Permutation group approach to association schemes
type: Item
instance of: scholarly article
title: Permutation group approach to association schemes
zbMATH Open document ID: 1228.05311
author: S. A. Evdokimov
author: Ilya Ponomarenko
published in: European Journal of Combinatorics
publication date: 2009-11-30T00:00:00Z
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 20B99
zbMATH DE Number: 5640331
zbMATH Keywords: schurity problem
zbMATH Keywords: separability problem
MaRDI profile type: Publication
full work available at URL: j.ejc.2008.11.005
OpenAlex ID: W1991133303
cites work: Quasigroups. I
cites work: Generalized table algebras
cites work: On the order of uniprimitive permutation groups
cites work: Q4871775
cites work: On cyclotomic schemes over finite near-fields
cites work: A survey on spherical designs and algebraic combinatorics on spheres
cites work: Q3218140
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Q4718790
cites work: Q3992965
cites work: Q4763522
cites work: An optimal lower bound on the number of variables for graph identification
cites work: On groups with several doubly-transitive permutation representations
cites work: Strongly regular graphs and finite permutation groups of rank 3
cites work: Q3481814
cites work: Q4847930
cites work: On a new high dimensional Weisfeiler-Lehman algorithm
cites work: Normal cyclotomic schemes over a finite commutative ring
cites work: On primitive cellular algebras
cites work: Q4436153
cites work: Two inequalities for parameters of a cellular algebra
cites work: On highly closed cellular algebras and highly closed isomorphisms
cites work: On a family of Schur rings over a finite cyclic group.
cites work: Separability number and Schurity number of coherent configurations
cites work: On the geometric graph isomorphism problem
cites work: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
cites work: Circulant graphs: recognizing and isomorphism testing in polynomial time
cites work: Forestal algebras and algebraic forests (on a new class of weakly compact graphs)
cites work: Algebras in Plancherel duality and algebraic combinatorics
cites work: Q4284633
cites work: Q4237398
cites work: Coherent algebras and the graph isomorphism problem
cites work: Cyclotomic schemes over finite rings
cites work: Q3204655
cites work: Isomorphism testing for embeddable graphs through definability
cites work: Q4762028
cites work: Coherent configurations. I
cites work: Coherent algebras
cites work: Strongly regular designs and coherent configurations of type \([{32\atop\;3}]\)
cites work: Q4141010
cites work: Characterization of families of rank 3 permutation groups by the subdegrees. I
cites work: On quasi-thin association schemes with odd number of points
cites work: On quasi-thin association schemes
cites work: Terwilliger algebras of cyclotomic schemes and Jacobi sums
cites work: Q3781006
cites work: Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
cites work: Q3205264
cites work: A bound for the least prime ideal in the Chebotarev density theorem
cites work: Automorphisms of certain classes of graphs
cites work: Finding Isomorphisms Between Finite Fields
cites work: An algorithm for computing the automorphism group of a Hadamard matrix
cites work: Q3765876
cites work: Pseudo-ordered polynomials over a finite field
cites work: Association schemes on triples and a ternary algebra
cites work: A characterization of Grassmann graphs
cites work: On the nlog n isomorphism technique (A Preliminary Report)
cites work: A solution of the isomorphism problem for circulant graphs
cites work: On the isomorphism problem for cyclic combinatorial objects
cites work: Schur rings.
cites work: On association schemes all elements of which have valency 1 or 2
cites work: Spin models and Bose-Mesner algebras
cites work: Q5569508
cites work: Untersuchungen von S‐Ringen, insbesondere im Gruppenring von p‐Gruppen
cites work: Association schemes, superschemes, and relations invariant under permutation groups

Permutation group approach to association schemes (cites work)
cites work: Q4228513

Permutation group approach to association schemes (cites work)
cites work: The subconstituent algebra of an association scheme. I

Permutation group approach to association schemes (cites work)
cites work: On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler

Permutation group approach to association schemes (cites work)
cites work: Homogeneous coherent configurations as generalized groups and their relationship to buildings

Permutation group approach to association schemes (cites work)
cites work: The exchange condition for association schemes

Permutation group approach to association schemes (DOI)
DOI: 10.1016/J.EJC.2008.11.005