On Uniform Global Error Bounds for Convex Inequalities

This paper studies the existence of a uniform global error bound when a convex inequality g 0, where g is a closed proper convex function, is perturbed. The perturbation neighborhoods are defined by small arbitrary perturbations of the epigraph of its conjugate function. Under certain conditions, it is shown that for sufficiently small arbitrary perturbations the perturbed system is solvable and there exists a uniform global error bound if and only if g satisfies the Slater condition and the solution set is bounded or its recession function satisfies the Slater condition. The results are used to derive lower bounds on the distance to ill-posedness.     

Minimizing Irregular Convex Functions: Ulam Stability for Approximate Minima

The main concern of this article is to study Ulam stability of the set of ε-approximate minima of a proper lower semicontinuous convex function bounded below on a real normed space X, when the objective function is subjected to small perturbations (in the sense of Attouch & Wets). More precisely, we characterize the class all proper lower semicontinuous convex functions bounded below such that the set-valued application which assigns to each function the set of its ε-approximate minima is Hausdorff upper semi-continuous for the Attouch–Wets topology when the set $\mathcal{C}(X)$ of all the closed and nonempty convex subsets of X is equipped with the Hausdorff topology. We prove that a proper lower semicontinuous convex function bounded below has Ulam-stable ε-approximate minima if and only if the boundary of any of its sublevel sets is bounded.     

Probabilistic spherical Marcinkiewicz–Zygmund inequalities

Recently, norm equivalences between spherical polynomials and their sample values at scattered sites have been proved. These so-called Marcinkiewicz–Zygmund inequalities involve a parameter that characterizes the density of the sampling set and they are applicable to all polynomials whose degree does not exceed an upper bound that is determined by the density parameter. We show that if one is satisfied by norm equivalences that hold with prescribed probability only, then the upper bound for the degree of the admissible polynomials can be enlarged significantly and that then, moreover, there exist fixed sampling sets which work for polynomials of all degrees.     

Best Approximations of Convex Compact Sets by Balls in the Hausdorff Metric

We deduce an upper bound for the Hausdorff distance between a nonempty bounded set and the set of all closed balls in a strictly convex straight geodesic space X of nonnegative curvature. We prove that the set $\chi \left[ {\rm M} \right]$ of centers of closed balls approximating a convex compact set in the Hausdorff metric in the best possible way is nonempty _X [M] and is contained in M. Some other properties of $\chi \left[ {\rm M} \right]$ also are investigated.     

Pisot substitution sequences,one dimensional cut-and-project sets and bounded remainder sets with fractal boundary

This paper uses a connection between bounded remainder sets in ${\mathbb{R}}^d$ and cut-and-project sets in $\mathbb{R}$ together with the fact that each one-dimensional Pisot substitution sequence is bounded distance equivalent to some lattice in order to construct several bounded remainder sets with fractal boundary. Moreover it is shown that there are cut-and-project sets being not bounded distance equivalent to each other even if they are locally indistinguishable, more precisely: even if they are contained in the same hull.     

Finite problems and the logic of the weak law of excluded middle

A new characteristic of propositional formulas as operations on finite problems, the cardinality of a sufficient solution set, is defined. It is proved that if a formula is deducible in the logic of the weak law of excluded middle, then the cardinality of a sufficient solution set is bounded by a constant depending only on the number of variables; otherwise, the accessible cardinality of a sufficient solution set is close to (greater than the nth root of) its trivial upper bound. This statement is an analog of the authors result about the algorithmic complexity of sets obtained as values of propositional formulas, which was published previously. Also, we introduce the notion of Kolmogorov complexity of finite problems and obtain similar results.     

On the Stability of the Boundary of the Feasible Set in Linear Optimization

This paper analizes the relationship between the stability properties of the closed convex sets in finite dimensions and the stability properties of their corresponding boundaries. We consider a given closed convex set represented by a certain linear inequality system whose coefficients can be arbitrarily perturbed, and we measure the size of these perturbations by means of the pseudometric of the uniform convergence. It is shown that the feasible set mapping is Berge lower semicontinuous at if and only if the boundary mapping satisfies the same property. Moreover, if the boundary mapping is semicontinuous in any sense (lower or upper; Berge or Hausdorff) at , then it is also closed at . All the mentioned stability properties are equivalent when the feasible set is a convex body.     

