AbstractLet n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every at most-n-dimensional representation of R is semisimple, and (2) if there exist nonsplit extensions of non-isomorphic irreducible R-modules whose dimensions sum to no greater than n
AbstractLet A be a semisimple, n-dimensional, commutative algebra over a field F. Fix a basis B of A...
AbstractWe introduce and generalize the notion of Castelnuovo–Mumford regularity for representations...
Let �� be a division ring, and G a finite group of automorphisms of E whose elements are distinct mo...
AbstractLet n be a positive integer, and let R be a finitely presented (but not necessarily finite d...
AbstractWe describe an algorithmic test, using the “standard polynomial identity" (and elementary co...
AbstractLet n be a positive integer, and let k be a field (of arbitrary characteristic) accessible t...
Abstract. Let n be a positive integer, and let k be a field (of arbitrary characteristic) accessible...
AbstractWe present a new deterministic algorithm to test constructively for isomorphism between two ...
AbstractWe describe an algorithmic test, using the “standard polynomial identity" (and elementary co...
Given a finite-dimensional noncommutative semisimple algebra A over C with involution, we show that ...
We present polynomial time algorithms for some fundamental tasks from representation theory of finit...
AbstractWe show that computing the dimension of a semi-algebraic set of Rn is a NPR-complete problem...
AbstractAn algorithm to construct a maximal order Λ in a finite-dimensional semisimple rational alge...
AbstractThis paper is motivated by a link between algebraic proof complexity and the representation ...
The paper considers computer algebra in a non-commutative setting. So far, suchinvestigations have b...
AbstractLet A be a semisimple, n-dimensional, commutative algebra over a field F. Fix a basis B of A...
AbstractWe introduce and generalize the notion of Castelnuovo–Mumford regularity for representations...
Let �� be a division ring, and G a finite group of automorphisms of E whose elements are distinct mo...
AbstractLet n be a positive integer, and let R be a finitely presented (but not necessarily finite d...
AbstractWe describe an algorithmic test, using the “standard polynomial identity" (and elementary co...
AbstractLet n be a positive integer, and let k be a field (of arbitrary characteristic) accessible t...
Abstract. Let n be a positive integer, and let k be a field (of arbitrary characteristic) accessible...
AbstractWe present a new deterministic algorithm to test constructively for isomorphism between two ...
AbstractWe describe an algorithmic test, using the “standard polynomial identity" (and elementary co...
Given a finite-dimensional noncommutative semisimple algebra A over C with involution, we show that ...
We present polynomial time algorithms for some fundamental tasks from representation theory of finit...
AbstractWe show that computing the dimension of a semi-algebraic set of Rn is a NPR-complete problem...
AbstractAn algorithm to construct a maximal order Λ in a finite-dimensional semisimple rational alge...
AbstractThis paper is motivated by a link between algebraic proof complexity and the representation ...
The paper considers computer algebra in a non-commutative setting. So far, suchinvestigations have b...
AbstractLet A be a semisimple, n-dimensional, commutative algebra over a field F. Fix a basis B of A...
AbstractWe introduce and generalize the notion of Castelnuovo–Mumford regularity for representations...
Let �� be a division ring, and G a finite group of automorphisms of E whose elements are distinct mo...