7 citations · 7 across the 3 of their papers we have counts for
3 papers
math.CO2007
Geometry and complexity of O'Hara's algorithm
Matjaz Konvalinka, Igor Pak
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor con…
math.CO2007★ 7 cited
Non-commutative Sylvester's determinantal identity
Matjaz Konvalinka
Sylvester's identity is a classical determinantal identity with a straightforward linear algebra proof. We present a new, combinatorial proof of the identity, prove several non-com…
math.CO2007
On Goulden-Jackson's determinantal expression for the immanant
Matjaz Konvalinka
In 1992, Goulden and Jackson found a beautiful determinantal expression for the immanant of a matrix. This paper proves the same result combinatorially.