Berge Sorting

Details Berge Sorting Berge Sorting

2005-12-27

arxiv.org/abs/math/0512612v1

Mathematics

Combinatorics

10 pages, 2 figures

Scientific paper

In 1966, Claude Berge proposed the following sorting problem. Given a string of $n$ alternating white and black pegs on a one-dimensional board consisting of an unlimited number of empty holes, rearrange the pegs into a string consisting of $\lceil\frac{n}{2}\rceil$ white pegs followed immediately by $\lfloor\frac{n}{2}\rfloor$ black pegs (or vice versa) using only moves which take 2 adjacent pegs to 2 vacant adjacent holes. Avis and Deza proved that the alternating string can be sorted in $\lceil\frac{n}{2}\rceil$ such {\em Berge 2-moves} for $n\geq 5$. Extending Berge's original problem, we consider the same sorting problem using {\em Berge $k$-moves}, i.e., moves which take $k$ adjacent pegs to $k$ vacant adjacent holes. We prove that the alternating string can be sorted in $\lceil\frac{n}{2}\rceil$ Berge 3-moves for $n\not\equiv 0\pmod{4}$ and in $\lceil\frac{n}{2}\rceil+1$ Berge 3-moves for $n\equiv 0\pmod{4}$, for $n\geq 5$. In general, we conjecture that, for any $k$ and large enough $n$, the alternating string can be sorted in $\lceil\frac{n}{2}\rceil$ Berge $k$-moves. This estimate is tight as $\lceil\frac{n}{2}\rceil$ is a lower bound for the minimum number of required Berge $k$-moves for $k\geq 2$ and $n\geq 5$.

Affiliated with

Also associated with

No associations

Rating

Berge Sorting 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 Berge Sorting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Berge Sorting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669223