11 problems
Uniqueness conjecture for 2-full words. The 2-full words are unique up to symmetries of the plane and a local symmetry (a flip) on hook snak…
Two-cut conjecture. Every even binary word satisfies
Monotonicity conjecture. The number of pairs satisfying
Strong Wilf-equivalence conjecture. Two binary words and are strongly Wilf-equivalent if and only if they are trivially equivalent.
Logarithmic-length conjecture. For every integer , there exists a binary word such that
Let be a pair of positive integers with . An infinite binary word has pseudoperiod if each position is compatible with a repetition having periods an…
Assuming the growth-rate limit exists, define … for . Monotonicity and discontinuity conjecture. The function is increasing on an…
For each positive real number , let be the set of restricted binary words of length with parameter . Existence conjecture. For given…
Let denote the set of restricted binary words of length associated with the positive rational parameter . A 1-Gray code is an arrangement of all words in…
Let , and let be chosen uniformly from the binary words having an even number of ones. A typical-word shuffle-square conjecture. With high probability as…
Let be coprime integers. For a word , let be its base-2 orbit and define the partial products by … The relation…