Bounds for sets with few distances distinct modulo a prime ideal
From MaRDI portal
Publication:6042826
DOI10.5802/ALCO.272zbMATH Open1518.05189arXiv2203.04492OpenAlexW4368377680MaRDI QIDQ6042826FDOQ6042826
Authors: Hiroshi Nozaki
Publication date: 4 May 2023
Published in: Algebraic Combinatorics (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/2203.04492
Recommendations
Cites Work
- Intersection theorems with geometric consequences
- Title not available (Why is that?)
- Association schemes and coding theory
- Title not available (Why is that?)
- Spherical codes and designs
- A generalization of Larman-Rogers-Seidel's theorem
- Title not available (Why is that?)
- On t-designs
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- Polynomial spaces
- A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials
- Designs as maximum codes in polynomial metric spaces
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Bounds on three- and higher-distance sets
- On Two-Distance Sets in Euclidean Space
- Upper bounds for \(s\)-distance sets and equiangular lines
- Title not available (Why is that?)
- 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 size of \(s\)-distance sets in real algebraic sets
- Equiangular lines with a fixed angle
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)