2000 character limit reached
$B_h$-sets of real and complex numbers
Published 28 Feb 2025 in math.CO and math.NT | (2502.21272v3)
Abstract: Let $K = \mathbb{R}$ or $\mathbb{C}$. An $n$-element subset $A$ of $K$ is a $B_h$-set if every element of $K$ has at most one representation as the sum of $h$ not necessarily distinct elements of $A$. Associated to the $B_h$ set $A = {a_1,\ldots, a_n}$ are the $B_h$-vectors $\mathbf{a} = (a_1,\ldots, a_n)$ in $Kn$. This paper proves that ``almost all'' $n$-element subsets of $K$ are $B_h$-sets in the sense that the set of all $B_h$-vectors is a dense open subset of $Kn$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.