Equivalence classes of functions over a finite field
S. Cavior (1964)
Acta Arithmetica
Similarity:
Displaying similar documents to “Coherent configurations I”
Equivalence classes of functions over a finite field
Some applications of a theorem of Schur to graphs and to a class of endomorphisms
Chao, Chong-Yun (1967)
Portugaliae mathematica
Similarity:
Coset representatives for permutation groups
Dixon, John D., Majeed, Abdul (1988)
Portugaliae mathematica
Similarity:
The scheme of morphisms from an elliptic curve to a Grassmannian
A. Bruguières (1987)
Compositio Mathematica
Similarity:
A triangle free configuration
Kishore Sinha (1978)
Časopis pro pěstování matematiky
Similarity:
Constructing a Canonical form of a Matrix in Several Problems about Combinatorial Designs
Mateva, Zlatka (2008)
Serdica Journal of Computing
Similarity:
Partially supported by the Bulgarian Science Fund contract with TU Varna, No 487. The author developed computer programs needed for the classification of designs with certain automorphisms by the local approach method. All these programs use canonicity test or/and construction of canonical form of an integer matrix. Their efficiency substantially influences the speed of the whole computation. The present paper deals with the implemented canonicity algorithm. It is based...
Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices.
Jørgensen, L.K., Klin, M. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: