Related papers: Mutation Cycles from Reddening Sequences
We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…
Tilting mutation is a way of producing new tilting complexes from old ones replacing only one indecomposable summand. In this paper, we give a purely combinatorial procedure for performing tilting mutation of suitable algebras. As an…
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,…
We show that the mutation class of a finite quiver without oriented cycles is finite if and only is the quiver is either Dynkin, extended Dynkin or has at most two vertices.
We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…
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…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
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…
We prove $\textsf{NP-hardness}$ results for determining whether quivers are mutation equivalent to quivers with given properties. Specifically, determining whether a quiver is mutation-equivalent to a quiver with exactly $k$ arrows between…
Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…
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…
An adjacent $q$-cycle is a natural generalization of an adjacent transposition. We show that the number of adjacent $q$-cycles in a permutation maps to the sum of occurrences of two mesh patterns under Foata's fundamental transformation. As…
We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.
In this article, we will expand on the notions of maximal green and reddening sequences for quivers associated to cluster algebras. The existence of these sequences has been studied for a variety of applications related to Fomin and…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…
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…
Given a framed quiver, i.e. one with a frozen vertex associated to each mutable vertex, there is a concept of green mutation, as introduced by Keller. Maximal sequences of such mutations, known as maximal green sequences, are important in…
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…
We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…
We continue the work started in parts (I) and (II). In this part we classify which continuous type A quivers are derived equivalent and introduce the new continuous cluster category with E-clusters, which are a generalization of clusters.…