4 papers · 1 filter
Cyclomatic numbers and permutations
Bridget Eileen Tenner, Vincent Vatter
We show that several apparently different aspects of a permutation are all tied to a single quantity, the cyclomatic number of its inversion graph. Every reduced word for the permu…
Boolean--Eulerian numbers
Miklós Bóna, Vincent Vatter
We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized bl…
Uncountably many enumerations of well-quasi-ordered permutation classes
Robert Brignall, Vincent Vatter
We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered per…
Bounds on the lettericity of graphs
Sean Mandrick, Vincent Vatter
Lettericity measures the minimum size of an alphabet needed to represent a graph as a letter graph, where vertices are encoded by letters, and edges are determined by an underlying…