arXiv · math/0302228
A Lemma and a Conjecture on the Cost of Rearrangements
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alberto Bressan. 2003-02-19. A Lemma and a Conjecture on the Cost of Rearrangements. https://arxiv.org/abs/math/0302228
Cite the original work for its findings. Save a collection to share your selection of sources.