ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be the real Hankel dimension of the cylinder probabilities of a stationary finite-alphabet process. If its Markov order is finite, then

ord⁡(μ)≤(n2).\operatorname{ord}(\mu)\le \binom n2.

For every n≥2n\ge2, there exists a stationary sofic process with a nonnegative rational presentation of minimal real dimension nn and exact Markov order

(n2).\binom n2.

Thus the bound is sharp when the alphabet is allowed to grow.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.