Weak Polynomial Identities for M1,1(E)

* Partially supported by Universita` di Bari: progetto “Strutture algebriche, geometriche e descrizione degli invarianti ad esse associate”.

Z2-Graded Polynomial Identities for Superalgebras of Block-Triangular Matrices

000 Mathematics Subject Classification: Primary 16R50, Secondary 16W55.

A Basis for Z-Graded Identities of Matrices over Infinite Fields

2000 Mathematics Subject Classification: 16R10, 16R20, 16R50

Involution Matrix Algebras – Identities and Growth

2000 Mathematics Subject Classification: 16R50, 16R10.

Asymptotic Behaviour of Colength of Varieties of Lie Algebras

This project was partially supported by RFBR, grants 99-01-00233, 98-01-01020 and 00-15-96128.

Exponents of Subvarieties of Upper Triangular Matrices over Arbitrary Fields are Integral

Partially supported by grant RFFI 98-01-01020.

The Variety of Leibniz Algebras Defined by the Identity x(y(zt)) ≡ 0

2000 Mathematics Subject Classification: Primary: 17A32; Secondary: 16R10, 16P99, 17B01, 17B30, 20C30

q-Leibniz Algebras

2000 Mathematics Subject Classification: Primary 17A32, Secondary 17D25.

Free Bicommutative Algebras

2000 Mathematics Subject Classification: Primary 17A50, Secondary 16R10, 17A30, 17D25, 17C50.

On the Hyperbolicity Domain of the Polynomial x^n + a1x^(n-1) + 1/4+ an

∗ Partially supported by INTAS grant 97-1644

Polynomial Automorphisms Over Finite Fields

It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).

Dubrovin Type Equations for Completely Integrable Systems Associated with a Polynomial Pencil

Dubrovin type equations for the N -gap solution of a completely integrable system associated with a polynomial pencil is constructed and then integrated to a system of functional equations. The approach used to derive those results is a generalization of the familiar process of finding the 1-soliton (1-gap) solution by integrating the ODE obtained from the soliton equation via the substitution u = u(x + λt).

Quadratic Mean Radius of a Polynomial in C(Z)

* Dedicated to the memory of Prof. N. Obreshkoff

Polynomial Expansions for Solutions of Higher-Order Bessel Heat Equation in Quantum Calculus

Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90

The Eccentric Connectivity Polynomial of some Graph Operations

The eccentric connectivity index of a graph G, ξ^C, was proposed by Sharma, Goswami and Madan. It is defined as ξ^C(G) = ∑ u ∈ V(G) degG(u)εG(u), where degG(u) denotes the degree of the vertex x in G and εG(u) = Max{d(u, x) | x ∈ V (G)}. The eccentric connectivity polynomial is a polynomial version of this topological index. In this paper, exact formulas for the eccentric connectivity polynomial of Cartesian product, symmetric difference, disjunction and join of graphs are presented.