A problem of arrangements

Cited in

(92)

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

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)