The following pages link to A problem of arrangements (Q2647596):
Displaying 50 items.
- On computation of Baker and Norine's rank on complete graphs (Q252840) (← links)
- Rational parking functions and Catalan numbers (Q259714) (← links)
- Combinatorics of the zeta map on rational Dyck paths (Q272321) (← links)
- Some permutations on Dyck words (Q287437) (← links)
- Rational associahedra and noncrossing partitions (Q396899) (← links)
- Generalized Dyck tilings (Q499498) (← links)
- Infinite excursions of router walks on regular trees (Q528998) (← links)
- Enumeration of connected Catalan objects by type (Q616392) (← links)
- Direct consequences of the basic ballot theorem (Q634565) (← links)
- The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
- A linear-time algorithm for the generation of trees (Q675311) (← links)
- Bijections between generalized Catalan families of types \(A\) and \(C\) (Q724856) (← links)
- Multi-cores, posets, and lattice paths (Q745066) (← links)
- The cycle lemma and some applications (Q751658) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- On directed lattice paths with vertical steps (Q897305) (← links)
- Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma (Q900982) (← links)
- A note on maxima in random walks (Q907270) (← links)
- Bijections for a class of labeled plane trees (Q966126) (← links)
- A history and a survey of lattice path enumeration (Q972828) (← links)
- Partitions of \(\mathbb Z_n\) into arithmetic progressions (Q1024267) (← links)
- The number of lattice paths below a cyclically shifting boundary (Q1024357) (← links)
- Minimal factorizations of permutations into star transpositions (Q1024452) (← links)
- A new method for solving a class of ballot problems (Q1066902) (← links)
- Some exact distributions of the number of one-sided deviations and the time of the last such deviation in the simple random walk (Q1091669) (← links)
- Lexicographic generation of ordered trees (Q1133548) (← links)
- Enumerations of ordered trees (Q1144044) (← links)
- A symmetric variation of a distribution of Kreweras and Poupard (Q1209662) (← links)
- On the analysis of algorithms for trees (Q1238995) (← links)
- Talmudic lattice path counting (Q1336450) (← links)
- Lattice path moments by cut and paste (Q1398297) (← links)
- Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope (Q1421335) (← links)
- Walks confined in a quadrant are not always D-finite (Q1885016) (← links)
- Combinatorics of diagonally convex directed polyominoes (Q1924364) (← links)
- Poisson-Dirichlet branching random walks (Q1948689) (← links)
- The non-commutative cycle lemma (Q1957971) (← links)
- Lagrange inversion and Schur functions (Q1975184) (← links)
- Infinite Sperner's theorem (Q2068601) (← links)
- Raney numbers, threshold sequences and Motzkin-like paths (Q2166306) (← links)
- Bijections between \(t\)-core partitions and \(t\)-tuples (Q2174605) (← links)
- Interlaced rectangular parking functions (Q2186837) (← links)
- On testing pseudorandom generators via statistical tests based on the arcsine law (Q2186921) (← links)
- Full spark frames in the orbit of a representation (Q2197948) (← links)
- Three interacting families of Fuss-Catalan posets (Q2199814) (← links)
- A multi-computational exploration of some games of pure chance (Q2229699) (← links)
- Sizes of simultaneous core partitions (Q2237940) (← links)
- Patterns in trees (Q2277475) (← links)
- On the sweep map for fuss rational Dyck paths (Q2300586) (← links)
- A cyclic approach on classical ruin model (Q2306094) (← links)
- The representation of the symmetric group on \(m\)-Tamari intervals (Q2437563) (← links)
