31 citations · 36 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…
math.CO2009
A Bijective Proof For Forest Reciprocity Theorem
ShinnYih Huang
In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijectiv…