中文
相关论文

相关论文: Set addition in boxes and the Freiman-Bilu theorem

200 篇论文

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.

组合数学 · 数学 2019-02-18 Andrzej P. Kisielewicz , Krzysztof Przesławski

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

组合数学 · 数学 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

数论 · 数学 2020-03-20 Changhao Chen , Igor E. Shparlinski

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

组合数学 · 数学 2024-02-21 Yifan Jing , Shukun Wu

Let $\A\subset\binom{[n]}{r}$ be a compressed, intersecting family and let $X\subset[n]$. Let $\A(X)={A\in\A:A\cap X\ne\emptyset}$ and $\S_{n,r}=\binom{[n]}{r}({1})$. Motivated by the Erd\H{o}s-Ko-Rado theorem, Borg asked for which…

组合数学 · 数学 2012-10-30 Benjamin Bond

We show that, for a finite set $A$ of real numbers, the size of the set $$\frac{A+A}{A+A} = \left\{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right \}$$ is bounded from below by $$\left|\frac{A+A}{A+A} \right| \gg \frac{|A|^{2+1/4}}{|A /…

组合数学 · 数学 2016-10-13 Ben Lund

Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…

数论 · 数学 2024-02-21 Joerg Bruedern , Trevor D. Wooley

Let $A\subset [1, 2]$ be a $(\delta, \sigma)$-set with measure $|A|=\delta^{1-\sigma}$ in the sense of Katz and Tao. For $\sigma\in (1/2, 1)$ we show that $$ |A+A|+|AA|\gtrapprox \delta^{-c}|A|, $$ for…

组合数学 · 数学 2020-02-26 Changhao Chen

We obtain quantitative versions of the Balog-Szemeredi-Gowers and Freiman theorems in the model case of a finite field geometry F_2^n, improving the previously known bounds in such theorems. For instance, if A is a subset of F_2^n such that…

组合数学 · 数学 2007-11-13 Ben Green , Terence Tao

We address Heath-Brown's and Serre's dimension growth conjecture (proved by Salberger), when the degree $d$ grows. Recall that Salberger's dimension growth results give bounds of the form $O_{X, \varepsilon} (B^{\dim X+\varepsilon})$ for…

数论 · 数学 2020-09-23 Wouter Castryck , Raf Cluckers , Philip Dittmann , Kien Huu Nguyen

We prove that for sets $A, B, C \subset \mathbb{F}_p$ with $|A|=|B|=|C| \leq \sqrt{p}$ and a fixed $0 \neq d \in \mathbb{F}_p$ holds $$ \max(|AB|, |(A+d)C|) \gg|A|^{1+1/26}. $$ In particular, $$ |A(A+1)| \gg |A|^{1 + 1/26} $$ and $$…

数论 · 数学 2015-07-21 Dmitrii Zhelezov

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

数论 · 数学 2024-07-12 Sarah Peluse , Sean Prendiville , Xuancheng Shao

We define a new framework that unifies the filtration and mapper approaches from TDA, and present efficient algorithms to compute it. Termed the box filtration of a PCD, we grow boxes (hyperrectangles) that are not necessarily centered at…

计算几何 · 计算机科学 2025-10-10 Enrique Alvarado , Prashant Gupta , Bala Krishnamoorthy

Let $p$ a large enough prime number. When $A$ is a subset of $\mathbb{F}_p\smallsetminus\{0\}$ of cardinality $|A|> (p+1)/3$, then an application of Cauchy-Davenport Theorem gives $\mathbb{F}_p\smallsetminus\{0\}\subset A(A+A)$. In this…

数论 · 数学 2019-05-29 Pierre-Yves Bienvenu , François Hennecart , Ilya Shkredov

We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…

数论 · 数学 2019-08-19 Khalid Younis

Research on Helly-type theorems in combinatorial convex geometry has produced volumetric versions of Helly's theorem using witness sets and quantitative extensions of Doignon's theorem. This paper combines these philosophies and presents…

组合数学 · 数学 2021-05-10 Travis Dillon

In the paper we study two characteristics D^+ (A), D^\times (A) of a set A which play important role in recent results concerning sum-product phenomenon. Also we obtain several variants and improvements of the Balog-Wooley decomposition…

组合数学 · 数学 2016-05-03 Ilya D. Shkredov

A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha_d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common…

组合数学 · 数学 2026-01-14 Andrew Suk , Ji Zeng

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

组合数学 · 数学 2010-04-13 Adrian Dumitrescu

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

组合数学 · 数学 2021-07-01 Imre Ruzsa , Jozsef Solymosi