Fixed point theorems for some generalized multivalued nonexpansive mappings

In this paper, we introduce a condition on multivalued mappings which is a multivalued version of condition (C_λ) defined by Garcia-Falset et al. (2011) [3]. It is shown here that some of the classical fixed point theorems for multivalued nonexpansive mappings can be extended to mappings satisfying this condition. Our results generalize the results in Lim (1974), Lami Dozo (1973), Kirk and Massa (1990), Garcia-Falset et al. (2011), Dhompongsa et al. (2009) and Abkar and Eslamian (2010) [4], [5], [6], [3], [7] and [8] and many others.     

The number of excellent discrete Morse functions on graphs

In Nicolaescu (2008) [7] the number of non-homologically equivalent excellent Morse functions defined on S² was obtained in the differentiable setting. We carried out an analogous study in the discrete setting for some kinds of graphs, including S¹, in Ayala et al. (2009) [1]. This paper completes this study, counting excellent discrete Morse functions defined on any infinite locally finite graph.     

A note on strong matrix summability via ideals

Following the line of recent works of Das et al. (2011) [15] and Savas and Das (2011) [19] we apply the notion of ideals to strong matrix summability, and in this note, we introduce the notion of strong A^I-summability with respect to an Orlicz function. We make certain investigations on the classes of sequences arising out of this new summability method.     

The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data

For two or more classes of points in R^d with d≥1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect to the points from one or all of the other classes. The CCCDs were introduced by Priebe et al. [C.E. Priebe, J.G. DeVinney, D.J. Marchette, On the distribution of the domination number of random class catch cover digraphs. Statistics and Probability Letters 55 (2001) 239-246] who investigated the case of two classes, X and Y. They calculated the exact (i.e., finite sample) distribution of the domination number of the CCCDs based on X points relative to Y points both of which were uniformly distributed on a bounded interval. We investigate the distribution of the domination number of the CCCDs based on data from non-uniform X points on an interval with end points from Y. Then we extend these calculations for multiple Y points on bounded intervals.     

On Taylor-series expansion methods for the second kind integral equations

In this paper, we comment on the recent papers by Yuhe Ren et al. (1999) [1] and Maleknejad et al. (2006) [7] concerning the use of the Taylor series to approximate a solution of the Fredholm integral equation of the second kind as well as a solution of a system of Fredholm equations. The technique presented in Yuhe Ren et al. (1999) [1] takes advantage of a rapidly decaying convolution kernel k(|s−t|) as |s−t| increases. However, it does not apply to equations having other types of kernels. We present in this paper a more general Taylor expansion method which can be applied to approximate a solution of the Fredholm equation having a smooth kernel. Also, it is shown that when the new method is applied to the Fredholm equation with a rapidly decaying kernel, it provides more accurate results than the method in Yuhe Ren et al. (1999) [1]. We also discuss an application of the new Taylor-series method to a system of Fredholm integral equations of the second kind.     

An adaptive estimator of the memory parameter and the goodness-of-fit test using a multidimensional increment ratio statistic

The increment ratio (IR) statistic was first defined and studied in Surgailis et al. (2007) [19] for estimating the memory parameter either of a stationary or an increment stationary Gaussian process. Here three extensions are proposed in the case of stationary processes. First, a multidimensional central limit theorem is established for a vector composed by several IR statistics. Second, a goodness-of-fit χ²-type test can be deduced from this theorem. Finally, this theorem allows to construct adaptive versions of the estimator and the test which are studied in a general semiparametric frame. The adaptive estimator of the long-memory parameter is proved to follow an oracle property. Simulations attest to the interesting accuracies and robustness of the estimator and the test, even in the non Gaussian case.     

Empirical processes of multidimensional systems with multiple mixing properties

We establish a multivariate empirical process central limit theorem for stationary R^d-valued stochastic processes (X_i)_i≥1 under very weak conditions concerning the dependence structure of the process. As an application, we can prove the empirical process CLT for ergodic torus automorphisms. Our results also apply to Markov chains and dynamical systems having a spectral gap on some Banach space of functions. Our proof uses a multivariate extension of the techniques introduced by Dehling et al. (2009) [9] in the univariate case. As an important technical ingredient, we prove a 2pth moment bound for partial sums in multiple mixing systems.     

Rotundity structure of local nature for generalized Orlicz-Lorentz function spaces

Criteria for extreme points and rotund points in generalized Orlicz-Lorentz function spaces, which were introduced in Foralewski (2011) [27] are given. Some examples show that in these spaces the notion of rotund point is essentially stronger than the notion of extreme point. Finally, the criteria obtained in this paper are interpreted in the case of classical Orlicz-Lorentz spaces. Results of this paper are related to the results from Carothers et al. (1992) [9], Kamińska (1990) [4], Foralewski et al. (2008) [26].     

Linearly perturbed polyhedral normal cone mappings and applications

Under a mild regularity assumption, we derive an exact formula for the Fréchet coderivative and some estimates for the Mordukhovich coderivative of the normal cone mappings of perturbed polyhedra in reflexive Banach spaces. Our focus point is a positive linear independence condition, which is a relaxed form of the linear independence condition employed recently by Henrion et al. (2010) [1], and Nam (2010) [3]. The formulae obtained allow us to get new results on solution stability of affine variational inequalities under linear perturbations. Thus, our paper develops some aspects of the work of Henrion et al. (2010) [1] Nam (2010) [3] Qui (in press) [12] and Yao and Yen (2009) [6] and [7].     

