On the public citation graph

Galois correspondence between permutation groups and cellular rings (association schemes)

https://doi.org/10.1007/bf01787700
0 signed · 81 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/mana.19740600102openalex-snapshot
Untersuchungen von S‐Ringen, insbesondere im Gruppenring von p‐Gruppen
inferredcites →https://doi.org/10.1007/978-1-4615-6666-3openalex-snapshot
Combinatorial Theory
inferredcites →https://doi.org/10.1007/978-1-4684-8497-7openalex-snapshot
Finite Simple Groups: An Introduction to Their Classification
inferredcites →https://doi.org/10.1007/978-3-0348-5547-1openalex-snapshot
Funktionen- und Relationenalgebren
inferredcites →https://doi.org/10.1007/978-94-017-1972-8openalex-snapshot
Investigations in Algebraic Theory of Combinatorial Objects
inferredcites →https://doi.org/10.1007/978-94-017-1972-8_1openalex-snapshot
Cellular Rings and Groups of Automorphisms of Graphs
inferredcites →https://doi.org/10.1007/bf00148146openalex-snapshot
Automorphic graphs and the Krein condition
inferredcites →https://doi.org/10.1007/bf00181203openalex-snapshot
The uniqueness of certain automorphic graphs
inferredcites →https://doi.org/10.1007/bf01070698openalex-snapshot
On the number of graphs for which a given permutation group is the automorphism group
inferredcites →https://doi.org/10.1007/bf01070906openalex-snapshot
Galois theory for post algebras. I
inferredcites →https://doi.org/10.1007/bf01218880openalex-snapshot
Zur Theorie der einfach transitiven Permutationsgruppen
inferredcites →https://doi.org/10.1007/bf01447427openalex-snapshot
The construction of some automorphic graphs
inferredcites →https://doi.org/10.1007/bf01674471openalex-snapshot
Primitive permutation groups of small degrees. II
inferredcites →https://doi.org/10.1007/bf01788104openalex-snapshot
Current research on algebraic combinatorics
inferredcites →https://doi.org/10.1007/bf01894773openalex-snapshot
Isomorphism problem for a special class of graphs
inferredcites →https://doi.org/10.1007/bf02125894openalex-snapshot
Non rank 3 strongly regular graphs with the 5-vertex condition
inferredcites →https://doi.org/10.1007/bf02480207openalex-snapshot
Reduction of the number of associate classes of hypercubic association schemes
inferredcites →https://doi.org/10.1007/bfb0089374openalex-snapshot
On Construction and Identification of Graphs
inferredcites →https://doi.org/10.1016/0012-365x(75)90057-6openalex-snapshot
Strongly regular graphs
inferredcites →https://doi.org/10.1016/0021-8693(78)90220-xopenalex-snapshot
Strongly regular graphs having strongly regular subconstituents
inferredcites →https://doi.org/10.1016/0095-8956(73)90007-5openalex-snapshot
A class of vertex-transitive digraphs
inferredcites →https://doi.org/10.1016/0095-8956(82)90009-0openalex-snapshot
A class of vertex-transitive digraphs, II
inferredcites →https://doi.org/10.1016/0095-8956(82)90045-4openalex-snapshot
On the uniqueness of the graphs G(n, k) of the Johnson schemes
inferredcites →https://doi.org/10.1016/0097-3165(83)90069-9openalex-snapshot
Association algebras for finite projective planes
inferredcites →https://doi.org/10.1016/0097-3165(85)90025-1openalex-snapshot
A new strongly regular graph
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50019-9openalex-snapshot
A search for simple groups of order less than one million††This research was supported in part by NSF grant GP3909 and in part by ONR contract N00014-67-A-0094-0010.
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50020-5openalex-snapshot
Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.
inferredcites →https://doi.org/10.1016/c2013-0-10826-4openalex-snapshot
Graphical Enumeration
inferredcites →https://doi.org/10.1016/c2013-0-11702-3openalex-snapshot
Finite Permutation Groups
inferredcites →https://doi.org/10.1016/s0021-9800(67)80003-6openalex-snapshot
Point-symmetric graphs with a prime number of points
inferredcites →https://doi.org/10.1016/s0021-9800(67)80037-1openalex-snapshot
Research problems
inferredcites →https://doi.org/10.1016/s0195-6698(87)80018-5openalex-snapshot
Isomorphism Problem for Relational Structures with a Cyclic Automorphism
inferredcites →https://doi.org/10.1016/s0195-6698(89)80006-xopenalex-snapshot
On a New Family of (P and Q)-polynomial Schemes
inferredcites →https://doi.org/10.1016/s0304-0208(08)72973-6openalex-snapshot
Computation of Some Parameters of Lie Geometries
inferredcites →https://doi.org/10.1017/cbo9780511987045.023openalex-snapshot
Strongly regular graphs and partial geometries
inferredcites →https://doi.org/10.1017/cbo9781107325579.010openalex-snapshot
Geometries originating from certain distance-regular graphs
inferredcites →https://doi.org/10.1017/cbo9781139237253openalex-snapshot
Theory of Groups of Finite Order
inferredcites →https://doi.org/10.1038/088170a0openalex-snapshot
Theory of Groups of Finite Order
inferredcites →https://doi.org/10.1080/00927877908822410openalex-snapshot
The non-abelian simple groups g, |g| < 106— character tables
inferredcites →https://doi.org/10.1080/00927878408823125openalex-snapshot
Presentations for the simple groups g, l05≪ |g| < 106
inferredcites →https://doi.org/10.1088/0031-9112/16/12/013openalex-snapshot
Applied Combinatorial Mathematics
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0498831-1openalex-snapshot
The nonabelian simple groups 𝐺, ∣𝐺∣<10⁶—maximal subgroups
inferredcites →https://doi.org/10.1093/qmath/37.4.419openalex-snapshot
THE MAXIMALITY OF CERTAIN WREATH PRODUCTS IN ALTERNATING AND SYMMETRIC GROUPS
inferredcites →https://doi.org/10.2307/2006354openalex-snapshot
The Nonabelian Simple Groups G, | G | < 10 6 -Maximal Subgroups
inferredcites →https://doi.org/10.2307/2284007openalex-snapshot
Applied Combinatorial Mathematics.
inferredcites →https://doi.org/10.2307/2314023openalex-snapshot
Finite Permutation Groups.
inferredcites →https://doi.org/10.4153/cjm-1968-103-xopenalex-snapshot
The Number of Graphs with a given Automorphism Group

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/eujc.1993.1050openalex-snapshot
The Structure of Rational Schur Rings over Cyclic Groups
inferred← citeshttps://doi.org/10.1007/978-94-017-1972-8_1openalex-snapshot
Cellular Rings and Groups of Automorphisms of Graphs
inferred← citeshttps://doi.org/10.1007/bf00053381openalex-snapshot
Subschemes of Hamming association schemes H(n, q), q?4
inferred← citeshttps://doi.org/10.1007/bf00053382openalex-snapshot
Skew-symmetric association schemes with two classes and strongly regular graphs of type L 2n?1(4n?1)
inferred← citeshttps://doi.org/10.1007/bf00053383openalex-snapshot
Polynomial time algorithms for recognizing and isomorphism testing of cyclic tournaments
inferred← citeshttps://doi.org/10.1007/bf01200820openalex-snapshot
Group-theoretical approach to the investigation of reaction graphs for highly degenerate rearrangements of chemical compounds I. Criterion of the connectivity of a graph
inferred← citeshttps://doi.org/10.1007/s10623-016-0258-8openalex-snapshot
A non-Schurian coherent configuration on 14 points exists
inferred← citeshttps://doi.org/10.1007/s13366-011-0007-0openalex-snapshot
A construction of the automorphism groups of indecomposable S-rings over $${Z_{2^n}}$$
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00476-8openalex-snapshot
Association schemes on the set of antiflags of a projective plane
inferred← citeshttps://doi.org/10.1016/0021-8693(91)90134-topenalex-snapshot
Subschemes of some association schemes
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90077-2openalex-snapshot
Class 3 association schemes whose symmetrizations have two classes
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.027openalex-snapshot
Strongly regular Cayley graphs over the group Zpn⊕Zpn
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.103openalex-snapshot
Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2014.09.007openalex-snapshot
On the automorphism groups of strongly regular graphs II
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.040openalex-snapshot
Links between two semisymmetric graphs on 112 vertices via association schemes
inferred← citeshttps://doi.org/10.1016/j.laa.2003.06.020openalex-snapshot
Directed strongly regular graphs obtained from coherent algebras
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00391-0openalex-snapshot
Small vertex-transitive directed strongly regular graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80102-3openalex-snapshot
Amorphous Association Schemes over the Galois Rings of Characteristic 4
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80114-xopenalex-snapshot
On Pseudo-automorphisms and Fusions of an Association Scheme
inferred← citeshttps://doi.org/10.1016/s0195-6698(89)80006-xopenalex-snapshot
On a New Family of (P and Q)-polynomial Schemes
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00064-0openalex-snapshot
Association schemes of small order
inferred← citeshttps://doi.org/10.1023/a:1005959008545openalex-snapshot
The Structure of Schur Rings Over Cyclic Groups of Square-Free Order
inferred← citeshttps://doi.org/10.1023/a:1022488330352openalex-snapshot
Commutative Association Schemes Whose Symmetrizations Have Two Classes
inferred← citeshttps://doi.org/10.1023/a:1022494701663openalex-snapshot
The Subconstituent Algebra of an Association Scheme, (Part I)
inferred← citeshttps://doi.org/10.1109/18.720545openalex-snapshot
Association schemes and coding theory
inferred← citeshttps://doi.org/10.1112/s0024611503014412openalex-snapshot
A solution of the isomorphism problem for circulant graphs
inferred← citeshttps://doi.org/10.1142/s021819670200119xopenalex-snapshot
PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES
inferred← citeshttps://doi.org/10.1145/120694.120726openalex-snapshot
For computations with coherent configurations
inferred← citeshttps://doi.org/10.37236/1363openalex-snapshot
Recognizing Circulant Graphs of Prime Order in Polynomial Time
inferred← citeshttps://doi.org/10.37236/1570openalex-snapshot
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes
inferred← citeshttps://doi.org/10.37236/2039openalex-snapshot
Automorphism Groups of Rational Circulant Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1002.1921openalex-snapshot
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program Implementation of the Weisfeiler-Leman Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1008.0751openalex-snapshot
Automorphism groups of rational circulant graphs through the use of Schur rings
inferred← citeshttps://doi.org/10.48550/arxiv.math/0603518openalex-snapshot
Strongly regular Cayley graphs over primary abelian groups of rank 2
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.