pith. sign in

arxiv: 2605.22241 · v1 · pith:DBQBISUYnew · submitted 2026-05-21 · 🧮 math.CO

Combinatorics and Asymptotics of Positive Systems of Linear Catalytic Equations

Cyril Banderier , Michael Drmota This is my paper

Pith reviewed 2026-05-22 04:53 UTC · model grok-4.3

classification 🧮 math.CO
keywords catalytic equationsgenerating functionsasymptoticscontext-free grammarslattice pathscombinatorial enumerationpositive systems
0
0 comments X

The pith

Positive linear catalytic equations reduce to context-free grammar systems and follow universal asymptotics.

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

The paper analyzes positive linear systems of equations in one catalytic variable that arise in combinatorial counting problems such as lattice paths and stack-sortable permutations. It establishes that the generating functions for these systems satisfy a positive polynomial system of equations associated with a context-free grammar. This reduction then supports a proof of universal asymptotic behavior for the sequences counted by the original equations. A sympathetic reader would care because the result supplies a uniform combinatorial and analytic handle on a broad class of enumeration problems without needing case-by-case derivations.

Core claim

For positive linear systems in one catalytic variable the corresponding generating functions satisfy a positive polynomial system of equations associated to a context-free grammar, and these systems admit a universal asymptotic behaviour.

What carries the argument

Positive polynomial system of equations associated to a context-free grammar, obtained by algebraic manipulation of the linear catalytic equations.

If this is right

  • Lattice path enumeration problems receive a uniform combinatorial description via context-free grammars.
  • Stack-sortable permutation counts inherit the same universal asymptotic expansion.
  • Any combinatorial object whose generating function arises from a positive linear catalytic equation inherits the same algebraic and asymptotic structure.
  • The reduction supplies an explicit algebraic equation that can be solved for exact or asymptotic formulas.

Where Pith is reading between the lines

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

  • The same reduction technique may extend to mildly nonlinear catalytic systems that remain positive.
  • Universal asymptotics of this type often imply that the dominant singularity is algebraic and lies on the positive real axis.
  • The context-free grammar interpretation opens the possibility of bijective proofs between different catalytic models.

Load-bearing premise

The systems of equations must be positive and linear in exactly one catalytic variable.

What would settle it

Exhibit a concrete positive linear catalytic system whose generating function either fails to satisfy any positive polynomial system or whose coefficients violate the predicted universal asymptotic form.

read the original abstract

We provide a complete combinatorial and asymptotic analysis of positive linear systems of equations in one catalytic variable that appear in several combinatorial problems such as in lattice path counting or stack-sortable permutation counting. We show that the corresponding generating functions satisfy a positive polynomial system of equations (which is associated to a context-free grammar). Furthermore we prove a universal asymptotic behaviour.

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 / 2 minor

Summary. The paper provides a complete combinatorial and asymptotic analysis of positive linear systems of equations in one catalytic variable, as arising in lattice path counting and stack-sortable permutation enumeration. It shows that the generating functions satisfy an equivalent positive polynomial system associated to a context-free grammar, and derives a universal asymptotic behaviour from this representation using algebraic singularity analysis.

Significance. If the results hold, the work supplies a unified algebraic-combinatorial framework for a broad class of catalytic equations, reducing them to context-free grammar systems and yielding universal asymptotics without case-by-case analysis. This strengthens the link between positivity, grammar representations, and standard singularity-analysis techniques, offering a reusable tool for enumerative combinatorics.

major comments (1)
  1. [§3.2, Theorem 3.4] §3.2, Theorem 3.4: the reduction from the linear catalytic system to the polynomial system is presented as preserving positivity and combinatorial validity, but the argument does not explicitly address whether the elimination of the catalytic variable can introduce extraneous singularities inside the disk of convergence; a concrete radius comparison or example computation would confirm that the dominant singularity remains unchanged for the claimed universality.
minor comments (2)
  1. [Abstract] The abstract states 'universal asymptotic behaviour' without specifying the precise form (e.g., square-root singularity); adding a one-sentence statement of the asymptotic form would improve clarity.
  2. [§2] Notation for the catalytic variable x and the auxiliary variables should be fixed once in §2 and used consistently; occasional re-use of x for different roles creates minor ambiguity.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive evaluation of our manuscript and for the constructive comment, which we address below. We are happy to incorporate clarifications to strengthen the presentation of the reduction and its analytic consequences.

