A new upper bound for the size of s-distance sets in boxes

2018/12/27 by Hegedüs, Gábor
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1812.10696

Abstract

Let q,d≥ 2 be integers. Define J(q,d):=\frac 1q ( min_0

Related

• On integer distance sets
• An upper bound for the size of s-distance sets in real algebraic sets
• A new upper bound for codes with a single Hamming distance
• A generalization of Larman-Rogers-Seidel's theorem
• Intersections of sets of distances