Affine processes, arbitrage-Free Term structures of legendre polynomials,and option pricing

Multivariate Affine term structure models have been increasingly used for pricing derivatives in fixed income markets. In these models, uncertainty of the term structure is driven by a state vector, while the short rate is an affine function of this vector. The model is characterized by a specific form for the stochastic differential equation (SDE) for the evolution of the state vector. This SDE presents restrictions on its drift term which rule out arbitrages in the market. In this paper we solve the following inverse problem: Suppose the term structure of interest rates is modeled by a linear combination of Legendre polynomials with random coefficients. Is there any SDE for these coefficients which rules out arbitrages? This problem is of particular empirical interest because the Legendre model is an example of factor model with clear interpretation for each factor, in which regards movements of the term structure. Moreover, the Affine structure of the Legendre model implies knowledge of its conditional characteristic function. From the econometric perspective, we propose arbitrage-free Legendre models to describe the evolution of the term structure. From the pricing perspective, we follow Duffie et al. (2000) in exploring Legendre conditional characteristic functions to obtain a computational tractable method to price fixed income derivatives. Closing the article, the empirical section presents precise evidence on the reward of implementing arbitrage-free parametric term structure models: The ability of obtaining a good approximation for the state vector by simply using cross sectional data.

Invariant tests in an instrumental variables model with unknown data generating process

In this work we focus on tests for the parameter of an endogenous variable in a weakly identi ed instrumental variable regressionmodel. We propose a new unbiasedness restriction for weighted average power (WAP) tests introduced by Moreira and Moreira (2013). This new boundary condition is motivated by the score e ciency under strong identi cation. It allows reducing computational costs of WAP tests by replacing the strongly unbiased condition. This latter restriction imposes, under the null hypothesis, the test to be uncorrelated to a given statistic with dimension given by the number of instruments. The new proposed boundary condition only imposes the test to be uncorrelated to a linear combination of the statistic. WAP tests under both restrictions to perform similarly numerically. We apply the di erent tests discussed to an empirical example. Using data from Yogo (2004), we assess the e ect of weak instruments on the estimation of the elasticity of inter-temporal substitution of a CCAPM model.

On invariant Rings of Sylow subgroups of finite classical groups

In this thesis we study the invariant rings for the Sylow p-subgroups of the nite classical groups. We have successfully constructed presentations for the invariant rings for the Sylow p-subgroups of the unitary groups GU(3; Fq2) and GU(4; Fq2 ), the symplectic group Sp(4; Fq) and the orthogonal group O+(4; Fq) with q odd. In all cases, we obtained a minimal generating set which is also a SAGBI basis. Moreover, we computed the relations among the generators and showed that the invariant ring for these groups are a complete intersection. This shows that, even though the invariant rings of the Sylow p-subgroups of the general linear group are polynomial, the same is not true for Sylow p-subgroups of general classical groups. We also constructed the generators for the invariant elds for the Sylow p-subgroups of GU(n; Fq2 ), Sp(2n; Fq), O+(2n; Fq), O-(2n + 2; Fq) and O(2n + 1; Fq), for every n and q. This is an important step in order to obtain the generators and relations for the invariant rings of all these groups.

Monotonicity and asymptotics of zeros of Sobolev type orthogonal polynomials: A general case

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

On the zeros of polynomials: An extension of the Enestrom-Kakeya theorem

This paper presents an extension of the Enestrom-Kakeya theorem concerning the roots of a polynomial that arises from the analysis of the stability of Brown (K, L) methods. The generalization relates to relaxing one of the inequalities on the coefficients of the polynomial. Two results concerning the zeros of polynomials will be proved, one of them providing a partial answer to a conjecture by Meneguette (1994)[6]. (C) 2011 Elsevier B.V. All rights reserved.

GLOBAL DYNAMICS of THE LORENZ SYSTEM WITH INVARIANT ALGEBRAIC SURFACES

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

Convexity of the extreme zeros of Gegenbauer and Laguerre polynomials

Let C-n(lambda)(x), n = 0, 1,..., lambda > -1/2, be the ultraspherical (Gegenbauer) polynomials, orthogonal. in (-1, 1) with respect to the weight function (1 - x(2))(lambda-1/2). Denote by X-nk(lambda), k = 1,....,n, the zeros of C-n(lambda)(x) enumerated in decreasing order. In this short note, we prove that, for any n is an element of N, the product (lambda + 1)(3/2)x(n1)(lambda) is a convex function of lambda if lambda greater than or equal to 0. The result is applied to obtain some inequalities for the largest zeros of C-n(lambda)(x). If X-nk(alpha), k = 1,...,n, are the zeros of Laguerre polynomial L-n(alpha)(x), also enumerated in decreasing order, we prove that x(n1)(lambda)/(alpha + 1) is a convex function of alpha for alpha > - 1. (C) 2002 Published by Elsevier B.V. B.V.

