Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

The permutation classes Av(1234,2341) and Av(1243,2314)

Bevan, David (2016) The permutation classes Av(1234,2341) and Av(1243,2314). Australasian Journal of Combinatorics, 64. 3–20. ISSN 1034-4942

[img]
Preview
Text (Bevan-AJOC-2016-The-permutation-classes)
Bevan_AJOC_2016_The_permutation_classes.pdf - Final Published Version
License: Creative Commons Attribution 4.0 logo

Download (151kB) | Preview

Abstract

We investigate the structure of the two permutation classes defined by the sets of forbidden patterns {1234, 2341} and {1243, 2314}. By considering how the Hasse graphs of permutations in these classes can be built from a sequence of rooted source graphs, we determine their algebraic generating functions. Our approach is similar to that of “adding a slice”, used previously to enumerate various classes of polyominoes and other combinatorial structures. To solve the relevant functional equations, we make extensive use of the kernel method.