The group-theoretical approach to fast matrix multiplication generates specific combinatorial objects, named Uniquely Solvable Puzzles (briefly USP). In the paper some numerical characteristic of the USP was discussed and the relation of USPs to famous combinatorial problem named «Cap set problem» was investigated.
