More on P-Stable Convex Sets in Banach Spaces

We study the asymptotic behavior and limit distributions for sums S _n =b_n ^-1 _i=1 ⁿ _i,where _i, i 1, are i.i.d. random convex compact (cc) sets in a given separable Banach space B and summation is defined in a sense of Minkowski. The following results are obtained: (i) Series (LePage type) and Poisson integral representations of random stable cc sets in B are established; (ii) The invariance principle for processes S _n(t) =b_n ^-1 _i=1 ^[nt] _i, t[0, 1], and the existence of p-stable cc Levy motion are proved; (iii) In the case, where _i are segments, the limit of S _n is proved to be countable zonotope. Furthermore, if B = R ^d , the singularity of distributions of two countable zonotopes Y_{p 1}, ₁,Y_{p 2}, ₂, corresponding to values of exponents p ₁, p ₂ and spectral measures ₁, ₂, is proved if either p ₁ p ₂ or _{1 2}; (iv) Some new simple estimates of parameters of stable laws in R ^d , based on these results are suggested.     

On 1-Blocking Sets in PG(n,q), n ≥ 3

In this article we study minimal1-blocking sets in finite projective spaces _PG(n,q),n 3. We prove that in PG(n,q ²),q = p ^h , p prime, p > 3,h 1, the second smallest minimal 1-blockingsets are the second smallest minimal blocking sets, w.r.t.lines, in a plane of PG(n,q ²). We also study minimal1-blocking sets in PG(n,q ³), n 3, q = p ^h, p prime, p > 3,q 5, and prove that the minimal 1-blockingsets of cardinality at most q 3 + q ² + q + ¹ are eithera minimal blocking set in a plane or a subgeometry PG(3,q).     

Komlós Theorem for Unbounded Random Sets

We present the Komlós theorem for multivalued functions whose values are closed (possibly unbounded) convex subsets of a separable Banach space. Komlós theorem can be seen as a generalization of the SLLN for it deals with a sequence of integrable multivalued functions that do not have to be identically distributed nor independent. The Artstein–Hart SLLN for random sets with values in Euclidean spaces is derived from the main result. Finally, since the main theorem concerns multifunctions whose values are allowed to be unbounded, we can restate it in terms of normal integrands (random lower semicontinuous functions).     

Porosity of ill-posed problems

We prove that in several classes of optimization problems, including the setting of smooth variational principles, the complement of the set of well-posed problems is -porous.

     

Avoidable algebraic subsets of Euclidean space

Fix an integer and consider real -dimensional . A partition of avoids the polynomial , where each is an -tuple of variables, if there is no set of the partition which contains distinct such that . The polynomial is avoidable if some countable partition avoids it. The avoidable polynomials are studied here. The polynomial is an especially interesting example of an avoidable one. We find (1) a countable partition which avoids every avoidable polynomial over , and (2) a characterization of the avoidable polynomials. An important feature is that both the ``master' partition in (1) and the characterization in (2) depend on the cardinality of .

     

Bayesian Multiscale Smoothing for Making Inferences About Features in Scatterplots

A rather common problem of data analysis is to find interesting features, such as local minima, maxima, and trends in a scatterplot. Variance in the data can then be a problem and inferences about features must be made at some selected level of significance. The recently introduced SiZer technique uses a family of nonparametric smooths of the data to uncover features in a whole range of scales. To aid the analysis, a color map is generated that visualizes the inferences made about the significance of the features. The purpose of this article is to present Bayesian versions of SiZer methodology. Both an analytically solvable regression model and a fully Bayesian approach that uses Gibbs sampling are presented. The prior distributions of the smooths are based on a roughness penalty. Simulation based algorithms are proposed for making simultaneous inferences about the features in the data.     

Feasibility in reverse convex mixed-integer programming

In this paper we address the problem of the infeasibility of systems defined by reverse convex inequality constraints, where some or all of the variables are integer. In particular, we provide a polynomial algorithm that identifies a set of all constraints critical to feasibility (CF), that is constraints that may affect a feasibility status of the system after some perturbation of the right-hand sides. Furthermore, we will investigate properties of the irreducible infeasible sets and infeasibility sets, showing in particular that every irreducible infeasible set as well as infeasibility sets in the considered system, are subsets of the set CF of constraints critical to feasibility.     

Ascoli-Arzelà type theorem for rational iterations on the complex projective plane

For a dominant algebraically stable rational self-map of the complex projective plane of degree at least 2, we will consider three different definitions of the Fatou set and show the equivalence of them (Ascoli-Arzelà type theorem). As a corollary, it follows that all Fatou components are Stein. This is an improvement of an early result by Fornæss and Sibony.

     

Further Considerations on a Variational Property of Integral Functionals

In this note, we point out that the conclusion of Theorem 2.1 of Ref. 1 applies to any decomposable linear subspace of L ^p (T, E).