2005
DOI: 10.1201/9781439863725
|View full text |Cite
|
Sign up to set email alerts
|

Computational Aspects of Polynomial Identities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
64
0
14

Year Published

2005
2005
2020
2020

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 76 publications
(78 citation statements)
references
References 0 publications
0
64
0
14
Order By: Relevance
“…It is well-known from the theory (see [7]) that any finitely generated algebra is PI-equivalent to some finite dimensional algebra. For each n ≥ 2, we exhibit a finite dimensional algebra PI-equivalent to F n A .…”
Section: Downloaded By [University Of Nebraska Lincoln] At 18:57 24 mentioning
confidence: 99%
“…It is well-known from the theory (see [7]) that any finitely generated algebra is PI-equivalent to some finite dimensional algebra. For each n ≥ 2, we exhibit a finite dimensional algebra PI-equivalent to F n A .…”
Section: Downloaded By [University Of Nebraska Lincoln] At 18:57 24 mentioning
confidence: 99%
“…Besides [4], [5], [3] and [1], let us also mention [6] and [7] which provide a generalization of Kemer's theorem for PI G-graded algebras where G is finite abelian and for affine PI algebras with involution.…”
Section: Introductionmentioning
confidence: 99%
“…The concept of a graded identity with involution (graded * -identity) is the union of concepts of a graded identity (see [30], [31], [28], [29]) and identity with involution (see, e.g., [29]). It inherits the principal features of the notion of an ordinary polynomial identity.…”
Section: Introductionmentioning
confidence: 99%
“…It inherits the principal features of the notion of an ordinary polynomial identity. We refer the reader to the textbooks [25], [26], [29], and to [30], [31] on questions concerning ordinary polynomial identities.…”
Section: Introductionmentioning
confidence: 99%