Results 111 to 120 of about 225 (160)
Some enumerative properties of parking functions
A parking function is a sequence \((\pi_1,\dots, \pi_n)\) of positive integers such that if \(\lambda_1\leq\cdots\leq \lambda_n\) is the increasing rearrangement of \(\pi_1,\dots,\pi_n\), then \(\lambda_i\leq i\) for \(1\leq i\leq n\).
Stanley, Richard P., Yin, Mei
core +1 more source
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
SIAM J Discret Math, 2020 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Ordered Construction Of Combinatorial Objects
, 2007 . The generating function method for counting species of combinatorial objects is applied to the construction of the objects in order. The species considered are those described using context-free grammars with additional group-invariant operators.
Mitch Harris, Nachum Dershowitz
core
Permutations Which Are the Union of an Increasing and a Decreasing Subsequence
, 1998 It is shown that there are # 2n n # - # n-1 m=0 2 n-m-1 # 2m m # permutations which are the union of an increasing sequence and a decreasing sequence.
M. D. Atkinson
core
The Bricklayer Problem And The Strong Cycle Lemma
, 1998 this paper, we solve a counting problem about building stacks of such blocks, which we call bricks. We have a linear base of length m on which we can place bricks. The bricks sitting directly on the base can start at any integer position, as long as they
Douglas B. West, Hunter S. Snevily
core
Skeletal generalizations of chip-firing games, parking functions, and Dyck paths
For \(0\leq k\leq n-1\), we introduce a family of \(k\)-skeletal paths which are counted by the \(n\)th Catalan number for each \(k\), and specialize to Dyck paths when \(k=n-1\).
Backman, Spencer +5 more
core +1 more source
, 2004 We revisit the pills problem proposed by Knuth and McCarthy. In a bottle there are m large pills and n small pills. The large pill is equivalent to two small pills. Every day a person chooses a pill at random.
Prodinger, Helmut +1 more
core
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
, 1996 We give efficient algorithms for listing equivalence classes of k-ary strings under reversal and permutation of alphabet symbols. As representative of each equivalence class we choose that string which is lexicographically smallest.
Frank Ruskey +2 more
core
Combinatorial proofs of Ismail's identities on Al-Salam-Chirara polynomials. [PDF]
Arab J MathUncu AK.
europepmc +1 more source
Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees. [PDF]
Adv Appl Math, 2020 Himwich ZM, Rosenberg NA.
europepmc +1 more source