93 problems
Let a switch Markov chain be the chain on realizations of a degree sequence that performs a switch, for an unconstrained, bipartite, or directed degree sequence. A degree sequence…
The universal-enveloping-algebra expression conjecture. For every ,
Let , and let be the birth Mallows process. If are its jump times, its jumping process is…
Let denote the limit shape of the random-core growth process for fixed . Let be the piecewise-linear curve with vertices … where is the scaling con…
Symmetry of complements. For all , . The conjecture is supported in the paper by computations for .
Negative partial-sum conjecture. If there are pairwise different indices such that
For every finite graph with maximum degree and every integer , the lazy Glauber dynamics on the set of proper -colorings of has mixing tim…
Let , let and be partitions of , and let be arbitrary nonnegative edge rates. For the Specht-module representations…
Determine the sharp quantitative local-to-global spectral bound for down-up walks on the faces of a pure simplicial complex, assuming sufficiently strong spectral expansion of the…
For the continuous-time chain on with generator defined by … where boundary terms are omitted and denotes addition modulo , determine the corresponding…
For every , there exists a constant such that, for every and every increasing set in satis…
For each , let be the set of unrooted binary trees with leaves labelled by . Consider the Markov chain that, at each step, removes a uniform…
Bounded-complexity rapid-mixing conjecture. The Markov chain is rapidly mixing for every .
Polynomial mixing-time conjecture. For any graph , the Glauber dynamics on the -colourings of for has polynomial mixing time.
Let particles evolve according to the Attracting Random Walks (ARW) model on an arbitrary graph, with interaction parameter . The mixing time is measured with respect…
Let be a stationary reversible Markov chain with transition operator , invariant distribution , and let…
Let be an indecomposable, doubly stochastic matrix indexed by an alphabet of size , satisfying … where . A word of length is generated by the Markov chain wi…
Contingency-table norm conjecture. For arbitrary table dimensions and , table sum , and row and column sums and , this multi-decomposition is non-degenera…
Exact spectral-gap conjecture. The inequality relating the -urn and two-urn gaps is an equality:
Let be a Hurwitz-stable distribution supported on one parity class. Consider the two-step parity flip--repair graph and its walk on each connected component: the walk flips a…
Let and let be a regular parameter vector. A label is neutral if for every . Let … be the number of neutral labels, and let…
Fill's characterization conjecture. The following are equivalent:
Connectivity conjecture. For every , the set of reduced bumpless pipe dreams of size is connected under the flips that preserve reducedness.
Skewed sampling conjecture. There should be a polynomial-time algorithm that approximately samples uniformly from the set of -colorings of whenever
Fix , and consider the Burnside chain on for varying . Let be any nonzero eigenvalue of this chain. The binomial multiplicity conjecture. There exist…