An upper bound for the size of \(s\)-distance sets in real algebraic sets
From MaRDI portal
Publication:2048560
DOI10.37236/9712zbMath1467.05267arXiv2007.00429MaRDI QIDQ2048560
Publication date: 9 August 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.00429
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05E30: Association schemes, strongly regular graphs
14P05: Real algebraic sets
05D05: Extremal set theory
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
05B30: Other designs, configurations
05B25: Combinatorial aspects of finite geometries
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- A survey on spherical designs and algebraic combinatorics on spheres
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- On t-designs
- Spherical codes and designs
- Some tapas of computer algebra
- Upper bounds for \(s\)-distance sets and equiangular lines
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- Gröbner bases for complete uniform families
- A new proof of several inequalities on codes and sets
- A new upper bound for the size of \(s\)-distance sets in boxes
- An upper bound for the cardinality of an \(s\)-distance set in Euclidean space
- 3264 and All That
- A remark on sets with few distances in $\mathbb {R}^{d}$