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

DOI10.1007/S10474-019-00993-8MaRDI QIDQ2300121zbMATH OpenOpenAlexWikidataFDO

Authors Gábor Hegedüs

Publication date 26 February 2020

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

\(s\)-distance setdistance problemslice rank method

Mathematics Subject Classification ID

Extremal combinatorics (05D99) Erd?s problems and related topics of discrete geometry (52C10)

Abstract: Let $q,dgeq2$ be integers. Define ${\displaystyle }$ J(q,d):=frac 1q Big( min_{0<x<1} frac{1-x^q}{1-x} x^{-frac{q-1}{d}}Big). ${\displaystyle }$ Let $$cal G$$ be an arbitrary subset. We denote by $$cal G$$ the set of (non-zero) distances among points of $$cal G$$: ${\displaystyle }$ d(mbox{$calG$}):={d( p_1, p_2):~ p_1, p_2in mbox{$calG$}, p_1 e p_2}. ${\displaystyle }$ Our main result is a new upper bound for the size of $s$-distance sets in boxes. More concretely, let $A_{i}subseteqmathbbR$, $|A_i|=qgeq2$ be subsets for each $1leqileqn$. Consider the box $$cal B$$. Suppose that $$cal G${\displaystyle }subseteqmbox$cal B$$ is a set such that $$cal G$$. Let $d:=fracn(q-1)s$. Then ${\displaystyle }$|mbox{$calG$}|leq 2(qJ(q,d))^n.${\displaystyle }$ We use Tao's slice rank bounding method in our proof.

Review text

The subject is related to the following distance problem by Erdős: Given \(n\) points in the plane, what is the smallest number of distinct distances they can determine? In 1946 Erdős gave some inequalities for the minimum number of these distances. \par An \(s\)-distance set is any subset \(G\) of \(n\)-dimensional Euclidean space such that the size of the set of distances among points of \(G\) (the number of distinct distances) is at most \(s\). \par In the paper, the author investigates \(s\)-distance sets in the direct product of finite sets of points (boxes) in \(n\)-dimensional Euclidean space. A new upper bound for the size of \(s\)-distance sets in boxes is given. In the proof, the author uses Tao's slice rank method.

Recommendations

• Bounds on three- and higher-distance sets
• New bounds for distance-type problems over prime fields
• An upper bound for the cardinality of an s-distance set in Euclidean space
• scientific article; zbMATH DE number 2145235
• On distinct sums and distinct distances.

Cited in

(5)

• On the \(L_2\)-discrepancy for anchored boxes
• An upper bound for the size of \(s\)-distance sets in real algebraic sets
• An upper bound for the cardinality of an s-distance set in Euclidean space
• Random multilinear maps and the Erdős box problem
• A remark on sets with few distances in \(\mathbb{R}^d\)

This page was built for publication: A new upper bound for the size of \(s\)-distance sets in boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300121)