Search results for "LYN"

On ∗-polynomial identities for n × n matrices

1990

Asymptotics for the standard and the Capelli identities

2003

Let {c n (St k )} and {c n (C k )} be the sequences of codimensions of the T-ideals generated by the standard polynomial of degreek and by thek-th Capelli polynomial, respectively. We study the asymptotic behaviour of these two sequences over a fieldF of characteristic zero. For the standard polynomial, among other results, we show that the following asymptotic equalities hold: $$\begin{gathered} c_n \left( {St_{2k} } \right) \simeq c_n \left( {C_{k^2 + 1} } \right) \simeq c_n \left( {M_k \left( F \right)} \right), \hfill \\ c_n \left( {St_{2k + 1} } \right) \simeq c_n \left( {M_{k \times 2k} \left( F \right) \oplus M_{2k \times k} \left( F \right)} \right), \hfill \\ \end{gathered} $$ wher…

Growth of polynomial identities: is the sequence of codimensions eventually non-decreasing?

2014

Central polynomials and matrix invariants

1996

LetK be a field, charK=0 andM n (K) the algebra ofn×n matrices overK. If λ=(λ1,…,λ m ) andμ=(μ 1,…,μ m ) are partitions ofn 2 let $$\begin{gathered} F^{\lambda ,\mu } = \sum\limits_{\sigma ,\tau \in S_n 2} {\left( {\operatorname{sgn} \sigma \tau } \right)x_\sigma (1) \cdot \cdot \cdot x_\sigma (\lambda _1 )^{y_\tau } (1)^{ \cdot \cdot \cdot } y_\tau (\mu _1 )^{x\sigma } (\lambda _1 + 1)} \hfill \\ \cdot \cdot \cdot x_\sigma (\lambda _1 + \lambda _2 )^{y_\tau } (\mu _1 ^{ + 1} )^{ \cdot \cdot \cdot y_\tau } (\mu _1 + \mu _2 ) \hfill \\ \cdot \cdot \cdot x_\sigma (\lambda _1 + \cdot \cdot \cdot + \lambda _{\mu - 1} ^{ + 1} ) \hfill \\ \cdot \cdot \cdot x_\sigma (n^2 )^{y_\tau } (\mu _1 ^{ + \…

On the simultaneous determination of polynomial roots

1982

A variation on theorems of Jordan and Gluck

2006

Abstract Gluck proved that any finite group G has an abelian subgroup A such that | G : A | is bounded by a polynomial function of the largest degree of the complex irreducible characters of G . This improved on a previous bound of Isaacs and Passman. In this paper, we present a variation of this result that looks at the number of prime factors. All these results, in turn, may be seen as variations on the classical theorem of Jordan on linear groups.

Y-proper graded cocharacters and codimensions of upper triangular matrices of size 2, 3, 4

2012

Abstract Let F be a field of characteristic 0. We consider the upper triangular matrices with entries in F of size 2, 3 and 4 endowed with the grading induced by that of Vasilovsky. In this paper we give explicit computation for the multiplicities of the Y -proper graded cocharacters and codimensions of these algebras.

On the exponential growth of graded Capelli polynomials

2013

In a free superalgebra over a field of characteristic zero we consider the graded Capelli polynomials Cap M+1[Y,X] and Cap L+1[Z,X] alternating on M+1 even variables and L+1 odd variables, respectively. Here we compute the superexponent of the variety of superalgebras determinated by Cap M+1[Y,X] and Cap L+1[Z,X]. An essential tool in our computation is the generalized-six-square theorem proved in [3].

Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III

1980

In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…

Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation

1970

If, for each zero of a polynomial, an approximation is known, estimates for the errors of these approximations are given, based on the evaluation of the polynomial at these points. The procedure can be carried over to the case of multiple roots and root clusters using derivatives up to the orderk - 1, wherek is the multiplicity of the cluster.