Alweiss, Ryan - Asymptotic results on Klazar set partition avoidance

dmtcs:4373 - Discrete Mathematics & Theoretical Computer Science, March 19, 2018, Vol. 19 no. 2, Permutation Patterns 2016
Asymptotic results on Klazar set partition avoidance

Authors: Alweiss, Ryan

We establish asymptotic bounds for the number of partitions of $[n]$ avoiding a given partition in Klazar's sense, obtaining the correct answer to within an exponential for the block case. This technique also enables us to establish a general lower bound. Additionally, we consider a graph theoretic restatement of partition avoidance problems, and propose several conjectures.


Source : oai:arXiv.org:1608.02279
Volume: Vol. 19 no. 2, Permutation Patterns 2016
Section: Permutation Patterns
Published on: March 19, 2018
Submitted on: August 19, 2017
Keywords: Mathematics - Combinatorics,05A18


Share

Consultation statistics

This page has been seen 50 times.
This article's PDF has been downloaded 46 times.