Minimal right determiners of irreducible morphisms in string algebras
classification
🧮 math.RT
keywords
lambdanumberdeterminersirreducibleminimalmorphismsrightstring
read the original abstract
Let $\Lambda$ be a finite dimensional string algebra over a field with the quiver $Q$ such that the underlying graph of $Q$ is a tree, and let $|\Det(\Lambda)|$ be the number of the minimal right determiners of all irreducible morphisms between indecomposable left $\Lambda$-modules. Then we have $$|\Det(\Lambda)|=2n-p-q-1,$$ where $n$ is the number of vertices in $Q$, $p=|\{i\mid i$ is a source in $Q$ with two neighbours$\}|$ and $q$ is the number of non-zero vertex ideals of $\Lambda$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.