Reconstructing Permutations from Identification Minors
We consider the problem whether a permutation of a finite set is uniquely determined by its identification minors. While there exist non-reconstructible permutations of every set with two, three, or four elements, we show that every permutation of a finite set with at least five elements is reconstr...
Saved in:
| Published in | The Electronic journal of combinatorics Vol. 22; no. 4 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
30.10.2015
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | We consider the problem whether a permutation of a finite set is uniquely determined by its identification minors. While there exist non-reconstructible permutations of every set with two, three, or four elements, we show that every permutation of a finite set with at least five elements is reconstructible from its identification minors. Moreover, we provide an algorithm for recovering a permutation from its deck. We also discuss a generalization of this reconstruction problem, as well as the related set-reconstruction problem. |
|---|---|
| ISSN: | 1077-8926 1077-8926 |
| DOI: | 10.37236/5353 |