Design theory from the viewpoint of algebraic combinatorics

DOI10.1007/s00373-016-1739-2zbMath1365.05301OpenAlexW2557794481MaRDI QIDQ2361074

Eiichi Bannai, Hajime Tanaka, Etsuko Bannai, Yan Zhu

Publication date: 29 June 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1739-2

zbMATH Keywords

Terwilliger algebraassociation schemespherical design\(t\)-designtight designrelative \(t\)-designEuclidean design

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Designs and configurations (05B99)

Related Items

Explicit construction of exact unitary designs, Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials, Spherical designs and modular forms of the \(D_4\) lattice, On polarization of spherical codes and designs, Upper energy bounds for spherical designs of relatively small cardinalities, The complex conjugate invariants of Clifford groups, Relative \(t\)-designs in Johnson association schemes for P-polynomial structure, Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\), Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\), Relative \(t\)-designs in nonbinary Hamming association schemes, Tight \(t\)-designs on one shell of Johnson association schemes, Energy bounds for codes in polynomial metric spaces, On the explicit constructions of certain unitaryt-designs

Cites Work

• The nonexistence of certain tight spherical designs
• On antipodal spherical t-designs of degree s with $t\geq 2s-3$
• On t-Designs and Groups
• Universal upper and lower bounds on energy of spherical designs
• TheD₄Root System Is Not Universally Optimal
• Square λ-Linked Designs
• On tight spherical designs
• 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
• Distance-regular graphs
• Conformal designs and minimal conformal weight spaces of vertex operator superalgebras
• Conformal designs and D.H. Lehmer's conjecture
• Nonexistence results for tight block designs
• Optimal asymptotic bounds for spherical designs
• On the existence of tight relative 2-designs on binary Hamming association schemes
• A Fisher type inequality for weighted regular \(t\)-wise balanced designs
• The strong thirteen spheres problem
• Note on the tight relative 2-designs on \(H(n,2)\)
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• A generalization of Larman-Rogers-Seidel's theorem
• Computational existence proofs for spherical \(t\)-designs
• Tight 9-designs on two concentric spheres
• Isometric embeddings between classical Banach spaces, cubature formulas, and spherical designs
• The subconstituent algebra of an association scheme. I
• The subconstituent algebra of an association scheme. III
• The subconstituent algebra of an association scheme. II
• Spherical t-designs which are orbits of finite groups
• New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
• Tight relative 2-designs on two shells in Johnson association schemes
• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• On relative \(t\)-designs in polynomial association schemes
• Uniqueness of certain association schemes
• Cubature formulas in numerical analysis and Euclidean tight designs
• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
• Crested products of Markov chains
• New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
• A survey on spherical designs and algebraic combinatorics on spheres
• Commutative association schemes
• Harmonics on posets
• On the nonbinary Johnson scheme
• On even unimodular extremal lattices
• Averaging sets: A generalization of mean values and spherical designs
• t-designs in classical association schemes
• An analogue of t-designs in the association schemes of alternating bilinear forms
• Fisher type inequalities for Euclidean t-designs
• On some spherical t-designs
• Representations of finite classical groups. A Hopf algebra approach
• Three addition theorems for some q-Krawtchouk polynomials
• A partially ordered set and q-Krawtchouk polynomials
• Bounds for the number of nodes in Chebyshev type quadrature formulas
• Kubaturformeln mit minimaler Knotenzahl
• On t-designs
• Association schemes and t-designs in regular semilattices
• An addition theorem for some q-Hahn polynomials
• Spherical codes and designs
• On tight 6-designs
• Tight 4-designs
• Tight spherical designs. I
• Designs in product association schemes
• The minimal number of nodes in Chebyshev type quadrature formulas
• Designs in a coset geometry: Delsarte theory revisited.
• Harmonic index designs in binary Hamming schemes
• The character table of the Hecke algebra \({\mathcal H}(GL_{2n}(\mathbb{F}_ q),Sp_{2n}(\mathbb{F}_ q))\)
• On spherical t-designs in \(R^ 2\).
• Tight \(t\)-designs on two concentric spheres
• Well-separated spherical designs
• Rational designs
• Spherical designs of harmonic index \(t\)
• Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\)
• On antipodal Euclidean tight \((2e+1)\)-designs
• Tight relative 2- and 4-designs on binary Hamming association schemes
• Conformal designs based on vertex operator algebras
• Special moments
• On Euclidean tight 4-designs
• Remarks on the concepts of \(t\)-designs
• On averaging sets
• Extended Griess Algebras and Matsuo-Norton Trace Formulae
• Energy-Minimizing Error-Correcting Codes
• The Tammes Problem for N = 14
• The Characters of the Finite General Linear Groups
• Experimental Study of Energy-Minimizing Point Configurations on Spheres
• Universally optimal distribution of points on spheres
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• New upper bounds for kissing numbers from semidefinite programming
• On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
• Tight Spherical Disigns, II
• Some q-Krawtchouk Polynomials on Chevalley Groups
• ON TIGHT DESIGNS
• On Two-Distance Sets in Euclidean Space
• Mixed block designs
• Spherical faraday cage for the case of equal point charges and chebyshev-type quadrature on the sphere