Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
نویسنده
چکیده
Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n > 24. Summary Burnt pancakes problem was defined by Gates and Papadimitriou in 1979. They proved that g(−f n) ≥ 3n/2 − 1. In 1995 Cohen and Blum conjectured that g(n) = g(−I n) and proved that g(−I n) = g(−f n) + 1 ≥ 3n/2.
منابع مشابه
Successor rules for flipping pancakes and burnt pancakes
A stack of n pancakes can be rearranged in all n! ways by a sequence of n!−1 flips, and a stack of n ‘burnt’ pancakes can be rearranged in all 2nn! ways by a sequence of 2nn!−1 flips. In both cases, a computer program can efficiently generate suitable solutions. We approach these tasks instead from a human perspective. How can we determine the next flip directly from the current stack? How can ...
متن کاملOn average and highest number of flips in pancake sorting
We are given a stack of pancakes of different sizes and the only allowed operation is to take several pancakes from top and flip them. The unburnt version requires the pancakes to be sorted by their sizes at the end, while in the burnt version they additionally need to be oriented burnt-side down. We present an algorithm with the average number of flips, needed to sort a stack of n burnt pancak...
متن کاملGreedy flipping of pancakes and burnt pancakes
We prove that a stack of n pancakes is rearranged in all n! ways by repeatedly applying the following rule: Flip the maximum number of pancakes that gives a new stack. This complements the previously known pancake flipping Gray code (S. Zaks, A New Algorithm for Generation of Permutations BIT 24 (1984), 196–204) which we also describe as a greedy algorithm: Flip the minimum number of pancakes t...
متن کاملon the Problem of Sorting Burnt Pancakes
The “pancake problem” is a well-known open combinatorial problem that recently has been shown to have applications to parallel processing. Given a stack of n pancakes in arbitrary order, all of different sizes, the goal is to sort them into the size-ordered configuration having the largest pancake on the bottom and the smallest on top. The allowed sorting operation is a “spatula flip”, in which...
متن کاملThe Harassed Waitress Problem
It is known that a stack of n pancakes can be rearranged in all n! ways by a sequence of n!−1 flips, and that a stack of n ‘burnt’ pancakes can be rearranged in all 2n! ways by a sequence of 2n!−1 flips. Unfortunately, the known algorithms are too difficult to be used by the waitstaff of a busy restaurant. How can humans can determine the next flip from the current stack and no extra informatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1601.06278 شماره
صفحات -
تاریخ انتشار 2016