On the number of pancake stacks requiring four flips to be sorted

zbMath1437.05016arXiv1902.04055MaRDI QIDQ5207835

Charles Buehrle, Saúl A. Blanco, Akshay Patidar

Publication date: 13 January 2020

Full work available at URL: https://arxiv.org/abs/1902.04055

zbMATH Keywords

Cayley graphscycle embeddingpancake graphburnt pancake graph

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (3)

Lengths of cycles in generalized pancake graphs ⋮ An Algorithm to Enumerate Grid Signed Permutation Classes ⋮ Some relations on prefix reversal generators of the symmetric and hyperoctahedral group

This page was built for publication: On the number of pancake stacks requiring four flips to be sorted