Permutation group approach to association schemes

Authors:
Sergei Evdokimov;Ilia Ponomarenko
Affiliations:
Steklov Institute of Mathematics at St. Petersburg, Russian Federation;Steklov Institute of Mathematics at St. Petersburg, Russian Federation
Venue:
European Journal of Combinatorics
Year:
2009

Citing 24
Cited 3

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Riemann hypothesis and finding roots over finite fields

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Strongly regular designs and coherent configurations of type U3 2-3-e

European Journal of Combinatorics
Coherent algebras and the graph isomorphism problem

Discrete Applied Mathematics - Combinatorics and complexity
Association schemes on triples and ternary algebra

Journal of Combinatorial Theory Series A
For computations with coherent configurations

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
The Subconstituent Algebra of an Association Scheme, (Part I)

Journal of Algebraic Combinatorics: An International Journal
Association schemes, superschemes, and relations invariant under permutation groups

European Journal of Combinatorics
A characterization of Grassmann graphs

European Journal of Combinatorics
Automorphism groups, isomorphism, reconstruction

Handbook of combinatorics (vol. 2)
Faster isomorphism testing of strongly regular graphs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the isomorphism problem for cyclic combinatorial objects

Discrete Mathematics
On a New High Dimensional Weisfeiler-Lehman Algorithm

Journal of Algebraic Combinatorics: An International Journal
Terwilliger algebras of cyclotomic schemes Jacobi sums

European Journal of Combinatorics
Isomorphism testing for embeddable graphs through definability

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Spin models and Bose-Mesner algebras

European Journal of Combinatorics - In memoriam François Jaeger
On quasi-thin association schemes

Journal of Combinatorial Theory Series A
Factorization of polynominals over finite fields in subexponential time under GRH

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
On the nlog n isomorphism technique (A Preliminary Report)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration

European Journal of Combinatorics
On cyclotomic schemes over finite near-fields

Journal of Algebraic Combinatorics: An International Journal
Factoring polynomials over finite fields

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A survey on spherical designs and algebraic combinatorics on spheres

European Journal of Combinatorics
Schur rings

European Journal of Combinatorics

Commutative association schemes

European Journal of Combinatorics
Schur rings

European Journal of Combinatorics
Characterizations of wreath products of one-class association schemes

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey the modern theory of schemes (coherent configurations). The main attention is paid to the schurity problem and the separability problem. Several applications of schemes to constructing polynomial-time algorithms, in particular, graph isomorphism tests, are discussed.