44 citations · 82 across the 8 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013★ 11 cited
Computing the Tutte Polynomial of Lattice Path Matroids Using Determinantal Circuits
Jason Morton, Jacob Turner
We give a quantum-inspired algorithm computing the Tutte polynomial of a lattice path matroid, where is the size of the ground set of the matroid. Furthermore, this ca…
math.RT2013★ 4 cited
The Invariant Ring Of m Matrices Under The Adjoint Action By a Product Of General Linear Groups
Jacob Turner, Jason Morton
Let be a vector space over an algebraically closed field of characteristic zero with . We study the ring of polynomial invaria…
math.CT2013★ 9 cited
Generalized Counting Constraint Satisfaction Problems With Determinantal Circuits
Jason Morton, Jacob Turner
Generalized counting constraint satisfaction problems include Holant problems with planarity restrictions; polynomial-time algorithms for such problems include matchgates and match…