%0 Journal Article
%J Rend. Sem. Mat. Univ. Padova 110 (2003) 97-102
%D 2003
%T A lemma and a conjecture on the cost of rearrangements
%A Alberto Bressan
%X 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.
%B Rend. Sem. Mat. Univ. Padova 110 (2003) 97-102
%I Università di Padova
%G en_US
%U http://hdl.handle.net/1963/2914
%1 1786
%2 Mathematics
%3 Functional Analysis and Applications
%$ Submitted by Andrea Wehrenfennig (andreaw@sissa.it) on 2008-09-11T13:23:07Z\\nNo. of bitstreams: 1\\nmath.AP0302228.pdf: 114252 bytes, checksum: 85213b6876996792213f6032c6fe2035 (MD5)