中文
相关论文

相关论文: An arithmetic transference proof of a relative Sze…

200 篇论文

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

动力系统 · 数学 2014-09-29 Vitaly Bergelson , Donald Robertson

Let $f_{s,k}(n)$ be the maximum possible number of $s$-term arithmetic progressions in a sequence $a_1<a_2<\ldots<a_n$ of $n$ integers which contains no $k$-term arithmetic progression. For all integers $k > s \geq 3$, we prove that…

组合数学 · 数学 2020-08-10 Jacob Fox , Cosmin Pohoata

We extend Szemeredi's Regularity Lemma (SRL) to abstract measure spaces. Our main aim is to find general conditions under which the original proof of Szemeredi still works. To illustrate that our approach has some merit, we outline several…

组合数学 · 数学 2007-05-23 Bela Bollobas , Vladimir Nikiforov

By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer $b\leq 246$ such that there are infinitely many primes $p$ such that $p+b$ is also prime. Let $P_1,...,P_t\in \mathbb{Z}[y]$ with…

数论 · 数学 2026-03-24 Andrew Lott , Nagendar Reddy Ponagandla

In this paper we introduce and study a certain type of sub semi-group of $\mathbb{R}/\mathbb{Z}$ which turns out to be closely related to \sz's theorem on arithmetic progressions.

度量几何 · 数学 2018-04-25 Han Yu

A famous theorem of Erdos and Szekeres states that any sequence of $n$ distinct real numbers contains a monotone subsequence of length at least $\sqrt{n}$. Here, we prove a positive fraction version of this theorem. For $n > (k-1)^2$, any…

组合数学 · 数学 2024-02-27 Andrew Suk , Ji Zeng

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

数论 · 数学 2014-12-17 James Maynard

In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…

动力系统 · 数学 2021-01-27 Anna Klick , Nicolae Strungaru , Adi Tcaciuc

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+\alpha)n$…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

数论 · 数学 2024-12-30 Jared Duker Lichtman

We establish versions of Szeg\H{o}'s distance formula and Widom's theorem on invertibility of (a family of) Toeplitz operators in a class of finite codimension subalgebras of uniform algebras, obtained by imposing a finite number of linear…

泛函分析 · 数学 2021-07-07 Douglas T. Pfeffer , Michael T. Jury

The aim of this paper is to try to establish a generic model for the problem that several multivariable number-theoretic functions represent simultaneously primes for infinitely many integral points. More concretely, we introduced briefly…

综合数学 · 数学 2009-11-23 Shaohua Zhang

We introduce and study the permanence properties of the class of linear transfers between probability measures. This class contains all cost minimizing mass transports, but also martingale mass transports, the Schrodinger bridge associated…

偏微分方程分析 · 数学 2018-10-29 Malcolm Bowles , Nassif Ghoussoub

We study thresholds for extremal properties of random discrete structures. We determine the threshold for Szemer\'edi's theorem on arithmetic progressions in random subsets of the integers and its multidimensional extensions and we…

组合数学 · 数学 2016-09-20 Mathias Schacht

In 2001, Koml\'os, S\'ark\"ozy and Szemer\'edi proved that, for each $\alpha>0$, there is some $c>0$ and $n_0$ such that, if $n\geq n_0$, then every $n$-vertex graph with minimum degree at least $(1/2+\alpha)n$ contains a copy of every…

组合数学 · 数学 2022-02-07 Amarja Kathapurkar , Richard Montgomery

We study the prime numbers that lie in Beatty sequences of the form $\lfloor \alpha n + \beta \rfloor$ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence and a Chebotarev…

数论 · 数学 2019-09-04 Caleb Ji , Joshua Kazdan , Vaughan McDonald

I provide simplified proofs for each of the following fundamental theorems regarding selection principles: 1. The Quasinormal Convergence Theorem, due to the author and Zdomskyy, asserting that a certain, important property of the space of…

一般拓扑 · 数学 2024-06-05 Boaz Tsaban

The classical Szeg\"{o}--Kolmogorov Prediction Theorem gives necessary and sufficient condition on a weight $w$ on the unite cirlce $T$ so that the exponentials with positive integer frequences span the weighted space $L^2(T,w)$. We…

经典分析与常微分方程 · 数学 2019-12-24 Alexander Olevskii , Alexander Ulanovskii

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

组合数学 · 数学 2019-07-18 Guy Moshkovitz , Asaf Shapira

Let ${\bf K}$ be an $\mathrm{LS}({\bf K})$-short abstract elementary class and assume more than the existence of a monster model (amalgamation over sets and arbitrarily large models). Suppose ${\bf K}$ is categorical in some…

逻辑 · 数学 2022-03-18 Samson Leung