Related papers: Semi-invariant pictures and two conjectures on max…

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

The problem we are considering is the following. A colorblind player is given a set $B = \{b_1,b_2,...,b_N\}$ of $N$ colored balls. He knows that each ball is colored either red or green, and that there are less green balls (this will be…

A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on a…

This is my PhD thesis supervised by Professor Jerzy Weyman. A symmetric quiver $(Q,\sigma)$ is a finite quiver without oriented cycles $Q=(Q_0,Q_1)$ equipped with a contravariant involution $\sigma$ on $Q_0\sqcup Q_1$. The involution allows…

For modules over an artin algebra a linear stability condition is given by a "central charge" and a nonlinear stability condition is given by the wall-crossing sequence of a "green path". Finite Harder-Narasimhan stratifications of the…

Let $K$ be a field, $Q$ a quiver, and $\mathcal{A}$ the ideal of the path algebra $KQ$ that is generated by the arrows of $Q$. We present old and new results about the representation theories of the truncations $KQ/\mathcal{A}^L$, $L \in…

In this paper, we prove that the maximal order of a semiregular element in the automorphism group of a cubic vertex-transitive graph X does not tend to infinity as the number of vertices of X tends to infinity. This gives a solution (in the…

Let D be a division algebra with center F. A maximal subfield of D is defined to be a field K such that CD(K) = K; that is, K is its own centralizer in D. A maximal subfield K is said to be self-invariant if it normalises by itself, i.e.…

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,…

Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…

We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…

We use recent results on matrix semi-invariants to give degree bounds on generators for the ring of semi-invariants for quivers with no oriented cycles.

We consider two (densely defined) involutions on the space of $q\times q$ matrices; $I(x_{ij})$ is the matrix inverse of $(x_{ij})$, and $J(x_{ij})$ is the matrix whose $ij$th entry is the reciprocal $x_{ij}^{-1}$. Let $K=I\circ J$. The set…

Let $Q$ be a rank 3 mutation-cyclic quiver. It is known that every $\mathbf{c}$-vector of $Q$ is a solution to a quadratic equation of the form $$\sum_{i=1}^3 x_i^2 + \sum_{1\leq i<j\leq 3} \pm q_{ij} x_i x_j =1,$$where $q_{ij}$ is the…

We study maximum antichains in two posets related to quiver representations. Firstly, we consider the set of isomorphism classes of indecomposable representations ordered by inclusion. For various orientations of the Dynkin diagram of type…

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.

The set of forks is a class of quivers introduced by M. Warkentin, where every connected mutation-infinite quiver is mutation equivalent to infinitely many forks. Let $Q$ be a fork with $n$ vertices, and $\boldsymbol{w}$ be a…

We use a geometric description of $m$-cluster categories of Dynkin type $A$ to count the the number of coloured quivers in the $m$-mutation class of quivers of Dynkin type $A$. This is related to angulations of polygons and the cell-growth…

The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory and other related fields. We study an old problem of Linial…

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…