Complexity bounds for second-order optimality in unconstrained optimization

This paper examines worst-case evaluation bounds for finding weak minimizers in unconstrained optimization. For the cubic regularization algorithm, Nesterov and Polyak (2006) [15] and Cartis et al. (2010) [3] show that at most O(?⁻³) iterations may have to be performed for finding an iterate which is within ? of satisfying second-order optimality conditions. We first show that this bound can be derived for a version of the algorithm, which only uses one-dimensional global optimization of the cubic model and that it is sharp. We next consider the standard trust-region method and show that a bound of the same type may also be derived for this method, and that it is also sharp in some cases. We conclude by showing that a comparison of the bounds on the worst-case behaviour of the cubic regularization and trust-region algorithms favours the first of these methods.     

Optimal insurance under rank-dependent expected utility

We re-visit the problem of optimal insurance design under Rank-Dependent Expected Utility (RDEU) examined by Bernard et al. (2015), Xu (2018), and Xu et al. (2018). Unlike the latter, we do not impose the no-sabotage condition on admissible indemnities, that is, that indemnity and retention functions be nondecreasing functions of the loss. Rather, in a departure from the aforementioned work, we impose a state-verification cost that the insurer can incur in order to verify the loss severity, hence automatically ruling out any ex post moral hazard that could otherwise arise from possible misreporting of the loss by the insured. We fully characterize the optimal indemnity schedule and discuss how our results relate to those of Bernard et al. (2015) and Xu et al. (2018). We then extend the setting by allowing for a distortion premium principle, with a distortion function that differs from that of the insured, and we provide a characterization of the optimal retention in that case.     

Adversarial smoothed analysis

The purpose of this note is to extend the results on uniform smoothed analysis of condition numbers from Bürgisser et al. (2008) [1] to the case where the perturbation follows a radially symmetric probability distribution. In particular, we will show that the bounds derived in [1] still hold in the case of distributions whose density has a singularity at the center of the perturbation, which we call adversarial.     

Common fixed point results in CAT(0) spaces

Let X be a complete CAT(0) space, T be a generalized multivalued nonexpansive mapping, and t be a single valued quasi-nonexpansive mapping. Under the assumption that T and t commute weakly, we shall prove the existence of a common fixed point for them. In this way, we extend and improve a number of recent results obtained by Shahzad (2009) [7] and [12], Shahzad and Markin (2008) [6], and Dhompongsa et al. (2005) [5].     

The monotonic property and stability of solutions of fractional differential equations

In this paper we improve on the monotone property of Lemma 1.7.3 in Lakshmikantham et al. (2009) [5] for the case g(t,u)=λu with a nonnegative real number λ. We also investigate the Mittag-Leffler stability of solutions of fractional differential equations by using the fractional comparison principle.     

Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions

We deal with numerical approximation of stochastic Itô integrals of singular functions. We first consider the regular case of integrands belonging to the Hölder class with parameters r and ?. We show that in this case the classical Itô-Taylor algorithm has the optimal error Θ(n^−(r+?)). In the singular case, we consider a class of piecewise regular functions that have continuous derivatives, except for a finite number of unknown singular points. We show that any nonadaptive algorithm cannot efficiently handle such a problem, even in the case of a single singularity. The error of such algorithm is no less than n^{−min{1/2,r+?}}. Therefore, we must turn to adaptive algorithms. We construct the adaptive Itô-Taylor algorithm that, in the case of at most one singularity, has the optimal error O(n^−(r+?)). The best speed of convergence, known for regular functions, is thus preserved. For multiple singularities, we show that any adaptive algorithm has the error Ω(n^{−min{1/2,r+?}}), and this bound is sharp.     

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable

It is known that planar graphs without cycles of length from 4 to 7 are 3-colorable (Borodin et al., 2005) [13] and that planar graphs in which no triangles have common edges with cycles of length from 4 to 9 are 3-colorable (Borodin et al., 2006) [11]. We give a common extension of these results by proving that every planar graph in which no triangles have common edges with k-cycles, where k∈{4,5,7} (or, which is equivalent, with cycles of length 3, 5 and 7), is 3-colorable.     

Fractional weak discrepancy and split semiorders

The fractional weak discrepancywd_F(P) of a poset P=(V,?) was introduced in Shuchat et al. (2007) [6] as the minimum nonnegative k for which there exists a function f:V→R satisfying (i) if a?b then f(a)+1≤f(b) and (ii) if a∥b then |f(a)−f(b)|≤k. In this paper we generalize results in Shuchat et al. (2006, 2009) [5] and [7] on the range of wd_F for semiorders to the larger class of split semiorders. In particular, we prove that for such posets the range is the set of rationals that can be represented as r/s for which 0≤s−1≤r<2s.     

Ramsey numbers for a disjoint union of good graphs

We give the Ramsey number for a disjoint union of some G-good graphs versus a graph G generalizing the results of Stahl (1975) [5] and Baskoro et al. (2006) [1] and the previous result of the author Bielak (2009) [2]. Moreover, a family of G-good graphs with s(G)>1 is presented.