The integer-numerator conjecture for the stationary distribution of the finite k-chain
Statement
Let , let be the state space of the finite -chain, let be its stationary distribution, and set
For each , write for an integer. Integer-numerator conjecture. For every , we have
This conjectures that all stationary probabilities have the common denominator after clearing denominators, based on computations for .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.