Second order asymptotic behaviour of subordinated sequences with longtailed subordinator

Suppose that {a(n)} is a discrete probability distribution on the set N₀={0,1,2,…} and {p(n)} is some non-negative sequence defined on the same set. The equation defines a new sequence {b(n)}. Here {a*k(n)} denotes the k-fold convolution of the distribution {a(n)}. In the paper the asymptotic behaviour of the sequence {b(n)} is investigated. It is known that for the large classes of the sequences {a(n)} and {p(n)}, b(n)∼σp([σn]), where 1/σ is the mean of the distribution {a(n)}. The main object of the present work is to estimate the difference b(n)−σp([σn]) for some classes of the sequences {a(n)} and {p(n)}.     

Log-concavity and LC-positivity

A triangle {a(n,k)}_0?k?n of nonnegative numbers is LC-positive if for each r, the sequence of polynomials is q-log-concave. It is double LC-positive if both triangles {a(n,k)} and {a(n,n−k)} are LC-positive. We show that if {a(n,k)} is LC-positive then the log-concavity of the sequence {xk} implies that of the sequence {zn} defined by , and if {a(n,k)} is double LC-positive then the log-concavity of sequences {xk} and {yk} implies that of the sequence {zn} defined by . Examples of double LC-positive triangles include the constant triangle and the Pascal triangle. We also give a generalization of a result of Liggett that is used to prove a conjecture of Pemantle on characteristics of negative dependence.     

Uniform and mean approximation by certain weighted polynomials,with applications

LetW(x):= exp(-{tiQ(x})), where, for example, Q(x) is even and convex onR, and Q(x)/logx → ∞ asx → ∞. A result of Mhaskar and Saff asserts that ifa _n =a _n (W) is the positive root of the equation $$n = ({2 \mathord{\left/ {\vphantom {2 \pi }} \right. \kern-\nulldelimiterspace} \pi })\int_0^1 {{{a_n xQ'(a_n x)} \mathord{\left/ {\vphantom {{a_n xQ'(a_n x)} {\sqrt {1 - x^2 } }}} \right. \kern-\nulldelimiterspace} {\sqrt {1 - x^2 } }}dx,}$$ then, given any polynomialP _n(x) of degree at mostn, the sup norm ofP _n(x)W(a _n x) overR is attained on [-1, 1]. In addition, any sequence of weighted polynomials {p _n (x)W(a _n x)} ₁ ^∞ that is uniformly bounded onR will converge to 0, for ¦x¦>1. In this paper we show that under certain conditions onW, a function g(x) continuous inR can be approximated in the uniform norm by such a sequence {p _n (x)W(a _n x)} ₁ ^∞ if and only if g(x)=0 for ¦x¦? 1. We also prove anL _p analogue for 0W(x)=exp(?|x| ^α ), when α >1. Further applications of our results are upper bounds for Christoffel functions, and asymptotic behavior of the largest zeros of orthogonal polynomials. A final application is an approximation theorem that will be used in a forthcoming proof of Freud's conjecture for |x| ^p exp(?|x| ^α ),α > 0,p > ?1.     

Lower semicontinuity and the theorem of Datko and Pazy

Let {T(t)} _t≥0 be aC ₀-semigroup on a real or complex Banach spaceX and letJ:C ⁺[0,∞)→[0,∞] be a lower semicontinuous and nondecreasing functional onC ⁺[0,∞), the positive cone ofC[0,∞), satisfyingJ(c 1)=∞ for allc>0. We prove the following result: if {T(t)} _t≥0 is not uniformly exponentially stable, then the set $\{ x \in X: J(||T( \cdot )x||) = \infty \}$ is residual inX.     

Weak convergence to multifractional Brownian motion of Riemann-Liouville type in Besov spaces