read point-by-point responses

  1. Referee: [§3.2, Theorem 3.4] §3.2, Theorem 3.4: the reduction from the linear catalytic system to the polynomial system is presented as preserving positivity and combinatorial validity, but the argument does not explicitly address whether the elimination of the catalytic variable can introduce extraneous singularities inside the disk of convergence; a concrete radius comparison or example computation would confirm that the dominant singularity remains unchanged for the claimed universality.

    Authors: We thank the referee for this observation. The proof of Theorem 3.4 proceeds by iteratively solving the linear catalytic equation for the auxiliary generating function and substituting into the remaining equations, yielding a positive polynomial system whose coefficients are manifestly non-negative because they arise directly from the original non-negative coefficients via combinatorial decomposition. By the theory of positive algebraic systems (as in the referenced works on context-free grammars), the resulting system admits a unique analytic solution branch in a disk whose radius is determined by the first positive real singularity. Because the substitution is a positive rational operation, it cannot introduce poles or branch points inside the original disk of convergence; any potential singularity would have to satisfy the original catalytic equation and thus lie on or beyond the dominant singularity. Nevertheless, to make this radius comparison fully explicit, we will add a short remark immediately after Theorem 3.4 that invokes the implicit-function theorem on the positive system and notes that the growth rate is preserved. We will also include a concrete numerical check for the stack-sortable permutation example (whose catalytic equation is given in the introduction), computing the dominant singularity of both the original linear system and the reduced polynomial system to confirm they coincide to machine precision. These additions will be marked as new text in the revised version. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation is self-contained via combinatorial construction and standard analysis

full rationale

The paper starts from positive linear catalytic equations arising in combinatorial problems (e.g., lattice paths) and constructs an equivalent positive polynomial system tied to a context-free grammar. Universal asymptotics then follow from algebraic singularity analysis applied to this system. Both steps rest on explicit combinatorial bijections and positivity to guarantee validity, together with classical results on generating functions; no step reduces a claimed prediction to a fitted parameter, a self-referential definition, or a load-bearing self-citation whose justification is internal to the present work. The argument is therefore independent of its own outputs and externally verifiable against the stated combinatorial class.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on standard assumptions in analytic combinatorics and generating functions for context-free grammars.

axioms (1)
  • domain assumption The equations are positive linear systems in one catalytic variable.
    This is the class of equations analyzed, appearing in lattice path and permutation counting.