Maximal sets with no solution to <Emphasis Type="Italic">x</Emphasis>+<Emphasis Type="Italic">y</Emphasis>=3<Emphasis Type="Italic">z</Emphasis>

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture rst made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by Matolcsi and Ruzsa, who made a rst signicant step towards it. Here, we prove the full conjecture by giving an optimal upper bound for the Lebesgue measure of a 3-sum-free subset A of [0; 1], that is, a set containing no solution to the equation x+y=3z where x, y and z are restricted to belong to A. We then address the inverse problem and characterize precisely, among all sets with that property, those attaining the maximal possible measure.     

Exact packing measure of central Cantor sets in the line

In this paper we consider a class of symmetric Cantor sets in $\mathbb{R}$. Under certain separation condition we determine the exact packing measure of such a Cantor set through the computation of the lower density of the uniform probability measure supported on the set. With an additional restriction on the dimension we give also the exact centered Hausdorff measure by computing the upper density.     

Hausdorff measure of infinitely generated self-similar sets

We analyze self-similarity with respect to infinite sets of similitudes from a measure-theoretic point of view. We extend classic results for finite systems of similitudes satisfying the open set condition to the infinite case. We adopt Vitali-type techniques to approximate overlapping self-similar sets by non-overlapping self-similar sets. As an application we show that any open and bounded set with a boundary of null Lebesgue measure always contains a self-similar set generated by a countable system of similitudes and with Lebesgue measure equal to that ofA.     

Sagitta,Lenses, and Maximal Volume

We give a characterization of critical points that allows us to define a metric invariant on all Riemannian manifolds M with a lower sectional curvature bound and an upper radius bound. We show there is a uniform upper volume bound for all such manifolds with an upper bound on this invariant. We generalize results by Grove and Petersen by showing any such M that has volume sufficiently close to this upper bound is homeomorphic to the standard sphere \(S^{n}\) or a standard lens space \(S^n/{\mathbb {Z}}_m\) where \(m\in \{2,3,\ldots \}\) is no larger than an a priori constant.     

Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization

We consider the problem of minimizing a continuous function f over a compact set \({\mathbf {K}}\). We analyze a hierarchy of upper bounds proposed by Lasserre (SIAM J Optim 21(3):864–885, 2011), obtained by searching for an optimal probability density function h on \({\mathbf {K}}\) which is a sum of squares of polynomials, so that the expectation \(\int _{{\mathbf {K}}} f(x)h(x)dx\) is minimized. We show that the rate of convergence is no worse than \(O(1/\sqrt{r})\), where 2r is the degree bound on the density function. This analysis applies to the case when f is Lipschitz continuous and \({\mathbf {K}}\) is a full-dimensional compact set satisfying some boundary condition (which is satisfied, e.g., for convex bodies). The rth upper bound in the hierarchy may be computed using semidefinite programming if f is a polynomial of degree d, and if all moments of order up to \(2r+d\) of the Lebesgue measure on \({\mathbf {K}}\) are known, which holds, for example, if \({\mathbf {K}}\) is a simplex, hypercube, or a Euclidean ball.     

On large minimal blocking sets in PG(2,q)

The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when q is a square. Here the bound is improved if q is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐prime order. The construction can be regarded as a generalization of Buekenhout's construction of unitals. For example, if q is a cube, then our construction gives minimal blocking sets of size q^4/3 + 1 or q^4/3 + 2. Density results for the spectrum of minimal blocking sets in Galois planes of non‐prime order is also presented. The most attractive case is when q is a square, where we show that there is a minimal blocking set for any size from the interval . © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 25–41, 2005.     

Holomorphic automorphisms of complex Banach spaces

We consider holomorphic automorphisms of infinite dimensional complex Banach spaces. First we look at automorphisms with an attracting fixed point to construct Fatou–Bieberbach domains in Banach spaces. Second, we look tame sets in Banach spaces. Recall that a discrete set in X is tame if it can be mapped onto an arithmetic progression via an automorphism of X. We show that bounded discrete sets of Banach spaces allowing a Schauder basis are tame. In contrast, \(l_\infty \) has several bounded discrete sets which are not tame.     

