Name
Abstract | ||
|---|---|---|
Recently Wen Chean Teh [Australas. J. Combin. 76 (2020), 208-219] showed that for every permutation pi of the ordered alphabet A = {a(1), a(2), ..., a(n)} there exists a word w is an element of A*, in which each letter of A appears at least once, such that w and pi(w) have the same Parikh matrix. He conjectured that it is always possible to find such a w whose length is at most 2n. We prove this. |
Year | Venue | DocType |
|---|---|---|
2020 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
78 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jamie Simpson | 1 | 164 | 21.41 |