On sets of integers containing k elements in arithmetic progression
From MaRDI portal
Publication:4059028
DOI10.4064/AA-27-1-199-245zbMath0303.10056OpenAlexW1022649828WikidataQ56341552 ScholiaQ56341552MaRDI QIDQ4059028
No author found.
Publication date: 1975
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/205339
Related Items (only showing first 100 items - show all)
Independent sets in algebraic hypergraphs ⋮ Spanning surfaces in \(3\)-graphs ⋮ A Furstenberg-Zimmer structure theorem for \(\sigma\)-finite measure spaces ⋮ Multi-recurrence and van der Waerden systems ⋮ Number theory -- probabilistic, heuristic, and computational approaches ⋮ Arithmetic progressions and chaos in linear dynamics ⋮ A Szemerédi-type theorem for subsets of the unit cube ⋮ An ergodic correspondence principle, invariant means and applications ⋮ Spanning trees of dense directed graphs ⋮ Subset sum ``cubes and the complexity of primality testing ⋮ Isometric extensions and multiple recurrence of infinite measure preserving systems ⋮ Integer colorings with no rainbow 3-term arithmetic progression ⋮ Stability and sparsity in sets of natural numbers ⋮ Gowers norms and pseudorandom measures of subsets ⋮ On the extremal combinatorics of the Hamming space ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ On a colored Turán problem of Diwan and Mubayi ⋮ Density theorems and extremal hypergraph problems ⋮ Normal limiting distributions for systems of linear equations in random sets ⋮ The number of \(k\)-dimensional corner-free subsets of grids ⋮ A generic distal tower of arbitrary countable height over an arbitrary infinite ergodic system ⋮ Discordant sets and ergodic Ramsey theory ⋮ Topological characteristic factors and independence along arithmetic progressions ⋮ Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions ⋮ A note on sparse supersaturation and extremal results for linear homogeneous systems ⋮ Pointwise ergodic theorems for non-conventional bilinear polynomial averages ⋮ Distance graphs and sets of positive upper density in \(\mathbb{R}^d\) ⋮ On odd rainbow cycles in edge-colored graphs ⋮ Down the large rabbit hole ⋮ Linear equations and sets of integers ⋮ Monochromatic Hilbert cubes and arithmetic progressions ⋮ An uncountable ergodic Roth theorem and applications ⋮ Numerical semigroups of Szemerédi type ⋮ Multiplicative patterns in syndetic sets ⋮ Regularity of certain Diophantine equations ⋮ The polynomial Carleson operator ⋮ A view on multiple recurrence ⋮ Juxtaposing combinatorial and ergodic properties of large sets of integers ⋮ Polynomial averages and pointwise ergodic theorems on nilpotent groups ⋮ Oscillation inequalities in ergodic theory and analysis: one-parameter and multi-parameter perspectives ⋮ Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions ⋮ Box-counting dimensions of popcorn subsets ⋮ On \(\sigma\)-nil ideals of bounded index of \(\sigma\)-nilpotence. ⋮ On the Ramsey-Turán numbers of graphs and hypergraphs ⋮ A short proof of the canonical polynomial van der Waerden theorem ⋮ Erdős and the integers ⋮ Extremal results in sparse pseudorandom graphs ⋮ Discrete quantum subgroup asymptotically fixing a sequence of finite subsets ⋮ Szemerédi's proof of Szemerédi's theorem ⋮ Colorings with only rainbow arithmetic progressions ⋮ Hyperfinite graphings and combinatorial optimization ⋮ A uniform set with fewer than expected arithmetic progressions of length 4 ⋮ Long regularly-spaced and convex sequences in dense sets of integers ⋮ A Skolem-Mahler-Lech theorem in positive characteristic and finite automata ⋮ Rational dynamical systems, \(S\)-units, and \(D\)-finite power series ⋮ Distributions of finite sequences represented by polynomials in Piatetski-Shapiro sequences ⋮ Solvability of linear equations within weak mixing sets ⋮ Geometric progression-free sequences with small gaps ⋮ Caps and progression-free sets in \(\mathbb{Z}_m^n\) ⋮ Counting sum-free sets in abelian groups ⋮ Multiple recurrence and nilsequences (with an appendix by Imre Ruzsa) ⋮ Universal sampling of band-limited signals ⋮ Recurrence and primitivity for IP systems with polynomial wildcards ⋮ FVIP systems and multiple recurrence ⋮ Arithmetic progressions in self-similar sets ⋮ A subexponential upper bound for van der Waerden numbers \(W(3,k)\) ⋮ Roth-type theorems in finite groups ⋮ On the number of monochromatic solutions of integer linear systems on abelian groups ⋮ Bivariate fluctuations for the number of arithmetic progressions in random sets ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ Optimal arithmetic structure in exponential Riesz sequences ⋮ Improved bound in Roth's theorem on arithmetic progressions ⋮ Multidimensional configurations in the primes with shifted prime steps ⋮ Star-critical Ramsey numbers for large generalized fans and books ⋮ A Prime Analogue of Roth’s Theorem in Function Fields ⋮ A density version of the Hales-Jewett theorem ⋮ Notions of size in a semigroup: an update from a historical perspective ⋮ On the interplay between additive and multiplicative largeness and its combinatorial applications ⋮ Hypergraphs without exponents ⋮ On pseudorandom subsets in finite fields. I: Measure of pseudorandomness and support of Boolean functions ⋮ Approximate arithmetic structure in large sets of integers ⋮ Iterated combinatorial density theorems ⋮ The Brown-Erdős-Sós conjecture in finite abelian groups ⋮ Multidimensional multiplicative combinatorial properties of dynamical syndetic sets ⋮ On sets of integers with the Schur property ⋮ On the structure of a random sum-free set ⋮ Algebraic characterizations of some relative notions of size ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Polynomial Szemerédi theorems for countable modules over integral domains and finite fields ⋮ On a question of Erdős and Moser ⋮ Book Review: Inevitable randomness in discrete mathematics ⋮ A tight bound for hypergraph regularity ⋮ A polynomial bound in Freiman's theorem. ⋮ On arithmetic structures in dense sets of integers ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ Counting independent sets in graphs ⋮ Strictly ergodic distal models and a new approach to the Host-Kra factors ⋮ A relative Szemerédi theorem ⋮ On arithmetic progressions in model sets ⋮ Fourier dimension and avoidance of linear patterns
This page was built for publication: On sets of integers containing k elements in arithmetic progression
