On Certain Sets of Integers

From MaRDI portal
Publication:5817505

DOI10.1112/jlms/s1-28.1.104zbMath0050.04002OpenAlexW2108900323WikidataQ55966506 ScholiaQ55966506MaRDI QIDQ5817505

Klaus F. Roth

Publication date: 1953

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-28.1.104




Related Items (only showing first 100 items - show all)

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponentA Furstenberg-Zimmer structure theorem for \(\sigma\)-finite measure spacesTrilinear smoothing inequalities and a variant of the triangular Hilbert transformAdditive combinatorics and graph theoryFinite configurations in sparse setsA Szemerédi-type theorem for subsets of the unit cubeA Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)Intersection of arcs and normal rational curves in spaces of even characteristicOn subsets of abelian groups with no 3-term arithmetic progressionSubset sumsOn a conjecture of AlonGowers norms and pseudorandom measures of subsetsOn subsets of finite Abelian groups with no 3-term arithmetic progressionsThe equidistant dimension of graphsOn the classification of Stanley sequencesShort proofs of some extremal results. II.Normal limiting distributions for systems of linear equations in random setsCombinatorial theorems in sparse random setsOn certain other sets of integersA note on sparse supersaturation and extremal results for linear homogeneous systemsOn solution-free sets of integersImproved bounds for progression-free sets in \(C_8^n\)Linear equations and sets of integersBounds for graph regularity and removal lemmasA probabilistic technique for finding almost-periods of convolutionsA generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. IIUnique sequences containing no \(k\)-term arithmetic progressionsOn the stability of the Erdős-Ko-Rado theoremA generalization of Roth's theorem in function fieldsInjective colorings with arithmetic constraintsThe polynomial Carleson operatorOn the Duffin-Schaeffer conjectureNovel structures in Stanley sequencesLong arithmetic progressions in \(A+A+A\) with \(A\) a prime subsetNoise correlation bounds for uniform low degree functionsOn arithmetic progressions in symmetric sets in finite field modelA quantitative version of the non-Abelian idempotent theoremMaximal sets with no solution to \(x+y=3z\)A new proof of the density Hales-Jewett theoremRestriction theory of the Selberg sieve, with applicationsThreshold functions and Poisson convergence for systems of equations in random setsA new proof of the graph removal lemmaOn Roth's theorem on progressionsProgression-free sets in finite abelian groups.Erdős and the integersAnalytic number theory. Abstracts from the workshop held November 3--9, 2019Density and Ramsey type results on algebraic equations with restricted solution setsOn anti-powers in aperiodic recurrent wordsFinding large 3-free sets. I. The small \(n\) caseA counterexample to sparse removalChessboard domination problemsHigher-order Fourier analysis of \(\mathbb F_p^n\) and the complexity of systems of linear formsArithmetic progressions in Salem-type subsets of the integersThe number of monochromatic Schur triplesOn the subsets product in finite groupsOn the KŁR conjecture in random graphsMeasurable events indexed by products of treesRoth's theorem on progressions revisitedThe NOF multiparty communication complexity of composed functionsThe junta method for hypergraphs and the Erdős-Chvátal simplex conjectureCongruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equationsDifference sets and shifted primesEnumerating solution-free sets in the integersProgression-free sets in \(\mathbb{Z}_4^n\) are exponentially smallOn generalized Stanley sequencesOn the complexity of finding and counting solution-free sets of integersBipartite Ramsey numbers for graphs of small bandwidthAn improved construction of progression-free setsExploiting word-level parallelism for fast convolutions and their applications in approximate string matchingCaps and progression-free sets in \(\mathbb{Z}_m^n\)Behrend's theorem for sequences containing no k-element arithmetic progression of a certain typeOn subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressionsRoth's theorem in many variablesRandom sum-free subsets of abelian groupsArithmetic progressions in self-similar setsMore distinct distances under local conditionsA subexponential upper bound for van der Waerden numbers \(W(3,k)\)Rado's criterion over squares and higher powersImproved bound in Roth's theorem on arithmetic progressionsStar-critical Ramsey numbers for large generalized fans and booksOn differences and sums of integers. IA generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progressionSome remarks concerning irregularities of distribution of sequences of integers in arithmetic progressions. IIIOn non-optimally expanding sets in Grassmann graphsArithmetic progressions, different regularity lemmas and removal lemmasTriangle-free subgraphs of hypergraphsA combinatorial proof of the removal lemma for groupsArithmetic progressions in sets of fractional dimensionShape of the asymptotic maximum sum-free sets in integer lattice gridsA Roth-type theorem with mixed powersThe complexity of solution-free sets of integers for general linear equationsGreedy algorithm, arithmetic progressions, subset sums and divisibilityA polynomial bound in Freiman's theorem.On arithmetic structures in dense sets of integersTrigonometric series with gapsA new bound for the Brown-Erdős-Sós problemCounting independent sets in graphsOn the growth of Stanley sequencesOn the diagonal queens domination problemFourier dimension and avoidance of linear patterns




This page was built for publication: On Certain Sets of Integers