2009
DOI: 10.1016/j.jpaa.2009.03.003
|View full text |Cite
|
Sign up to set email alerts
|

Polynomial growth and identities of superalgebras and star-algebras

Abstract: We study associative algebras with 1 endowed with an automorphism or antiautomor-\ud phism ' of order 2, i.e., superalgebras and algebras with involution. For any fixed k >=1,\ud we construct associative '-algebras whose '-codimension sequence is given asymptoti-\ud cally by a polynomial of degree k whose leading coefficient is the largest or smallest possi-\ud ble

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…Much effort has been put into the study of varieties V of polynomial growth, i.e., such that c n (V) is polynomially bounded [5,12,[17][18][19][20][21].…”
Section: Characterizing Algebras Of Polynomial Codimension Growthmentioning
confidence: 99%
“…Much effort has been put into the study of varieties V of polynomial growth, i.e., such that c n (V) is polynomially bounded [5,12,[17][18][19][20][21].…”
Section: Characterizing Algebras Of Polynomial Codimension Growthmentioning
confidence: 99%
“…Let A ∈ var gr (G gr k ) and suppose that c gr n (A) ≈ qn k , for some q > 0. We shall prove that A ∼ T 2 [14,Theorem 3.4].) Let k 2.…”
Section: Lemma 62 Letmentioning
confidence: 99%
“…, is the dimension of the space of multilinear * -polynomials in n fixed variables in the corresponding relatively free algebra with involution of countable rank. Such sequence has been extensively studied (see [8,15,16,17,18,19] ) but it turns out that it can be explicitly computed only in very few cases. In case A is a PI-algebra, i.e, it satisfies a non trivial polynomial identity, it was proved in [9] that, as in the ordinary case, c * n (A), n = 1, 2, .…”
Section: Introductionmentioning
confidence: 99%