activity
20022014
most citedThe enumeration of simple permutations

75 citations · 111 across the 13 of their papers we have counts for

collaborators

13 papers

math.CO2014★ 1 cited

Deflatability of Permutation Classes

M. H. Albert, M. D. Atkinson, Cheyne Homberger +1

A deflatable permutation class is one in which the simple permutations are contained in a proper subclass. Deflatable permutation classes are often easier to describe and enumerate…

math.CO2012★ 5 cited

Inflations of Geometric Grid Classes: Three Case Studies

Michael H. Albert, M. D. Atkinson, Vincent Vatter

We enumerate three specific permutation classes defined by two forbidden patterns of length four. The techniques involve inflations of geometric grid classes.

math.CO2012★ 2 cited

Pattern classes and priority queues

Michael Albert, M. D. Atkinson

When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C'. The basis of C' is determined fo…

math.CO2011★ 3 cited

Counting (3+1) - Avoiding permutations

M. D. Atkinson, Bruce E. Sagan, Vincent Vatter

A poset is {\it $(\3+\1)$-free} if it contains no induced subposet isomorphic to the disjoint union of a 3-element chain and a 1-element chain. These posets are of interest because…

math.CO2009★ 13 cited

Growth rates for subclasses of Av(321)

M. H. Albert, M. D. Atkinson, R. Brignall +3

Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or…

math.CO2007★ 2 cited

The -modular descent algebras

M. D. Atkinson, G. Pfeiffer, S. J. van Willigenburg

The concept of descent algebras over a field of characteristic zero is extended to define descent algebras over a field of prime characteristic. Some basic algebraic structure of t…