output
20022009
most citedBlack holes in asymptotically Lifshitz spacetime

226 citations

Showing math.COShow all

5 papers · 1 filter

math.CO2008

Permutations sortable by n-4 passes through a stack

Anders Claesson, Mark Dukes, Einar Steingrimsson

We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a…

math.CO2008

Symmetric Schroder paths and restricted involutions

Eva Y. P. Deng, Mark Dukes, Toufik Mansour +1

Let be the set of permutations in the symmetric group with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns . We prese…

math.CO2007

Vertex coloring acyclic digraphs and their corresponding hypergraphs

Geir Agnarsson, Agust Egilsson, Magnus Mar Halldorsson

We consider vertex coloring of an acyclic digraph $\Gdag$ in such a way that two vertices which have a common ancestor in $\Gdag$ receive distinct colors. Such colorings arise in a…

math.CO2007

On Colorings of Squares of Outerplanar Graphs

Geir Agnarsson, Magnus Mar Halldorsson

We study vertex colorings of the square of an outerplanar graph . We find the optimal bound of the inductiveness, chromatic number and the clique number of as a func…

math.CO20071 cited

Combinatorial Gray codes for classes of pattern avoiding permutations

W. M. B. Dukes, Mark F. Flanagan, Toufik Mansour +1

The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhausti…