Quantitative theorems for regular systems of equations
From MaRDI portal
(Redirected from Publication:1108271)
Recommendations
- Regular systems of linear functional equations and applications
- REGULAR SYSTEMS OF EQUATIONS IN λ-CALCULUS
- Regular systems of differential-algebraic equations
- scientific article; zbMATH DE number 4099397
- Metric regularity and systems of generalized equations
- scientific article; zbMATH DE number 6314687
- On partition regular systems of equations
- Regularity of certain Diophantine equations
- scientific article; zbMATH DE number 687581
- Quadratic systems of ordinary differential equations and algebra
Cites work
- scientific article; zbMATH DE number 3937240 (Why is no real title available?)
- scientific article; zbMATH DE number 3675949 (Why is no real title available?)
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 1182901 (Why is no real title available?)
- A canonical partition theorem for equivalence relations on \(Z^ n\).
- A survey of bounds for classical Ramsey numbers
- An elementary proof of the canonizing version of Gallai-Witt's theorem
- An ergodic Szemerédi theorem for commuting transformations
- Canonical partition theorems for parameter sets
- Canonization theorems for finite affine and linear spaces
- On sets of integers containing k elements in arithmetic progression
- On the Ramsey numbers N(3,3,\dots ,3;2)
- Partition theorems for systems of finite subsets of integers
- Partitionen und lineare Gleichungssysteme
- Studien zur Kombinatorik
- The ergodic theoretical proof of Szemerédi’s theorem
Cited in
(39)- Partition-regular systems of equations
- From discrete to continuous: monochromatic 3-term arithmetic progressions
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- Distinguishing subgroups of the rationals by their Ramsey properties
- Integer colorings with no rainbow \(k\)-term arithmetic progression
- Counting patterns in colored orthogonal arrays
- Partition regularity for systems of diagonal equations
- Ramsey properties of random discrete structures
- Counting configuration-free sets in groups
- Partition regularity of polynomial systems near zero
- Monochromatic sums and products
- An asymmetric random Rado theorem: 1-statement
- Partition regularity in the rationals
- Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)
- Bootstrapping partition regularity of linear systems
- Image partition regularity of affine transformations
- Rado's criterion over squares and higher powers
- Partition regularity and multiplicatively syndetic sets
- On the number of monochromatic solutions of integer linear systems on abelian groups
- Fermat's last theorem implies Euclid's infinitude of primes
- Extremal Sidon sets are Fourier uniform, with applications to partition regularity
- Normal limiting distributions for systems of linear equations in random sets
- On partition regular systems of equations
- Iterated combinatorial density theorems
- Solving equations in dense Sidon sets
- Sets Partition Regular for n Equations Need not Solve n + 1
- scientific article; zbMATH DE number 2188406 (Why is no real title available?)
- Independent arithmetic progressions in clique-free graphs on the natural numbers
- On the number of monochromatic solutions of integer linear systems on abelian groups
- Colouring versus density in integers and Hales-Jewett cubes
- On the degree of regularity of some equations
- Extremal results for random discrete structures
- Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations
- Finding Patterns Avoiding Many Monochromatic Constellations
- Counting monochromatic solutions to diagonal Diophantine equations
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- Nonconstant monochromatic solutions to systems of linear equations
- Independent Deuber sets in graphs on the natural numbers
- An asymmetric random Rado theorem for single equations: The 0‐statement
This page was built for publication: Quantitative theorems for regular systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108271)
