|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Constructing irreducible representations of finitely presented algebras | | Edward S. Letzter
; | | Date: |
25 Oct 1999 | | Subject: | Rings and Algebras; Representation Theory; Commutative Algebra MSC-class: 16-08;13P10 | math.RA math.AC math.RT | | Abstract: | By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In slightly more detail: Assume that $n$ is a positive integer, that $k$ is a computable field, that $ar{k}$ denotes the algebraic closure of $k$, and that $M_n(ar{k})$ denotes the algebra of $n imes n$ matrices with entries in $ar{k}$. Let $R$ be a finitely presented $k$-algebra. Calculating over $k$, the procedure will (a) decide whether an irreducible representation $R o M_n(ar{k})$ exists, and (b) explicitly construct an irreducible representation $R o M_n(ar{k})$ if at least one exists. (For (b), it is necessary to assume that $k[x]$ is equipped with a factoring algorithm.) An elementary example is worked through. | | Source: | arXiv, math.RA/9910132 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER