English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Burnt pancakes problem was defined by Gates and Papadimitriou in 1979. Astack S of pancakes with a burnt side must be sorted by size, the smallest ontop, and each pancake with burnt side down. Only operation allowed is to splitstack in two parts and flip upper part. g(S) is the minimal number of flipsneeded to sort stack S. Stack S may be -In when pancakes are in right order butupside down or -f_n when all pancakes are right side up but sorted in reverseorder. Gates et al. proved that g(-f_n)>=3n/2-1.  In 1995 Cohen and Blum proved that g(-I_n)=g(-f_n)+1>=3n/2.  In 1997 Heydari and Sudborough proved that g(-I_n)<= 3(n+1)/2 whenever somefortuitous sequence of flips exists. They gave fortuitous sequences for n=3,15, 27 and 31. They showed that two fortuitous sequences S_n and S_n' maycombine into another fortuitous sequence S_n'' with n''=n+n'-3. So a fortuitoussequence S_n gives a fortuitous sequence S_{n+12}. This proves thatg(-I_n)<=3(n+1)/2 if n is congruent to 3 modulo 4 and n>=23.  In 2011 Josef Cibulka enhanced Gates and Papadimitriou's lower bound thanksto a potential function. He got so g(-I_n)>=3n/2+1 if n>1 proving thereby, thatg(-I_n)=3(n+1)/2 if n is congruent to 3 modulo 4 and n>=23.  This paper explains how to build generalized fortuitous sequences for everyn>=25 proving thereby that g(-I_n)=ceiling(3n/2)+1 for every n>=25.

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24