105 citations · 118 across the 13 of their papers we have counts for
5 papers · 1 filter
Lattice Path Matroid Polytopes
Hoda Bidkhori
Fix two lattice paths and from to that use East and North steps with never going above . Bonin et al. show that the lattice paths that go from $(0,0…
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…
Finite Eulerian posets which are binomial, Sheffer or triangular
Hoda Bidkhori
In this paper we study finite Eulerian posets which are binomial, Sheffer or triangular. These important classes of posets are related to the theory of generating functions and to…
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…
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…