We study the weak convergence of the family of processes {V _n (t)} _n??? defined by $$V_n(t)=\int_{0}^t(t-u)^{H(t)-\frac{1}{2}}\theta_n(u)du,$$ where {?? _n (u)} _n??? is a family of processes converging in law to a Brownian motion, as n????. We consider two cases of {?? _n }. First, we construct ?? _n based on the well-known Donsker??s theorem and show that {V _n (t)} _n??? converges in law to a multifractional Brownian motion of Riemann-Liouville type, as n????. Second, we construct ?? _n based on a Poisson process, and then show that a multifractional Brownian motion of Riemann-Liouville type can be approximated in law by {V _n (t)} _n???.     

An asymptotic formula for the t-core partition function and a conjecture of Stanton

For a positive integer t, a partition is said to be a t-core if each of the hook numbers from its Ferrers-Young diagram is not a multiple of t. In 1996, Granville and Ono proved the t-core partition conjecture, that at(n), the number of t-core partitions of n, is positive for every nonnegative integer n as long as t?4. As part of their proof, they showed that if p?5 is prime, the generating function for ap(n) is essentially a multiple of an explicit Eisenstein Series together with a cusp form. This representation of the generating function leads to an asymptotic formula for ap(n) involving L-functions and divisor functions. In 1999, Stanton conjectured that for t?4 and n?t+1, at(n)?at+1(n). Here we prove a weaker form of this conjecture, that for t?4 and n sufficiently large, at(n)?at+1(n). Along the way, we obtain an asymptotic formula for at(n) which, in the cases where t is coprime to 6, is a generalization of the formula which follows from the work of Granville and Ono when t=p?5 is prime.     

Finite Element Matrix Sequences: the Case of Rectangular Domains