Asymptotics of zeros of polynomials arising from rational integrals

We prove that the zeros of the polynomials P.. (a) of degree m, defined by Boros and Moll via[GRAPHICS]approach the lemmiscate {zeta epsilon C: \zeta(2) - 1\ = Hzeta < 0}, as m --> infinity. (C) 2004 Elsevier B.V. All rights reserved.

Real orthogonal polynomials in frequency analysis

We study the use of para-orthogonal polynomials in solving the frequency analysis problem. Through a transformation of Delsarte and Genin, we present an approach for the frequency analysis by using the zeros and Christoffel numbers of polynomials orthogonal on the real line. This leads to a simple and fast algorithm for the estimation of frequencies. We also provide a new method, faster than the Levinson algorithm, for the determination of the reflection coefficients of the corresponding real Szego polynomials from the given moments.

Connection coefficients and zeros of orthogonal polynomials

We discuss an old theorem of Obrechkoff and some of its applications. Some curious historical facts around this theorem are presented. We make an attempt to look at some known results on connection coefficients, zeros and Wronskians of orthogonal polynomials from the perspective of Obrechkoff's theorem. Necessary conditions for the positivity of the connection coefficients of two families of orthogonal polynomials are provided. Inequalities between the kth zero of an orthogonal polynomial p(n)(x) and the largest (smallest) zero of another orthogonal polynomial q(n)(x) are given in terms of the signs of the connection coefficients of the families {p(n)(x)} and {q(n)(x)}, An inequality between the largest zeros of the Jacobi polynomials P-n((a,b)) (x) and P-n((alpha,beta)) (x) is also established. (C) 2001 Elsevier B.V. B.V. All rights reserved.

Monotonicity of zeros of Jacobi polynomials

Denote by x(nk)(alpha, beta), k = 1...., n, the zeros of the Jacobi polynornial P-n((alpha,beta)) (x). It is well known that x(nk)(alpha, beta) are increasing functions of beta and decreasing functions of alpha. In this paper we investigate the question of how fast the functions 1 - x(nk)(alpha, beta) decrease as beta increases. We prove that the products t(nk)(alpha, beta) := f(n)(alpha, beta) (1 - x(nk)(alpha, beta), where f(n)(alpha, beta) = 2n(2) + 2n(alpha + beta + 1) + (alpha + 1)(beta + 1) are already increasing functions of beta and that, for any fixed alpha > - 1, f(n)(alpha, beta) is the asymptotically extremal, with respect to n, function of beta that forces the products t(nk)(alpha, beta) to increase. (c) 2007 Elsevier B.V. All rights reserved.

Zeros of Gegenbauer and Hermite polynomials and connection coefficients

In this paper, sharp upper limit for the zeros of the ultraspherical polynomials are obtained via a result of Obrechkoff and certain explicit connection coefficients for these polynomials. As a consequence, sharp bounds for the zeros of the Hermite polynomials are obtained.

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.

On the behaviour of zeros of Jacobi polynomials

Denote by x(n,k)(alpha, beta) and x(n,k) (lambda) = x(n,k) (lambda - 1/2, lambda - 1/2) the zeros, in decreasing order, of the Jacobi polynomial P-n((alpha, beta))(x) and of the ultraspherical (Gegenbauer) polynomial C-n(lambda)(x), respectively. The monotonicity of x(n,k)(alpha, beta) as functions of a and beta, alpha, beta > - 1, is investigated. Necessary conditions such that the zeros of P-n((a, b)) (x) are smaller (greater) than the zeros of P-n((alpha, beta))(x) are provided. A. Markov proved that x(n,k) (a, b) < x(n,k)(α, β) (x(n,k)(a, b) > x(n,k)(alpha, beta)) for every n is an element of N and each k, 1 less than or equal to k less than or equal to n if a > alpha and b < β (a < alpha and b > beta). We prove the converse statement of Markov's theorem. The question of how large the function could be such that the products f(n)(lambda) x(n,k)(lambda), k = 1,..., [n/2] are increasing functions of lambda, for lambda > - 1/2, is also discussed. Elbert and Siafarikas proved that f(n)(lambda) = (lambda + (2n(2) + 1)/ (4n + 2))(1/2) obeys this property. We establish the sharpness of their result. (C) 2002 Elsevier B.V. (USA).