Skip to main content
Log in

Universal and Overlap Cycles for Posets, Words, and Juggling Patterns

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We discuss results dealing with universal cycles (ucycles) and s-overlap cycles, and contribute to the body of those results by proving existence of universal cycles of naturally labeled posets (NL posets), s-overlap cycles of words of weight k, and juggling patterns. The result on posets is, to the best of our knowledge, the first demonstration of the existence of a ucycle whose length is unknown.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Aardenne-Ehrenfest, T.V., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Bull. Belg. Math. Soc.: Simon Stevin 28, 203–217 (1951)

    MathSciNet  MATH  Google Scholar 

  2. Blanca, A., Godbole, A.: On universal cycles for new classes of combinatorial structures. SIAM J. Discrete Math. 25, 1832–1842 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brightwell, G., Winkler, P.: Counting linear extensions. Order 8, 225–242 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brockman, G., Kay, B., Snively, E.: On universal cycles of labeled graphs. Preprint. arXiv:0808.3610 (2009)

  5. Brockman, G., Kay, B., Snively, E.: On universal cycles of labeled graphs. Electron. J. Comb. 17, Research Paper No. R4 (2010)

  6. Campbell, A., Godbole, A., Kay, B.: Contributions to the theory of de Bruijn cycles. Preprint. arXiv:1304.2820, to appear in Electr. J. Comb. Number Theory 14A, Paper A2 (2014)

  7. Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discrete Math. 110, 43–59 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chung, F., Graham, R.: Universal juggling cycles. Integers: Electron. J. Comb. Number Theory 7, Research Paper No. A08 (2007)

  9. Godbole, A., Knisley, D., Norwood, R.: On \(\alpha \)-overlap graphs. Congr. Numer. 204, 161–171 (2010)

    MathSciNet  MATH  Google Scholar 

  10. Horan, V.: Overlap cycles for permutations: necessary and sufficient conditions. Preprint. arXiv:1309.4741, to appear in Electr. J. Comb. Number Theory 14, Paper A29 (2014)

  11. Horan, V., Hurlbert, G.: \(s\)-Overlap cycles for permutations. Bull. Inst. Comb. Appl. 69, 60–67 (2013)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Hurlbert, G.: On universal cycles of \(k\)-subsets of an \(n\)-set. SIAM J. Discrete Math. 7, 598–604 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tutte, W.T., Smith, C.A.B.: On unicursal paths in a network of degree 4. Am. Math. Mon. 48, 233–237 (1941)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The research of all four authors was supported by NSF Grant 1263009.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anant Godbole.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

King, A., Laubmeier, A., Orans, K. et al. Universal and Overlap Cycles for Posets, Words, and Juggling Patterns. Graphs and Combinatorics 32, 1013–1025 (2016). https://doi.org/10.1007/s00373-015-1632-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1632-4

Keywords

Navigation