Related papers: Detecting Infinitely Many Semisimple Representatio…
For monomial special multiserial algebras, which in general are of wild representation type, we construct radical embeddings into algebras of finite representation type. As a consequence, we show that the representation dimension of…
In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall,…
A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…
In this paper we prove an identity in terms of generating functions which enables us to calculate the numbers of isomorphism classes of absolutely indecomposable semistable representations of quivers over finite fields.
We present a partial proof of van Hoeij-Abramov conjecture about the algorithmic possibility of computation of finite sums of rational functions. The theoretical results proved in this paper provide an algorithm for computation of a large…
We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…
We prove a general result on presentations of finitely-generated algebras and apply it to obtain nice presentations for some noncommutative algebras arising in the matrix bispectral problem. By "nice presentation" we mean a presentation…
Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…
We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…
We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…
Building on \'Esik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebra with tests. Similarly as \'Esik and Kuich, we assume…
An extension of algebras is a homomorphism of algebras preserving identities. We use extensions of algebras to study the finitistic dimension conjecture over Artin algebras. Let $f: B \to A$ be an extension of Artin algebras. We denote by…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
We investigate the characters of some finite-dimensional representations of the quantum affine algebras $U_q(\hat{g})$ using the action of the copy of $U_q(g)$ embedded in it. First, we present an efficient algorithm for computing the…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…
A field $k$ is called large if every irreducible $k$-curve with a $k$-rational smooth point has infinitely many $k$-points. Let $k$ be a perfect large field and let $f \in k[x]$. Consider the evaluation map $f_k: k \to k$. Assume that $f_k$…
We study the category $\mathcal{A}$ of smooth semilinear representations of the infinite symmetric group over the field of rational functions in infinitely many variables. We establish a number of results about the structure of…