The De Giorgi measure and an obstacle problem related to minimal surfaces in metric spaces

We study the existence of a set with minimal perimeter that separates two disjoint sets in a metric measure space equipped with a doubling measure and supporting a Poincaré inequality. A measure constructed by De Giorgi is used to state a relaxed problem, whose solution coincides with the solution to the original problem for measure theoretically thick sets. Moreover, we study properties of the De Giorgi measure on metric measure spaces and show that it is comparable to the Hausdorff measure of codimension one. We also explore the relationship between the De Giorgi measure and the variational capacity of order one. The theory of functions of bounded variation on metric spaces is used extensively in the arguments.     

Characterizations of simultaneous farthest point in normed linear spaces with applications

In this paper, we consider a problem of best approximation (simultaneous farthest point) for bounded sets in a real normed linear space X. We study simultaneous farthest point in X by elements of bounded sets, and present various characterizations of simultaneous farthest point of elements by bounded sets in terms of the extremal points of the closed unit ball of X ^*, where X ^* is the dual space of X. We establish the characterizations of simultaneous farthest points for bounded sets in , the space of all real-valued continuous functions on a compact topological space Q endowed with the usual operations and with the norm . It is important to state clearly that the contribution of this paper in relation with the previous works (see, for example, [9, Theorem 1.13]) is a technical method to represent the distance from a bounded set to a compact convex set in X which specifically concentrates on the Hahn-Banach Theorem in X.     

Pointwise behaviour of Orlicz–Sobolev functions

We study the regularity of Orlicz–Sobolev functions on metric measure spaces equipped with a doubling measure. We show that each Orlicz–Sobolev function is quasicontinuous and has Lebesgue points outside a set of capacity zero and that the discrete maximal operator is bounded in the Orlicz–Sobolev space. We also show that if the Hardy–Littlewood maximal operator is bounded in the Orlicz space $L^{\Psi}(X)We study the regularity of Orlicz–Sobolev functions on metric measure spaces equipped with a doubling measure. We show that each Orlicz–Sobolev function is quasicontinuous and has Lebesgue points outside a set of capacity zero and that the discrete maximal operator is bounded in the Orlicz–Sobolev space. We also show that if the Hardy–Littlewood maximal operator is bounded in the Orlicz space , then each Orlicz–Sobolev function can be approximated by a H?lder continuous function both in the Lusin sense and in norm. The research is supported by the Centre of Excellence Geometric Analysis and Mathematical Physics of the Academy of Finland.     

Random Steiner symmetrizations of sets and functions

In this article we prove almost sure convergence, in the L ₁ distance, of sequences of random Steiner symmetrizations of measurable sets having finite measure to the ball having the same measure. From this result we deduce analogous statements concerning the almost sure convergence to the spherical symmetrization of random Steiner symmetrizations of non negative L _p functions in the natural norm and uniform convergence of non negative continuous functions with bounded support. The latter result is finally used to prove that sequences of random symmetrizations of a compact set converge almost surely in the Hausdorff distance to the ball having the same measure, providing another proof of Mani-Levitska’s conjecture besides the one given in 2006 by Van Schaftingen (Topol Methods Nonlinear Anal 28(1): 61–85, 2006).     

An Analog of Titchmarsh’s Theorem for the Fourier–Walsh Transform

The space clos(X) of all nonempty closed subsets of an unbounded metric space X is considered. The space clos(X) is endowed with a metric in which a sequence of closed sets converges if and only if the distances from these sets to a fixed point θ are bounded and, for any r, the sequence of the unions of the given sets with the exterior balls of radius r centered at θ converges in the Hausdorff metric. The metric on clos(X) thus defined is not equivalent to the Hausdorff metric, whatever the initial metric space X. Conditions for a set to be closed, totally bounded, or compact in clos(X) are obtained; criteria for the bounded compactness and separability of clos(X) are given. The space of continuous maps from a compact space to clos(X) is considered; conditions for a set to be totally bounded in this space are found.