4 papers
Inversion monotonicity in subclasses of the 1324-avoiders
Anders Claesson, Svante Linusson, Henning Ulfarsson +1
A collection of patterns is called inversion monotone if , the number of -avoiding permutations of length with inversions, is weakly increasing i…
A Permutation Avoidance Game with Reverse Replies and Monotone Traps
Henning Ulfarsson
We study the impartial game PAP (``permutations avoiding patterns''), in which players take turns choosing patterns to avoid. We define a set of length patterns, , and sho…
BiSC: An algorithm for discovering generalized permutation patterns
Henning Ulfarsson
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties fro…
Combinatorial Exploration: An algorithmic framework for enumeration
Michael H. Albert, Christian Bean, Anders Claesson +3
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequ…