101 citations · 629 across the 59 of their papers we have counts for
Showing 2017 · math.COShow all
2 papers · 2 filters
math.CO2017★ 9 cited
Lower bounds on the number of realizations of rigid graphs
Georg Grasegger, Christoph Koutschan, Elias Tsigaridas
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take adv…
math.CO2017★ 2 cited
A Curious Family of Binomial Determinants That Count Rhombus Tilings of a Holey Hexagon
Christoph Koutschan, Thotsaporn Thanatipanonda
We evaluate a curious determinant, first mentioned by George Andrews in 1980 in the context of descending plane partitions. Our strategy is to combine the famous Desnanot-Jacobi-Do…