Sciweavers

Share
34 search results - page 1 / 7
» On permutations with bounded drop size
Sort
View
EJC
2010
8 years 11 months ago
Descent polynomials for permutations with bounded drop size
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...
Fan R. K. Chung, Anders Claesson, Mark Dukes, Rona...
EJC
2016
3 years 7 months ago
On permutations with bounded drop size
The maximum drop size of a permutation π of [n] = {1, 2, . . . , n} is defined to be the maximum value of i − π(i). Chung, Claesson, Dukes and Graham found polynomials Pk(x) ...
Joanna N. Chen, William Y. C. Chen
CCCG
2001
9 years 24 days ago
Geometric permutations of balls with bounded size disparity
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...
Yunhong Zhou, Subhash Suri
TIT
2010
103views Education» more  TIT 2010»
8 years 6 months ago
Codes in permutations and error correction for rank modulation
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...
Alexander Barg, Arya Mazumdar
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
8 years 11 months ago
Permutation Reconstruction from Minors
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...
Mariana Raykova
books