Generalized partition function zeros of 1D spin models and their critical behavior at edge singularities

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

L-orthogonal polynomials associated with related measures

A positive measure psi defined on [a, b] such that its moments mu(n) = integral(b)(a)t(n) d psi(t) exist for n = 0, +/-1, +/-2. can be called a strong positive measure on [a, b] When 0 <= a < b <= infinity the sequence of polynomials {Q(n)} defined by integral(b)(a) t(-n+s) Q(n)(t) d psi(t) = 0, s = 0, ., n - 1, exist and they are referred here as L-orthogonal polynomials We look at the connection between two sequences of L-orthogonal polynomials {Q(n)((1))} and {Q(n)((0))} associated with two closely related strong positive measures and th defined on [a, b]. To be precise, the measures are related to each other by (t - kappa) d psi(1)(t) = gamma d psi(0)(t). where (t - kappa)/gamma is positive when t is an element of (n, 6). As applications of our study. numerical generation of new L-orthogonal polynomials and monotonicity properties of the zeros of a certain class of L-orthogonal polynomials are looked at. (C) 2010 IMACS Published by Elsevier B V All rights reserved

Concerning the stability of BDF methods

We present an analysis of A0-stability of BDF methods and proof that zero-stable BDF methods are A0-stable using the Schur-Cohn criterion. With this result we have that zero-stable BDF methods are stiffly-stable. © 2008 American Institute of Physics.

Limitantes para os zeros de polinômios gerados por uma relação de recorrência de três termos

Pós-graduação em Matemática - IBILCE

Zeros de Polinômios Perturbados

Pós-graduação em Matematica Aplicada e Computacional - FCT

Zeros de Polinômios Auto-Recíprocos Reais no Círculo Unitário

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Szegö polynomials: quadrature rules on the unit circle and on [-1, 1]

We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.

Yang-Lee zeros of the two- and three-state Potts model defined on π3 Feynman diagrams

We present both analytical and numerical results on the position of partition function zeros on the complex magnetic field plane of the q=2 state (Ising) and the q=3 state Potts model defined on phi(3) Feynman diagrams (thin random graphs). Our analytic results are based on the ideas of destructive interference of coexisting phases and low temperature expansions. For the case of the Ising model, an argument based on a symmetry of the saddle point equations leads us to a nonperturbative proof that the Yang-Lee zeros are located on the unit circle, although no circle theorem is known in this case of random graphs. For the q=3 state Potts model, our perturbative results indicate that the Yang-Lee zeros lie outside the unit circle. Both analytic results are confirmed by finite lattice numerical calculations.

Zeros of Weakly Holomorphic Modular Forms of Levels 2 and 3

Let M-k(#)(N) be the space of weakly holomorphic modular forms for Gamma(0)(N) that are holomorphic at all cusps except possibly at infinity. We study a canonical basis for M-k(#)(2) and M-k(#)(3) and prove that almost all modular forms in this basis have the property that the majority of their zeros in a fundamental domain lie on a lower boundary arc of the fundamental domain.

Conditional density approximations with mixtures of polynomials

Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one- and multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities is found. We illustrate and study the methods using data sampled from known parametric distributions, and we demonstrate their applicability by learning models based on real neuroscience data. Finally, we compare the performance of the proposed methods with an approach for learning mixtures of truncated basis functions (MoTBFs). The empirical results show that the proposed methods generally yield models that are comparable to or significantly better than those found using the MoTBF-based method.

The Zeros of Riemann Zeta Partial Sums Yield Solutions to f(x) + f(2x) + · · · + f(nx) = 0

This paper proves that every zero of any n th , n ≥ 2, partial sum of the Riemann zeta function provides a vector space of basic solutions of the functional equation f(x)+f(2x)+⋯+f(nx)=0,x∈R . The continuity of the solutions depends on the sign of the real part of each zero.

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

On a Stratification Defined by Real Roots of Polynomials

2000 Mathematics Subject Classification: 12D10

Overdetermined Strata in General Families of Polynomials

2000 Mathematics Subject Classification: 12D10.