Membership in moment cones, quiver semi-invariants, and generic semi-stability for bipartite quivers

11/03/2022
by   Calin Chindris, et al.
0

Let Q be a bipartite quiver with vertex set Q_0 such that the number of arrows between any two source and sink vertices is constant. Let β=(β(x))_x ∈ Q_0 be a dimension vector of Q with positive integer coordinates, and let Δ(Q, β) be the moment cone associated to (Q, β). We show that the membership problem for Δ(Q, β) can be solved in strongly polynomial time. As a key step in our approach, we first solve the polytopal problem for semi-invariants of Q and its flag-extensions. Specifically, let Q_β be the flag-extension of Q obtained by attaching a flag ℱ(x) of length β(x)-1 at every vertex x of Q, and let β be the extension of β to Q_β that takes values 1, …, β(x) along the vertices of the flag ℱ(x) for every vertex x of Q. For an integral weight σ of Q_β, let K_σ be the dimension of the space of semi-invariants of weight σ on the representation space of β-dimensional complex representations of Q_β. We show that K_σ can be expressed as the number of lattice points of a certain hive-type polytope. This polytopal description together with Derksen-Weyman's Saturation Theorem for quiver semi-invariants allows us to use Tardos's algorithm to solve the membership problem for Δ(Q,β) in strongly polynomial time. In particular, this yields a strongly polynomial time algorithm for solving the generic semi-stability problem for representations of Q and Q_β.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2023

Moment cone membership for quivers in strongly polynomial time

In this note we observe that membership in moment cones of spaces of qui...
research
08/31/2020

Edmonds' problem and the membership problem for orbit semigroups of quiver representations

A central problem in algebraic complexity, posed by J. Edmonds, asks to ...
research
06/10/2021

Integer programs with bounded subdeterminants and two nonzeros per row

We give a strongly polynomial-time algorithm for integer linear programs...
research
06/28/2021

Notes on {a,b,c}-Modular Matrices

Let A ∈ℤ^m × n be an integral matrix and a, b, c ∈ℤ satisfy a ≥ b ≥ c ≥ ...
research
02/12/2023

Computing Truncated Metric Dimension of Trees

Let G=(V,E) be a simple, unweighted, connected graph. Let d(u,v) denote ...
research
04/07/2022

Strong Admissibility, a Tractable Algorithmic Approach (proofs)

Much like admissibility is the key concept underlying preferred semantic...
research
09/10/2017

Complete Classification of Generalized Santha-Vazirani Sources

Let F be a finite alphabet and D be a finite set of distributions over F...

Please sign up or login with your details

Forgot password? Click here to reset