scientific article; zbMATH DE number 3523693
From MaRDI portal
Publication:4101924
zbMath0335.10054MaRDI QIDQ4101924
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Regularity lemmas for hypergraphs and quasi-randomness, Extremal problems on set systems, An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\), Regularity Lemma for k-uniform hypergraphs, Algebraic conditions for additive functions over the reals and over finite fields, Sub-Ramsey numbers for arithmetic progressions, A variant of the hypergraph removal lemma, A Hardy field extension of Szemerédi's theorem, Remarks on a Ramsey theory for trees, Combinatorial theorems in sparse random sets, On infinite sum-free sets of natural numbers, On sums and products of combinatorial cubes, Subspaces and orthogonal decompositions generated by bounded orthogonal systems, Bounds for graph regularity and removal lemmas, Turán‐ and Ramsey‐type results for unavoidable subgraphs, Arithmetic progressions in multiplicative groups of finite fields, On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\), Nearly equal distances in metric spaces, Multiple recurrence and convergence results associated to \(\mathbb F_P^\omega\)-actions, Multidimensional multiplicative large sets in totally minimal systems, Sumsets contained in infinite sets of integers, Multiple recurrence and convergence for Hardy sequences of polynomial growth, Turán‐type problems for long cycles in random and pseudo‐random graphs, Noise correlation bounds for uniform low degree functions, Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective, NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR, On Regularity Lemmas and their Algorithmic Applications, Posterior contraction rates for stochastic block models, Random differences in Szemerédi's theorem and related results, A weighted regularity lemma with applications, Stability results for random discrete structures, The Gaussian primes contain arbitrarily shaped constellations, An improved construction of progression-free sets, A removal lemma for systems of linear equations over finite fields, On Assouad dimension and arithmetic progressions in sets defined by digit restrictions, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, Counting subgraphs in quasi‐random 4‐uniform hypergraphs, On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions, Green’s Conjecture and Testing Linear Invariant Properties, Ramsey properties of random discrete structures, Regularity properties for triple systems, A note on multiparty communication complexity and the Hales-Jewett theorem, Arithmetic progressions, different regularity lemmas and removal lemmas, Monochromatic sums and products, The quasi-randomness of hypergraph cut properties, A Large Gap in a Dilate of a Set, Small gaps between prime numbers: The work of Goldston-Pintz-Yildirim, The poset of hypergraph quasirandomness, A multi-dimensional Szemerédi theorem for the primes via a correspondence principle, ON POINTS WITH POSITIVE DENSITY OF THE DIGIT SEQUENCE IN INFINITE ITERATED FUNCTION SYSTEMS
