ACM Home Page
Please provide us with feedback. Feedback
For computations with coherent configurations
Full text PdfPdf (524 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1991 international symposium on Symbolic and algebraic computation table of contents
Bonn, West Germany
Pages: 219 - 223  
Year of Publication: 1991
ISBN:0-89791-437-6
Authors
I. A. Faradzev  Institute for System Studies, Academy of Science of USSR, 9, pr. 60 let Octyabrya, 117321, Moscow, USSR
M. H. Klin  Institute of Organic Chemistry, Academy of Science of USSR, 47, Leninsky pr., 117913, Moscow, USSR
Sponsors
GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/120694.120726
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Ad1
Adam A. Problem 2-10. J. Comb. Theory, 1967, 2,393.
 
Bi1
Biggs N.L. Automorphic graphs and the Krein condition. Geom. Dedicata, 1976, 5, 117-127.
 
Bo1
Bose R., Shimamoto T. Classification and analysis of partially balanced incomplete block designs with two associate classes. J. Amer. Statist. Assoc., 1952, 47, 151-184.
 
Fa1
Faradzev I.A. A package for computation in V-rings of permutation groups. In "Methods and programs for solving optimizalional problems on graphs and networks", part 1. Novosibirsk, 1982, 218-222 {in Russian.
 
Fa2
Faradzev I.A. Association schemes on antiflags of a projective plane. Proc. 2nd Japanes Conf. on Combinatorics (to appear).
 
Fa3
Faradzev I.A., Ivanov A.A., Klin M.H. Galois correspondence between permutation groups and cellular rings (association schemes). Graphs and Combinatorics (to appear).
 
Gol
Gol'fand Ja.Yu., Klin M.H. Amorphic cellular rings. I. In "Investigations in Algebraic Theory of Combinatorial Objects". Moscow, VNIISI, 1985, 32- 38 {in Russian }.
 
Hi1
Higman D.G. Coherent configurations. I. Rend. Sem. Mat. Univ. Padova, 1970, 44, 1-25.
 
Hi2
Higman G. On the simple group of D.G.Higman and C.C.Sims. 111. J. Math., 1969, 13, 74- 80.
 
Ho1
Hoffman A.J., Singleton R.R. On Moore graphs with diameter 2 and 3. IBM J. Res. Develop., 1960, 4,497-504.
 
Hu1
Hubaut X.L. Strongly regular graphs. Discrete Math., 1975, 13,357-381.
 
Iv1
tvanov A.A. Construction of some new automorphic graphs using computers. In "Air Phisics and Applied Mathematics", Moscow, 1981, 144-146 {in Russian }.
 
Iv2
 
Iv3
Ivanov A.A., Klin M.H., Faradzev I.A. Primitive representations of the nonabelian simple groups of order less than 106. Preprint. Moscow, VNIISI, 1982 (part 1), 1984 (part 2) {in Russian }.
 
Kal
Kaluznin L.A., Klin M.H. On some maximal subgroups of the symmetric and alternating groups. Mat. Sbornik, 1972, 87, 91-121 {in Russian 1.
 
Kl1
Klin M.H. The use of the computer "MIR-.I" in the investigation of the problem of maximality of induced symmmetric groups. In "Computations in Algebra and Combinatorics", Kiev, 1978, 137-148 {in Russian 1.
 
Kl2
Klin M.H. The 4-regularity of the McLaughlin graph. Manuscript (preliminary version), 1988.
 
Kl3
Klin M.H., Muzichuk M.E., Faradzev I.A. Cellular rings and automorphism groups of graphs. In "Investigations in Algebraic Theory of Combinatorial Objects". Kluwer Publ. Co. (to appear).
 
ML1
McI~ughlin J. A simple group of order 898,128,000. In "The Theory of Finite Groups", Benjamin, 1969, 109-111.
 
Si1
Sims C.C. One isomorphism between two groups of order 44,352,000. In "The Theory of Finite Groups", Benjamin, 1969, 101-108.
 
Si2
Sims C.C. Computing methods in the study of permutation groups. In "Computational Problems in Abstract Algebra". Pergamon Press, 1970, 169-184.
 
We1
Weisfeiler B. On the construction and identification of graphs. Lect. Notes Math., v.558, 1976.
 
We2
Weisfeiler B.Ju., Leman A.A. Reduction of a graph to a canonical form and the arising algebra. NTI, ser.2, 1968, 9, 12-16 {in Russian 1.
 
Za1
Zaichenko V.A. An algorithmic approach to the constructions of combinatorial objects and the computations in permutation groups based on method of invariant relations method. Ph.D.Thesis. Moscow, 1981 {in Russian 1.
 
Za2
Zaichenko V.A., Ivanov A.A., Klin M.H. Construction and investigation of new automorphic graphs, in "Methods and programs for solving optimizational problems on graphs and networks", part 2. Novosibirsk, 1982, 48-50 {in Russian 1.
 
Za3
Zaichenko V.A., Klin M.H., Faradzev I.A. On some problems related to a computer presentation of permutation groups. In "Computations in Algebra, the Number Theory and Combinatorics", Kiev, 1980, 21- 32 {in Russian 1.


Collaborative Colleagues:
I. A. Faradzev: colleagues
M. H. Klin: colleagues

Peer to Peer - Readers of this Article have also read: