Related papers: Complexity of quiver mutation equivalence
We consider birack and switch colorings of braids. We define a switch structure on the set of permutation representations of the braid group and consider when such a representation is a switch automorphism. We define quiver-valued…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…
This paper classifies all 4d Nakajima quiver varieties through a combinatorial approach. For each such variety, we describe the symplectic leaves and minimal degenerations between them. Using the resulting Hasse diagrams and secondary…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
A P-matrix is a square matrix $X$ such that all principal submatrices of $X$ have positive determinant. Such matrices appear naturally in instances of the linear complementarity problem, where these are precisely the matrices for which the…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We introduce thread quivers as an (infinite) generalization of quivers, and show that every k-linear (k algebraically closed) hereditary category with Serre duality and enough projectives is equivalent to the category of finitely presented…
Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results rely on reductions from a handful of undecidable problems,…
We consider arrow diagrams of links in $S^3$ and define $k$-moves on such diagrams, for any $k\in\mathbb N$. We study the equivalence classes of links in $S^3$ up to $k$-moves. For $k=2$, we show that any two knots are equivalent, whereas…
The Harder-Narasimhan type of a quiver representation is a discrete invariant parameterised by a real-valued function (called a central charge) defined on the vertices of the quiver. In this paper, we investigate the strength and…
We show that the problem of checking if a given nondeterministic parity automaton simulates another given nondeterministic parity automaton is NP-hard. We then adapt the techniques used for this result to show that the problem of checking…
We define a certain class of simple varieties over a field $k$ by a constructive recipe and show how to control their (equivariant) truncating invariants. Consequently, we prove that on simple varieties: (i) if $k=\overline{k}$ and…
We present a graded mutation rule for quivers of cluster-tilted algebras. Furthermore, we give a technique to recover a cluster-tilting object from its graded quiver in the cluster category of coh $\mathbb{X}$.
A quiver is an oriented graph. Quiver mutation is an elementary operation on quivers. It appeared in physics in Seiberg duality in the nineties and in mathematics in the definition of cluster algebras by Fomin-Zelevinsky in 2002. We show,…
We completely determine all varieties of monoids on whose free objects all fully invariant congruences or all fully invariant congruences contained in the least semilattice congruence permute. Along the way, we find several new monoid…
Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph. Deciding whether a…
Derksen and Weyman described the cone of semi-invariants associated with a quiver. We give an inductive description of this cone, followed by an example of refinement of the inequalities characterising anti-invariant weights in the case of…
We prove the NP-hardness of the problem whether a given word can be derived from a given regular grammar without repeated occurrence of any nonterminal.
We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…
It is widely claimed that the quantile function is equivariant under increasing transformations. We show by a counterexample that this is not true (even for strictly increasing transformations). However, we show that the quantile function…