Bootstrapping partition regularity of linear systems
From MaRDI portal
Publication:4970545
DOI10.1017/S0013091520000048zbMath1448.05204arXiv1904.07581OpenAlexW2936860779MaRDI QIDQ4970545
Publication date: 14 October 2020
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.07581
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partition regularity and the primes
- A Schur-type addition theorem for primes
- Higher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear forms
- Some two color, four variable Rado numbers
- Linear equations in primes
- Quantitative theorems for regular systems of equations
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Studien zur Kombinatorik
- On triples in arithmetic progression
- Gowers norms control diophantine inequalities
- The two-colour Rado number for the equation \(ax+by=(a+b)_z\)
- Finite field models in arithmetic combinatorics -- ten years on
- Partitionen und lineare Gleichungssysteme
- On Generalized Schur Numbers
- Monochromatic sums and products
- The 2-color Rado number of $x_1+x_2+\cdots +x_n=y_1+y_2+\cdots +y_k$
- An arithmetic regularity lemma, associated counting lemma, and applications
- Fourier analysis in combinatorial number theory
- Tight bounds on additive Ramsey-type numbers
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- Good Bounds in Certain Systems of True Complexity One
- On the Ramsey number of the Brauer configuration
- Monochromatic Solutions to
- Sum-free sets of integers
- Ramsey's Theorem for n-Parameter Sets
- The true complexity of a system of linear equations
- A new proof of Szemerédi's theorem
