✦ LIBER ✦

Endomorphism monoids containing all permutations

✍ Scribed by R. Birkenhead

Book ID: 112760209
Publisher: Springer
Year: 1981
Tongue: English
Weight: 85 KB
Volume: 13
Category: Article
ISSN: 0002-5240
DOI: 10.1007/bf02483840

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Collapsing monoids containing permutatio

Collapsing monoids containing permutations and constants

✍ Anne Fearnley; IvoG. Rosenberg 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 167 KB

The endomorphism monoid of the random po

The endomorphism monoid of the random poset contains all countable semigroups

✍ Igor Dolinka 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 96 KB

Endomorphisms of the group of all recurs

Endomorphisms of the group of all recursive permutations

✍ A. S. Morozov 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 701 KB

Shortest string containing all permutati

Shortest string containing all permutations

✍ S.P. Mohanty 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 509 KB

Shortest string containing all permutati

Shortest string containing all permutations

✍ P.J. Koutas; T.C. Hu 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 1007 KB

Revkd t 7 M

Short strings containing all k-element p

Short strings containing all k-element permutations

✍ Carla Savage 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Given n and k, we consider the problem of conslructing a shortest string over the, set ~. ={1,2 ..... n} which contains every permulation of each k-element subset of ~, as a scbsequence. Let g(n, k) denote the length of a shorte,;t such string. We show by construction tic, a: g(n, k) <~ k(n -2) + 4