pith-pipeline@v0.9.0 · 5572 in / 1113 out tokens · 63684 ms · 2026-05-22T04:53:48.782426+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Height of walks with resets, the Moran model, and the discrete Gumbel distribution.Sémin

    Rafik Aguech, Asma Althagafi, and Cyril Banderier. Height of walks with resets, the Moran model, and the discrete Gumbel distribution.Sémin. Lothar. Comb., 87B:37, 2023. Article #12

    work page 2023

  2. [2]

    Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata.Algorithmica, 82(3):386–428, 2020

    Andrei Asinowski, Axel Bacher, Cyril Banderier, and Bernhard Gittenberger. Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata.Algorithmica, 82(3):386–428, 2020

    work page 2020

  3. [3]

    From geometry to generating functions: rectangulations and permutations.Sémin

    Andrei Asinowski and Cyril Banderier. From geometry to generating functions: rectangulations and permutations.Sémin. Lothar. Comb., 91B, 2024. Article #46, 12 pp. Proceedings of FPSAC’24

    work page 2024

  4. [4]

    Generating functions for generating trees.Discrete Math., 246(1- 3):29–55, 2002

    Cyril Banderier, Mireille Bousquet-Mélou, Alain Denise, Philippe Flajolet, Danièle Gardy, and Dominique Gouyou-Beauchamps. Generating functions for generating trees.Discrete Math., 246(1- 3):29–55, 2002

    work page 2002

  5. [5]

    Formulae and asymptotics for coefficients of algebraic functions

    Cyril Banderier and Michael Drmota. Formulae and asymptotics for coefficients of algebraic functions. Comb. Probab. Comput., 24(1):1–53, 2015

    work page 2015

  6. [6]

    Basic analytic combinatorics of directed lattice paths.Theor

    Cyril Banderier and Philippe Flajolet. Basic analytic combinatorics of directed lattice paths.Theor. Comput. Sci., 281(1-2):37–80, 2002

    work page 2002

  7. [7]

    Enumeration and asymptotics for the area of lattice paths

    Cyril Banderier and Bernhard Gittenberger. Enumeration and asymptotics for the area of lattice paths. InFourth colloquium on mathematics and computer science IV. Nancy, France, September 18–22, 2006, pages 345–356. Discrete Mathematics & Theoretical Computer Science, 2006

    work page 2006

  8. [8]

    Latticepathology and symmetric functions (extended abstract)

    Cyril Banderier, Marie-Louise Lackner, and Michael Wallner. Latticepathology and symmetric functions (extended abstract). InProceedings of AofA 2020, June 15–19, 2020. LIPIcs, 2020. Id/No 2

    work page 2020

  9. [9]

    Polynomial equations with one catalytic variable, algebraic series and map enumeration.J

    Mireille Bousquet-Mélou and Arnaud Jehanne. Polynomial equations with one catalytic variable, algebraic series and map enumeration.J. Comb. Theory, Ser. B, 96(5):623–672, 2006

    work page 2006

  10. [10]

    Linear recurrences with constant coefficients: The multivariate case.Discrete Math., 225(1-3):51–75, 2000

    Mireille Bousquet-Mélou and Marko Petkovšek. Linear recurrences with constant coefficients: The multivariate case.Discrete Math., 225(1-3):51–75, 2000

    work page 2000

  11. [11]

    Brown and William T

    William G. Brown and William T. Tutte. On the enumeration of rooted non-separable planar maps. Can. J. Math., 16:572–577, 1964

    work page 1964

  12. [12]

    Universality for catalytic equations and fully parked trees

    Alice Contat and Nicolas Curien. Universality for catalytic equations and fully parked trees. Preprint, arXiv:2503.17348 [math.PR] (2025), 2025

    work page arXiv 2025

  13. [13]

    An Interplay Between Combinatorics and Probability

    Michael Drmota.Random Trees. An Interplay Between Combinatorics and Probability. Springer, 2009

    work page 2009

  14. [14]

    Universal asymptotic properties of positive functional equations with one catalytic variable.Matematica, 2(3):692–742, 2023

    Michael Drmota and Eva-Maria Hainzl. Universal asymptotic properties of positive functional equations with one catalytic variable.Matematica, 2(3):692–742, 2023

    work page 2023

  15. [15]

    Universal singular exponents in catalytic variable equations.J

    Michael Drmota, Marc Noy, and Guan-Ru Yu. Universal singular exponents in catalytic variable equations.J. Comb. Theory, Ser. A, 185:33, 2022. Id/No 105522

    work page 2022

  16. [16]

    From order one catalytic decompositions to context-free specifi- cations: the rewiring bijection.Sémin

    Enrica Duchi and Gilles Schaeffer. From order one catalytic decompositions to context-free specifi- cations: the rewiring bijection.Sémin. Lothar. Comb., 93B, 2025. Article #49, 12 pp. Proceedings of FPSAC’25

    work page 2025

  17. [17]

    On the enumeration and generation of generalized Dyck words.Discrete Mathe- matics, 225(1-3):121–135, 2000

    Philippe Duchon. On the enumeration and generation of generalized Dyck words.Discrete Mathe- matics, 225(1-3):121–135, 2000

    work page 2000

  18. [18]

    Cambridge University Press, 2009

    Philippe Flajolet and Robert Sedgewick.Analytic Combinatorics. Cambridge University Press, 2009

    work page 2009

  19. [19]

    Knuth.The Art of Computer Programming

    Donald E. Knuth.The Art of Computer Programming. Vol. 1: Fundamental Algorithms. Addison- Wesley, 3rd edition, 1997. 22 CYRIL BANDERIER AND MICHAEL DRMOTA

    work page 1997

  20. [20]

    Generalized Dyck languages.Ann

    Jacques Labelle. Generalized Dyck languages.Ann. Sci. Math. Qué., 17(1):53–64, 1993

    work page 1993

  21. [21]

    Jacques Labelle and Yeong N. Yeh. Generalized Dyck paths.Discrete Mathematics, 82(1):1–6, 1990

    work page 1990

  22. [22]

    Systems of discrete differential equations, constructive algebraicity of the solutions.Comb

    Hadrien Notarantonio and Sergey Yurkevich. Systems of discrete differential equations, constructive algebraicity of the solutions.Comb. Theory, 5(2):34, 2025. Id/No 1

    work page 2025

  23. [23]

    General Néron desingularization and approximation.Nagoya Math

    Dorin Popescu. General Néron desingularization and approximation.Nagoya Math. J., 104:85–115, 1986

    work page 1986

  24. [24]

    William T. Tutte. A census of planar maps.Can. J. Math., 15:249–271, 1963

    work page 1963

  25. [25]

    The umbral transfer-matrix method

    Doron Zeilberger. The umbral transfer-matrix method. I: Foundations.J. Comb. Theory, Ser. A, 91(1-2):451–463, 2000. URL:https://lipn.fr/~banderier CNRS/Université Sorbonne Paris-Nord, Villetaneuse, France. URL:https://www.dmg.tuwien.ac.at/drmota/ Institut für Diskrete Mathematik und Geometrie, TU Wien, Wien, Austria

    work page 2000