Nondeterministic walks generalize lattice paths by using set-valued steps whose reachable endpoint sets yield algebraic generating functions for bridges, excursions, and meanders on Dyck/Motzkin steps, with extensions and a conjecture for general steps backed by code packages.
Cambridge University Press
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
Positive linear catalytic equations have generating functions that form positive polynomial systems from context-free grammars and follow universal asymptotics.
citing papers explorer
-
Combinatorics of nondeterministic walks
Nondeterministic walks generalize lattice paths by using set-valued steps whose reachable endpoint sets yield algebraic generating functions for bridges, excursions, and meanders on Dyck/Motzkin steps, with extensions and a conjecture for general steps backed by code packages.
-
Combinatorics and Asymptotics of Positive Systems of Linear Catalytic Equations
Positive linear catalytic equations have generating functions that form positive polynomial systems from context-free grammars and follow universal asymptotics.