104
click to vote
JCT
2016
10 years 27 days ago
2016
The classical Littlewood-Richardson rule is a rule for computing coefficients in many areas, and comes in many guises. In this paper we prove two Littlewood-Richardson rules for s...
157
click to vote
JCT
2016
10 years 27 days ago
2016
Abstract. We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we ...
JCT
2016
10 years 27 days ago
2016
We define and study a recurrence relation in Z3 , called the hexahedron recurrence, which is similar to the octahedron recurrence (Hirota bilinear difference equation) and cube re...
JCT
2016
10 years 27 days ago
2016
It is proved that, for a prime number p, showing that an n-element matroid is not representable over GF(p) requires only O(n2 ) rank evaluations.
JCT
2016
10 years 27 days ago
2016
Let a planar algebraic curve C be defined over a valuation field by an equation F(x, y) = 0. Valuations of the coefficients of F define a subdivision of the Newton polygon ∆ o...