50 citations · 127 across the 19 of their papers we have counts for
22 papers
Enumerative combinatorics of intervals in the Dyck pattern poset
Antonio Bernini, Matteo Cervetti, Luca Ferrari +1
We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some speci…
Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous binary trees
Mark Dukes, Thomas Selig, Jason P. Smith +1
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurr…
The Abelian sandpile model on Ferrers graphs -- A classification of recurrent configurations
Mark Dukes, Thomas Selig, Jason P. Smith +1
We classify all recurrent configurations of the Abelian sandpile model (ASM) on Ferrers graphs. The classification is in terms of decorations of EW-tableaux, which undecorated are…
EW-tableaux, Le-tableaux, tree-like tableaux and the Abelian sandpile model
Thomas Selig, Jason P. Smith, Einar Steingrimsson
A EW-tableau is a certain 0/1-filling of a Ferrers diagram, corresponding uniquely to an acyclic orientation, with a unique sink, of a certain bipartite graph called a Ferrers grap…
Tiered trees, weights, and q-Eulerian numbers
William Dugan, Sam Glennon, Paul E. Gunnells +1
Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formu…
Number of cycles in the graph of 312-avoiding permutations
Richard Ehrenborg, Sergey Kitaev, Einar Steingrimsson
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation there…