|
|
|
|
| LEADER |
01157 am a22001933u 4500 |
| 001 |
89803 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Monks, Maria
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Monks, Maria
|e contributor
|
| 245 |
0 |
0 |
|a Reconstructing Permutations from Cycle Minors
|
| 260 |
|
|
|b Electronic Journal of Combinatorics,
|c 2014-09-18T16:13:50Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/89803
|
| 520 |
|
|
|a 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 set of cycle minors if and only if n≥6. We then use this to provide an alternate proof of a known result on a related reconstruction problem.
|
| 520 |
|
|
|a National Science Foundation (U.S.) (Grant DMS-0447070-001)
|
| 520 |
|
|
|a United States. National Security Agency (Grant H98230-06-1-0013)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Electronic Journal of Combinatorics
|
