Reconstructing Permutations from Cycle Minors
The ith cycle minor of a permutation p of the set {1,2,…,n} is the permutation formed by deleting an entry i from the decomposition of p into disjoint cycles and reducing each remaining entry larger than i by 1. In this paper, we show that any permutation of {1,2,…,n} can be reconstructed from its s...
Main Author: | Monks, Maria |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | en_US |
Published: |
Electronic Journal of Combinatorics
2014
|
Online Access: | http://hdl.handle.net/1721.1/89803 |
Similar Items
-
Coding for locality in reconstructing permutations
by: Raviv, Netanel, et al.
Published: (2018) -
Coding for locality in reconstructing permutations
by: Raviv, Netanel, et al.
Published: (2018) -
Two enumerative results on cycles of permutations
by: Stanley, Richard P.
Published: (2015) -
Permutations statistics of indexed and poset permutations
by: Steingrímsson, Einar
Published: (2007) -
Counting and generating permutations in regular classes of permutations
by: Basset, N
Published: (2014)