Abstract
A weak order is a way to rank n objects where ties are allowed. In this paper, we extend the prefer-larger and the prefer-opposite algorithms for de Bruijn sequences to provide the first known greedy universal cycle constructions for weak orders.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alhakim, A.: A simple combinatorial algorithm for de Bruijn sequences. Am. Math. Mon. 117(8), 728–732 (2010)
Alhakim, A.: Spans of preference functions for de Bruijn sequences. Discrete Appl. Math. 160(7–8), 992–998 (2012)
Alhakim, A., Sala, E., Sawada, J.: Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions. Submitted manuscript (2019)
Diaconis, P., Graham, R.: Products of universal cycles. In: Demaine, E., Demaine, M., Rodgers, T. (eds.) A Lifetime of Puzzles, pp. 35–55. A K Peters (2008)
Eldert, C., Gray, H.J., Gurk, H.M., Rubinoff, M.: Shifting counters. AIEE Trans. 77, 70–74 (1958)
Ford, L.R.: A cyclic arrangement of \(m\)-tuples. Report No. P-1071, RAND Corporation (1957)
Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195–221 (1982)
Fredricksen, H., Maiorana, J.: Necklaces of beads in \(k\) colors and \(k\)-ary de Bruijn sequences. Discrete Math. 23, 207–210 (1978)
Gabric, D., Sawada, J., Williams, A., Wong, D.: A successor rule framework for constructing \(k\)-ary de Bruijn sequences and universal cycles. IEEE Trans. Inf. Theory 66, 679–687 (2019)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley Professional, Boston (1994)
Horan, V., Hurlbert, G.: Universal cycles for weak orders. SIAM J. Discrete Math. 27(3), 1360–1371 (2013)
Jackson, B., Stevens, B., Hurlbert, G.: Research problems on Gray codes and universal cycles. Discrete Math. 309(17), 5341–5348 (2009)
Knuth, D.E.: The Art of Computer Programming, Volume 4A, Combinatorial Algorithms. Addison-Wesley Professional, Boston (2011)
Martin, M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40, 859–864 (1934)
Mütze, T., Sawada, J., Williams, A.: The Combinatorial Object Server\(++\). http://combos.org/index.html
Sawada, J.: Personal communication
Sawada, J., Wong, D.: An efficient universal cycle construction for weak orders. Submitted manuscript (2019)
Sloane, N.: The on-line encyclopedia of integer sequences. http://oeis.org. Sequence A000670
Stein, S.K.: Mathematics: The Man-Made Universe, 3rd edn. W. H. Freeman and Company, San Francisco (1994)
Wang, X., Wong, D., Zhang, W.: A simple greedy de Bruijn sequence construction. In: Proceedings of the 10th SEquences and Their Applications (SETA), Hong Kong (2018)
Acknowledgements
This research is supported by the MSIT (Ministry of Science and ICT), Korea, under the ICT Consilience Creative program (IITP-2019-2011-1-00783) supervised by the IITP (Institute for Information & communications Technology Planning & Evaluation).
The authors would like to thank Joe Sawada for his comments that greatly improve this paper. They would also like to thank Kyounga Woo for the fruitful discussions related to this research.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Jacques, M., Wong, D. (2020). Greedy Universal Cycle Constructions for Weak Orders. In: Changat, M., Das, S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science(), vol 12016. Springer, Cham. https://doi.org/10.1007/978-3-030-39219-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-39219-2_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39218-5
Online ISBN: 978-3-030-39219-2
eBook Packages: Computer ScienceComputer Science (R0)