Related papers: Mutation Cycles from Reddening Sequences
A widely studied model for generating sequences is to ``evolve'' them on a tree according to a symmetric Markov process. We prove that model trees tend to be maximally ``far apart'' in terms of variational distance.
In this work we approach three-dimensional evolution algebras from certain constructions performed on two-dimensional algebras. More precisely, we provide four different constructions producing three-dimensional evolution algebras from…
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}$.
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
For a fixed root of a quiver, it is a very hard problem to construct all or even only one indecomposable representation with this root as dimension vector. We investigate two methods which can be used for this purpose. In both cases we get…
In this paper we state and prove a formula for the permutations associated to reddening and loop sequences in $A_n$ straight orientation using the picture group. In particular this applies to maximal green sequences in $A_n$ straight…
We will give quiver presentations of the Grothendieck constructions of functors from a small category to the 2-category of $\Bbbk$-categories for a commutative ring $\Bbbk$.
A mutation loop of a valued quiver $Q$, is a combination of quiver automorphisms (permutations of vertices and valuations) and mutations that sends $Q$ to itself. In this article we study what we called \emph{global mutations loops} which…
Additional remarks and questions for transseries. In particular: properties of composition for transseries; the recursive nature of the construction of R[[[ x ]]]; modes of convergence for transseries. There are, at this stage, questions…
Sequencing by synthesis is the underlying technology for many next-generation DNA sequencing platforms. We developed a new model, the fixed flow cycle model, to derive the distributions of sequence length for a given number of flow cycles…
Quiver mutation plays a crucial role in the definition of cluster algebras by Fomin and Zelevinsky. It induces an equivalence relation on the set of all quivers without loops and two-cycles. A quiver is called mutation-acyclic if it is…
In this work we establish some new interleavers based on permutation functions. The inverses of these interleavers are known over a finite field $\mathbb{F}_q$. For the first time M\"{o}bius and R\'edei functions are used to give new…
Nuclear multifragmentation process can be viewed as a recombination of nucleons into clusters of various sizes. In a combinatorial analysis, various moments of cluster size distribution appear to be quite simple in terms of canonical…
In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…
Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…
Exceptional sequences are certain ordered sequences of quiver representations. We use noncrossing edge-labeled trees in a disk with boundary vertices (expanding on T. Araya's work) to classify exceptional sequences of representations of Q,…
We show that the number of quivers in the mutation class of a quiver of Dynkin type $D_n$ is given by $\sum_{d|n} \phi(n/d)\binom{2d}{d}/(2n)$ for $n \geq 5$. To obtain this formula, we give a correspondence between the quivers in the…
We give an explicit description of the mutation classes of quivers of type \tilde{A}_n. Furthermore, we provide a complete classification of cluster tilted algebras of type \tilde{A}_n up to derived equivalence. We show that the bounded…
We use combinatorics of quivers and the corresponding surfaces to study maximal green sequences of minimal length for quivers of type $\mathbb{A}$. We prove that such sequences have length $n+t$, where $n$ is the number of vertices and $t$…
We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and…