A problem of arrangements

Cited In (84)

Path Counting for Grid-Based Navigation
Limit theorem for the moment of maximum of a random walk reaching a fixed level in the region of moderate deviations
The corners of core partitions
A multi-computational exploration of some games of pure chance
Three Fuss-Catalan posets in interaction and their associative algebras
Sizes of simultaneous core partitions
Trees, parking functions, and standard monomials of skeleton ideals
Down-step statistics in generalized Dyck paths
Rowmotion on \(m\)-Tamari and biCambrian lattices
Three interacting families of Fuss-Catalan posets
Difference Equations and Generating Functions for some Lattice Path Problems
Raney numbers, threshold sequences and Motzkin-like paths
Nonleaf patterns in trees: protected nodes and fine numbers
On testing pseudorandom generators via statistical tests based on the arcsine law
Interlaced rectangular parking functions
Cliff operads: a hierarchy of operads on words
A group action on cyclic compositions and \(\gamma\)-positivity
Algorithms for counting minimum-perimeter lattice animals
A branching process with coalescence to model random phylogenetic networks
A symmetric variation of a distribution of Kreweras and Poupard
Scaling limits of slim and fat trees
On computation of Baker and Norine's rank on complete graphs
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
A cyclic approach on classical ruin model
Rational parking functions and Catalan numbers
COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS
Rational associahedra and noncrossing partitions
Lattice path moments by cut and paste
A new combinatorial representation of the additive coalescent
Bijections for a class of labeled plane trees
Combinatorics of the zeta map on rational Dyck paths
Chains of maximum length in the Tamari lattice.
Bijective recurrences for Motzkin paths
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
Bijections between generalized Catalan families of types \(A\) and \(C\)
Walks on the slit plane: Other approaches
Full spark frames in the orbit of a representation
Enumerations of ordered trees
Convergence of discrete snakes
Asymptotics of trees with a prescribed degree sequence and applications
A linear-time algorithm for the generation of trees
Infinite Sperner's theorem
Multi-cores, posets, and lattice paths
Lagrange inversion and Schur functions
A history and a survey of lattice path enumeration
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
Schröder's paths and random hierarchies
Non-uniform random generation of generalized Motzkin paths
Lexicographic generation of ordered trees
The origins of combinatorics on words
The cycle lemma and some applications
Homomesy in products of two chains
Walks confined in a quadrant are not always D-finite
Partitions of \(\mathbb Z_n\) into arithmetic progressions
On directed lattice paths with vertical steps
Title not available (Why is that?)
On the sweep map for fuss rational Dyck paths
The number of lattice paths below a cyclically shifting boundary
A note on maxima in random walks
Talmudic lattice path counting
Poisson-Dirichlet branching random walks
The balloon popping problem revisited: lower and upper bounds
Patterns in trees
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
Combinatorics of diagonally convex directed polyominoes
Bijections between \(t\)-core partitions and \(t\)-tuples
Bounded affine permutations. I: Pattern avoidance and enumeration
Lagrange inversion
The representation of the symmetric group on \(m\)-Tamari intervals
Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma
A new method for solving a class of ballot problems
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)