31 problems
Let be a sequence. A sequence is good for -step irrational equidistribution if it satisfies the corresponding irrational equidistribution…
Restricted density polynomial Hales–Jewett conjecture. There exists such that, for every satisfying
VIP-system recurrence conjecture. The VIP-system is good for nice recurrence.
Let be a group. A set is a set of measurable recurrence if, for every measure-preserving -system and every with…
Brown–Graham–Landman conjecture. If is not a set of -nilBohr recurrence for some , then is not -large.
Katznelson's conjecture. There is a set which is a set of Bohr recurrence but not a set of topological recurrence.
Glasner–Huang–Shao–Weiss–Ye conjecture. The set has nonempty intersection with every infinite arithmetic progression of step size .
Let be a virtually- group and let be a nontrivial finite group. Let be the critical parameter such that the -stationary random walk on…
Unbounded-jump random-walk conjecture. In this setup, the local version of the limit law for is also true, and the random walk defined above is recurrent.
Let and be minimal systems on the same compact space . Mixed linear-quadratic nonrecurrence conjecture. There are minimal systems and such that f…
A topological dynamical system is a pair consisting of a compact space and a continuous map ; it is minimal if every orbit is dense. For two transformations…
Let be a finite abelian group of order , let denote its endomorphism ring, and let . For , write…
For , let be a proper Bohr-Hamming Ball, with and . Define … A set is -recurrent…
Popular-difference density conjecture. The displayed lower bound holds for every pair of matrices satisfying the stated full-rank condition. The conjecture is a finitary form of th…
Katznelson's finite-field conjecture. Every subset of which is a set of Bohr recurrence is a set of chromatic recurrence.
Special Katznelson conjecture. If is a set of Bohr recurrence in , then is a set of chromatic recurrence.
Katznelson's conjecture. If is a set of Bohr recurrence, then is a set of chromatic recurrence.
Let be a set of chromatic recurrence, let , let , and let denote the set defined ea…
Let be a set of density recurrence, meaning that for every subset of a suitable positive upper density, . Hereditary recurrenc…
Let be the left eigenvector associated with the dual Markov chains, and let be the parameter used to construct them. The chains are called t…
Exponential-mixing conjecture. If is exponentially mixing, then the conclusion of Proposition (a) holds for all non-periodic points .
-rotor recurrence conjecture. For almost every such , the corresponding -rotor walk on visits every vertex infinitely many times almost surely.
Let be a triangulation, let be a tangent vector on , and let denote the corresponding graph of discrete tangent vectors. Suppose that is recurrent and that t…
Let be a set of recurrence. A Borel probability measure on is continuous if for every , an…
Let be a one-dimensional random-walk increment with zero mean, and let denote the centre of mass at time . Recurrence conjecture. Suppose . If … then is rec…