A <Emphasis Type="Italic">C</Emphasis><Superscript>1</Superscript> Multivariate Clough–Tocher Interpolant

We show that in dimensions four and higher, to insure a smooth interpolant, additional geometric constraints must be imposed on the generalized Clough–Tocher split introduced in Worsey and Farin (Constr. Approx. 3:99–110, [1987]).      

The Gabriel–Roiter Measure for Right Pure Semisimple Rings

We show how the Gabriel–Roiter measure, introduced by Ringel in (Bull Sci Math 129:726–748, 2005 and Contemp Math 406:105–135, 2006), applies to indecomposable modules of finite length over right pure semisimple rings, and in particular to the study of the open problem whether any right pure semisimple ring is of finite representation type. Dedicated to the memory of Andrey Vladimirovich Roiter. Professor A. V. Roiter has died on 26 July 2006 in Riga, Latvia. He was born in 1937.     

A few remarks on recurrence relations for geometrically continuous piecewise Chebyshevian B-splines

This works complements a recent article (Mazure, J. Comp. Appl. Math. 219(2):457–470, 2008) in which we showed that T. Lyche’s recurrence relations for Chebyshevian B-splines (Lyche, Constr. Approx. 1:155–178, 1985) naturally emerged from blossoms and their properties via de Boor type algorithms. Based on Chebyshevian divided differences, T. Lyche’s approach concerned splines with all sections in the same Chebyshev space and with ordinary connections at the knots. Here, we consider geometrically continuous piecewise Chebyshevian splines, namely, splines with sections in different Chebyshev spaces, and with geometric connections at the knots. In this general framework, we proved in (Mazure, Constr. Approx. 20:603–624, 2004) that existence of B-spline bases could not be separated from existence of blossoms. Actually, the present paper enhances the powerfulness of blossoms in which not only B-splines are inherent, but also their recurrence relations. We compare this fact with the work by G. Mühlbach and Y. Tang (Mühlbach and Tang, Num. Alg. 41:35–78, 2006) who obtained the same recurrence relations via generalised Chebyshevian divided differences, but only under some total positivity assumption on the connexion matrices. We illustrate this comparison with splines with four-dimensional sections. The general situation addressed here also enhances the differences of behaviour between B-splines and the functions of smaller and smaller supports involved in the recurrence relations.     

Degrees of stretched Kostka coefficients

Given a partition λ and a composition β, the stretched Kostka coefficient is the map n ↦ K _{n λ,n β} sending each positive integer n to the Kostka coefficient indexed by n λ and n β. Kirillov and Reshetikhin (J. Soviet Math. 41(2), 925–955, 1988) have shown that stretched Kostka coefficients are polynomial functions of n. King, Tollu, and Toumazet have conjectured that these polynomials always have nonnegative coefficients (CRM Proc. Lecture Notes 34, 99–112, 2004), and they have given a conjectural expression for their degrees (Séminaire Lotharingien de Combinatoire 54A, 2006). We prove the values conjectured by King, Tollu, and Toumazet for the degrees of stretched Kostka coefficients. Our proof depends upon the polyhedral geometry of Gelfand–Tsetlin polytopes and uses tilings of GT-patterns, a combinatorial structure introduced in De Loera and McAllister, (Discret. Comput. Geom. 32(4), 459–470, 2004). Research supported by NSF VIGRE Grant No. DMS-0135345 and by NWO Mathematics Cluster DIAMANT.     

On Spherical Averages of Radial Basis Functions

A radial basis function (RBF) has the general form

FCLT and MDP for Stochastic Lotka–Volterra Model

In this paper, we continue an asymptotic analysis of a stochastic version of the Lotka–Volterra model for predator–prey interactions. While the fluid approximation and large deviations were shown in Klebaner and Liptser (Ann. Appl. Probab. 11, 1263–1291, 2001) here we establish the diffusion approximation and moderate deviations.     

A Magnus- and Fer-Type Formula in Dendriform Algebras

We provide a refined approach to the classical Magnus (Commun. Pure Appl. Math. 7:649–673, [1954]) and Fer expansion (Bull. Classe Sci. Acad. R. Belg. 44:818–829, [1958]), unveiling a new structure by using the language of dendriform and pre-Lie algebras. The recursive formula for the logarithm of the solutions of the equations X=1+λ a ≺ X and Y=1−λ Y ≻ a in A[[λ]] is provided, where (A,≺,≻) is a dendriform algebra. Then we present the solutions to these equations as an infinite product expansion of exponentials. Both formulae involve the pre-Lie product naturally associated with the dendriform structure. Several applications are presented.      

On special values of certain Dirichlet L-functions

Let r _k (n) denote the number of ways n can be expressed as a sum of k squares. Recently, S. Cooper (Ramanujan J. 6:469–490, [2002]), conjectured a formula for r ₉(t), t≡5 (mod 8), r ₁₁(t), t≡7 (mod 8), where t is a square-free positive integer. In this note we observe that these conjectures follow from the works of Lomadze (Akad. Nauk Gruz. Tr. Tbil. Mat. Inst. Razmadze 17:281–314, [1949]; Acta Arith. 68(3):245–253, [1994]). Further we express r ₉(t), r ₁₁(t) in terms of certain special values of Dirichlet L-functions. Combining these two results we get expressions for these special values of Dirichlet L-functions involving Jacobi symbols.      

