pith. sign in

arxiv: 2606.21286 · v1 · pith:NB3NKA5Cnew · submitted 2026-06-19 · 🧮 math.CO · math.AC

Occupation Ideals and Parikh Images in Markov Support Dynamics

Luis Pousa This is my paper

Pith reviewed 2026-06-26 14:08 UTC · model grok-4.3

classification 🧮 math.CO math.AC
keywords occupation patternsParikh imagesmonomial idealsMarkov support graphsregular languagessupport dynamicscombinatorial algebra
0
0 comments X

The pith

The minimal generators of a monomial ideal built from Parikh monomials of trajectories encode the distinct occupation patterns realized by a Markov chain at each time n.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs a monomial ideal for each time n whose generators come from the Parikh vectors of all possible state trajectories of length n in the support graph. It shows that the minimal generators of this ideal precisely correspond to the distinct occupation patterns that occur. This algebraic embedding separates the growth of reachable states, the number of trajectories, and the number of distinct occupation vectors. Readers might care because it offers a way to analyze the combinatorial structure of Markov chain supports using tools from commutative algebra rather than direct enumeration.

Core claim

Given an initial state, the support graph determines a regular language of admissible trajectories. Each trajectory maps to a monomial via the Parikh map recording occupation numbers. For each n, the monomial ideal generated by these monomials has minimal generators that encode the distinct occupation patterns at time n. The construction embeds occupation patterns into combinatorial commutative algebra and separates three levels of support complexity: reachability growth, trajectory growth, and occupation-pattern growth.

What carries the argument

The occupation ideal, defined as the monomial ideal generated by Parikh monomials of admissible trajectories of fixed length, whose minimal generators represent distinct occupation patterns.

If this is right

  • The framework attaches an algebraic layer to the directed support structure of a Markov chain.
  • It connects regular languages, Parikh images, monomial ideals, symbolic dynamics, and support graphs.
  • Occupation ideals reflect branching, recurrence, transience, and local oscillation in the underlying graph.
  • Three levels of support complexity can be distinguished algebraically.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This approach could enable the use of algebraic algorithms to compute growth rates of occupation patterns without enumerating all trajectories.
  • The separation of complexities might help classify Markov chains based on algebraic invariants of their support graphs.
  • The construction might extend to studying limits of these ideals as time goes to infinity.

Load-bearing premise

The minimal generators of the monomial ideal generated by the Parikh monomials of all admissible trajectories of length n encode the distinct occupation patterns realized at that time.

What would settle it

An example of a Markov support graph where two trajectories of length n have different occupation vectors but produce the same minimal generator set in the ideal, or where a distinct pattern is not captured by any minimal generator.

Figures

Figures reproduced from arXiv: 2606.21286 by Luis Pousa.

