Sorting 1-away permutations with underlying Fibonacci convolutions

DOI10.1007/S00010-024-01146-1MaRDI QIDQ6963432zbMATH OpenFDO

Authors Hosam M. Mahmoud

Publication date 7 July 2025

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00010-024-01146-1

zbMATH Keywords

algorithmconvolutionFibonacci numbersrestricted permutationsorting

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Combinatorial probability (60C05) Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 2186877 (Why is no real title available?)
• scientific article; zbMATH DE number 435515 (Why is no real title available?)
• scientific article; zbMATH DE number 62667 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1540682 (Why is no real title available?)
• Normal convergence problem? Two moments and a recurrence may be the clues
• On the number of certain types of strongly restricted permutations

This page was built for publication: Sorting 1-away permutations with underlying Fibonacci convolutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963432)