
Dr Robert Brignall
Senior Lecturer In Combinatorics
Biography
Professional biography
I'm a Senior Lecturer in Combinatorics in the School of Mathematics and Statistics, having joined the OU as a Lecturer in 2010. After graduating from the University of Cambridge in 2003, I studied first for an MSc and then completed my PhD in 2007 at the University of St Andrews, before moving to the University of Bristol as a Research Fellow. You should visit my personal page if you would like to read more.
Research interests
My research interests lie in enumerative and structural combinatorics, more specifically on permutation patterns, graph theory, and well-quasi-ordering. You should visit my personal page if you would like to read more, including access to my preprints, papers, and slides of talks that I have given.
Projects
Infinite Antichains: from Permutations to Combinatorial Structures
Some of the most celebrated results in combinatorics of the last 50 years concern the study of well-quasi-ordering of combinatorial structures, i.e. the existence or otherwise of infinite antichains for objects such as graphs, tournaments or permutations. Recent research by the PI has developed a general construction for infinite antichains for permutations, which in turn gives a technique that can be used more generally for other structures. These constructions not only add evidence to the widely-held belief that the only infinite antichains that need to be considered in the study of well-quasi-ordering have a “regular” structure, but also suggest what this regular structure might be. This proposal aims to investigate this structure further, by first considering further examples in the study of permutation patterns, with particular reference to “grid classes”. It is hoped that the insight gained by studying examples in permutations will lead to more general structural results for antichains in other structures, and also explain the differences between the various structures.
LMS Grant Award
LMS Research Scheme Grant - Grant reference: 11579 - Title of Conference: Mathematics in the regions: Staff Tutor Research Grant for Conference to be held in October 2016
Publications
Book Chapter
Journal Article
Mini-Workshop: Permutation Patterns (2024)
Labelled Well-Quasi-Order in Juxtapositions of Permutation Classes (2024)
A framework for minimal hereditary classes of graphs of unbounded clique-width (2023)
Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width (2022)
Labelled well-quasi-order for permutation classes (2022)
Well-quasi-ordering and finite distinguishing number (2020)
A structural characterisation of Av(1324) and new bounds on its growth rate (2020)
Combinatorial specifications for juxtapositions of permutation classes (2019)
Rationality for subclasses of 321-avoiding permutations (2019)
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (2019)
Zeros of the Möbius function of permutations (2019)
A Counterexample Regarding Labelled Well-Quasi-Ordering (2018)
Characterising inflations of monotone grid classes of permutations (2018)
The Möbius function of permutations with an indecomposable lower bound (2018)
Linear Clique-Width for Hereditary Classes of Cographs (2017)
Juxtaposing Catalan Permutation Classes with Monotone Ones (2017)
2×2 monotone grid classes are finitely based (2016)
Bichain graphs: geometric model and universal graphs (2016)
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique (2015)
A simple proof of a theorem of Schmerl and Trotter for permutations (2015)
Enumerating indices of Schubert varieties defined by inclusions (2014)
Large infinite antichains of permutations (2013)
The enumeration of three pattern classes using monotone grid classes (2012)
Modular decomposition and the reconstruction conjecture (2012)
Grid classes and partial well order (2012)
Simple extensions of combinatorial structures (2011)
The enumeration of permutations avoiding 2143 and 4231 (2011)
Growth rates for subclasses of Av(321) (2010)
Almost avoiding permutations (2009)
Decomposing simple permutations, with enumerative consequences (2008)
Simple permutations and algebraic generating functions (2008)
Simple permutations: Decidability and unavoidable substructures (2008)
Presentation / Conference
Staircases, dominoes, and the growth rate of 1324-avoiders (2017)