On difference sets of sequences of integers. I
From MaRDI portal
(Redirected from Publication:4168982)
Cites work
Cited in
(92)- On the density of sequences of integers the sum of no two of which is a square. II: General sequences
- On the maximal ergodic theorem for certain subsets of the integers
- On the density of sequences of integers the sum of no two of which is a square. I: Arithmetic progressions
- Van der Corput's difference theorem
- Three-term polynomial progressions in subsets of finite fields
- Ramsey properties of nonlinear Diophantine equations
- On arithmetic structures in dense sets of integers
- On random perturbation of some intersective sets.
- Uniform distribution of subpolynomial functions along primes and applications
- The Furstenberg-Sárközy theorem and asymptotic total ergodicity phenomena in modular rings
- Single and multiple recurrence along non-polynomial sequences
- On monochromatic solutions to x-y=z^2
- An improved lower bound related to the Furstenberg-Sárközy theorem
- On subsets of the hypercube with prescribed Hamming distances
- On a theorem of Sárközy for difference sets and shifted primes
- Intersections of shifted sets
- A Hardy field extension of Szemerédi's theorem
- The Furstenberg-Sárközy theorem for intersective polynomials in function fields
- Finite field models in arithmetic combinatorics -- ten years on
- Van der Corput's difference theorem: some modern developments
- Towards characterizing the 2-Ramsey equations of the form \(ax + by = p(z)\)
- Polynomial configurations in subsets of random and pseudo-random sets
- On a diagonal quadric in dense variables
- Poincaré recurrence and number theory: thirty years later
- MULTIDIMENSIONAL VAN DER CORPUT SETS AND SMALL FRACTIONAL PARTS OF POLYNOMIALS
- Arithmetic progressions with a pseudorandom step
- Binary quadratic forms in difference sets
- Faster evaluation of subtraction games
- Multivariate polynomial values in difference sets
- Structure along arithmetic patterns in sequences of vectors
- On difference sets of sequences of integers. III
- Sets in \(\mathbb{Z}_m\) whose difference sets avoid squares
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case
- Uniform distribution of prime powers and sets of recurrence and van der Corput sets in \(\mathbb{Z}^k\)
- IP-sets and polynomial recurrence
- Polynomials with roots modulo every integer
- Intersective polynomials arising from sums of powers
- Sets whose differences avoid squares modulo m
- Monochromatic solutions for multi-term unknowns
- Interpolation sets and nilsequences
- A new upper bound for sets with no square differences
- On polynomials with roots modulo almost all primes
- The Pintz-Steiger-Szemerédi estimate for intersective quadratic polynomials in function fields
- Minimally intersective polynomials with arbitrarily long factorization
- Some results on Poincaré sets
- Partition regularity and multiplicatively syndetic sets
- Bounds for sets with no polynomial progressions
- Random differences in Szemerédi's theorem and related results
- Popular progression differences in vector spaces II
- On uniform distribution of polynomials and good universality
- Problems and Results on Intersective Sets
- Dynamical systems and uniform distribution of sequences
- On two-point configurations in subsets of pseudo-random sets
- Multiple recurrence and convergence for sequences related to the prime numbers
- Further bounds in the polynomial Szemerédi theorem over finite fields
- Additive averages of multiplicative correlation sequences and applications
- A strong-type Furstenberg-Sárközy theorem for sets of positive measure
- Arithmetic progressions in certain subsets of finite fields
- Monochromatic quotients, products and polynomial sums in the rationals
- Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials
- Monochromatic integers adding to polynomials of prime variables
- Polynomials with factors of the form ( x q – a ) with roots modulo every integer
- Bounds in a popular multidimensional nonlinear Roth theorem
- Quantitative bounds in the nonlinear Roth theorem
- Storage codes and recoverable systems on lines and grids
- Bohr recurrence and density of non-lacunary semigroups of \(\mathbb{N}\)
- Arithmetic progressions at the journal of the LMS
- A quadratic Roth theorem for sets with large Hausdorff dimensions
- Quantitative concatenation for polynomial box norms
- Intersective sets over abelian groups
- Two-point patterns determined by curves
- On multiplicative recurrence along linear patterns
- Problems on infinite sumset configurations in the integers and beyond
- Equidistribution of polynomial sequences in function fields, with applications
- Polynomial Schur's theorem
- The Furstenberg-Sárközy theorem for polynomials in one or more prime variables
- Separating measurable recurrence from strong recurrence via rigidity sequences
- Intersective sets for sparse sets of integers
- Partition regularity of Pythagorean pairs
- A quantitative bound on Furstenberg-Sárközy patterns with shifted prime power common differences in primes
- A maximal extension of the Bloom-Maynard bound for sets without square differences
- Separating topological recurrence from measurable recurrence: exposition and extension of Kriz's example
- On the polynomial Szemerédi theorem in finite commutative rings
- Prime and polynomial distances in colourings of the plane
- The primes contain arbitrarily long polynomial progressions
- Difference sets without squares
- A Weyl-type equidistribution theorem in finite characteristic
- Variations on topological recurrence
- Intersective polynomials and the polynomial Szemerédi theorem
- Difference sets and shifted primes
- Intersective polynomials and the primes
This page was built for publication: On difference sets of sequences of integers. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168982)
