Related papers: Complexity of quiver mutation equivalence
We consider the problem of testing whether an unknown unitary is close to a specified level of the Clifford hierarchy. Bu, Gu, and Jaffe proposed a candidate tester for this task based on a connection with noncommutative analogues of the…
The notions of equivalence and strict equivalence for order one differential equations are introduced. The more explicit notion of strict equivalence is applied to examples and questions concerning autonomous equations and equations having…
A permutation of n letters is k-prolific if each (n-k)-subset of the letters in its one-line notation forms a unique pattern. We present a complete characterization of k-prolific permutations for each k, proving that k-prolific permutations…
In this note we investigate under which conditions the dual of the flow polytope (henceforth referred to as the `dual flow polytope') of a quiver is k-neighborly, for generic weights near the canonical weight. We provide a lower bound on k,…
For a quiver with weighted arrows we define gauge-theory K-theoretic W-algebra generalizing the definition of Shiraishi et al., and Frenkel and Reshetikhin. In particular, we show that the qq-character construction of gauge theory presented…
To a finite quiver equipped with a positive integer on each of its vertices, we associate a holomorphic symplectic manifold having some parameters. This coincides with Nakajima's quiver variety with no stability parameter/framing if the…
Knot theory is actively studied both by physicists and mathematicians as it provides a connecting centerpiece for many physical and mathematical theories. One of the challenging problems in knot theory is distinguishing mutant knots. Mutant…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
A shuffle of two strings is formed by interleaving the characters into a new string, keeping the characters of each string in order. A string is a square if it is a shuffle of two identical strings. There is a known polynomial time dynamic…
A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…
Let $n \geq 2$. We introduce the notion of $n$-representations of quivers, and we explicitly provide concrete examples of $2$-representations of quivers. We establish the categories of $n$-representations and investigate kernels and…
We try to clarify the relations between quiver varieties of type A and Kraft-Pocesi proof of normality of nilpotent conjugacy classes closures.
Convolution in Borel-Moore homology plays an important role in Nakajima's construction of representations of the Heisenberg algebra and of modified enveloping algebras of Kac-Moody algebras. In its most basic form, convolution between two…
We show that the graph transformation problem of turning a simple graph into an Eulerian one by a minimum number of single edge switches is NP-hard. Further, we show that any simple Eulerian graph can be transformed into any other such…
The unrestricted red size of a quiver is the maximal number of red vertices in its framed quiver after any given mutation sequence. In a 2023 paper by E. Bucher and J. Machacek, it was shown that connected, mutation-finite quivers either…
Many combinatorial problems can be formulated as "Can I transform configuration 1 into configuration 2, if certain transformations only are allowed?". An example of such a question is: given two k-colourings of a graph, can I transform the…
We associate a coloured quiver to a rigid object in a Hom-finite 2-Calabi--Yau triangulated category and to a partial triangulation on a marked (unpunctured) Riemann surface. We show that, in the case where the category is the generalised…
We prove a conjecture of Nakajima (for type A the result was announced by Ginzburg- Vasserot) giving a geometric realization, via quiver varieties, of the Yangian of type ADE (and more in general of the Yangian associated to every symmetric…
We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in…
The \emph{linear vertex arboricity} of a graph is the smallest number of sets into which the vertices of a graph can be partitioned so that each of these sets induces a linear forest. Chaplick et al. [JoCG 2020] showed that, somewhat…