scientific article; zbMATH DE number 3884178
Askey- Wilson polynomialsBose-Mesner algebracentralizer ringscharacter tableDistance regular graphsdualitygeneral association schemesgroup representationHamming schemeshypergeometric seriesorthogonal polynomialspermutation grouppolynomial schemesSchur ringsspherical functionsthe Johnson schemes
Combinatorial aspects of finite geometries (05B25) Other designs, configurations (05B30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Ordinary representations and characters (20C15) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Spherical harmonics (33C55) Finite geometry and special incidence structures (51E99)
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- The subconstituent algebra of a Latin square
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Examples of rank 3 product action transitive decompositions
- The graphs induced by maximal totally isotropic flats of affine-unitary spaces
- New examples of Euclidean tight 4-designs
- 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
- Suborbits of \(m\)-dimensional totally isotropic subspaces under finite singular classical groups
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
- Leonard triples and hypercubes
- Pseudo 1-homogeneous distance-regular graphs
- Linear programming bounds for codes via a covering argument
- A characterization of some distance-regular graphs by strongly closed subgraphs
- The mathematics of Donald Gordon Higman
- Distance-regular graphs of \(q\)-Racah type and the \(q\)-tetrahedron algebra
- Higmanian rank-5 association schemes on 40 points
- A survey on spherical designs and algebraic combinatorics on spheres
- Table algebras
- Permutation group approach to association schemes
- Representations of finite association schemes
- Commutative association schemes
- Schur rings.
- Association schemes based on attenuated spaces
- Exploiting group symmetry in truss topology optimization
- Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)
- On the shape of a tridiagonal pair
- Finite Euclidean graphs and Ramanujan graphs
- A generalization of dual polar graph of orthogonal space
- Fourier-invariant pairs of partitions of finite Abelian groups and association schemes
- Algebraic decompositions of commutative association schemes
- A class of distance-regular graphs that are \(\phi\)-polynomial
- Orthogonal polynomials - Constructive theory and applications
- Hadamard graphs. I
- Distance-regular graphs with girth 3 or 4: I
- An inequality between intersection numbers of a distance-regular graph
- A survey of some problems in combinatorial designs - a matrix approach
- A remark on the intersection arrays of distance-regular graphs
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3
- Distance-transitive representations of the symmetric groups
- A new feasibility condition for distance-regular graphs
- The classification of finite connected hypermetric spaces
- On local structure of a distance-regular graph of Hamming type
- Root system graphs
- Certain distance-regular digraphs and related rings of characteristic 4
- Distance-regular digraphs of girth 4
- Balanced sets and Q-polynomial association schemes
- First distribution invariants and EKR theorems
- W-complement d-spreads, singleton systems
- Sharp sets of permutations
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- t-designs in classical association schemes
- Association schemes and quadratic transformations for orthogonal polynomials
- An analogue of t-designs in the association schemes of alternating bilinear forms
- A local characterization of the Johnson scheme
- Constructions of ranked posets
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- On distance transitive graphs in which the stabilizer of a point contains an alternating group
- Characters of finite quasigroups. IV: Products and superschemes
- The large cliques in the graph of quadratic forms
- The association schemes of dual polar spaces of type \(^ 2A_{2d- 1}(p^ f)\) are characterized by their parameters if \(d\geq 3\)
- Duality in coherent configurations
- Tight 4 and 5-designs in projective spaces
- P and Q polynomial schemes with \(q=-1\)
- A characterization of the association schemes of bilinear forms
- Characterization of the association schemes of Hermitian forms over GF(2^ 2)
- On distance-regular graphs with fixed valency. III
- On distance-regular graphs with fixed valency. IV
- A remark on association schemes on finite groups
- A geometric condition for incidence-matrix nullvectors
- Constructing trees with given eigenvalues and angles
- Feasibility conditions for non-symmetric 3-class association schemes
- \(h\)-space structure in matrix displacement formulas
- Minimal subschemes of the group association schemes of Mathieu groups
- Galois correspondence between permutation groups and cellular rings (association schemes)
- Diameter, covering index, covering radius and eigenvalues
- On table algebras and applications to finite group theory
- Table algebras and applications to products of characters in finite groups
- Non-symmetric, metric, cometric association schemes are self-dual
- On nonsymmetric P- and Q-polynomial association schemes
- Character table of a controlling association scheme defined by the general orthogonal group \(O(3,q)\)
- Partitions in matrices and graphs
- Splitting fields of association schemes
- On the parameters of codes for the Lee and modular distance
- On pseudo-automorphisms and fusions of an association scheme
- Subschemes of some association schemes
- Character tables of certain association schemes coming from finite unitary and symplectic groups
- A spectral method for concordant polyhedral faces
- Bounding the diameter of a distance regular graph by a function of \(k_ d\)
- On distance-transitive graphs and involutions
- Amorphous association schemes over the Galois rings of characteristic 4
- On a theorem of Ikuta, Ito and Munemasa
- On the G-matrices with entries and eigenvalues in Q(i)
- Duality in partially balanced block designs
- A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
- Character tables of association schemes of affine type
- Subschemes of the Johnson scheme
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3218140)