Commutative Moufang Loops with Finite Conjugacy Classes of Subloops

It is proved that the following conditions are equivalent for an arbitrary commutative Moufang loop :1) the loop is finite over the center;2) every subloop of defines a finite conjugacy class of subloops;3) every associative subloop of defines a finite conjugacy class of subloops;4) every infinite associative subloop of defines a finite conjugacy class of subloops.     

Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.     

Nondensely defined evolution impulsive differential inclusions with nonlocal conditions

In this paper, we shall establish sufficient conditions for the existence of integral solutions for some nondensely defined evolution impulsive differential inclusions in Banach spaces with nonlocal conditions.     

π1-classification of real arrangements with up to eight lines

One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan (Michigan Math. J. 44(2) (1997) 283), and it turns out that the incidence lattice of such arrangements determines the projective fundamental group. We use actions on the set of wiring diagrams, introduced in (Garber et al. (J. Knot Theory Ramf.), to classify real arrangements of up to 8 lines. In particular, we show that the incidence lattice of such arrangements determines both the affine and the projective fundamental groups.     

A robust and efficient adaptive reweighted estimator of multivariate location and scatter

This article proposes a reweighted estimator of multivariate location and scatter, with weights adaptively computed from the data. Its breakdown point and asymptotic behavior under elliptical distributions are established. This adaptive estimator is able to attain simultaneously the maximum possible breakdown point for affine equivariant estimators and full asymptotic efficiency at the multivariate normal distribution. For the special case of hard-rejection weights and the MCD as initial estimator, it is shown to be more efficient than its non-adaptive counterpart for a broad range of heavy-tailed elliptical distributions. A Monte Carlo study shows that the adaptive estimator is as robust as its non-adaptive relative for several types of bias-inducing contaminations, while it is remarkably more efficient under normality for sample sizes as small as 200.     

Rank estimation in reduced-rank regression

Reduced rank regression assumes that the coefficient matrix in a multivariate regression model is not of full rank. The unknown rank is traditionally estimated under the assumption of normal responses. We derive an asymptotic test for the rank that only requires the response vector have finite second moments. The test is extended to the nonconstant covariance case. Linear combinations of the components of the predictor vector that are estimated to be significant for modelling the responses are obtained.     

On Selfsimilar Jordan Curves on the Plane

We study the attractors of a finite system of planar contraction similarities S _j (j=1,...,n) satisfying the coupling condition: for a set {x ₀,...,x _n} of points and a binary vector (s ₁,...,s _n ), called the signature, the mapping S _j takes the pair {x ₀,x _n} either into the pair {x _j-1,x _j } (if s _j =0) or into the pair {x _j , x _j-1} (if s _j =1). We describe the situations in which the Jordan property of such attractor implies that the attractor has bounded turning, i.e., is a quasiconformal image of an interval of the real axis.