Bounds for sets with few distances distinct modulo a prime ideal
From MaRDI portal
Publication:6042826
Abstract: Let be the ring of integers of an algebraic number field embedded into . Let be a subset of the Euclidean space , and be the set of the squared distances of two distinct points in . In this paper, we prove that if and there exist values distinct modulo a prime ideal of such that each is not zero modulo and each element of is congruent to some , then .
Recommendations
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3874093 (Why is no real title available?)
- scientific article; zbMATH DE number 3513797 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A generalization of Larman-Rogers-Seidel's theorem
- A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials
- A remark on sets with few distances in \(\mathbb{R}^d\)
- An upper bound for the cardinality of an \(s\)-distance set in Euclidean space
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- An upper bound for the size of \(s\)-distance sets in real algebraic sets
- Association schemes and coding theory
- Bounds on three- and higher-distance sets
- Designs as maximum codes in polynomial metric spaces
- Equiangular lines with a fixed angle
- Intersection theorems with geometric consequences
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- On Two-Distance Sets in Euclidean Space
- On t-designs
- Polynomial spaces
- Spherical codes and designs
- Upper bounds for \(s\)-distance sets and equiangular lines
This page was built for publication: Bounds for sets with few distances distinct modulo a prime ideal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042826)