Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-26T04:42:58.423Z Has data issue: false hasContentIssue false

GROUP ACTIONS AND ASYMPTOTIC BEHAVIOR OF GRADED POLYNOMIAL IDENTITIES

Published online by Cambridge University Press:  24 March 2003

A. GIAMBRUNO
Affiliation:
Dipartimento di Matematica ed Applicazioni, Università di Palermo, 90123 Palermo, [email protected]
S. MISHCHENKO
Affiliation:
Department of Algebra and Geometric Computations, Faculty of Mathematics and Mechanics, Ulyanovsk State University, Ulyanovsk 432700, [email protected]
M. ZAICEV
Affiliation:
Department of Algebra, Faculty of Mathematics and Mechanics, Moscow State University, Moscow 119899, [email protected]
Get access

Abstract

Let $F$ be an algebraically closed field of characteristic $0$ , and let $A$ be a $G$ -graded algebra over $F$ for some finite abelian group $G$ . Through $G$ being regarded as a group of automorphisms of $A$ , the duality between graded identities and $G$ -identities of $A$ is exploited. In this framework, the space of multilinear $G$ -polynomials is introduced, and the asymptotic behavior of the sequence of $G$ -codimensions of $A$ is studied.

Two characterizations are given of the ideal of $G$ -graded identities of such algebra in the case in which the sequence of $G$ -codimensions is polynomially bounded. While the first gives a list of $G$ -identities satisfied by $A$ , the second is expressed in the language of the representation theory of the wreath product $G \wr S_n$ , where $S_n$ is the symmetric group of degree $n$ .

As a consequence, it is proved that the sequence of $G$ -codimensions of an algebra satisfying a polynomial identity either is polynomially bounded or grows exponentially.

Type
Notes and Papers
Copyright
The London Mathematical Society, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)