Almost strict total positivity and a class of Hurwitz polynomials

We establish sufficient conditions for a matrix to be almost totally positive, thus extending a result of Craven and Csordas who proved that the corresponding conditions guarantee that a matrix is strictly totally positive. Then we apply our main result in order to obtain a new criteria for a real algebraic polynomial to be a Hurwitz one. The properties of the corresponding extremal Hurwitz polynomials are discussed. (C) 2004 Elsevier B.V. All rights reserved.

Zero sets of bivariate Hermite polynomials

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Generalization of a Conjecture in the Geometry of Polynomials

In this paper we survey work on and around the following conjecture, which was first stated about 45 years ago: If all the zeros of an algebraic polynomial p (of degree n ≥ 2) lie in a disk with radius r, then, for each zero z1 of p, the disk with center z1 and radius r contains at least one zero of the derivative p′ . Until now, this conjecture has been proved for n ≤ 8 only. We also put the conjecture in a more general framework involving higher order derivatives and sets defined by the zeros of the polynomials.

Rolle's Theorem for Complex Polynomials with Real Coefficients

Let p(z) be an algebraic polynomial of degree n ¸ 2 with real coefficients and p(i) = p(¡i). According to Grace-Heawood Theorem, at least one zero of the derivative p0(z) is on the disk with center in the origin and radius cot(¼=n). In this paper is found the smallest domain containing at leas one zero of the derivative p0(z).

Transmission Of Intra-cellular Genetic Information: A System Proposal.

One of the great challenges of the scientific community on theories of genetic information, genetic communication and genetic coding is to determine a mathematical structure related to DNA sequences. In this paper we propose a model of an intra-cellular transmission system of genetic information similar to a model of a power and bandwidth efficient digital communication system in order to identify a mathematical structure in DNA sequences where such sequences are biologically relevant. The model of a transmission system of genetic information is concerned with the identification, reproduction and mathematical classification of the nucleotide sequence of single stranded DNA by the genetic encoder. Hence, a genetic encoder is devised where labelings and cyclic codes are established. The establishment of the algebraic structure of the corresponding codes alphabets, mappings, labelings, primitive polynomials (p(x)) and code generator polynomials (g(x)) are quite important in characterizing error-correcting codes subclasses of G-linear codes. These latter codes are useful for the identification, reproduction and mathematical classification of DNA sequences. The characterization of this model may contribute to the development of a methodology that can be applied in mutational analysis and polymorphisms, production of new drugs and genetic improvement, among other things, resulting in the reduction of time and laboratory costs.

Combining Legendre's Polynomials and Genetic Algorithm in the Solution of Nonlinear Initial-Value Problems

This work develops a method for solving ordinary differential equations, that is, initial-value problems, with solutions approximated by using Legendre's polynomials. An iterative procedure for the adjustment of the polynomial coefficients is developed, based on the genetic algorithm. This procedure is applied to several examples providing comparisons between its results and the best polynomial fitting when numerical solutions by the traditional Runge-Kutta or Adams methods are available. The resulting algorithm provides reliable solutions even if the numerical solutions are not available, that is, when the mass matrix is singular or the equation produces unstable running processes.

Generalized Coupled Algebraic Riccati Equations for Discrete-time Markov Jump with Multiplicative Noise Systems

In this paper we consider the existence of the maximal and mean square stabilizing solutions for a set of generalized coupled algebraic Riccati equations (GCARE for short) associated to the infinite-horizon stochastic optimal control problem of discrete-time Markov jump with multiplicative noise linear systems. The weighting matrices of the state and control for the quadratic part are allowed to be indefinite. We present a sufficient condition, based only on some positive semi-definite and kernel restrictions on some matrices, under which there exists the maximal solution and a necessary and sufficient condition under which there exists the mean square stabilizing solution fir the GCARE. We also present a solution for the discounted and long run average cost problems when the performance criterion is assumed be composed by a linear combination of an indefinite quadratic part and a linear part in the state and control variables. The paper is concluded with a numerical example for pension fund with regime switching.

Algebraic Bethe ansatz method for the exact calculation of energy spectra and form factors: applications to models of Bose-Einstein condensates and metallic nanograins

