A problem of arrangements
From MaRDI portal
Publication:2647596
DOI10.1215/S0012-7094-47-01423-3zbMath0030.16701WikidataQ56169636 ScholiaQ56169636MaRDI QIDQ2647596
Theodore S. Motzkin, Aryeh Dvoretzky
Publication date: 1947
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Related Items
Combinatorics of the zeta map on rational Dyck paths ⋮ Talmudic lattice path counting ⋮ Some permutations on Dyck words ⋮ Walks confined in a quadrant are not always D-finite ⋮ Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max ⋮ Some exact distributions of the number of one-sided deviations and the time of the last such deviation in the simple random walk ⋮ Three Fuss-Catalan posets in interaction and their associative algebras ⋮ Chains of maximum length in the Tamari lattice ⋮ Raney numbers, threshold sequences and Motzkin-like paths ⋮ The origins of combinatorics on words ⋮ Bijections between \(t\)-core partitions and \(t\)-tuples ⋮ On doubly symmetric Dyck words ⋮ The Corners of Core Partitions ⋮ Combinatorics of diagonally convex directed polyominoes ⋮ Generalizations of the ballot problem ⋮ Path Counting for Grid-Based Navigation ⋮ Lexicographic generation of ordered trees ⋮ The Ballot Problem Revisited ⋮ Rational associahedra and noncrossing partitions ⋮ Enumeration of connected Catalan objects by type ⋮ Interlaced rectangular parking functions ⋮ On testing pseudorandom generators via statistical tests based on the arcsine law ⋮ Down-step statistics in generalized Dyck paths ⋮ Scaling limits of slim and fat trees ⋮ Lattice path moments by cut and paste ⋮ Enumerations of ordered trees ⋮ On directed lattice paths with vertical steps ⋮ A branching process with coalescence to model random phylogenetic networks ⋮ Trees, parking functions, and standard monomials of skeleton ideals ⋮ Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma ⋮ Full spark frames in the orbit of a representation ⋮ Cliff operads: a hierarchy of operads on words ⋮ Three interacting families of Fuss-Catalan posets ⋮ Direct consequences of the basic ballot theorem ⋮ A note on maxima in random walks ⋮ Poisson-Dirichlet branching random walks ⋮ COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS ⋮ The representation of the symmetric group on \(m\)-Tamari intervals ⋮ Algorithms for counting minimum-perimeter lattice animals ⋮ The non-commutative cycle lemma ⋮ Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope ⋮ The balloon popping problem revisited: lower and upper bounds ⋮ A new combinatorial representation of the additive coalescent ⋮ A multi-computational exploration of some games of pure chance ⋮ Lagrange inversion and Schur functions ⋮ Lagrange inversion ⋮ Generalized Dyck tilings ⋮ Sizes of simultaneous core partitions ⋮ A linear-time algorithm for the generation of trees ⋮ Bounded affine permutations I. Pattern avoidance and enumeration ⋮ Asymptotics of trees with a prescribed degree sequence and applications ⋮ Infinite excursions of router walks on regular trees ⋮ Bijections for a class of labeled plane trees ⋮ A symmetric variation of a distribution of Kreweras and Poupard ⋮ Unnamed Item ⋮ A history and a survey of lattice path enumeration ⋮ Unnamed Item ⋮ Non-uniform random generation of generalized Motzkin paths ⋮ Schröder's paths and random hierarchies ⋮ Patterns in trees ⋮ On the analysis of algorithms for trees ⋮ Walks on the slit plane: Other approaches ⋮ Bijective recurrences for Motzkin paths ⋮ Bijections between generalized Catalan families of types \(A\) and \(C\) ⋮ Homomesy in products of two chains ⋮ Multi-cores, posets, and lattice paths ⋮ On the sweep map for fuss rational Dyck paths ⋮ The cycle lemma and some applications ⋮ A cyclic approach on classical ruin model ⋮ Partitions of \(\mathbb Z_n\) into arithmetic progressions ⋮ The number of lattice paths below a cyclically shifting boundary ⋮ Minimal factorizations of permutations into star transpositions ⋮ Infinite Sperner's theorem ⋮ Moments, Narayana numbers, and the cut and paste for lattice paths ⋮ Difference Equations and Generating Functions for some Lattice Path Problems ⋮ Convergence of discrete snakes ⋮ Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs ⋮ A new method for solving a class of ballot problems ⋮ On computation of Baker and Norine's rank on complete graphs ⋮ Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers ⋮ Rational parking functions and Catalan numbers
