Skip to main content
Springer Nature Link
Log in

Greedy Universal Cycle Constructions for Weak Orders

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12016))

Included in the following conference series:

  • 957 Accesses

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

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

') var buybox = document.querySelector("[data-id=id_"+ timestamp +"]").parentNode var buyingOptions = buybox.querySelectorAll(".buying-option") ;[].slice.call(buyingOptions).forEach(initCollapsibles) // springerPlus roll out starts here if (window.localStorage) { window.localStorage.removeItem("springerPlusRollOut") } //springerPlus ends here var buyboxMaxSingleColumnWidth = 480 function initCollapsibles(subscription, index) { var toggle = subscription.querySelector(".buying-option-price") subscription.classList.remove("expanded") var form = subscription.querySelector(".buying-option-form") var priceInfo = subscription.querySelector(".price-info") var buyingOption = toggle.parentElement if (toggle && form && priceInfo) { toggle.setAttribute("role", "button") toggle.setAttribute("tabindex", "0") toggle.addEventListener("click", function (event) { var expandedBuyingOptions = buybox.querySelectorAll(".buying-option.expanded") var buyboxWidth = buybox.offsetWidth ;[].slice.call(expandedBuyingOptions).forEach(function(option) { if (buyboxWidth <= buyboxMaxSingleColumnWidth && option != buyingOption) { hideBuyingOption(option) } }) var expanded = toggle.getAttribute("aria-expanded") === "true" || false toggle.setAttribute("aria-expanded", !expanded) form.hidden = expanded if (!expanded) { buyingOption.classList.add("expanded") } else { buyingOption.classList.remove("expanded") } priceInfo.hidden = expanded }, false) } } function hideBuyingOption(buyingOption) { var toggle = buyingOption.querySelector(".buying-option-price") var form = buyingOption.querySelector(".buying-option-form") var priceInfo = buyingOption.querySelector(".price-info") toggle.setAttribute("aria-expanded", false) form.hidden = true buyingOption.classList.remove("expanded") priceInfo.hidden = true } function initKeyControls() { document.addEventListener("keydown", function (event) { if (document.activeElement.classList.contains("buying-option-price") && (event.code === "Space" || event.code === "Enter")) { if (document.activeElement) { event.preventDefault() document.activeElement.click() } } }, false) } function initialStateOpen() { var buyboxWidth = buybox.offsetWidth ;[].slice.call(buybox.querySelectorAll(".buying-option")).forEach(function (option, index) { var toggle = option.querySelector(".buying-option-price") var form = option.querySelector(".buying-option-form") var priceInfo = option.querySelector(".price-info") if (buyboxWidth > buyboxMaxSingleColumnWidth) { toggle.click() } else { if (index === 0) { toggle.click() } else { toggle.setAttribute("aria-expanded", "false") form.hidden = "hidden" priceInfo.hidden = "hidden" } } }) } initialStateOpen() if (window.buyboxInitialised) return window.buyboxInitialised = true initKeyControls() })()

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Sawada and Wong have recently discovered a new efficient algorithm to generate a universal cycle for weak orders for all n in [17] under another notation by applying the framework in [9].

References

  1. Alhakim, A.: A simple combinatorial algorithm for de Bruijn sequences. Am. Math. Mon. 117(8), 728–732 (2010)

    Article  MathSciNet  Google Scholar 

  2. Alhakim, A.: Spans of preference functions for de Bruijn sequences. Discrete Appl. Math. 160(7–8), 992–998 (2012)

    Article  MathSciNet  Google Scholar 

  3. Alhakim, A., Sala, E., Sawada, J.: Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions. Submitted manuscript (2019)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. Eldert, C., Gray, H.J., Gurk, H.M., Rubinoff, M.: Shifting counters. AIEE Trans. 77, 70–74 (1958)

    Google Scholar 

  6. Ford, L.R.: A cyclic arrangement of \(m\)-tuples. Report No. P-1071, RAND Corporation (1957)

    Google Scholar 

  7. Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195–221 (1982)

    Article  MathSciNet  Google Scholar 

  8. Fredricksen, H., Maiorana, J.: Necklaces of beads in \(k\) colors and \(k\)-ary de Bruijn sequences. Discrete Math. 23, 207–210 (1978)

    Article  MathSciNet  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley Professional, Boston (1994)

    Google Scholar 

  11. Horan, V., Hurlbert, G.: Universal cycles for weak orders. SIAM J. Discrete Math. 27(3), 1360–1371 (2013)

    Article  MathSciNet  Google Scholar 

  12. Jackson, B., Stevens, B., Hurlbert, G.: Research problems on Gray codes and universal cycles. Discrete Math. 309(17), 5341–5348 (2009)

    Article  MathSciNet  Google Scholar 

  13. Knuth, D.E.: The Art of Computer Programming, Volume 4A, Combinatorial Algorithms. Addison-Wesley Professional, Boston (2011)

    MATH  Google Scholar 

  14. Martin, M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40, 859–864 (1934)

    Article  MathSciNet  Google Scholar 

  15. Mütze, T., Sawada, J., Williams, A.: The Combinatorial Object Server\(++\). http://combos.org/index.html

  16. Sawada, J.: Personal communication

    Google Scholar 

  17. Sawada, J., Wong, D.: An efficient universal cycle construction for weak orders. Submitted manuscript (2019)

    Google Scholar 

  18. Sloane, N.: The on-line encyclopedia of integer sequences. http://oeis.org. Sequence A000670

  19. Stein, S.K.: Mathematics: The Man-Made Universe, 3rd edn. W. H. Freeman and Company, San Francisco (1994)

    Google Scholar 

  20. 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)

    Google Scholar 

Download references

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

  1. State University of New York, Incheon, Korea

    Marsden Jacques & Dennis Wong

Authors
  1. Marsden Jacques
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dennis Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Marsden Jacques or Dennis Wong .

Editor information

Editors and Affiliations

  1. University of Kerala, Thiruvananthapuram, India

    Manoj Changat

  2. Indian Statistical Institute, Kolkata, India

    Sandip Das

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation