Commutative association schemes

DOI10.1016/j.ejc.2008.11.001zbMath1228.05317arXiv0811.2475OpenAlexW2018701021MaRDI QIDQ1039424

Hajime Tanaka, William J. Martin

Publication date: 30 November 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.2475

zbMATH Keywords

semidefinite programmingGelfand pairsspin modelscometric association schemesDelsarte Theory

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

The search for small association schemes with noncyclotomic eigenvalues, Design theory from the viewpoint of algebraic combinatorics, On quantum adjacency algebras of Doob graphs and their irreducible modules, New Bounds for Spherical Two-Distance Sets, Hermitian rank distance codes, Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials, Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes, Classification of commutative association schemes with almost commutative Terwilliger algebras, On standard bases of irreducible modules of Terwilliger algebras of Doob schemes, On the connectivity of graphs in association schemes, Linear programming bounds for regular graphs, Quantum isomorphism of graphs from association schemes, On strongly regular designs admitting fusion to strongly regular decomposition, On the Terwilliger algebra of the group association scheme of \(C_n \rtimes C_2\), Near-bipartite Leonard pairs, On almost distance-regular graphs, Perron spectratopes and the real nonnegative inverse eigenvalue problem, On relative \(t\)-designs in polynomial association schemes, On symmetric association schemes and associated quotient-polynomial graphs, Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures, Semidefinite programming for permutation codes, Symmetric bilinear forms over finite fields with applications to coding theory, Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\), On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra, An Assmus-Mattson theorem for codes over commutative association schemes, On few-class Q-polynomial association schemes: feasible parameters and nonexistence results, Partially metric association schemes with a multiplicity three, Association schemes on the Schubert cells of a Grassmannian, On generalised \(t\)-designs and their parameters, Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras, Relaxations of Combinatorial Problems Via Association Schemes, Notes on the Leonard system classification, Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}, A survey of semisimple algebras in algebraic combinatorics, A duality of scaffolds for translation association schemes, Representations of finite association schemes, Weighted association schemes, fusions, and minimal coherent closures, Association schemes on general measure spaces and zero-dimensional abelian groups

Cites Work

