English
Related papers

Related papers: Additive energies on discrete cubes

200 papers

For a positive integer $n \geq 2$, define $t_n$ to be the smallest number such that the additive energy $E(A)$ of any subset $A \subset \{0,1,\cdots,n-1\}^d$ and any $d$ is at most $|A|^{t_n}$. Trivially we have $t_n \leq 3$ and $$ t_n \geq…

Combinatorics · Mathematics 2024-11-20 Xuancheng Shao

We show that for all $A, B \subseteq \{0,1,2\}^{d}$ we have $$ |A+B|\geq (|A||B|)^{\log(5)/(2\log(3))}. $$ We also show that for all finite $A,B \subset \mathbb{Z}^{d}$, and any $V \subseteq\{0,1\}^{d}$ the inequality $$ |A+B+V|\geq…

Combinatorics · Mathematics 2024-04-16 Lars Becker , Paata Ivanisvili , Dmitry Krachun , Jóse Madrid

We show that for any finite set $A$ and an arbitrary $\varepsilon>0$ there is $k=k(\varepsilon)$ such that the higher energy ${\mathsf{E}}_k(A)$ is at most $|A|^{k+\varepsilon}$ unless $A$ has a very specific structure. As an application we…

Number Theory · Mathematics 2021-03-30 Ilya D. Shkredov

We show that if A is a set having small subtractive doubling in an abelian group, that is |A-A|< K|A|, then there is a polynomially large subset B of A-A so that the additive energy of B is large than (1/K)^{1 - \epsilon) where epsilon is a…

Combinatorics · Mathematics 2008-03-03 Nets Hawk Katz , Paul Koester

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Number Theory · Mathematics 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson

Let $F_{k,d}(n)$ be the maximal size of a set ${A}\subseteq [n]$ such that the equation \[a_1a_2\dots a_k=x^d, \; a_1<a_2<\ldots<a_k\] has no solution with $a_1,a_2,\ldots,a_k\in {A}$ and integer $x$. Erd\H{o}s, S\'ark\"ozy and T. S\'os…

We show that a set $A \subset \{0,1\}^{n}$ with edge-boundary of size at most $|A| (\log_{2}(2^{n}/|A|) + \epsilon)$ can be made into a subcube by at most $(2 \epsilon/\log_{2}(1/\epsilon))|A|$ additions and deletions, provided $\epsilon$…

Combinatorics · Mathematics 2013-11-28 David Ellis

A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.

Combinatorics · Mathematics 2019-02-18 Andrzej P. Kisielewicz , Krzysztof Przesławski

In this expository note we describe a proof due to A. Sapozhenko that the number of independent sets in the discrete $d$-dimensional hypercube $Q_d$ is asymptotically $2 \sqrt{e} 2^{2^{d-1}}$ as $d$ tends to infinity.

Combinatorics · Mathematics 2019-01-09 David Galvin

Let $d \geq 1$ and $s \leq 2^d$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_n$ and $n\geq d$, let $\lambda(n,d,s,A)$ denote the fraction of subcubes $Q_d$ of $Q_n$ that contain exactly $s$ vertices of $A$. Let…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Maria Axenovich , John Goldwasser

We study optimal dimensionless inequalities $$ \|f\|_{U^k} \leq \|f\|_{\ell^{p_{k,n}}} $$ that hold for all functions $f\colon\mathbb{Z}^d\to\mathbb{C}$ supported in $\{0,1,\ldots,n-1\}^d$ and estimates $$ \|1_A\|_{U^k}^{2^k}\leq…

Combinatorics · Mathematics 2025-06-18 Adrian Beker , Tonći Crmarić , Vjekoslav Kovač

Given $A\subseteq GL_2(\mathbb{F}_q)$, we prove that there exist disjoint subsets $B, C\subseteq A$ such that $A = B \sqcup C$ and their additive and multiplicative energies satisfying \[ \max\{\,E_{+}(B),\, E_{\times}(C)\,\}\ll…

Combinatorics · Mathematics 2021-06-28 Ali Mohammadi , Thang Pham , Yiting Wang

In this paper, we provide estimates for the additive discretized energy of \[\sum_{c\in C} |\{(a_1, a_2, b_1, b_2)\in A^2\times B^2: |(a_1 +cb_1) - (a_2 + cb_2)|\le \delta\}|_{\delta},\] that depend on non-concentration conditions of the…

Classical Analysis and ODEs · Mathematics 2024-03-29 Quy Pham , Thang Pham , Chun-Yen Shen

We obtain a series of lower bounds for the product set of combinatorial cubes, as well as some non--trivial upper estimates for the multiplicative energy of such sets.

Combinatorics · Mathematics 2020-08-04 Ilya D. Shkredov

We prove a combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there are at most $2^{d+1}-2$ nearly neighbourly simplices in $\mathbb R^d$.

Combinatorics · Mathematics 2020-01-01 Andrzej P. Kisielewicz , Krzysztof Przesławski

Let $A$ be a subset of integers and let $2\cdot A+k\cdot A=\{2a_1+ka_2 : a_1,a_2\in A\}$. Y. O. Hamidoune and J. Ru\' e proved that if $k$ is an odd prime and $A$ a finite set of integers such that $|A|>8k^k$, then $|2\cdot A+k\cdot A|\ge…

Number Theory · Mathematics 2011-03-16 Zeljka Ljujic

In the paper we develop the method of higher energies. New upper bounds for the additive energies of convex sets, sets A with small |AA| and |A(A+1)| are obtained. We prove new structural results, including higher sumsets, and develop the…

Combinatorics · Mathematics 2013-01-01 Ilya D. Shkredov

We establish a sharp estimate for $k$-additive energies of subsets of the discrete hypercube conjectured by de Dios Pont, Greenfeld, Ivanisvili, and Madrid in arXiv:2112.09352, which generalizes a result by Kane and Tao. This note proves…

Classical Analysis and ODEs · Mathematics 2023-06-19 Vjekoslav Kovač

We establish that, for almost all natural numbers $N$, there is a sum of two positive integral cubes lying in the interval $[N-N^{7/18+\epsilon},N]$. Here, the exponent $7/18$ lies half way between the trivial exponent $4/9$ stemming from…

Number Theory · Mathematics 2024-05-30 Joerg Bruedern , Trevor D. Wooley

We show upper bounds on the maximal dimension $d$ of Hilbert cubes $H=a_0+\{0,a_1\}+\cdots + \{0, a_d\}\subset S \cap [1, N]$ in several sets $S$ of arithmetic interest such as the squares, powerful numbers and pure powers.

Number Theory · Mathematics 2015-10-20 Rainer Dietmann , Christian Elsholtz
‹ Prev 1 2 3 10 Next ›