In the present paper, we consider a preconditioning strategy for Finite Element (FE) matrix sequences {A _n (a)} _n discretizing the elliptic problem $$\left\{ \begin{gathered} A_a u \equiv ( - )^k \nabla ^k [a(x,y)\nabla ^k u(x,y)] = f(x,y),{ }(x,y) \in \Omega = (0,1)^2 , \hfill \\ \left. {\left( {\frac{{\partial ^s }}{{\partial v^s }}u(x,y)} \right)} \right|_{\partial \Omega } \equiv 0,{ }s = 0,...,k - 1,{ }^{^{^{^{^{^{(1)} } } } } } \hfill \\ \end{gathered} \right.$$ with a(x,y) being a uniformly positive function and ν denoting the unit outward normal direction. More precisely, in connection with preconditioned conjugate gradient (PCG) like methods, we define the preconditioning sequence: {P _n (a)} _n , P _n (a):= $$\widetilde D$$ _n ^1/2(a)A _n (1) $$\widetilde D$$ _n ^1/2(a), where $$\widetilde D$$ _n (a) is the suitable scaled main diagonal of A _n (a). In fact, under the mild assumption of Lebesgue integrability of a(x), the weak clustering at the unity of the corresponding preconditioned sequence is proved. Moreover, if a(x,y) is regular enough and if a uniform triangulation is considered, then the preconditioned sequence shows a strong clustering at the unity so that the sequence {P _n (a)} _n turns out to be a superlinear preconditioning sequence for {A _n (a)} _n . The computational interest is due to the fact that the computation with A _n (a) is reduced to computations involving diagonals and two-level Toeplitz structures {A _n (1)} _n with banded pattern. Some numerical experimentations confirm the efficiency of the discussed proposal.     

High-Order Three-Term Recursions, Riemann–Hilbert Minors and Nikishin Systems on Star-Like Sets

We study monic polynomials Q _n (x) generated by a high-order three-term recursion xQ _n (x)=Q _n+1(x)+a _n?p Q _n?p (x) with arbitrary p≥1 and a _n >0 for all n. The recursion is encoded by a two-diagonal Hessenberg operator H. One of our main results is that, for periodic coefficients a _n and under certain conditions, the Q _n are multiple orthogonal polynomials with respect to a Nikishin system of orthogonality measures supported on star-like sets in the complex plane. This improves a recent result of Aptekarev–Kalyagin–Saff, where a formal connection with Nikishin systems was obtained in the case when $\sum_{n=0}^{\infty}|a_{n}-a|<\infty$ for some a>0. An important tool in this paper is the study of ‘Riemann–Hilbert minors’, or equivalently, the ‘generalized eigenvalues’ of the Hessenberg matrix H. We prove interlacing relations for the generalized eigenvalues by using totally positive matrices. In the case of asymptotically periodic coefficients a _n , we find weak and ratio asymptotics for the Riemann–Hilbert minors and we obtain a connection with a vector equilibrium problem. We anticipate that in the future, the study of Riemann–Hilbert minors may prove useful for more general classes of multiple orthogonal polynomials.     

Базисы из экспонент в пространствахL p

Let the rootsλ _n of an entire functionL(z) be separated and lie in some horizontal strip ¦Im z¦ ≦h, and suppose that $$0< c \leqq |L(z)|(1 + |z|)^{ - b} \exp ( - a|\operatorname{Im} z|) \leqq C< \infty$$ for ¦Imz¦≧H>h. If 1<p<2 and - 1/pq (1/q+1/p=1), then the system {exp (iλ _n x)} _n=0 ^∞ constitutes a basis нn the spaceL ^p (-a,a). In the caseb=1/q orb=?1/p the theorem fails, Equivalence of the following two statements is also proved:

1. {exp (iλ _n x)} _n=0 ^∞ is an extendable convergence system inL ^p from the interval (-a, a).
2. {exp (iλ _n x)} _n=0 ^∞ is a continuable basis inL ^p (-a,a).

     

Some results about the cross-correlation function between two maximal linear sequences

Let {a₁} and {a_d1} be two maximal linear sequences of period pⁿ ? 1. The cross-correlation function is defined by C_d(t) =

for t = 0, t…pⁿ ? 2, where $\text{ζ = exp(2π}\text{1}\text{p}\text{)}$. We find some new general results about C_d(t). We also determine the values and the number of occurences of each value of C_d(t) for several new values of d.     

Siegel cusp forms of degree 2 are determined by their fundamental Fourier coefficients

We prove that a Siegel cusp form of degree 2 for the full modular group is determined by its set of Fourier coefficients a(S) with 4 det(S) ranging over odd squarefree integers. As a key step to our result, we also prove that a classical cusp form of half-integral weight and level 4N, with N odd and squarefree, is determined by its set of Fourier coefficients a(d) with d ranging over odd squarefree integers, a result that was previously known only for Hecke eigenforms.     

Refinement of an inequality of P. L. Chebyshev

Let P _n denote the linear space of polynomials p(z:=Σ _k=0 ⁿ a _k (p)z ^k of degree ≦ n with complex coefficients and let |p|_[?1,1]: = max _x∈[?1,1]|p(x)| be the uniform norm of a polynomial p over the unit interval [?1, 1]. Let t _n ∈ P _n be the n ^th Chebyshev polynomial. The inequality $$ \frac{{\left| p \right|_{\left[ { - 1,1} \right]} }} {{\left| {a_n (p)} \right|}} \geqq \frac{{\left| {t_n } \right|_{\left[ { - 1,1} \right]} }} {{\left| {a_n (t_n )} \right|}},p \in P_n $$ due to P. L. Chebyshev can be considered as an extremal property of the Chebyshev polynomial t _n in P _n . The present note contains various extensions and improvements of the above inequality obtained by using complex analysis methods.     

On vanishing coefficients of algebraic power series over fields of positive characteristic

Let K be a field of characteristic p>0 and let f(t ₁,…,t _d ) be a power series in d variables with coefficients in K that is algebraic over the field of multivariate rational functions K(t ₁,…,t _d ). We prove a generalization of both Derksen’s recent analogue of the Skolem–Mahler–Lech theorem in positive characteristic and a classical theorem of Christol, by showing that the set of indices (n ₁,…,n _d )∈? ^d for which the coefficient of \(t_{1}^{n_{1}}\cdots t_{d}^{n_{d}}\) in f(t ₁,…,t _d ) is zero is a p-automatic set. Applying this result to multivariate rational functions leads to interesting effective results concerning some Diophantine equations related to S-unit equations and more generally to the Mordell–Lang Theorem over fields of positive characteristic.     

Asymptotic behavior of the maximal zero of a polynomial orthogonal on a segment with a nonclassical weight

Let {p _n (t)} _n=0 ^t8 be a system of algebraic polynomials orthonormal on the segment [?1, 1] with a weight p(t); let {x _n,ν ^(p) } _ν=1 ⁿ be zeros of a polynomial p _n (t) (x _x,ν ^(p) = cosθ _n,ν ^(p) ; 0 < θ _n,1 ^(p) < θ _n,2 ^(p) < ... < θ _n,n ^(p) < π). It is known that, for a wide class of weights p(t) containing the Jacobi weight, the quantities θ _n,1 ^(p) and 1 ? x _n,1 ^(p) coincide in order with n ^?1 and n ^?2, respectively. In the present paper, we prove that, if the weight p(t) has the form p(t) = 4(1 ? t ²)^?1{ln²[(1 + t)/(1 ? t)] + π ²}^?1, then the following asymptotic formulas are valid as n → ∞:

$$\theta _{n,1}^{(p)} = \frac{{\sqrt 2 }}{{n\sqrt {\ln (n + 1)} }}\left[ {1 + {\rm O}\left( {\frac{1}{{\ln (n + 1)}}} \right)} \right],x_{n,1}^{(p)} = 1 - \left( {\frac{1}{{n^2 \ln (n + 1)}}} \right) + O\left( {\frac{1}{{n^2 \ln ^2 (n + 1)}}} \right).$$

     

Preconditioned HSS methods for the solution of non-Hermitian positive definite linear systems and applications to the discrete convection-diffusion equation

Summary. We study the role of preconditioning strategies recently developed for coercive problems in connection with a two-step iterative method, based on the Hermitian skew-Hermitian splitting (HSS) of the coefficient matrix, proposed by Bai, Golub and Ng for the solution of nonsymmetric linear systems whose real part is coercive. As a model problem we consider Finite Differences (FD) matrix sequences {A_n(a,p)}_n discretizing the elliptic (convection-diffusion) problem with being a plurirectangle of R^d with a(x) being a uniformly positive function and p(x) denoting the Reynolds function: here for plurirectangle we mean a connected union of rectangles in d dimensions with edges parallel to the axes. More precisely, in connection with preconditioned HSS/GMRES like methods, we consider the preconditioning sequence {P_n(a)}_n, P_n(a):= D_n^1/2(a)A_n(1,0) D_n^1/2(a) where D_n(a) is the suitably scaled main diagonal of A_n(a,0). If a(x) is positive and regular enough, then the preconditioned sequence shows a strong clustering at unity so that the sequence {P_n(a)}_n turns out to be a superlinear preconditioning sequence for {A_n(a,0)}_n where A_n(a,0) represents a good approximation of Re(A_n(a,p)) namely the real part of A_n(a,p). The computational interest is due to the fact that the preconditioned HSS method has a convergence behavior depending on the spectral properties of {P_n^-1(a)Re(A_n(a,p))}_n {P_n^-1(a)A_n(a,0)}_n: therefore the solution of a linear system with coefficient matrix A_n(a,p) is reduced to computations involving diagonals and to the use of fast Poisson solvers for {A_n(1,0)}_n.Some numerical experimentations confirm the optimality of the discussed proposal and its superiority with respect to existing techniques.Mathematics Subject Classification (1991): 65F10, 65N22, 15A18, 15A12, 47B65     

Positive existential definability of multiplication from addition and the range of a polynomial

We consider the problem of recovering multiplication in the integers from enrichments of its additive structure, in the positive existential context. We prove that if a conjecture by Caporaso–Harris–Mazur holds, then for all integer-valued polynomials F of degree at least 2, multiplication is positive-existentially definable in (Z; 0, 1,+, R_F, =) where R_F is the unary relation F(Z). Similar results were only known for the polynomials F(t) = t² (under the Bombieri–Lang conjecture) and F(t) = tⁿ (under a generalization of the abc conjecture).     

On–off fluid models in heavy traffic environment

We consider fluid models with infinite buffer size. Let {Z _N (t)} be the net input rate to the buffer, where {{Z _N (t)} is a superposition of N homogeneous alternating on–off flows. Under heavy traffic environment {{Z _N (t)} converges in distribution to a centred Gaussian process with covariance function of a single flow. The aim of this paper is to prove the convergence of the stationary buffer content process {X _N ^* (t)} in the fNth model to the buffer content process {X _N (t)} in the limiting Gaussian model. This revised version was published online in June 2006 with corrections to the Cover Date.     

On Kernel polynomials and self-perturbation of orthogonal polynomials

Given an orthogonal polynomial system {Q _n (x)} _n=0 ^∞, define another polynomial system by where α _n are complex numbers and t is a positive integer. We find conditions for {P _n (x)} _n=0 ^∞ to be an orthogonal polynomial system. When t=1 and α₁≠0, it turns out that {Q _n (x)} _n=0 ^∞ must be kernel polynomials for {P _n (x)} _n=0 ^∞ for which we study, in detail, the location of zeros and semi-classical character. Received: November 25, 1999; in final form: April 6, 2000?Published online: June 22, 2001     

A study of the lex plus powers conjecture

An {a₁,…,a_n}-lex plus powers ideal is a monomial ideal in I⊂k[x₁,…,x_n] which minimally contains the regular sequence x₁^a₁,…,x_n^a_n and such that whenever m∈R_t is a minimal generator of I and m′∈R_t is greater than m in lex order, then m′∈I. Conjectures of Eisenbud et al. and Charalambous and Evans predict that after restricting to ideals containing a regular sequence in degrees {a₁,…,a_n}, then {a₁,…,a_n}-lex plus powers ideals have extremal properties similar to those of the lex ideal. That is, it is proposed that a lex plus powers ideal should give maximum possible Hilbert function growth (Eisenbud et al.), and, after fixing a Hilbert function, that the Betti numbers of a lex plus powers ideal should be uniquely largest (Charalambous, Evans). The first of these assertions would extend Macaulay's theorem on Hilbert function growth, while the second improves the Bigatti, Hulett, Pardue theorem that lex ideals have largest graded Betti numbers. In this paper we explore these two conjectures. First we give several equivalent forms of each statement. For example, we demonstrate that the conjecture for Hilbert functions is equivalent to the statement that for a given Hilbert function, lex plus powers ideals have the most minimal generators in each degree. We use this result to prove that it is enough to show that lex plus powers ideals have the most minimal generators in the highest possible degree. A similar result holds for the stronger conjecture. In this paper we also prove that if the weaker conjecture holds, then lex plus powers ideals are guaranteed to have largest socles. This suffices to show that the two conjectures are equivalent in dimension ?3, which proves the monomial case of the conjecture for Betti numbers in those degrees. In dimension 2, we prove both conjectures outright.     

Numerical range and quasi-sectorial contractions

A method developed in Arlinski? (1987) [1] is applied to study the numerical range of quasi-sectorial contractions and to prove three main results. Our first theorem gives characterization of the maximal sectorial generator A in terms of the corresponding contraction semigroup {exp(−tA)}_t?0. The second result establishes for these quasi-sectorial contractions a quite accurate localization of their numerical range. We give for this class of semigroups a new proof of the Euler operator-norm approximation: exp(−tA)=limn→∞(I+tA/n)⁻ⁿ, t?0, with the optimal estimate: O(1/n), of the convergence rate, which takes into account the value of the sectorial generator angle (the third result).