English
Related papers

Related papers: Complexity of quiver mutation equivalence

200 papers

This paper studies the geometric and algebraic aspects of the moduli spaces of quivers of fence type. We first provide two quotient presentations of the quiver varieties and interpret their equivalence as a generalized Gelfand-MacPherson…

Algebraic Geometry · Mathematics 2013-01-15 Yi Hu , Sangjib Kim

We introduce and study the notion of equivariant $\mathbb{Q}$-sliceness for strongly invertible knots. On the constructive side, we prove that every Klein amphichiral knot, which is a strongly invertible knot admitting a compatible negative…

Geometric Topology · Mathematics 2024-12-13 Alessio Di Prisa , Oğuz Şavk

This paper studies questions of coherence and strictification related to self-similarity - the identity $S\cong S\otimes S$ in a (semi-)monoidal category. Based on Saavedra's theory of units, we first demonstrate that strict self-similarity…

Category Theory · Mathematics 2015-02-10 Peter Hines

We present a unified mathematical framework that elegantly describes minimally SUSY gauge theories in even dimension, ranging from $6d$ to $0d$, and their dualities. This approach combines recent developments on graded quiver with…

High Energy Physics - Theory · Physics 2018-09-12 Sebastian Franco , Gregg Musiker

Can the vertices of a graph $G$ be partitioned into $A \cup B$, so that $G[A]$ is a line-graph and $G[B]$ is a forest? Can $G$ be partitioned into a planar graph and a perfect graph? The NP-completeness of these problems are just special…

Combinatorics · Mathematics 2007-05-23 Alastair Farrugia

In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to…

Combinatorics · Mathematics 2017-05-04 Nathan Lhote , Mohammed Senhaji

We present a faster method to determine all singularities of quiver moduli spaces up to smooth equivalence. We show that every quiver controls a large family of noncommutative compact manifolds.

Rings and Algebras · Mathematics 2014-09-23 Lieven Le Bruyn

In type A we find equivalences of geometries arising in three settings: Nakajima's (``framed'') quiver varieties, conjugacy classes of matrices and loop Grassmannians. These are now all given by explicit formulas. In particular, we embedd…

Representation Theory · Mathematics 2025-03-18 Ivan Mirkovic , Maxim Vybornov

Motivated by the problem of classifying quantum symmetries of non-semisimple, finite-dimensional associative algebras, we define a notion of connection between bounded quivers and build a bicategory of bounded quivers and quiver…

Category Theory · Mathematics 2024-04-29 Sean Thompson

In the present paper we consider a general family of two dimensional wave equations which represents a great variety of linear and nonlinear equations within the framework of the transformations of equivalence groups. We have investigated…

Mathematical Physics · Physics 2025-07-24 Saadet S. Özer

We prove that a prime knot K is not determined by its p-fold cyclic branched cover for at most two odd primes p. Moreover, we show that for a given odd prime p, the p-fold cyclic branched cover of a prime knot K is the p-fold cyclic…

Geometric Topology · Mathematics 2014-02-26 M. Boileau , L. Paoluzzi

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

Rings and Algebras · Mathematics 2011-07-13 A. A. Lopatin

We give a precise definition of folded quivers and folded cluster algebras. We give many examples of including some with finite mutation structure that do not have analogues in the unfolded cases. We relate these examples to the finite…

Combinatorics · Mathematics 2024-05-28 Dani Kaufman

In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input permutations is fixed and show that the problem is NP-hard for…

Combinatorics · Mathematics 2007-06-13 Mathilde Bouvel , Dominique Rossin , Stephane Vialette

We prove the computational intractability of rotating and placing $n$ square tiles into a $1 \times n$ array such that adjacent tiles are compatible--either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as…

Computational Complexity · Computer Science 2017-01-03 Jeffrey Bosboom , Erik D. Demaine , Martin L. Demaine , Adam Hesterberg , Pasin Manurangsi , Anak Yodpinyanee

We discuss certain structural analogies between supersymmetric quiver gauge theories and lattice models leading to fracton phases of matter. In particular, classes of quiver models can be viewed as lattice models having sub-system…

High Energy Physics - Theory · Physics 2021-10-04 Shlomo S. Razamat

We define derived equivalent invariants for gentle algebras, constructed in an easy combinatorial way from the quiver with relations defining these algebras. Our invariants consist of pairs of natural numbers and contain important…

Representation Theory · Mathematics 2019-03-05 Diana Avella-Alaminos , Christof Geiss

This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…

Numerical Analysis · Mathematics 2013-03-11 Yuri R. Nesterenko

We introduce a new class of smooth correspondences between Nakajima quiver varieties called split parabolic quiver varieties, and study their properties. We use these correspondences to construct an explicit resolution of singularities of…

Algebraic Geometry · Mathematics 2026-02-02 Nicolle González , Eugene Gorsky , José Simental

We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and…

Computational Complexity · Computer Science 2026-04-08 Marco Sälzer , Martin Lange