Name
Abstract | ||
|---|---|---|
A superpattern is a string of characters of length n that contains as a subsequence, and in a sense that depends on the context, all the smaller strings of length k in a certain class. We prove structural and probabilistic results on superpatterns for preferential arrangements, including (i) a theorem that demonstrates that a string is a superpattern for all preferential arrangements if and only if it is a superpattern for all permutations; and (ii) a result that is reminiscent of a still unresolved conjecture of Alon on the smallest permutation on [n] that contains all k-permutations with high probability. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.endm.2016.09.003 | Electronic Notes in Discrete Mathematics |
Keywords | DocType | Volume |
Superpattern,preferential arrangements,permutation | Journal | 54 |
ISSN | Citations | PageRank |
1571-0653 | 0 | 0.34 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yonah Biers-Ariel | 1 | 0 | 0.34 |
| Anant P. Godbole | 2 | 95 | 16.08 |
| Yiguang Zhang | 3 | 0 | 0.68 |