Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.     

On the Zeros of Orthogonal Polynomials: The Elliptic Case

Constructive Approximation - Let E = [–1, α] \cup [β, 1], –1 &;lt; α &;lt; β &;lt; 1, and let (pn) be orthogonal on E with respect to the weight function...     

An algorithm for the divisors of monic polynomials over a commutative ring

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R₀ ⊕ … ⊕ R_m (m ≤ deg f), associated to a fundamental system of idempotents e₀, … , e_m, such that the component of f in each R_i[X] has degree coefficient which is a unit of R_i. We propose to give an algorithm to explicitly find such a decomposition. Moreover, we extend this result to divisors of doubly monic Laurent polynomials.     

ON A SET OF h-HARMONIC HOMOGENEOUS POLYNOMIALS

1　IntroductionLet Sd- 1 bethe unitsphere of Rd,Πdthe space of allpolynomialsofd variables,and x(i)= (x1 ,… ,xi) (i=1 ,… ,d) .In this paper,we are concerned with the homogeneous polyno-mials orthogonal with the weightfunction h(x(d) ) =x2 k11 …x2 kdd on Sd- 1 ,where ki≥ 0 (i=1 ,… ,d) .Connected with the weightfunction h(x(d) ) are the following differential-differenceoperators introduced by Charles F. Dunkl in [3 ] ,Dip(x(d) ) = p(x(d) ) xi+ di=1kip(x(d) ) -p(x1 ,… ,-xi,… ,xd)xi,Δ…     

Laguerre approximation of stable manifolds with application to connecting orbits

We present an algorithm, based on approximation by Laguerre polynomials, for computing a point on the stable manifold of a stationary solution of an autonomous system. A superconvergence phenomenon means that the accuracy of our results is much higher than the usual spectral accuracy. Both the theory and the implementation of the method are considered. Finally, as an application of the algorithm, we describe a fully spectral approximation of homo- and heteroclinic orbits.

     

New inequalities from classical Sturm theorems

Inequalities satisfied by the zeros of the solutions of second-order hypergeometric equations are derived through a systematic use of Liouville transformations together with the application of classical Sturm theorems. This systematic study allows us to improve previously known inequalities and to extend their range of validity as well as to discover inequalities which appear to be new. Among other properties obtained, Szegő's bounds on the zeros of Jacobi polynomials for , are completed with results for the rest of parameter values, Grosjean's inequality (J. Approx. Theory 50 (1987) 84) on the zeros of Legendre polynomials is shown to be valid for Jacobi polynomials with |β|1, bounds on ratios of consecutive zeros of Gauss and confluent hypergeometric functions are derived as well as an inequality involving the geometric mean of zeros of Bessel functions.     

The linear polarization constant of R n

Summary He present work deals with estimations of the n-th linear polarization constant c(H)_n of an n-dimensional real Hilbert space H. We provide some new lower bounds on the value of sup_║y║=1 │1,y> ... n,y>│, where x₁, ... ,x_n are unit vectors in H. In particular, the results improve an earlier estimate of Marcus. However, the intriguing conjecture c(H) _n= n^n/2 remains open.     

On the chromatic polynomial of a graph

Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()^α≤≤ () ^{n −ω}. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() ^{n −ω}≤μ(G)≤n−α() ^α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002     

ON THE GENERALIZATIONS OF KALANDIA＇S LEMMA

Based on Bernstein＇s Theorem, Kalandia＇s Lemma describes the error estimate and the smoothness of the remainder under the second part of Hoelder norm when a HSlder function is approximated by its best polynomial approximation. In this paper, Kalandia＇s Lemma is generalized to the cases that the best polynomial is replaced by one of its four kinds of Chebyshev polynomial expansions, the error estimates of the remainder are given out under Hoeder norm or the weighted HSlder norms.