Geodesic
On combinatorial problem, related with fast matrix multiplication
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 13 (2013) no. 4, pp. 63-67

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{ISU_2013_13_4_a8,
     author = {Yu. V. Kuznetsov},
     title = {On combinatorial problem, related with fast matrix multiplication},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {63--67},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2013_13_4_a8/}
}
TY  - JOUR
AU  - Yu. V. Kuznetsov
TI  - On combinatorial problem, related with fast matrix multiplication
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2013
SP  - 63
EP  - 67
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2013_13_4_a8/
LA  - ru
ID  - ISU_2013_13_4_a8
ER  - 
%0 Journal Article
%A Yu. V. Kuznetsov
%T On combinatorial problem, related with fast matrix multiplication
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2013
%P 63-67
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2013_13_4_a8/
%G ru
%F ISU_2013_13_4_a8
Yu. V. Kuznetsov. On combinatorial problem, related with fast matrix multiplication. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 13 (2013) no. 4, pp. 63-67. http://geodesic.mathdoc.fr/item/ISU_2013_13_4_a8/