Asymptotics of Pattern Avoidance in the Permutation-Tuple and Klazar Set Partition Settings
[article]
Benjamin Gunby
<span title="2019-06-23">2019</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
We consider asymptotics of set partition pattern avoidance in the sense of Klazar. One of the results of this paper extends work of Alweiss, and finds a classification for set partitions π such that the number of set partitions of [n] avoiding π grows more slowly than n^cn for all c>0. Several conjectures are proposed, and the related question of asymptotics of parallel (k-tuple) permutation pattern avoidance is considered and solved completely to within an exponential factor, generalizing
more »
... s and Tardos's 2004 proof of the Stanley-Wilf Conjecture.
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1609.06023v3">arXiv:1609.06023v3</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4puadvapvbeztanwzcx7x4cawu">fatcat:4puadvapvbeztanwzcx7x4cawu</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200930120422/https://arxiv.org/pdf/1609.06023v2.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<span style="color: #f43e3e;">✱</span>
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/f7/e7f74717d361bf5b291ff274d4245a6fe539aa94.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1609.06023v3" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>
