Related papers: Red sizes of quivers
Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and computational biology, insdel codes have recently become a focal…
Inspired by recent work of Geiss-Leclerc-Schroer, we use Hom-finite cluster categories to give a good candidate set for a basis of (upper) cluster algebras with coefficients arising from quivers. This set consists of generic values taken by…
We propose a definition of expander representations of quivers, generalizing dimension (or linear algebra) expanders, as a qualitative refinement of slope stability. We prove existence of uniform expander representations for any wild quiver…
We describe the "generic" part of the character ring of general linear groups over a finite field in terms of quiver representations.
Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…
It is shown that certain transformations on quiver-dimension vector pairs induce isomorphisms on the corresponding moduli spaces of quiver representations and map a stable dimension vector to a stable dimension vector. This result combined…
[Abridged] We assemble a sample of 45 intermediate X-ray luminosity galaxy clusters at low redshifts using SDSS data to conduct a comprehensive investigation into the photometric variation of red sequence modal galaxy colours with…
Recently it has been noticed that many interesting combinatorial objects belong to a class of semigroups called left regular bands, and that random walks on these semigroups encode several well-known random walks. For example, the set of…
Given a matching between n red points and n blue points by line segments in the plane, we consider the problem of obtaining a crossing-free matching through flip operations that replace two crossing segments by two non-crossing ones. We…
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a…
We study rank-2 cluster scattering diagrams through moduli spaces of quiver representations and a recently developed combinatorial framework of tight gradings. Combining quiver-theoretic and combinatorial methods, we prove and extend a…
The purpose of this paper is to give an explicit formula for the number of non-isomorphic cluster-tilted algebras of type $A_n$, by counting the mutation class of any quiver with underlying graph $A_n$. It will also follow that if $T$ and…
Recently there has been considerable interest in studying the length and the depth of finite groups, algebraic groups and Lie groups. In this paper we introduce and study similar notions for algebras. Let $k$ be a field and let $A$ be an…
This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
In this paper, we compute the Frobenius dimension of any cluster tilted algebra of finite type. Moreover, we give conditions on the bounded quiver of a cluster tilted algebra $\Lambda$ such that $\Lambda$ has non-trivial open Frobenius…
We find sharp upper and lower bounds for the degree of an algebraic number in terms of the $Q$-dimension of the space spanned by its conjugates. For all but seven nonnegative integers $n$ the largest degree of an algebraic number whose…
The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees. By and large, this is too ambitious an objective. As understood, sizing up means looking closely at the…
Motivated by applications in DNA-based data storage, constrained codes have attracted a considerable amount of attention from both academia and industry. We study the maximum cardinality of constrained codes for which the constraints can be…
Hadwiger and Haj\'{o}s conjectured that for every positive integer $t$, $K_{t+1}$-minor free graphs and $K_{t+1}$-topological minor free graphs are properly $t$-colorable, respectively. Clustered coloring version of these two conjectures…