3 citations · 5 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2011★ 1 cited
Eulerian-Catalan Numbers
Hoda Bidkhori, Seth Sullivant
We show that the Eulerian-Catalan numbers enumerate Dyck permutations. We provide two proofs for this fact, the first using the geometry of alcoved polytopes and the second a direc…
math.CO2009★ 3 cited
Counting the spanning trees of a directed line graph
Hoda Bidkhori, Shaunak Kishore
The line graph LG of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967, Knuth used the Matrix-Tree Theorem to prove a formula…
math.CO2009★ 1 cited
Strongly Cancellative and Recovering Sets On Lattices
ShinnYih Huang, Hoda Bidkhori
We use information theory to study recovering sets and strongly cancellative sets $\C_L$ on different lattices. These sets are special classes of recovering pairs and cancel…