Blumenthal's theorem for Laurent orthogonal polynomials

We investigate polynomials satisfying a three-term recurrence relation of the form B-n(x) = (x - beta(n))beta(n-1)(x) - alpha(n)xB(n-2)(x), with positive recurrence coefficients alpha(n+1),beta(n) (n = 1, 2,...). We show that the zeros are eigenvalues of a structured Hessenberg matrix and give the left and right eigenvectors of this matrix, from which we deduce Laurent orthogonality and the Gaussian quadrature formula. We analyse in more detail the case where alpha(n) --> alpha and beta(n) --> beta and show that the zeros of beta(n) are dense on an interval and that the support of the Laurent orthogonality measure is equal to this interval and a set which is at most denumerable with accumulation points (if any) at the endpoints of the interval. This result is the Laurent version of Blumenthal's theorem for orthogonal polynomials. (C) 2002 Elsevier B.V. (USA).

Szego polynomials and the truncated trigonometric moment problem

We show how Szego polynomials can be used in the theory of truncated trigonometric moment problem.

Companion orthogonal polynomials

We give some properties relating the recurrence relations of orthogonal polynomials associated with any two symmetric distributions d phi(1)(x) and d phi(2)(x) such that d phi(2)(x) = (I + kx(2))d phi(1)(x). AS applications of these properties, recurrence relations for many interesting systems of orthogonal polynomials are obtained.

BRST-BFV formalism for the generalized Schwinger model

We derive the Wess-Zumino scalar term of the generalized Schwinger model both in the singular and nonsingular cases by using BRST-BFV framework. The photon propagators are also computed in the extended Lorentz gauge.

A generalized Jaynes-Cummings Hamiltonian and supersymmetric shape invariance

A class of shape-invariant bound-state problems which represent two-level systems are introduced. It is shown that the coupled-channel Hamiltonians obtained correspond to the generalization of the Jaynes-Cummings Hamiltonian.

Chebyshev-Laurent polynomials and weighted approximation

Let (a, b) subset of (0, infinity) and for any positive integer n, let S-n be the Chebyshev space in [a, b] defined by S-n:= span{x(-n/2+k),k= 0,...,n}. The unique (up to a constant factor) function tau(n) is an element of S-n, which satisfies the orthogonality relation S(a)(b)tau(n)(x)q(x) (x(b - x)(x - a))(-1/2) dx = 0 for any q is an element of Sn-1, is said to be the orthogonal Chebyshev S-n-polynomials. This paper is an attempt to exibit some interesting properties of the orthogonal Chebyshev S-n-polynomials and to demonstrate their importance to the problem of approximation by S-n-polynomials. A simple proof of a Jackson-type theorem is given and the Lagrange interpolation problem by functions from S-n is discussed. It is shown also that tau(n) obeys an extremal property in L-q, 1 less than or equal to q less than or equal to infinity. Natural analogues of some inequalities for algebraic polynomials, which we expect to hold for the S-n-pelynomials, are conjectured.

Integration of polyharmonic functions

The results in this paper are motivated by two analogies. First, m-harmonic functions in R(n) are extensions of the univariate algebraic polynomials of odd degree 2m-1. Second, Gauss' and Pizzetti's mean value formulae are natural multivariate analogues of the rectangular and Taylor's quadrature formulae, respectively. This point of view suggests that some theorems concerning quadrature rules could be generalized to results about integration of polyharmonic functions. This is done for the Tchakaloff-Obrechkoff quadrature formula and for the Gaussian quadrature with two nodes.

Lagrangian heuristic for a class of the generalized assignment problems

A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.

Zeros of orthogonal polynomials generated by canonical perturbations of measures

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

Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

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

SZEGO and PARA-ORTHOGONAL POLYNOMIALS on THE REAL LINE: ZEROS and CANONICAL SPECTRAL TRANSFORMATIONS

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

Bayesian estimation of generalized exponential distribution under noninformative priors

The generalized exponential distribution, proposed by Gupta and Kundu (1999), is a good alternative to standard lifetime distributions as exponential, Weibull or gamma. Several authors have considered the problem of Bayesian estimation of the parameters of generalized exponential distribution, assuming independent gamma priors and other informative priors. In this paper, we consider a Bayesian analysis of the generalized exponential distribution by assuming the conventional non-informative prior distributions, as Jeffreys and reference prior, to estimate the parameters. These priors are compared with independent gamma priors for both parameters. The comparison is carried out by examining the frequentist coverage probabilities of Bayesian credible intervals. We shown that maximal data information prior implies in an improper posterior distribution for the parameters of a generalized exponential distribution. It is also shown that the choice of a parameter of interest is very important for the reference prior. The different choices lead to different reference priors in this case. Numerical inference is illustrated for the parameters by considering data set of different sizes and using MCMC (Markov Chain Monte Carlo) methods.