Determinantal equations conjecture for hidden Markov model varieties
Let be the alphabet, let denote the parameterization of the relevant hidden Markov model, and let be a string function. For words with , form the matrix whose -entry is . Determinantal equations conjecture. Let . Then
if and only if
for all choices of words such that . This gives determinantal equations for the Zariski closure of the hidden Markov model parameterization, addressing the problem of describing that variety by its invariants.
References
- Alexander Schoenhuth, “Equations for hidden Markov models”, arXiv:0901.3749 (2009).
Progress summary
The conjecture remains unresolved: the original 2009 paper states it, but no later proof, counterexample, or verification was found.
The determinantal-equations conjecture, stated as Conjecture 3.5 in a 2009 paper, proposes that for the vanishing of all specified determinants exactly characterizes the Zariski closure of the hidden Markov model parameterization. The source presents this as a conjecture, not a theorem.
Current status (as of August 2026): The conjecture is unresolved; no publicly retrieved source establishes a proof, counterexample, or subsequent resolution.
Sources
Solutions 0
No solutions have been posted yet.