English
Related papers

Related papers: Small subset sums

200 papers

We introduce axiomatically a Nonarchimedean field E, called the field of the Euclidean numbers, where a transfinite sum is defined that is indicized by ordinal numbers less than the first inaccessible {\Omega}. Thanks to this sum, E becomes…

Logic · Mathematics 2020-06-30 Vieri Benci , Marco Forti

A subset U of a group G is called k-universal if U contains a translate of every k-element subset of G. We give several nearly optimal constructions of small k-universal sets, and use them to resolve an old question of Erdos and Newman on…

Combinatorics · Mathematics 2008-04-06 Noga Alon , Boris Bukh , Benny Sudakov

We give a construction of a convex set $A \subset \mathbb R$ with cardinality $n$ such that $A-A$ contains a convex subset with cardinality $\Omega (n^2)$. We also consider the following variant of this problem: given a convex set $A$, what…

Combinatorics · Mathematics 2023-09-15 Krishnendu Bhowmick , Ben Lund , Oliver Roche-Newton

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…

Computational Geometry · Computer Science 2021-08-31 Stephane Durocher , J. Mark Keil , Saeed Mehrabi , Debajyoti Mondal

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

Optimization and Control · Mathematics 2024-03-11 Moslem Zamani , François Glineur , Julien M. Hendrickx

For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon,…

Combinatorics · Mathematics 2025-10-03 Josef Greilhuber , Carl Schildkraut , Jonathan Tidor

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\{1,2,\ldots, n\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is…

Combinatorics · Mathematics 2016-05-11 József Balogh , Hong Liu , Maryam Sharifzadeh

Suppose that $A$, $B$ and $S$ are non-empty subsets of a finite abelian group $G$. Then the generalized restricted sumset $$ A\stackrel{S}+B:=\{a+b:\,a\in A,\ b\in B,\ a-b\not\in S\} $$ contains at least $$ \min\{|A|+|B|-3|S|,p(G)\} $$…

Number Theory · Mathematics 2016-09-13 Shanshan Du , Hao Pan

Let $C$ and $K$ be centrally symmetric convex bodies of volume $1$ in ${\mathbb R}^n$. We provide upper bounds for the multi-integral expression \begin{equation*}\|{\bf…

Metric Geometry · Mathematics 2019-06-11 Giorgos Chasapis , Apostolos Giannopoulos , Nikos Skarmogiannis

Let $K$ be a number field. In the terminology of Nagell a unit $\varepsilon$ of $K$ is called {\it exceptional} if $1-\varepsilon$ is also a unit. The existence of such a unit is equivalent to the fact that the unit equation…

Number Theory · Mathematics 2018-10-09 Csanád Bertók , Kálmán Győry , Lajos Hajdu , Andrzej Schinzel

We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…

Combinatorics · Mathematics 2018-05-15 Alain Plagne , Salvatore Tringali

Let V be a finite set of points in Euclidean d-space (d >= 2). The intersection of all unit balls B(v,1) centered at v, where v ranges over V, henceforth denoted by B(V) is the ball polytope associated with V. Note that B(V) is non-empty…

Metric Geometry · Mathematics 2009-05-12 Yaakov S. Kupitz , Horst Martini , Micha A. Perles

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Combinatorics · Mathematics 2024-01-12 Noga Alon , Natalie Dodson , Carmen Jackson , Rose McCarty , Rajko Nenadov , Lani Southern

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

Combinatorics · Mathematics 2021-10-26 Evangelos Bartzos , Ioannis Z. Emiris , Raimundas Vidunas

Let an $R$-body be the complement of the union of open balls of radius $R$ in $\mathbb{E}^d$. The $R$-hulloid of a closed not empty set $A$, the minimal $R$-body containing $A$, is investigated; if $A$ is the set of the vertices of a…

Analysis of PDEs · Mathematics 2022-10-11 M. Longinetti , P. Manselli , A. Venturi

For a finite set of points $V=\{v_1, \dots, v_m\}$ in Euclidean space $\mathbb{R}^d$ and a point $r \in \mathbb{R}^d$, a subset $S \subset V$ is called $r$-balanced if $\mathrm{relint}(\mathrm{conv}(S)) \cap r \neq \emptyset$. In the case…

Combinatorics · Mathematics 2025-12-10 Mikhail V. Bludov

For a given integer $k$, let $\ell_k$ denote the supremum $\ell$ such that every sufficiently large graph $G$ with average degree less than $2\ell$ admits a separator $X \subseteq V(G)$ for which $\chi(G[X]) < k$. Motivated by the values of…

Combinatorics · Mathematics 2025-10-03 Guillaume Aubian , Marthe Bonamy , Romain Bourneuf , Oscar Fontaine , Lucas Picasarri-Arrieta

We show that the Euclidean ball has the smallest volume among sublevel sets of nonnegative forms of bounded Bombieri norm as well as among sublevel sets of sum of squares forms whose Gram matrix has bounded Frobenius or nuclear (or, more…

Optimization and Control · Mathematics 2020-07-28 Khazhgali Kozhasov , Jean-Bernard Lasserre

A partially ordered set is r-thick if every nonempty open interval contains at least r elements. This paper studies the flag vectors of graded, r-thick posets and shows the smallest convex cone containing them is isomorphic to the cone of…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer , Gabor Hetyei

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin