Reconstructing permutations from identification minors (Q888635)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reconstructing permutations from identification minors |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reconstructing permutations from identification minors |
scientific article |
Statements
Reconstructing permutations from identification minors (English)
0 references
2 November 2015
0 references
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.
0 references
reconstruction problem
0 references
permutation
0 references
identification minor
0 references
0 references
0 references
0 references
