Designs in finite metric spaces: a probabilistic approach

DOI10.1007/S00373-021-02338-1MaRDI QIDQ2051880zbMATH OpenOpenAlexFDO

Authors 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

Christoffel functiondesignsdistance-regular graphsorthogonal polynomials

Mathematics Subject Classification ID

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

Abstract: A finite metric space is called here distance degree regular if its distance degree sequence is the same for every vertex. A notion of designs in such spaces is introduced that generalizes that of designs in $Q$-polynomial distance-regular graphs. An approximation of their cumulative distribution function, based on the notion of Christoffel function in approximation theory is given. As an application we derive limit laws on the weight distributions of binary orthogonal arrays of strength going to infinity. An analogous result for combinatorial designs of strength going to infinity is given.

Recommendations

• On designs in compact metric spaces and a universal bound on their size
• A probabilistic theory of designs based on distributions
• scientific article; zbMATH DE number 1498794
• Designs as maximum codes in polynomial metric spaces
• Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces
• Random methods in design theory: A survey

Cites work

• An explicit version of the Chebyshev-Markov-Stieltjes inequalities and its applications
• Association schemes and coding theory
• Association schemes and t-designs in regular semilattices
• Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials
• Coding with permutations
• Good Magma Gradings on Rings
• scientific article; zbMATH DE number 3771876 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3458467 (Why is no real title available?)
• scientific article; zbMATH DE number 3477793 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On the distance distributions of BCH codes and their duals
• On the weight distribution of spherical t-designs
• Spectra of graphs
• t-designs in classical association schemes
• Upper bounds on permutation codes via linear programming

Cited in

(1)

• scientific article; zbMATH DE number 1498794 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051880)