Designs in finite metric spaces: a probabilistic approach

DOI10.1007/s00373-021-02338-1zbMath1479.05371arXiv2102.08276OpenAlexW3169197187MaRDI QIDQ2051880

Minjia Shi, Olivier Rioul, Patrick Solé

Publication date: 25 November 2021

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

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

zbMATH Keywords

orthogonal polynomialsdistance-regular graphsdesignsChristoffel function

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Other designs, configurations (05B30) Group actions on combinatorial structures (05E18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Spectra of graphs
• t-designs in classical association schemes
• On the weight distribution of spherical t-designs
• Association schemes and t-designs in regular semilattices
• Upper bounds on permutation codes via linear programming
• An explicit version of the Chebyshev-Markov-Stieltjes inequalities and its applications
• Coding with permutations
• Association schemes and coding theory
• Good Magma Gradings on Rings
• On the distance distributions of BCH codes and their duals

This page was built for publication: Designs in finite metric spaces: a probabilistic approach