Related papers: Cyclically ordered quivers
Some binary quadratic operads are endowed with anticyclic structures and their characteristic functions as anticyclic operads are determined, or conjectured in one case.
Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…
We consider a quiver structure on the set of quandle colorings of an oriented knot or link diagram. This structure contains a wealth of knot and link invariants and provides a categorification of the quandle counting invariant in the most…
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…
In this article, we present two new characterizations of circular-arc bigraphs based on their vertex ordering. Also, we provide a characterization of circular-arc bigraphs in terms of forbidden patterns with respect to a particular ordering…
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…
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 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…
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…
A mutation cycle is a cycle in a graph whose vertices are labeled by the quivers in a given mutation class and whose edges correspond to single mutations. For any fixed $n\ge 4$, we describe arbitrarily long mutation cycles involving…
This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…
This paper is a survey on invariants of representations of quivers and their generalizations. We present the description of generating systems for invariants and relations between generators.
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…
We define a special sort of weighted oriented graphs, signed quivers. Each of these yields a symmetric quiver, i.e., a quiver endowed with an involutive anti-automorphism and the inherited signs. We develop a representation theory of…
The problem of Turing pattern formation has attracted much attention in nonlinear science as well as physics, chemistry and biology. So far all Turing patterns have been observed in stationary and oscillatory media only. In this letter we…
Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges induce a spanning tree of $G$. In this project, we study cyclic base ordering of…
We define mutation on coloured quivers associated to tilting objects in higher cluster categories. We show that this operation is compatible with the mutation operation on the tilting objects. This gives a combinatorial approach to tilting…
Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we…
The simplicial endofunctor induced by a comonad in some category may underly a cyclic object in its category of endofunctors. The cyclic symmetry is then given by a sequence of natural transformations. We write down the commutation…
A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…