Reconstructing compositions
| dc.creator | Vatter, Vincent | |
| dc.date | 2006-10-16 | |
| dc.date.accessioned | 2026-07-07T07:29:06Z | |
| dc.date.available | 2026-07-07T07:29:06Z | |
| dc.description | We consider the problem of reconstructing compositions of an integer from their subcompositions, which was raised by Raykova (albeit disguised as a question about layered permutations). We show that every composition w of n\ge 3k+1 can be reconstructed from its set of k-deletions, i.e., the set of all compositions of n-k contained in w. As there are compositions of 3k with the same set of k-deletions, this result is best possible. | |
| dc.identifier | https://arxiv.org/abs/math/0610477 | |
| dc.identifier | http://arxiv.org/abs/math/0610477 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/117977 | |
| dc.subject | Combinatorics | |
| dc.title | Reconstructing compositions | |
| dc.type | text |