• Type-II matrices and combinatorial structures
• Point sets and sequences with small discrepancy
• New upper bounds on codes via association schemes and linear programming
• The irreducible modules of the Terwilliger algebras of Doob schemes
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The subconstituent algebra of an association scheme. II
• The Terwilliger algebra of the hypercube
• A bilinear form relating two Leonard systems
• The exact bound in the Erdős-Ko-Rado theorem
• Tridiagonal pairs of \(q\)-Racah type
• Tight distance-regular graphs with respect to subsets
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Strengthened semidefinite programming bounds for codes
• The spectrum of Platonic graphs over finite fields
• Imprimitive cometric association schemes: constructions and analysis
• On knot invariants related to some statistical mechanical models
• Duality theory for space-time codes over finite fields
• Symmetry in semidefinite programs
• Some implications on amorphic association schemes
• On the equivalence between real mutually unbiased bases and a certain class of association schemes
• Pseudocyclic association schemes and strongly regular graphs
• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
• Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
• The spectra of the local graphs of the twisted Grassmann graphs
• Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
• Distance-regular graphs and the \(q\)-tetrahedron algebra
• There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
• A wedge product of association schemes
• New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
• A survey on spherical designs and algebraic combinatorics on spheres
• Table algebras
• Permutation group approach to association schemes
• Schur rings.
• Trends and lines of development in scheme theory
• Finite Euclidean graphs and Ramanujan graphs
• Harmonics on posets
• The Erdős-Ko-Rado theorem for vector spaces
• An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
• t-designs in classical association schemes
• An analogue of t-designs in the association schemes of alternating bilinear forms
• Zur Theorie der Permutationsgruppen mit regulärer Untergruppe. I
• Splitting fields of association schemes
• Subschemes of some association schemes
• Distance regular covers of the complete graph
• Association schemes and t-designs in regular semilattices
• Bilinear forms over a finite field, with applications to coding theory
• Bose-Mesner algebras related to type II matrices and spin models
• Upper bounds on permutation codes via linear programming
• Designs in product association schemes
• Association schemes and fusion algebras. (An introduction)
• Problems in algebraic combinatorics
• A four-class subscheme of the association of scheme coming from the action of \(\text{PGL} (2,4^f)\)
• On spin models, modular invariance, and duality
• A linear programming bound for orthogonal arrays with mixed levels
• Split orthogonal arrays and maximum independent resilient systems of functions
• Imprimitive Q-polynomial association schemes
• Association schemes with multiple Q-polynomial structures
• Codes for the \(m\)-metric
• Width and dual width of subsets in polynomial association schemes
• Orthogonal polynomials arising from the wreath products of a dihedral group with a symmetric group.
• Beyond the orthogonal array concept.
• Designs in a coset geometry: Delsarte theory revisited.
• Finite analogues of non-Euclidean spaces and Ramanujan graphs.
• Leonard pairs and the \(q\)-Racah polynomials
• On harmonic weight enumerators of binary codes
• Tight distance-regular graphs
• The Terwilliger algebra of a distance-regular graph that supports a spin model
• The character table of the Hecke algebra \({\mathcal H}(GL_{2n}(\mathbb{F}_ q),Sp_{2n}(\mathbb{F}_ q))\)
• Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points
• Zonal spherical functions on the complex reflection groups and (\(n+1,m+1\))-hypergeometric functions
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• Bose-Mesner algebras attached to invertible Jones pairs
• The subconstituent algebra of a distance-regular graph; thin modules with endpoint one
• Tight distance-regular graphs and the subconstituent algebra
• On the multiplicities of the primitive idempotents of a \(Q\)-polynomial distance-regular graph
• Introduction to Leonard pairs.
• Constructions for permutation codes in powerline communications
• A construction of amorphous association scheme from a pseudo-cyclic association scheme
• Strongly regular designs of the second kind
• Generalized generalized spin models (four-weight spin models)
• Spin Leonard pairs
• A direct approach to linear programming bounds for codes and tms-nets
• The subconstituent algebra of a strongly regular graph
• Modular data: the algebraic combinatorics of conformal field theory
• The kissing number in four dimensions
• The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two
• The displacement and split decompositions for a \(Q\)-polynomial distance-regular graph
• The kissing problem in three dimensions
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
• Association schemes from the action of \(\text{PGL}(2,q)\) fixing a nonsingular conic in \(\text{PG}(2,q)\)
• Ramanujan graphs on cosets of \(\operatorname{PGL}_2(\mathbb F_q)\)
• A new family of distance-regular graphs with unbounded diameter
• A note on the stability number of an orthogonality graph
• Two theorems concerning the Bannai-Ito conjecture
• Representation theory of wreath products of finite groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spherical functions of the symmetric space 𝐺(𝔽_{𝕢²})/𝔾(𝔽_{𝕢})
• On Nonisomorphic Room Squares
• Extending the t-Design Concept
• On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A strengthening of the Assmus-Mattson theorem
• A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS
• Semidefinite optimization
• TAMELY RAMIFIED EISENSTEIN FIELDS WITH PRIME POWER DISCRIMINANTS
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• A Dual Plotkin Bound for $(T,M,S)$-Nets
• New upper bounds for kissing numbers from semidefinite programming
• Coloring an Orthogonality Graph
• A comparison of the Delsarte and Lovász bounds
• Orthogonal Polynomials, Duality and Association Schemes
• Cones of Matrices and Set-Functions and 0–1 Optimization
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On the Shannon capacity of a graph
• Mixed block designs
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• Z₄ -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
• Improved upper bounds on sizes of codes
• Association schemes and coding theory
• Four-weight spin models and Jones pairs
• (𝑛+1,𝑚+1)-hypergeometric functions associated to character algebras
• Theory of Association Schemes
• The Drinfel'd polynomial of a tridiagonal pair
• Theq-Tetrahedron Algebra and Its Finite Dimensional Irreducible Modules
• Supercharacters and superclasses for algebra groups
• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
• New 5-designs
• Characteristic classes for spherical fiber spaces
• Generalizations of Gleason's theorem on weight enumerators of self-dual codes
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
• Hahn Polynomials, Discrete Harmonics, andt-Designs
• Minimum distance bounds for \(s\)-regular codes
• A new proof of the Assmus-Mattson theorem for non-binary codes
• Spin models and strongly hyper-self-dual Bose-Mesner algebras
• The multiplicities of a dual-thin \(Q\)-polynomial association scheme
• Two linear transformations each tridiagonal with respect to an eigenbasis of the other
• On the optimum of Delsarte's linear program