Leading coefficients of Kazhdan–Lusztig polynomials for Deodhar elements

We show that the leading coefficient of the Kazhdan–Lusztig polynomial P _x,w (q) known as μ(x,w) is always either 0 or 1 when w is a Deodhar element of a finite Weyl group. The Deodhar elements have previously been characterized using pattern avoidance in Billey and Warrington (J. Algebraic Combin. 13(2):111–136, [2001]) and Billey and Jones (Ann. Comb. [2008], to appear). In type A, these elements are precisely the 321-hexagon avoiding permutations. Using Deodhar’s algorithm (Deodhar in Geom. Dedicata 63(1):95–119, [1990]), we provide some combinatorial criteria to determine when μ(x,w)=1 for such permutations w. The author received support from NSF grants DMS-9983797 and DMS-0636297.     

The Picard–Lefschetz formula for p-adic cohomology

In this paper, we discuss a p-adic analogue of the Picard–Lefschetz formula. For a family with ordinary double points over a complete discrete valuation ring of mixed characteristic (0,p), we construct vanishing cycle modules which measure the difference between the rigid cohomology groups of the special fiber and the de Rham cohomology groups of the generic fiber. Furthermore, the monodromy operators on the de Rham cohomology groups of the generic fiber are described by the canonical generators of the vanishing cycle modules in the same way as in the case of the ℓ-adic (or classical) Picard–Lefschetz formula. For the construction and the proof, we use the logarithmic de Rham–Witt complexes and those weight filtrations investigated by Mokrane (Duke Math. J. 72(2):301–337, 1993).      

Small Support Spline Riesz Wavelets in Low Dimensions

In Han and Shen (SIAM J. Math. Anal. 38:530–556, 2006), a family of univariate short support Riesz wavelets was constructed from uniform B-splines. A bivariate spline Riesz wavelet basis from the Loop scheme was derived in Han and Shen (J. Fourier Anal. Appl. 11:615–637, 2005). Motivated by these two papers, we develop in this article a general theory and a construction method to derive small support Riesz wavelets in low dimensions from refinable functions. In particular, we obtain small support spline Riesz wavelets from bivariate and trivariate box splines. Small support Riesz wavelets are desirable for developing efficient algorithms in various applications. For example, the short support Riesz wavelets from Han and Shen (SIAM J. Math. Anal. 38:530–556, 2006) were used in a surface fitting algorithm of Johnson et al. (J. Approx. Theory 159:197–223, 2009), and the Riesz wavelet basis from the Loop scheme was used in a very efficient geometric mesh compression algorithm in Khodakovsky et al. (Proceedings of SIGGRAPH, 2000).     

Optimal buffer size for a stochastic processing network in heavy traffic

We consider a one-dimensional stochastic control problem that arises from queueing network applications. The state process corresponding to the queue-length process is given by a stochastic differential equation which reflects at the origin. The controller can choose the drift coefficient which represents the service rate and the buffer size b>0. When the queue length reaches b, the new customers are rejected and this incurs a penalty. There are three types of costs involved: A “control cost” related to the dynamically controlled service rate, a “congestion cost” which depends on the queue length and a “rejection penalty” for the rejection of the customers. We consider the problem of minimizing long-term average cost, which is also known as the ergodic cost criterion. We obtain an optimal drift rate (i.e. an optimal service rate) as well as the optimal buffer size b ^*>0. When the buffer size b>0 is fixed and where there is no congestion cost, this problem is similar to the work in Ata, Harrison and Shepp (Ann. Appl. Probab. 15, 1145–1160, 2005). Our method is quite different from that of (Ata, Harrison and Shepp (Ann. Appl. Probab. 15, 1145–1160, 2005)). To obtain a solution to the corresponding Hamilton–Jacobi–Bellman (HJB) equation, we analyze a family of ordinary differential equations. We make use of some specific characteristics of this family of solutions to obtain the optimal buffer size b ^*>0. A.P. Weerasinghe’s research supported by US Army Research Office grant W911NF0510032.     

Generalized qd algorithm and Markov–Bernstein inequalities for Jacobi weight

The Markov–Bernstein inequalities for the Jacobi measure remained to be studied in detail. Indeed the tools used for obtaining lower and upper bounds of the constant which appear in these inequalities, did not work, since it is linked with the smallest eigenvalue of a five diagonal positive definite symmetric matrix. The aim of this paper is to generalize the qd algorithm for positive definite symmetric band matrices and to give the mean to expand the determinant of a five diagonal symmetric matrix. After that these new tools are applied to the problem to produce effective lower and upper bounds of the Markov–Bernstein constant in the Jacobi case. In the last part we com pare, in the particular case of the Gegenbauer measure, the lower and upper bounds which can be deduced from this paper, with those given in Draux and Elhami (Comput J Appl Math 106:203–243, 1999) and Draux (Numer Algor 24:31–58, 2000).      

On Integrability of the Camassa–Holm Equation and Its Invariants

