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

∗ Partially supported by INTAS grant 97-1644

Weak Polynomial Identities for M1,1(E)

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

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

Neural Control of Chaos and Aplications

Signal processing is an important topic in technological research today. In the areas of nonlinear dynamics search, the endeavor to control or order chaos is an issue that has received increasing attention over the last few years. Increasing interest in neural networks composed of simple processing elements (neurons) has led to widespread use of such networks to control dynamic systems learning. This paper presents backpropagation-based neural network architecture that can be used as a controller to stabilize unsteady periodic orbits. It also presents a neural network-based method for transferring the dynamics among attractors, leading to more efficient system control. The procedure can be applied to every point of the basin, no matter how far away from the attractor they are. Finally, this paper shows how two mixed chaotic signals can be controlled using a backpropagation neural network as a filter to separate and control both signals at the same time. The neural network provides more effective control, overcoming the problems that arise with control feedback methods. Control is more effective because it can be applied to the system at any point, even if it is moving away from the target state, which prevents waiting times. Also control can be applied even if there is little information about the system and remains stable longer even in the presence of random dynamic noise.

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.

On Arrangements of Real Roots of a Real Polynomial and Its Derivatives

2000 Mathematics Subject Classification: 12D10.

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

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

On the Factorization of the Poincaré Polynomial: A Survey

2000 Mathematics Subject Classification: 13P05, 14M15, 14M17, 14L30.

Binomial Skew Polynomial Rings, Artin-Schelter Regularity, and Binomial Solutions of the Yang-Baxter Equation

2000 Mathematics Subject Classification: Primary 81R50, 16W50, 16S36, 16S37.

On Root Arrangements of Polynomial-Like Functions and their Derivatives

2000 Mathematics Subject Classification: 12D10.

A Geometrical Construction for the Polynomial Invariants of some Reflection Groups

2000 Mathematics Subject Classification: Primary 20F55, 13F20; Secondary 14L30.

Operators with Polynomial Coefficients and Generalized Gelfand-Shilov Classes

2010 Mathematics Subject Classification: Primary 35S05, 35J60; Secondary 35A20, 35B08, 35B40.