A remark on congruences for coefficients of Faber polynomials

Faber polynomials appear when weight zero Hecke operators act on the modular j-invariant. They are polynomials in j with rational integral coefficents. Using the theory of p-adic modular forms we establish some congruences and divisibilities for these coefficients. 2000 Mathematics Subject Classification Primary—11F33 Supported by NSF grant DMS-0501225.     

Envelopes of splines in the projective plane

In this paper a family of curves—Riemannian cubics—inthe unit sphere and the real projective plane is investigated.Riemannian cubics naturally arise as solutions to variationalproblems in Riemannian spaces. It is remarkable to find thatan envelope of lines generated by a Riemannian cubic in onespace is (nearly) a Riemannian cubic in another space.     

The rate of convergence of q-Bernstein polynomials for

In the note, we obtain the estimates for the rate of convergence for a sequence of q-Bernstein polynomials {B_n,q(f)} for 0<q<1 by the modulus of continuity of f, and the estimates are sharp with respect to the order for Lipschitz continuous functions. We also get the exact orders of convergence for a family of functions , and the orders do not depend on α, unlike the classical case.     

Monte Carlo approximation through Gibbs output in generalized linear mixed models

Geyer (J. Roy. Statist. Soc. 56 (1994) 291) proposed Monte Carlo method to approximate the whole likelihood function. His method is limited to choosing a proper reference point. We attempt to improve the method by assigning some prior information to the parameters and using the Gibbs output to evaluate the marginal likelihood and its derivatives through a Monte Carlo approximation. Vague priors are assigned to the parameters as well as the random effects within the Bayesian framework to represent a non-informative setting. Then the maximum likelihood estimates are obtained through the Newton Raphson method. Thus, out method serves as a bridge between Bayesian and classical approaches. The method is illustrated by analyzing the famous salamander mating data by generalized linear mixed models.     

Simulation of certain multivariate generalized Pareto distributions

The investigation of multivariate generalized Pareto distributions (GPDs) has begun only recently. For further progress with these distributions simulation methods are an important part. We describe several methods of simulating GPDs, beginning with an efficient method for the logistic GPD. The algorithm is based on the Shi transformation, which was already used for the simulation of multivariate extreme value distributions (EVDs) of logistic type. In the sequel another algorithm is presented simulating a broader class of GPDs. Due to its numerical complexity it is only practicably applicable in low dimensions. A method is given to generate unconditional GPD random vectors from conditionally GPD distributed random vectors. A short application of the simulation methods in the analysis of a real hydrological data set concludes the article. The simulation algorithms are available on the author’s home page .      

Infinite-Dimensional Black-Scholes Equation with Hereditary Structure

This paper considers the option pricing problem for contingent claims of the European type in a (B,S)-market in which the stock price and the asset in the riskless bank account both have hereditary structures. The Black-Scholes equation for the classical option pricing problem is generalized to an infinite-dimensional equation to include the effects of time delay in the evolution of the financial market as well as a very general payoff function. A computational algorithm for the solution is also obtained via a double sequence of polynomials of a certain bounded linear functional on a Banach space and the time variable.     

Some generating functions of Jacobi polynomials

In this paper, Weisner’s group-theoretic method of obtaining generating functions is utilized in the study of Jacobi polynomialsP> _n ^(a,ß)(x) by giving suitable interpretations to the index (n) and the parameter (β) to find out the elements for constructing a six-dimensional Lie algebra.     

The well-posedness of the Korteweg-de Vries-Benjamin-Ono equation

The well-posedness of the Cauchy problem to the generalized Korteweg-de Vries-Benjamin-Ono equation is considered. Local results for data in (s?−1/8) and the global well-posedness for data in are obtained if l=2. Moreover, for l=3, the problem is locally well-posed for data in H^s (s?1/4). The main idea is to use the Fourier restriction norm method.