5387 search results - page 581 / 1078 » Generating generic functions |
187
click to vote
EJC
2010
15 years 7 months ago
2010
Abstract. Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas f...
126
Voted
COMBINATORICS
2006
15 years 7 months ago
2006
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compos...
173
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
156
click to vote
COMBINATORICS
2007
15 years 7 months ago
2007
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
153
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the b...