32 search results - page 1 / 7 » On permutations with bounded drop size |
EJC
2010
13 years 4 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...
CCCG
2001
13 years 6 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...
TIT
2010
12 years 11 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...
COMBINATORICS
2006
13 years 4 months 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...
SPAA
1993
ACM
13 years 8 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...