Reconstructing compositions

Details Reconstructing compositions Reconstructing compositions

2006-10-16

arxiv.org/abs/math/0610477v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Reconstructing compositions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reconstructing compositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reconstructing compositions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-244866