English
Related papers

Related papers: Sumsets in the Hypercube

200 papers

Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…

Information Theory · Computer Science 2010-12-17 Arya Mazumdar , Ron M. Roth , Pascal O. Vontobel

Let $f$ be a smooth real function with strictly monotone first $k$ derivatives. We show that for a finite set $A$, with $|A+A|\leq K|A|$, $|2^kf(A)-(2^k-1)f(A)|\gg_k |A|^{k+1-o(1)}/K^{O_k(1)}$. We deduce several new sum-product type…

Number Theory · Mathematics 2020-05-04 Brandon Hanson , Oliver Roche-Newton , Misha Rudnev

For $\delta>0$ sufficiently small and $A\subset \mathbb{Z}^k$ with $|A+A|\le (2^k+\delta)|A|$, we show either $A$ is covered by $m_k(\delta)$ parallel hyperplanes, or satisfies $|\widehat{\operatorname{co}}(A)\setminus A|\le c_k\delta |A|$,…

Number Theory · Mathematics 2022-12-07 Peter van Hintum , Hunter Spink , Marius Tiba

Capsets are subsets of $\mathbb{F}_3^n$ with no three points on a line and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of $\mathbb{F}_3$.…

Combinatorics · Mathematics 2026-03-10 Cassie Grace , José Felipe Voloch

In the papers Ziegler(2001) and Goldstein(2012) it was previously shown that any subset of the Boolean cube $ S \subset \{0,1\}^n $ for $ n \leq 9 $ can be partitioned into $n+1$ parts of smaller diameter, i.e., the Borsuk conjecture holds…

Combinatorics · Mathematics 2025-04-03 Igor Batmanov , Vsevolod Voronov

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for…

Number Theory · Mathematics 2026-04-07 Melvyn B. Nathanson

A numerical semigroup $S$ is a subset of the non-negative integers containing $0$ that is closed under addition. The Hilbert series of $S$ (a formal power series equal to the sum of terms $t^n$ over all $n \in S$) can be expressed as a…

Commutative Algebra · Mathematics 2019-03-26 Jeske Glenn , Christopher O'Neill , Vadim Ponomarenko , Benjamin Sepanski

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Combinatorics · Mathematics 2014-02-25 Antal Balog , Oliver Roche-Newton

We derive massless and massive representations of all SU(2,2/N) superalgebras by using superfields defined in "harmonic superspace". This method allows one to easily construct "short superfields" which are relevant in the analysis of the…

High Energy Physics - Theory · Physics 2007-05-23 S. Ferrara

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

Dynamical Systems · Mathematics 2025-09-16 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors.…

Number Theory · Mathematics 2021-11-08 Peter J. Bradshaw

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

Combinatorics · Mathematics 2025-10-13 Manik Dhar , Sammy Luo

We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…

Combinatorics · Mathematics 2016-05-17 Anne de Roton

We study a variant of the Ackermann encoding $\mathbb{N}(x) := \sum_{y\in x}2^{\mathbb{N}(y)}$ of the hereditarily finite sets by the natural numbers, applicable to the larger collection $\mathsf{HF}^{1/2}$ of the hereditarily finite…

Logic in Computer Science · Computer Science 2018-06-26 Domenico Cantone , Alberto Policriti

The proportion of $d$-element subsets of $\mathbb{F}_2^d$ that are bases is asymptotic to $\prod_{j=1}^{\infty}(1-2^{-j}) \approx 0.29$ as $d \to \infty$. It is natural to ask whether there exists a (large) subset $\mathcal{F}$ of…

Combinatorics · Mathematics 2025-03-03 David Ellis , Maria-Romina Ivan , Imre Leader

We show that the biggest possible average set size in the complement $2^{\{1,2,\ldots, n\}} \setminus A$ of a union-closed family $A \subset 2^{\{1,2, \ldots, n\}}$ is $\tfrac{n+1}{2}$. With the same proof we get a sharp upper bound for the…

Combinatorics · Mathematics 2020-05-04 Luca Studer

We present a variety of new results on finite sets A of integers for which the sumset A+A is larger than the difference set A-A, so-called MSTD (more sums than differences) sets. First we show that there is, up to affine transformation, a…

Number Theory · Mathematics 2015-06-26 Peter Hegarty

Given a finite subset A of an abelian group G, we study the set k \wedge A of all sums of k distinct elements of A. In this paper, we prove that |k \wedge A| >= |A| for all k in {2,...,|A|-2}, unless k is in {2,|A|-2} and A is a coset of an…

Combinatorics · Mathematics 2012-06-27 Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

Let $A$ be a subset of an additive abelian semigroup $S$ and let $hA$ be the $h$-fold sumset of $A$. The following question is considered: Let $(A_q)_{q=1}^{\infty}$ be a strictly decreasing sequence of sets in $S$ and let $A =…

Number Theory · Mathematics 2026-05-15 Melvyn B. Nathanson

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

Classical Analysis and ODEs · Mathematics 2009-12-30 Chun-Yen Shen
‹ Prev 1 4 5 6 7 8 10 Next ›