32 search results - page 1 / 7 » On permutations with bounded drop size |
108
Voted
EJC
2010
15 years 27 days 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...
97
Voted
CCCG
2001
15 years 2 months ago
2001
We study combinatorial bounds for geometric permutations of balls with bounded size disparity in d-space. Our main contribution is the following theorem: given a set S of n disjoi...
92
Voted
TIT
2010
14 years 7 months ago
2010
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
100
Voted
COMBINATORICS
2006
15 years 26 days ago
2006
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
162
Voted
SPAA
1993
ACM
15 years 4 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...