Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Preimages under a popqueue-sorting algorithm

Preimages under a popqueue-sorting algorithm AbstractFollowing the footprints of what has been done with other sorting devices, we study a popqueue and define an optimal sorting algorithm, called Cons. Our results include a description of the set of all the preimages of a given permutation, an enumeration of the set of the preimages of permutations with some specific properties and, finally, the exact enumeration of permutations having 0, 1 and 2 preimages, respectively, with a characterization of permutations having 3 preimages. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Pure Mathematics and Applications de Gruyter

Preimages under a popqueue-sorting algorithm

Cioni, Lapo
Pure Mathematics and Applications , Volume 30 (1): 5 – Jun 1, 2022
Download PDF
5 pages

Loading next page...
 
/lp/de-gruyter/preimages-under-a-popqueue-sorting-algorithm-ZXsah6roSr
Publisher
de Gruyter
Copyright
© 2022 Lapo Cioni, published by Sciendo
eISSN
1788-800X
DOI
10.2478/puma-2022-0010
Publisher site
See Article on Publisher Site

Abstract

AbstractFollowing the footprints of what has been done with other sorting devices, we study a popqueue and define an optimal sorting algorithm, called Cons. Our results include a description of the set of all the preimages of a given permutation, an enumeration of the set of the preimages of permutations with some specific properties and, finally, the exact enumeration of permutations having 0, 1 and 2 preimages, respectively, with a characterization of permutations having 3 preimages.

Journal

Pure Mathematics and Applications – de Gruyter

Published: Jun 1, 2022

Keywords: sorting algorithm; permutation; popqueue; preimage; 05A05; 05A10; 05A15;

There are no references for this article.