Iterated combinatorial density theorems
From MaRDI portal
In this paper a variety of iterated density results for the number of different known combinatorial and algebraic structures via vector space have been obtained. The new simple proof of the finite unions and finite sums theorems have also been given.
Recommendations
- A combinatorial proof of the dense Hindman's theorem
- A combinatorial analog of a theorem of F.J. Dyson
- Density version of a theorem of Beck and Szemerédi-Trotter in combinatorial geometry
- The law of iterated logarithm for combinatorial multisets
- scientific article; zbMATH DE number 3995753
- A combinatorial proof of a stronger dense Hindman theorem
- scientific article; zbMATH DE number 749930
- On the density of sumsets
- Combinatorics of dense subsets of the rationals
- On the combinatorics of iterated stochastic integrals
Cites work
- A density statement generalizing Schur's theorem
- A family of countable homogeneous graphs
- Density versions of two generalizations of Schur's theorem
- Errata to ``Ramsey's theorem for a class of categories
- Finite sums from sequences within cells of a partition of N
- scientific article; zbMATH DE number 4029619 (Why is no real title available?)
- scientific article; zbMATH DE number 3674135 (Why is no real title available?)
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 3487493 (Why is no real title available?)
- scientific article; zbMATH DE number 1182901 (Why is no real title available?)
- Induced restricted Ramsey theorems for spaces
- On sets of integers containing k elements in arithmetic progression
- Partitionen und lineare Gleichungssysteme
- Partitionstheoreme für Graphen
- Quantitative theorems for regular systems of equations
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
- Studien zur Kombinatorik
Cited in
(4)
This page was built for publication: Iterated combinatorial density theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813782)