Note on pancake sorting

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2025-08-29 DOI:10.1016/j.ipl.2025.106597

Marcin Peczarski

引用次数: 0

Abstract

We present generalized approach to the proof of the lower bound for unburnt pancake sorting problem, where we search for the number

f (n)

of prefix reversals required to sort a stack (permutation) of n pancakes. For this purpose we introduce a new concept of guarded pancake blocks. Gates and Papadimitriou proved that

f (n) \geq 17 n / 16

for n a multiple of 16. Heydari and Sudborough improved this bound to

f (n) \geq 15 n / 14

for n a multiple of 14. We extend that result to

f (n) \geq ⌊ (15 n + 9) / 14 ⌋

for every

n \geq 6

查看原文本刊更多论文

煎饼分拣注意事项

我们提出了一种证明未烧焦煎饼排序问题下界的广义方法，其中我们搜索排序n个煎饼堆叠（排列）所需的前缀反转数f(n)。为此，我们提出了一个新的概念，即保护煎饼块。Gates和Papadimitriou证明了当n是16的倍数时f(n)≥17n/16。Heydari和Sudborough在n为14的倍数时将这一界限改进为f(n)≥15n/14。我们将结果推广到f(n)≥⌊(15n+9)/14⌋对于每一个n≥6。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.