The following pages link to (Q3903764):
Displaying 50 items.
- Infinite orders and non-\(D\)-finite property of 3-dimensional lattice walks (Q311562) (← links)
- Identities on extended Catalan numbers and their \(q\)-analogs (Q343782) (← links)
- On the enumeration of non-crossing pairings of well-balanced binary strings (Q360364) (← links)
- Non-D-finite excursions in the quarter plane (Q392804) (← links)
- Covering a chessboard with staircase walks (Q393918) (← links)
- Rational associahedra and noncrossing partitions (Q396899) (← links)
- Facets of the generalized cluster complex and regions in the extended Catalan arrangement of type \(A\) (Q396916) (← links)
- Counting paths in corridors using circular Pascal arrays (Q400362) (← links)
- Hiking a generalized Dyck path: a tractable way of calculating multimode boson evolution operators (Q525642) (← links)
- Enumeration of connected Catalan objects by type (Q616392) (← links)
- Polynomial structures in rank statistics distributions (Q622430) (← links)
- Gröbner bases of ideals cogenerated by Pfaffians (Q626722) (← links)
- The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
- Enumeration of ad-nilpotent \({\mathfrak b}\)-ideals for simple Lie algebras (Q696818) (← links)
- A discrete-time algorithm for pricing double barrier options. (Q698352) (← links)
- Bijections between generalized Catalan families of types \(A\) and \(C\) (Q724856) (← links)
- On the number of numerical semigroups containing two coprime integers \(p\) and \(q\). (Q744867) (← links)
- The cycle lemma and some applications (Q751658) (← links)
- On the distribution in a graph process (Q795841) (← links)
- An information and preference theory approach to a discrete resource allocation problem (Q807607) (← links)
- Gambler's ruin and winning a series by \(m\) games (Q907092) (← links)
- Multivariate Fuss-Catalan numbers (Q942097) (← links)
- Size of downsets in the pushing order and a problem of Berlekamp (Q947102) (← links)
- Seven (lattice) paths to log-convexity (Q970521) (← links)
- Lattice path counting and the theory of queues (Q972819) (← links)
- A history and a survey of lattice path enumeration (Q972828) (← links)
- Determinants of (generalised) Catalan numbers (Q972830) (← links)
- On batch queueing systems: a combinatorial approach (Q972832) (← links)
- Staircase tilings and \(k\)-Catalan structures (Q998328) (← links)
- Lattice and Schröder paths with periodic boundaries (Q1011541) (← links)
- Veneziano amplitudes, spin chains and abelian reduction of QCD (Q1017428) (← links)
- The \(g\)-theorem matrices are totally nonnegative (Q1024373) (← links)
- A new method for solving a class of ballot problems (Q1066902) (← links)
- On a property of lattice paths (Q1073792) (← links)
- A lattice path lemma and an application in enzyme kinetics (Q1073795) (← links)
- Lattice path combinatorics and linear probing (Q1075065) (← links)
- On a generalization of polynomials in the ballot problem (Q1076022) (← links)
- On generalized four-parameter Charlier distribution (Q1081186) (← links)
- A probabilistic method for lattice path enumeration (Q1081604) (← links)
- Some applications of the classical formula on ruin probabilities (Q1081949) (← links)
- The enumeration of restricted random walks by Sheffer polynomials with applications to statistics (Q1089339) (← links)
- On a determinant sequence in the lattice path counting (Q1104663) (← links)
- q-counting \(n\)-dimensional lattice paths (Q1167728) (← links)
- Higher dimensional restricted lattice paths with diagonal steps (Q1175795) (← links)
- On the structure of the lattice of noncrossing partitions (Q1185097) (← links)
- Identities of Rothe-Abel-Schläfli-Hurwitz-type (Q1191959) (← links)
- Some more properties of Catalan numbers (Q1193445) (← links)
- Lattice path enumeration by formal schema (Q1197397) (← links)
- Random walks with absorbing points (Q1199465) (← links)
- Gröbner bases and multiplicity of determinantal and Pfaffian ideals (Q1206501) (← links)
