中文
相关论文

相关论文: On the Structure of Sets with Few Three-Term Arith…

200 篇论文

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…

计算几何 · 计算机科学 2007-05-23 Jeff Erickson

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

数论 · 数学 2008-12-06 Hongze Li , Hao Pan

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

逻辑 · 数学 2026-02-23 Tomohiro Kawakami , Hiroshi Tanaka

We prove that any set $A\subset \mathbb{N}$ of positive upper density contains a finite $S\subset A$ such that $\sum_{n\in S}\frac{1}{n}=1$, answering a question of Erd\H{o}s and Graham.

数论 · 数学 2023-10-13 Thomas F. Bloom

For classes O of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order cont (containment of permutations, subgraph relation etc.), we investigate restrictions on the function f(n) counting…

组合数学 · 数学 2007-05-23 Martin Klazar

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

数论 · 数学 2016-02-23 Mikhail Gabdullin

Given finite configurations $P_1, \dots, P_n \subset \mathbb{R}^d$, let us denote by $\mathbf{m}_{\mathbb{R}^d}(P_1, \dots, P_n)$ the maximum density a set $A \subseteq \mathbb{R}^d$ can have without containing congruent copies of any…

组合数学 · 数学 2023-05-10 Davi Castro-Silva

We consider restricted sumsets over field $F$. Let\begin{align*}C=\{a_1+\cdots+a_n:a_1\in A_1,\ldots,a_n\in A_n, a_i-a_j\notin S_{ij}\ \text{if}\ i\not=j\},\end{align*} where $S_{ij}(1\leqslant i\not=j\leqslant n)$ are finite subsets of $F$…

数论 · 数学 2014-02-17 Lilu Zhao

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

数论 · 数学 2026-04-21 Xuancheng Shao

Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\lfloor n/3\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound…

计算几何 · 计算机科学 2019-02-26 Ahmad Biniaz , Alfredo García

We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson and…

逻辑 · 数学 2010-01-05 Anand Pillay

For any prime p we consider the density of elements in the multiplicative group of the finite field F_p having order, respectively index, congruent to a(mod d). We compute these densities on average, where the average is taken over all…

数论 · 数学 2007-05-23 Pieter Moree

An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…

组合数学 · 数学 2014-01-14 Robert Brignall , Nik Ruskuc , Vince Vatter

We combine the fundamental results of Breuillard, Green, and Tao on the structure of approximate groups, together with "tame" arithmetic regularity methods based on work of the authors and Terry, to give a structure theorem for finite…

群论 · 数学 2024-10-21 Gabriel Conant , Anand Pillay

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

数论 · 数学 2025-10-20 Harry Altman , Juan Arias de Reyna

A sequence $A$ of elements an additive group $G$ is {\it incomplete} if there exists a group element that {\it can not} be expressed as a sum of elements from $A$. The study of incomplete sequences is a popular topic in combinatorial number…

组合数学 · 数学 2011-12-06 Hoi H. Nguyen , Van Vu

The dimension of a poset $P$, denoted $\dim(P)$, is the least positive integer $d$ for which $P$ is the intersection of $d$ linear extensions of $P$. The maximum dimension of a poset $P$ with $|P|\le 2n+1$ is $n$, provided $n\ge2$, and this…

组合数学 · 数学 2015-08-26 Csaba Biró , Peter Hamburger , Attila Pór , William T. Trotter

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…

组合数学 · 数学 2016-11-29 Shanshan Du , Hao Pan

A set of points $S$ in Euclidean space $\mathbb{R}^d$ is called \textit{Ramsey} if any finite partition of $\mathbb{R}^{\infty}$ yields a monochromatic copy of $S$. While characterization of Ramsey set remains a major open problem in the…

组合数学 · 数学 2025-08-11 Vojtěch Rödl , Marcelo Sales

Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…

经典分析与常微分方程 · 数学 2013-06-11 Izabella Laba , Malabika Pramanik