Zobrazeno 1 - 10
of 336
pro vyhledávání: '"A. P. Brignall"'
Publikováno v:
Sillages Critiques, Vol 26 (2019)
Professor Gisele Venet talks to director Cecilia Dorland and actors Jack Christie and Pip Brignall about the production of The Duchess of Malfi at St Giles in the Field, London, by Scena Mundi Theatre Company (Spring 2017). The conversation took plac
Externí odkaz:
https://doaj.org/article/0781cd257f74425e8e3b8ee1be44325d
We undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the $M$-sum, wh
Externí odkaz:
http://arxiv.org/abs/2410.05834
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of 1324-avoide
Externí odkaz:
http://arxiv.org/abs/1711.10325
We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing a long sum
Externí odkaz:
http://arxiv.org/abs/1702.04269
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is in bijectiv
Externí odkaz:
http://arxiv.org/abs/1602.00672
Autor:
Atminas, Aistis, Brignall, Robert
Balogh, Bollobas and Weinreich showed that a parameter that has since been termed the distinguishing number can be used to identify a jump in the possible speeds of hereditary classes of graphs at the sequence of Bell numbers. We prove that every her
Externí odkaz:
http://arxiv.org/abs/1512.05993
Autor:
Albert, Michael, Brignall, Robert
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol. 18 no. 2, Permutation Patterns 2015, Permutation Patterns (February 11, 2016) dmtcs:1325
In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain $2 \times 2$ (generalized) g
Externí odkaz:
http://arxiv.org/abs/1511.00473
We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bichain graphs. Each of these classes is characterised by a finite list of
Externí odkaz:
http://arxiv.org/abs/1503.01628
We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. Our principle result is that the class of permutation graphs omitting $P_5$ and a clique of any size is well-quasi-ordered. This is proved by giving a
Externí odkaz:
http://arxiv.org/abs/1312.5907
Autor:
Albert, Michael H., Brignall, Robert
By extending the notion of grid classes to include infinite grids, we establish a structural characterisation of the simple permutations in Av(4231, 35142, 42513, 351624), a pattern class which has three different connections with algebraic geometry,
Externí odkaz:
http://arxiv.org/abs/1301.3188