Designs in finite metric spaces: a probabilistic approach

DOI10.1007/S00373-021-02338-1zbMATH Open1479.05371arXiv2102.08276OpenAlexW3169197187MaRDI QIDQ2051880FDOQ2051880

Authors: Minjia Shi, Olivier Rioul, Patrick Solé 

Publication date: 25 November 2021

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

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.

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

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

zbMATH Keywords

orthogonal polynomialsdistance-regular graphsdesignsChristoffel function

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectra of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Association schemes and coding theory
• Title not available (Why is that?)
• Association schemes and t-designs in regular semilattices
• Upper bounds on permutation codes via linear programming
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• t-designs in classical association schemes
• Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials
• On the distance distributions of BCH codes and their duals
• Coding with permutations
• On the weight distribution of spherical t-designs
• Title not available (Why is that?)
• An explicit version of the Chebyshev-Markov-Stieltjes inequalities and its applications
• Good Magma Gradings on Rings

Cited In (1)

• Title not available (Why is that?)

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)