Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Michael Engen"'
Autor:
Vincent Vatter, Michael Engen
Publikováno v:
The American Mathematical Monthly. 128:4-24
Numerous versions of the question "what is the shortest object containing all permutations of a given length?" have been asked over the past fifty years: by Karp (via Knuth) in 1972; by Chung, Diaconis, and Graham in 1992; by Ashlock and Tillotson in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b0269c6f1c81527a8dc21038ef81ab5
https://doi.org/10.1080/00029890.2021.1835384
https://doi.org/10.1080/00029890.2021.1835384
We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new combinatorial in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::647e61f8421c3a33536a36912d915b57
http://arxiv.org/abs/1809.01340
http://arxiv.org/abs/1809.01340
Publikováno v:
Scopus-Elsevier
We establish an exact formula for the length of the shortest permutation containing all layered permutations of length $n$, proving a conjecture of Gray.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc657ab3ab5017a5abff7dc47623afdf
http://arxiv.org/abs/1710.04240
http://arxiv.org/abs/1710.04240
Korpelainen, Lozin, and Razgon conjectured that a hereditary property of graphs which is well-quasi-ordered by the induced subgraph order and defined by only finitely many minimal forbidden induced subgraphs is labelled well-quasi-ordered, a notion s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7120bdabc785302775a79feff82525d
http://arxiv.org/abs/1709.10042
http://arxiv.org/abs/1709.10042