Using geometrical approach exposed in (Kersten et al. in J. Geom. Phys. 50:273–302, [2004] and Acta Appl. Math. 90:143–178, [2005]), we explore the Camassa–Holm equation (both in its initial scalar form, and in the form of 2×2-system). We describe Hamiltonian and symplectic structures, recursion operators and infinite series of symmetries and conservation laws (local and nonlocal). This work was supported in part by the NWO–RFBR grant 047.017.015 and RFBR–Consortium E.I.N.S.T.E.I.N. grant 06-01-92060.     

On the Nevanlinna characteristic of <Emphasis Type="Italic">f</Emphasis>(<Emphasis Type="Italic">z</Emphasis>+<Emphasis Type="Italic">η</Emphasis>) and difference equations in the complex plane

We investigate the growth of the Nevanlinna characteristic of f(z+η) for a fixed η∈C in this paper. In particular, we obtain a precise asymptotic relation between T(r,f(z+η)) and T(r,f), which is only true for finite order meromorphic functions. We have also obtained the proximity function and pointwise estimates of f(z+η)/f(z) which is a discrete version of the classical logarithmic derivative estimates of f(z). We apply these results to give new growth estimates of meromorphic solutions to higher order linear difference equations. This also allows us to solve an old problem of Whittaker (Interpolatory Function Theory, Cambridge University Press, Cambridge, 1935) concerning a first order difference equation. We show by giving a number of examples that all of our results are best possible in certain senses. Finally, we give a direct proof of a result in Ablowitz, Halburd and Herbst (Nonlinearity 13:889–905, 2000) concerning integrable difference equations. This research was supported in part by the Research Grants Council of the Hong Kong Special Administrative Region, China (HKUST6135/01P). The second author was also partially supported by the National Natural Science Foundation of China (Grant No. 10501044) and the HKUST PDF Matching Fund.     

Generalized Eisenstein series and several modular transformation formulae

B.C. Berndt (J. Reine Angew. Math. 272:182–193, 1975; 304:332–365, 1978) has derived a number of new transformation formulas, in particular, the transformation formulae of the logarithms of the classical theta functions, by using a transformation formula for a more general class of Eisenstein series. In this paper, we continue his study. By using a transformation formula for a class of twisted generalized Eisenstein series, we generalize a transformation formula given by J. Lehner (Duke Math. J. 8:631–655, 1941) and give a new proof for transformation formulas proved by Y. Yang (Bull. Lond. Math. Soc. 36:671–682, 2004). This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-214-C00003). This work also partially supported by BK21-Postech CoDiMaRo.     

On the Dynamic Programming Approach for the 3<Emphasis Type="Italic">D</Emphasis> Navier–Stokes Equations

The dynamic programming approach for the control of a 3D flow governed by the stochastic Navier–Stokes equations for incompressible fluid in a bounded domain is studied. By a compactness argument, existence of solutions for the associated Hamilton–Jacobi–Bellman equation is proved. Finally, existence of an optimal control through the feedback formula and of an optimal state is discussed. This paper has been written at Scuola Normale Superiore di Pisa and at école Normale Supérieure de Cachan, Antenne de Bretagne.     

Interpolation algorithm of Leverrier–Faddev type for polynomial matrices

We investigated an interpolation algorithm for computing outer inverses of a given polynomial matrix, based on the Leverrier–Faddeev method. This algorithm is a continuation of the finite algorithm for computing generalized inverses of a given polynomial matrix, introduced in [11]. Also, a method for estimating the degrees of polynomial matrices arising from the Leverrier–Faddeev algorithm is given as the improvement of the interpolation algorithm. Based on similar idea, we introduced methods for computing rank and index of polynomial matrix. All algorithms are implemented in the symbolic programming language MATHEMATICA , and tested on several different classes of test examples.     

A Fréchet derivative-free cubically convergent method for set-valued maps

We introduce a new iterative method in order to approximate a locally unique solution of variational inclusions in Banach spaces. The method uses only divided differences operators of order one. An existence–convergence theorem and a radius of convergence are given under some conditions on divided difference operator and Lipschitz-like continuity property of set-valued mappings. Our method extends the recent work related to the resolution of nonlinear equation in Argyros (J Math Anal Appl 332:97–108, 2007) and has the following advantages: faster convergence to the solution than all the previous known ones in Argyros and Hilout (Appl Math Comput, 2008 in press), Hilout (J Math Anal Appl 339:53–761, 2008, Positivity 10:673–700, 2006), and we do not need to evaluate any Fréchet derivative. We provide also an improvement of the ratio of our algorithm under some center-conditions and less computational cost. Numerical examples are also provided.      

Fourier–Padé Approximants for Nikishin Systems

We study type I Fourier–Padé approximation for certain systems of functions formed by the Cauchy transform of finite Borel measures supported on bounded intervals of the real line. This construction is similar to type I Hermite–Padé approximation. Instead of power series expansions of the functions in the system, we take their development in a series of orthogonal polynomials. We give the exact rate of convergence of the corresponding approximants. The answer is expressed in terms of the extremal solution of an associated vector-valued equilibrium problem for the logarithmic potential.