Figure 1
Figure 1. Figure 1: Support graph of the four-state irreducible chain. [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Support graph of a reducible chain. States [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Support graph of a finite birth–death chain on [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Occupation vectors of length-two trajectories over three states lie in the discrete simplex [PITH_FULL_IMAGE:figures/full_fig_p013_4.png] view at source ↗
read the original abstract

We introduce a commutative-algebraic framework for studying occupation patterns in directed support graphs associated with discrete-time Markov chains. Given an initial state, the support graph determines a regular language whose words are the admissible state trajectories. Applying the Parikh map, each trajectory is represented by its occupation vector, recording the number of visits to each state. Equivalently, each trajectory defines a monomial whose exponents are its occupation numbers. For each time $n$, we associate a monomial ideal generated by the Parikh monomials of all admissible trajectories of length $n$. The minimal generators of this ideal encode the distinct occupation patterns realized at that time. This construction embeds occupation patterns into combinatorial commutative algebra and separates three levels of support complexity: reachability growth, trajectory growth, and occupation-pattern growth. The framework provides an algebraic and combinatorial layer attached to the directed support structure of a Markov chain. It connects regular languages, Parikh images, monomial ideals, symbolic dynamics, and support graphs. Examples illustrate how occupation ideals reflect branching, recurrence, transience, and local oscillation in the underlying graph.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper introduces a commutative-algebraic framework for occupation patterns in directed support graphs of discrete-time Markov chains. Admissible trajectories of length n form a regular language; their Parikh images yield monomials whose exponents are occupation counts. For each n the authors form the monomial ideal generated by these Parikh monomials and assert that its minimal generators encode the distinct occupation patterns realized at time n. The construction is claimed to separate reachability growth, trajectory growth, and occupation-pattern growth while connecting regular languages, Parikh images, monomial ideals, and support graphs.

Significance. If the central encoding claim holds, the framework would supply an algebraic-combinatorial layer for analyzing support dynamics, with potential to distinguish different growth regimes in Markov chains via ideal-theoretic invariants. The manuscript ships no machine-checked proofs or reproducible code, but the construction itself is parameter-free once the support graph is given.

major comments (1)
  1. [Abstract] Abstract (and the corresponding definition in the main text): the claim that 'the minimal generators of this ideal encode the distinct occupation patterns realized at that time' is incorrect. Minimal generators of a monomial ideal are precisely the monomials whose exponent vectors are minimal under the componentwise partial order; any realized occupation vector w that is componentwise ≥ some other realized v (with at least one strict inequality) corresponds to a non-minimal generator. In graphs with self-loops or recurrent states, trajectories of fixed length n routinely produce strictly dominating count vectors (e.g., (k,0) and (k+1,0) for the same n). Consequently the minimal generators capture only the Pareto front of occupation patterns, not the full set of distinct realized patterns. This directly contradicts the stated encoding property and is load-bearing for the central claim.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for identifying an important inaccuracy in the central encoding claim. We address the comment below and will revise the manuscript to correct the statement while preserving the overall framework.

read point-by-point responses

  1. Referee: [Abstract] Abstract (and the corresponding definition in the main text): the claim that 'the minimal generators of this ideal encode the distinct occupation patterns realized at that time' is incorrect. Minimal generators of a monomial ideal are precisely the monomials whose exponent vectors are minimal under the componentwise partial order; any realized occupation vector w that is componentwise ≥ some other realized v (with at least one strict inequality) corresponds to a non-minimal generator. In graphs with self-loops or recurrent states, trajectories of fixed length n routinely produce strictly dominating count vectors (e.g., (k,0) and (k+1,0) for the same n). Consequently the minimal generators capture only the Pareto front of occupation patterns, not the full set of distinct realized patterns. This directly contradicts the stated encoding property and is load-bearing for the centra

    Authors: We agree with the referee that the stated claim is incorrect. The minimal generators of the monomial ideal are the minimal elements under the componentwise partial order on exponent vectors, so any occupation vector that dominates another realized vector will not appear among the minimal generators. This holds in the presence of self-loops or recurrent states, where multiple trajectories of length n can produce comparable count vectors. The full set of distinct realized occupation patterns is instead given by the complete collection of Parikh monomials before reduction to a minimal generating set. We will revise the abstract and the corresponding definition in the main text to state that the (not necessarily minimal) generators of the occupation ideal, or equivalently the set of all Parikh monomials of admissible trajectories of length n, encode the distinct occupation patterns. The minimal generators will be retained in the discussion as the Pareto front of minimal occupation vectors, which remains a combinatorially interesting subset. This clarification does not affect the separation of reachability, trajectory, and occupation-pattern growth rates, which continues to hold via the ideal membership and Hilbert function considerations in the revised framework. revision: yes

Circularity Check

0 steps flagged

No circularity; definitional construction with independent combinatorial content

full rationale

The paper defines an occupation ideal as the monomial ideal generated by Parikh monomials of length-n trajectories in the support graph, then states that its minimal generators encode realized occupation patterns. This is a direct definitional mapping from the language of admissible words to the ideal, not a reduction of one quantity to another by fitting or self-reference. No self-citation chains, ansatzes smuggled via prior work, or predictions that collapse to input data appear in the provided text. The separation into reachability, trajectory, and occupation-pattern growth is presented as a consequence of the construction rather than presupposed by it. The framework is self-contained against external benchmarks and does not rely on load-bearing self-citations.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Abstract-only review yields no fitted parameters. The central domain assumption is the regular-language property of the support graph. The occupation ideal is a newly introduced entity without independent evidence supplied.

axioms (1)
  • domain assumption The support graph determines a regular language whose words are the admissible state trajectories.
    Invoked at the start of the construction in the abstract.
invented entities (1)
  • Occupation ideal no independent evidence
    purpose: To encode distinct occupation patterns realized at each time via minimal generators of the Parikh monomial ideal.
    New object defined in the abstract with no external falsifiable handle provided.

pith-pipeline@v0.9.1-grok · 5712 in / 1122 out tokens · 24548 ms · 2026-06-26T14:08:38.991729+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

15 extracted references · 12 canonical work pages

  1. [1]

    A.V.Aho, J.E.Hopcroft, andJ.D.Ullman, TheDesignandAnalysisofComputerAlgorithms, Addison-Wesley, 1974

    1974

  2. [2]

    Bruns and J

    W. Bruns and J. Herzog,Cohen–Macaulay Rings, Cambridge University Press, 1998. doi:10.1017/CBO9780511608681

    work page doi:10.1017/cbo9780511608681 1998

  3. [3]

    Eilenberg and M

    S. Eilenberg and M. P. Schützenberger, Rational sets in commutative monoids,Journal of Algebra13(2) (1969), 173–191. doi:10.1016/0021-8693(69)90070-2

    work page doi:10.1016/0021-8693(69)90070-2 1969

  4. [4]

    Eilenberg,Automata, Languages, and Machines, Volume A, Academic Press, 1974

    S. Eilenberg,Automata, Languages, and Machines, Volume A, Academic Press, 1974

    1974

  5. [5]

    Esparza, P

    J. Esparza, P. Ganty, S. Kiefer, and M. Luttenberger, Parikh’s theorem: A simple and direct automaton construction,Information Processing Letters111(12) (2011), 614–619. doi:10.1016/j.ipl.2011.03.019

    work page doi:10.1016/j.ipl.2011.03.019 2011

  6. [6]

    Godsil and G

    C. Godsil and G. Royle,Algebraic Graph Theory, Springer, 2001. doi:10.1007/978-1-4613-0163- 9

    work page doi:10.1007/978-1-4613-0163- 2001

  7. [7]

    He and A

    J. He and A. Van Tuyl, Algebraic properties of the path ideal of a tree,Communications in Algebra38(5) (2010), 1725–1742. doi:10.1080/00927870902998166

    work page doi:10.1080/00927870902998166 2010

  8. [8]

    B. P. Kitchens,Symbolic Dynamics: One-Sided, Two-Sided and Countable State Markov Shifts, Springer, 1998. doi:10.1007/978-3-642-58822-8

    work page doi:10.1007/978-3-642-58822-8 1998

  9. [9]

    Kubitzke and A

    M. Kubitzke and A. Olteanu, Algebraic properties of classes of path ideals of posets,Journal of Pure and Applied Algebra218(6) (2014), 1012–1033. doi:10.1016/j.jpaa.2013.11.001

    work page doi:10.1016/j.jpaa.2013.11.001 2014

  10. [10]

    Cam- bridge University Press (1995).https://doi.org/10.1017/CBO9780511626302

    D. Lind and B. Marcus,An Introduction to Symbolic Dynamics and Coding, Cambridge Uni- versity Press, 1995. doi:10.1017/CBO9780511626302

    work page doi:10.1017/cbo9780511626302 1995

  11. [11]

    Miller and B

    E. Miller and B. Sturmfels,Combinatorial Commutative Algebra, Springer, 2005. doi:10.1007/b138602

    work page doi:10.1007/b138602 2005

  12. [12]

    J. R. Norris,Markov Chains, Cambridge University Press, 1997. doi:10.1017/CBO9780511810633

    work page doi:10.1017/cbo9780511810633 1997

  13. [13]

    R. J. Parikh, On context-free languages,Journal of the ACM13(4) (1966), 570–581. doi:10.1145/321356.321364

    work page doi:10.1145/321356.321364 1966

  14. [14]

    R. P. Stanley,Enumerative Combinatorics, Volume 1, Cambridge University Press, 1997. doi:10.1017/CBO9780511805967

    work page doi:10.1017/cbo9780511805967 1997

  15. [15]

    A. W. To, Parikh images of regular languages: Complexity and applications,International Journal of Foundations of Computer Science21(6) (2010), 835–848. 17

    2010