A problem of arrangements

Cited in

(84)

A symmetric variation of a distribution of Kreweras and Poupard
On computation of Baker and Norine's rank on complete graphs
A branching process with coalescence to model random phylogenetic networks
Some exact distributions of the number of one-sided deviations and the time of the last such deviation in the simple random walk
On the analysis of algorithms for trees
Scaling limits of slim and fat trees
Rational parking functions and Catalan numbers
A cyclic approach on classical ruin model
Path Counting for Grid-Based Navigation
Rational associahedra and noncrossing partitions
Lattice path moments by cut and paste
COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS
Bijections for a class of labeled plane trees
Limit theorem for the moment of maximum of a random walk reaching a fixed level in the region of moderate deviations
Combinatorics of the zeta map on rational Dyck paths
The corners of core partitions
A new combinatorial representation of the additive coalescent
Chains of maximum length in the Tamari lattice.
Bijective recurrences for Motzkin paths
A multi-computational exploration of some games of pure chance
Three Fuss-Catalan posets in interaction and their associative algebras
Counting lattice paths via a cycle lemma
Minimal factorizations of permutations into star transpositions
Some permutations on Dyck words
Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope
Enumeration of connected Catalan objects by type
Sizes of simultaneous core partitions
Bijections between generalized Catalan families of types \(A\) and \(C\)
Full spark frames in the orbit of a representation
Enumerations of ordered trees
Convergence of discrete snakes
Walks on the slit plane: Other approaches
Trees, parking functions, and standard monomials of skeleton ideals
A linear-time algorithm for the generation of trees
Down-step statistics in generalized Dyck paths
Asymptotics of trees with a prescribed degree sequence and applications
Multi-cores, posets, and lattice paths
Infinite Sperner's theorem
A history and a survey of lattice path enumeration
Lagrange inversion and Schur functions
The Ballot Problem Revisited
Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
Generalizations of the ballot problem
Rowmotion on \(m\)-Tamari and biCambrian lattices
Non-uniform random generation of generalized Motzkin paths
The origins of combinatorics on words
Lexicographic generation of ordered trees
Three interacting families of Fuss-Catalan posets
Schröder's paths and random hierarchies
The cycle lemma and some applications
Walks confined in a quadrant are not always D-finite
Homomesy in products of two chains
Partitions of Z_n into arithmetic progressions
On directed lattice paths with vertical steps
scientific article; zbMATH DE number 3919429 (Why is no real title available?)
The number of lattice paths below a cyclically shifting boundary
On the sweep map for fuss rational Dyck paths
Raney numbers, threshold sequences and Motzkin-like paths
A note on maxima in random walks
Difference Equations and Generating Functions for some Lattice Path Problems
Nonleaf patterns in trees: protected nodes and fine numbers
Talmudic lattice path counting
Poisson-Dirichlet branching random walks
The balloon popping problem revisited: lower and upper bounds
Patterns in trees
On testing pseudorandom generators via statistical tests based on the arcsine law
Interlaced rectangular parking functions
Cliff operads: a hierarchy of operads on words
Generalized Dyck tilings
On doubly symmetric Dyck words
Direct consequences of the basic ballot theorem
The non-commutative cycle lemma
Moments, Narayana numbers, and the cut and paste for lattice paths
A group action on cyclic compositions and \(\gamma\)-positivity
Combinatorics of diagonally convex directed polyominoes
Algorithms for counting minimum-perimeter lattice animals
Bijections between \(t\)-core partitions and \(t\)-tuples
Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma
The representation of the symmetric group on \(m\)-Tamari intervals
Bounded affine permutations. I: Pattern avoidance and enumeration
A new method for solving a class of ballot problems
Lagrange inversion
Optimal encodings for range top-\(k\), selection, and min-max
Infinite excursions of router walks on regular trees

This page was built for publication: A problem of arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2647596)