1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DM2019★ 1 cited
Prolific Compositions
Murray Tannock, Michael Albert
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, hold…
math.CO2017
Equivalence classes of mesh patterns with a dominating pattern
Murray Tannock, Henning Ulfarsson
Two mesh patterns are coincident if they are avoided by the same set of permutations, and are Wilf-equivalent if they have the same number of avoiders of each length. We provide su…
math.CO2015
Pattern avoiding permutations and independent sets in graphs
Christian Bean, Murray Tannock, Henning Ulfarsson
We introduce a new method for encoding permutations as weighted independent sets in a family of graphs we call cores. The encoding allows us to enumerate (1324, 2143)-, (1234, 1324…