In this review we demonstrate how the algebraic Bethe ansatz is used for the calculation of the-energy spectra and form factors (operator matrix elements in the basis of Hamiltonian eigenstates) in exactly solvable quantum systems. As examples we apply the theory to several models of current interest in the study of Bose-Einstein condensates, which have been successfully created using ultracold dilute atomic gases. The first model we introduce describes Josephson tunnelling between two coupled Bose-Einstein condensates. It can be used not only for the study of tunnelling between condensates of atomic gases, but for solid state Josephson junctions and coupled Cooper pair boxes. The theory is also applicable to models of atomic-molecular Bose-Einstein condensates, with two examples given and analysed. Additionally, these same two models are relevant to studies in quantum optics; Finally, we discuss the model of Bardeen, Cooper and Schrieffer in this framework, which is appropriate for systems of ultracold fermionic atomic gases, as well as being applicable for the description of superconducting correlations in metallic grains with nanoscale dimensions.; In applying all the above models to. physical situations, the need for an exact analysis of small-scale systems is established due to large quantum fluctuations which render mean-field approaches inaccurate.

Superconducting Correlations in Metallic Nanoparticles: Exact Solution of the BCS Model by the Algebraic Bethe Ansatz

Superconducting pairing of electrons in nanoscale metallic particles with discrete energy levels and a fixed number of electrons is described by the reduced Bardeen, Cooper, and Schrieffer model Hamiltonian. We show that this model is integrable by the algebraic Bethe ansatz. The eigenstates, spectrum, conserved operators, integrals of motion, and norms of wave functions are obtained. Furthermore, the quantum inverse problem is solved, meaning that form factors and correlation functions can be explicitly evaluated. Closed form expressions are given for the form factors and correlation functions that describe superconducting pairing.

Algebraic Bethe ansatz for integrable Kondo impurities in the one-dimensional supersymmetric t-J model

An integrable Kondo problem in the one-dimensional supersymmetric t-J model is studied by means of the boundary supersymmetric quantum inverse scattering method. The boundary K matrices depending on the local moments of the impurities are presented as a nontrivial realization of the graded reflection equation algebras in a two-dimensional impurity Hilbert space. Further, the model is solved by using the algebraic Bethe ansatz method and the Bethe ansatz equations are obtained. (C) 1999 Elsevier Science B.V.

Algebraic Bethe ansatz for integrable one-dimensional extended Hubbard models with open boundary conditions

Nine classes of integrable open boundary conditions, further extending the one-dimensional U-q (gl (212)) extended Hubbard model, have been constructed previously by means of the boundary Z(2)-graded quantum inverse scattering method. The boundary systems are now solved by using the algebraic Bethe ansatz method, and the Bethe ansatz equations are obtained for all nine cases.

Algebraic Bethe ansatz for the anisotropic supersymmetric U model

We present an algebraic Bethe ansatz for the anisotropic supersymmetric U model for correlated electrons on the unrestricted 4(L)-dimensional electronic Hilbert space x(n=l)(L)C(4)(where L is the lattice length). The supersymmetry algebra of the local Hamiltonian is the quantum superalgebra U-q[gl(2\1)] and the model contains two symmetry-preserving free real parameters; the quantization parameter q and the Hubbard interaction parameter U. The parameter U arises from the one-parameter family of inequivalent typical four-dimensional irreps of U-q[gl(2\1)]. Eigenstates of the model are determined by the algebraic Bethe ansatz on a one-dimensional periodic lattice.

Algebraic Bethe ansatz for integrable extended Hubbard models arising from supersymmetric group solutions

Integrable extended Hubbard models arising from symmetric group solutions are examined in the framework of the graded quantum inverse scattering method. The Bethe ansatz equations for all these models are derived by using the algebraic Bethe ansatz method.

Strong Grobner bases for polynomials over a principal ideal ring

Grobner bases have been generalised to polynomials over a commutative ring A in several ways. Here we focus on strong Grobner bases, also known as D-bases. Several authors have shown that strong Grobner bases can be effectively constructed over a principal ideal domain. We show that this extends to any principal ideal ring. We characterise Grobner bases and strong Grobner bases when A is a principal ideal ring. We also give algorithms for computing Grobner bases and strong Grobner bases which generalise known algorithms to principal ideal rings. In particular, we give an algorithm for computing a strong Grobner basis over a finite-chain ring, for example a Galois ring.