MENU

You are here

A lemma and a conjecture on the cost of rearrangements

TitleA lemma and a conjecture on the cost of rearrangements
Publication TypeJournal Article
Year of Publication2003
AuthorsBressan, A
JournalRend. Sem. Mat. Univ. Padova 110 (2003) 97-102
Abstract

Consider a stack of books, containing both white and black books. Suppose that we want to sort them out, putting the white books on the right, and the black books on the left (fig.~1). This will be done by a finite sequence of elementary transpositions. In other words, if we have a stack of all black books of length $a$ followed by a stack of all white books of length $b$, we are allowed to reverse their order at the cost of $a+b$. We are interested in a lower bound on the total cost of the rearrangement.

URLhttp://hdl.handle.net/1963/2914

Sign in