English
Related papers

Related papers: Complexity of quiver mutation equivalence

200 papers

We classify the connected quivers with the property that all the quivers in their mutation class have the same number of arrows. These are the ones having at most two vertices, or the ones arising from triangulations of marked bordered…

Combinatorics · Mathematics 2011-04-05 Sefi Ladkani

Machine learning is becoming an increasingly valuable tool in mathematics, enabling one to identify subtle patterns across collections of examples so vast that they would be impossible for a single researcher to feasibly review and analyze.…

Machine Learning · Computer Science 2025-08-05 Jesse He , Helen Jenne , Herman Chau , Davis Brown , Mark Raugas , Sara Billey , Henry Kvinge

We show that for any positive integer $n$, there exists a quiver $Q$ with $O(n^2)$ vertices and $O(n^2)$ edges such that any quiver on $n$ vertices is a full subquiver of a quiver mutation equivalent to $Q$. We generalize this statement to…

Combinatorics · Mathematics 2021-04-13 Sergey Fomin , Kiyoshi Igusa , Kyungyong Lee

We characterize the marked bordered unpunctured oriented surfaces with the property that all the Jacobian algebras of the quivers with potentials arising from their triangulations are derived equivalent. These are either surfaces of genus g…

Representation Theory · Mathematics 2011-02-22 Sefi Ladkani

A hereditary property of quivers is a property preserved by restriction to any full subquiver. Similarly, a mutation-invariant property of quivers is a property preserved by mutation. Using forks, a class of quivers developed by M.…

Combinatorics · Mathematics 2024-01-29 Tucker J. Ervin

A "weight" on a quiver $Q$ with values in a group $G$ is a function which assigns an element of $G$ for each arrow in $Q$. This paper shows that the essential steps in the mutation of quivers with potential [DWZ] goes through with weights…

Representation Theory · Mathematics 2018-03-12 Kiyoshi Igusa , Moses Kim

For a quiver with potential, Derksen, Weyman and Zelevinsky defined a combinatorial transformation - mutations. Mukhopadhyay and Ray, on the other hand, tell us how to compute Seiberg dual quivers for some quivers with potentials through a…

Rings and Algebras · Mathematics 2010-05-07 Jorge Vitória

We study the boundedness of a mutation class for quivers with real weights. The main result is a characterization of bounded mutation classes for real quivers of rank 3.

Combinatorics · Mathematics 2026-02-11 Roger Casals , Kenton Ke

Machine learning (ML) has emerged as a powerful tool in mathematical research in recent years. This paper applies ML techniques to the study of quivers -- a type of directed multigraph with significant relevance in algebra, combinatorics,…

Combinatorics · Mathematics 2025-09-11 Kymani T. K. Armstrong-Williams , Edward Hirst , Blake Jackson , Kyu-Hwan Lee

We use weighted unfoldings of quivers to provide a categorification of mutations of quivers of types $I_2(2n)$, thus extending the construction of categorifications of mutations of quivers to all finite types.

Representation Theory · Mathematics 2025-03-11 Drew Damien Duffield , Pavel Tumarkin

In this paper, we study structural properties of finite mutation type quivers. In particular, we obtain a characterization of finite mutation type quivers that are associated with triangulations of surfaces and give a new numerical…

Combinatorics · Mathematics 2010-04-27 Ahmet Seven

We give a precise definition of mutation of skew symmetrizable matrices over group rings and relate it to folding and mutation of quivers with symmetries. These matrices can have non-zero diagonal entries and we explain a mutation rule in…

Combinatorics · Mathematics 2026-01-23 Dani Kaufman , Carmen Alves Sabin

For any quiver mutation sequence, we define a pair of matrices that describe a fixed point equation of a cluster transformation determined from the mutation sequence. We give an explicit relationship between this pair of matrices and the…

Combinatorics · Mathematics 2020-01-07 Yuma Mizuno

A quiver mutation loop is a sequence of mutations and vertex relabelings, along which a quiver transforms back to the original form. For a given mutation loop, we introduce a quantity called a partition q-series. The partition q-series are…

Mathematical Physics · Physics 2015-06-01 Akishi Kato , Yuji Terashima

Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…

Combinatorics · Mathematics 2020-01-28 Omid Etesami , Willem H. Haemers

Totally proper quivers, introduced by S.~Fomin and the author arXiv:2406.03604, have many useful properties including powerful mutation invariants. We show that every mutation-acyclic quiver (i.e., a quiver that is mutation equivalent to an…

Representation Theory · Mathematics 2025-10-27 Scott Neville

We classify all mutation-finite quivers with real weights. We show that every finite mutation class not originating from an integer skew-symmetrizable matrix has a geometric realization by reflections. We also explore the structure of…

Combinatorics · Mathematics 2022-05-04 Anna Felikson , Pavel Tumarkin

We survey results on mutations of Jacobian algebras, while simultaneously extending them to the more general setup of frozen Jacobian algebras, which arise naturally from dimer models with boundary and in the context of the additive…

Representation Theory · Mathematics 2021-06-09 Matthew Pressland

We provide a quiver description for Cherkis bow varieties in arbitrary type. We explain how this generalizes the construction of Nakajima quiver varieties. We give criteria for stability, non-emptiness, smoothness and discuss deformations.…

Representation Theory · Mathematics 2025-09-03 Tiziano Gaibisso

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

Computational Complexity · Computer Science 2013-07-02 Christopher Hillar , Lek-Heng Lim
‹ Prev 1 2 3 10 Next ›