Asymptotically strict pseudocontractive mappings in the intermediate sense

It is proved that the modified Mann iteration process: _xn+1=(1−_αn)_xn+_αnTⁿ_xn,n∈N$x_{n+1}=(1-{\alpha }_n)x_n+{\alpha }_n{T}^n{x}_n,n\in \mathbb{N}$, where {_αn}$\left\{{\alpha }_n\right\}$ is a sequence in (0, 1) with δ≤_αn≤1−κ−δ$\delta \le {\alpha }_n\le 1-\kappa -\delta$ for some δ∈(0,1)$\delta \in (0,1)$, converges weakly to a fixed point of an asymptotically κ$\kappa$-strict pseudocontractive mapping T$T$ in the intermediate sense which is not necessarily Lipschitzian. We also develop CQ method for this modified Mann iteration process which generates a strongly convergent sequence.     

Nonexistence of positive weak solutions of elliptic inequalities

In this paper we give sufficient conditions for the nonexistence of positive entire weak solutions of coercive and anticoercive elliptic inequalities, both of the p$p$-Laplacian and of the mean curvature type, depending also on u$u$ and x$x$ inside the divergence term, while a gradient factor is included on the right-hand side. In particular, to prove our theorems we use a technique developed by Mitidieri and Pohozaev in [E. Mitidieri, S.I. Pohozaev, A priori estimates and the absence of solutions of nonlinear partial differential equations and inequalities, Proc. Steklov Inst. Math., 234 (2001) 1–362], which relies on the method of test functions without using comparison and maximum principles. Their approach is essentially based first on a priori estimates and on the derivation of an asymptotics for the a priori estimate. Finally nonexistence of a solution is proved by contradiction.     

Finding efficient recursions for risk aggregation by computer algebra

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the assumption that the probability generating function of the claim size be algebraic. The probability generating function of the claim number is supposed to be from the rather general class of D$D$-finite functions.     

Nouvelles expressions des formules de Hasse et de Hermite pour la fonction Zêta d’Hurwitz

This article presents an interesting relation between the Hurwitz zeta function ζ(s,x)$\zeta (s,x)$ and a modification of the Bell polynomials through the rewriting of two classical identities discovered by Hasse and Hermite, respectively. Some applications of these new expressions to Euler's sums are also underscored.     

The mixed problem for the Lamé system in a class of Lipschitz domains

We consider the mixed problem for the Lamé system

     

Obstacle problem for nonlinear parabolic equations

We show the existence of a continuous solution to a nonlinear parabolic obstacle problem with a continuous time-dependent obstacle. The solution is constructed by an adaptation of the Schwarz alternating method. Moreover, if the obstacle is Hölder continuous, we prove that the solution inherits the same property.     

Answers to two questions posed by Farhi concerning additive bases

Let A be an asymptotic basis for N and X a finite subset of A such that A?X is still an asymptotic basis. Farhi recently proved a new batch of upper bounds for the order of A?X in terms of the order of A and a variety of parameters related to the set X. He posed two questions concerning possible improvements to his bounds. In this note, we answer both questions.     

On the Ono invariants of imaginary quadratic number fields

J. Cohen, J. Sonn, F. Sairaiji and K. Shimizu proved that there are only finitely many imaginary quadratic number fields K whose Ono invariants OnoK are equal to their class numbers hK. Assuming a Restricted Riemann Hypothesis, namely that the Dedekind zeta functions of imaginary quadratic number fields K have no Siegel zeros, we determine all these K's. There are 114 such K's. We also prove that we are missing at most one such K. M. Ishibashi proved that if OnoK is large enough compared with hK, then the ideal class groups of K is cyclic. We give a short proof and a precision of Ishibashi's result. We prove that there are only finitely many imaginary quadratic number fields K satisfying Ishibashi's sufficient condition. Assuming our Restricted Riemann Hypothesis, we prove that the absolute values dK of their discriminants are less than 2.3⋅¹⁰⁹. We determine all these K's with dK?¹⁰⁶. There are 76 such K's. We prove that there is at most one such K with dK?1.8⋅¹⁰¹¹.     

Nonparametric likelihood based estimation for a multivariate Lipschitz density

We consider a problem of nonparametric density estimation under shape restrictions. We deal with the case where the density belongs to a class of Lipschitz functions. Devroye [L. Devroye, A Course in Density Estimation, in: Progress in Probability and Statistics, vol. 14, Birkhäuser Boston Inc., Boston, MA, 1987] considered these classes of estimates as tailor-made estimates, in contrast in some way to universally consistent estimates. In our framework we get the existence and uniqueness of the maximum likelihood estimate as well as strong consistency. This NPMLE can be easily characterized but it is not easy to compute. Some simpler approximations are also considered.     

High-dimensional asymptotic expansions for the distributions of canonical correlations

This paper examines asymptotic distributions of the canonical correlations between and with q≤p, based on a sample of size of N=n+1. The asymptotic distributions of the canonical correlations have been studied extensively when the dimensions q and p are fixed and the sample size N tends toward infinity. However, these approximations worsen when q or p is large in comparison to N. To overcome this weakness, this paper first derives asymptotic distributions of the canonical correlations under a high-dimensional framework such that q is fixed, m=n−p→∞ and c=p/n→c₀∈[0,1), assuming that and have a joint (q+p)-variate normal distribution. An extended Fisher’s z-transformation is proposed. Then, the asymptotic distributions are improved further by deriving their asymptotic expansions. Numerical simulations revealed that our approximations are more accurate than the classical approximations for a large range of p,q, and n and the population canonical correlations.