English
Related papers

Related papers: Roth-type theorems in additive combinatroics

200 papers

We first give a short intrinsic, diagrammatic proof of the First Fundamental Theorem of invariant theory (FFT) for the special orthogonal group $\text{SO}_m(\mathbb{C})$, given the FFT for $\text{O}_m(\mathbb{C})$. We then define, by means…

Representation Theory · Mathematics 2016-12-14 Gustav Lehrer , Ruibin Zhang

We present a self-contained proof of a strong version of van der Waerden's Theorem. By using translation invariant filters that are maximal with respect to inclusion, a simple inductive argument shows the existence of "piecewise…

Combinatorics · Mathematics 2020-01-17 Mauro Di Nasso

Carath\'eodorys Theorem of convex hulls plays an important role in convex geometry. In 1982, B\'ar\'any formulated and proved a more general version, called the Colorful Carath\'eodory. This colorful version was even more generalized by…

Combinatorics · Mathematics 2019-04-29 Helena Bergold , Winfried Hochstättler

A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erd\H{o}s in 1950, and over the following decades he asked many questions about them. Most…

Combinatorics · Mathematics 2022-11-04 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba

The conjecture of Brown, Erd\H{o}s and S\'os from 1973 states that, for any $k \ge 3$, if a $3$-uniform hypergraph $H$ with $n$ vertices does not contain a set of $k+3$ vertices spanning at least $k$ edges then it has $o(n^2)$ edges. The…

Combinatorics · Mathematics 2019-05-07 Rajko Nenadov , Benny Sudakov , Mykhaylo Tyomkyn

It is well known that the strong subadditivity theorem is hold for classical system, but it is very difficult to prove that it is hold for quantum system. The first proof of this theorem is due to Lieb by using the Lieb's theorem. Here we…

Quantum Physics · Physics 2007-05-23 Yong-Jian Han , Yong-Sheng Zhang , Guang-Can Guo

We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a…

Number Theory · Mathematics 2021-09-02 Thomas F. Bloom , Olof Sisask

Shortly after Szemer\'edi's proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of ergodic Ramsey…

Dynamical Systems · Mathematics 2007-05-23 Bryna Kra

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

Combinatorics · Mathematics 2025-10-02 Nived J M

This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…

Combinatorics · Mathematics 2026-03-20 Munenori Inagaki , Hideki Matsumura , Masanori Sawa , Yukihiro Uchida

We first prove the Grinberg-Kazhdan formal arc theorem without any assumptions on the characteristic. This part of the article is equivalent to arXiv:math-AG/0203263. Then we try to clarify the geometric ideas behind the proof by…

Algebraic Geometry · Mathematics 2019-11-25 Vladimir Drinfeld

Many important problems in extremal combinatorics can be be stated as proving a pure binomial inequality in graph homomorphism numbers, i.e., proving that…

Combinatorics · Mathematics 2022-02-03 Grigoriy Blekherman , Annie Raymond

This is an introduction to the theory of Witt vectors. It includes a construction of the Witt rings, the Frobenius and Verschiebung endomorphisms, the canonical map from W to W^2 (its lambda-algebra structure), the relation to strict…

Number Theory · Mathematics 2014-09-29 Joseph Rabinoff

We give an elementary, Fourier-free proof of Roth's theorem. The proof follows Roth's original density-increment strategy, but replaces the usual Fourier-analytic step with a direct combinatorial argument involving averages over…

Combinatorics · Mathematics 2026-05-20 Mark Lewko

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Logic · Mathematics 2015-01-15 Boris Zilber

A history of two Rolle Theorems, about the root of derivative and about root interval from 1690 till the end of XIX century.

History and Overview · Mathematics 2015-03-12 Galina Sinkevich

An old theorem of Ad\'amek constructs initial algebras for sufficiently cocontinuous endofunctors via transfinite iteration over ordinals in classical set theory. We prove a new version that works in constructive logic, using "inflationary"…

Logic · Mathematics 2022-11-04 Andrew M. Pitts , S. C. Steenkamp

We prove, assuming the generalized Riemann hypothesis, the Andre-Oort conjecture for Hilbert modular surfaces. More precisely, let K be a real quadratic field and let S be the coarse moduli space of complex abelian surfaces with…

Number Theory · Mathematics 2007-05-23 Bas Edixhoven

Since Hooley's seminal 1967 resolution of Artin's primitive root conjecture under the Generalized Riemann Hypothesis, numerous variations of the conjecture have been considered. We present a framework generalizing and unifying many…

Number Theory · Mathematics 2022-12-02 Olli Järviniemi , Antonella Perucca

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

Combinatorics · Mathematics 2022-01-20 Atsushi Atsuji , Hiroshi Kaneko