Viðburðadagatal tölvunarfræðideildar

ICE-TCS seminar: Michael Engen

Universal Permutations

  • 27.8.2019, 11:50 - 12:35

ICE-TCS-logo-200px

ICE-TCS seminar #337

Date and time: Tuesday, 27 August 2019, 11:50-12:35
Location: Room M1.09

Note the non-standard date and location!

Speaker: Michael Engen (Department of Mathematics, University of Florida)

Title: Universal Permutations

Abstract: The problem of finding a shortest permutation which contains all permutations of length n dates to 1999. While its length is known to be asymptotically quadratic in n, surprisingly little else is known. We prove a new constructive upper bound, as well as prove a formula for the exact length of the shortest permutation containing all layered permutations of length n.

This is joint work with Vatter [2] as well as with Albert, Pantone, and Vatter [1].

References

[1] Albert, M., Engen, M., Pantone, J., and Vatter, V. Universal layered permutations. Electron. J. Combin. 25, 3 (2018), Paper #P3.23, 5 pp.

[2] Engen, M., and Vatter, V. Containing all permutations. arXiv:1810.08252 [math.CO].



Vinsamlegast athugið að á viðburðum Háskólans í Reykjavík (HR) eru teknar ljósmyndir og myndbönd sem notuð eru í markaðsstarfi HR. Hægt er að nálgast frekari upplýsingar á ru.is eða með því að senda tölvupóst á netfangið: personuvernd@ru.is

//


Please note that at events hosted at Reykjavik University (RU), photographs and videos are taken which might be used for RU marketing purposes. Read more about this on our ru.is Please note that at events hosted at Reykjavik University (RU), photographs and videos are taken which might be used for RU marketing purposes. Read more about this on our website en.ru.is or send an e-mail: personuvernd@ru.is