12 citations · 15 across the 13 of their papers we have counts for
Showing 2019 · cs.DSShow all
2 papers · 2 filters
cs.DS2019
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
Kazuki Matoya, Taihei Oki
Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common…
cs.DS2019
Computing Valuations of the Dieudonné Determinants
Taihei Oki
This paper addresses the problem of computing valuations of the Dieudonné determinants of matrices over discrete valuation skew fields (DVSFs). Under a reasonable computational mod…