中文
相关论文

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

200 篇论文

Let us fix a prime $p$. The Erd\H{o}s-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$.…

组合数学 · 数学 2020-06-30 Lisa Sauermann

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

交换代数 · 数学 2015-02-02 Apoorva Khare

We consider the bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form "Is x in S?" by…

数据结构与算法 · 计算机科学 2015-04-09 Mohit Garg , Jaikumar Radhakrishnan

Let $F$ be a fixed field of characteristic zero containing an element $i$ such that $i^2 = -1$. In this paper we consider finite dimensional superalgebras over $F$ endowed with a pseudoautomorphism $p$ and we investigate the asymptotic…

环与代数 · 数学 2025-08-28 Elena Campedel , Ginevra Giordani , Antonio Ioppolo

The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…

组合数学 · 数学 2020-04-02 Changhao Chen , Catherine Greenhill

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

数论 · 数学 2016-07-29 Steve Wright

Let p be a prime and let A be a subset of F_p. For k<p let X_{A,k} be the (k-1)-dimensional complex on the vertex set F_p with a full (k-2)-skeleton whose (k-1)-faces are k-subsets S of F_p such that the sum of the elements of S belongs to…

组合数学 · 数学 2012-12-17 Roy Meshulam

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

组合数学 · 数学 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at most a*p, tends to a limit as p tends to infinity through…

数论 · 数学 2014-02-26 Ben Green , Olof Sisask

In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or…

微分几何 · 数学 2012-04-27 Ta Le Loi , Phan Phien

Suppose $A$ is a subset of $\{1, \dotsc, N\}$ which does not contain any configurations of the form $x,x+\lfloor n^c \rfloor$ where $n \neq 0$ and $1<c<\frac{6}{5}$. We show that the density of $A$ relative to the first $N$ integers is…

数论 · 数学 2024-11-19 Maximilian O'Keeffe

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

组合数学 · 数学 2026-05-08 Ruben Carpenter , Colin Defant , Noah Kravitz

A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…

逻辑 · 数学 2025-08-14 L. C. Brown

We obtain asymptotic bounds on the number of natural numbers less than $X$ satisfying $\gcd{\left(n,\lfloor P(n) \rfloor\right)}=1$, under some diophantine conditions on the coefficient of $x$ in $P$, and show that the density of such…

数论 · 数学 2024-11-25 Aahan Chatterjee

In a previous paper of the authors, we showed that for any polynomials $P_1,\dots,P_k \in \Z[\mathbf{m}]$ with $P_1(0)=\dots=P_k(0)$ and any subset $A$ of the primes in $[N] = \{1,\dots,N\}$ of relative density at least $\delta>0$, one can…

数论 · 数学 2014-10-13 Terence Tao , Tamar Ziegler

A coordinate cone in R^n is an intersection of some coordinate hyperplanes and open coordinate half-spaces. A semi-monotone set is a defnable in an o-minimal structure over the reals, open bounded subset of R^n such that its intersection…

逻辑 · 数学 2011-07-20 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

组合数学 · 数学 2024-05-17 Paul Bastide , Carla Groenland , Maria-Romina Ivan , Tom Johnston

L-Infinity structures have been a subject of recent interest in physics, where they occur in closed string theory and in gauge theory. This paper provides a class of easily constructible examples of $L_n$ and $L_{\infty}$ structures on…

量子代数 · 数学 2007-05-23 Marilyn Daily

Arithmetic progressions of length $3$ may be found in compact subsets of the reals that satisfy certain Fourier -- as well as Hausdorff -- dimensional requirements. It has been shown that a very similar result holds in the integers under…

经典分析与常微分方程 · 数学 2021-04-20 Paul Potgieter

For any $d\in \mathbb{N}$ and any function $f:(0,\infty)\to [0,1]$ with $f(R)\to 0$ as $R\to \infty$, we construct a set $A \subseteq \mathbb{R}^d$ and a sequence $R_n \to \infty$ such that $\|x-y\| \neq R_n$ for all $x,y\in A$ and…

经典分析与常微分方程 · 数学 2019-06-06 Alex Rice