Related papers: Square distance functions are Polyak-{\L}ojasiewic…
In this paper we discuss three distance functions on the set of convex bodies. In particular we study the convergence of Delzant polytopes, which are fundamental objects in symplectic toric geometry. By using these observations, we derive…
In the paper, properties of orbit functions are reviewed and further developed. Orbit functions on the Euclidean space $E_n$ are symmetrized exponential functions. The symmetrization is fulfilled by a Weyl group corresponding to a…
In this paper, we generalize the Minkowski distance by defining a new distance function in n-dimensional space, and we show that this function determines also a metric family as the Minkowski distance. Then, we consider three special cases…
We study the class of Lorentzian symmetric polynomials and Lorentzian symmetric functions, which are defined to be symmetric functions for which every truncation of variables is Lorentzian. Similar to the space of Lorentzian polynomials, we…
We study differentiability properties of functions defined in the euclidean space in terms of a conical square function which is analogue to the classical square function introduced by Stein and Zygmund in the sixties. Pointwise…
We propose a proximal algorithm for minimizing objective functions consisting of three summands: the composition of a nonsmooth function with a linear operator, another nonsmooth function, each of the nonsmooth summands depending on an…
We discuss a number of techniques for determining the Minkowski dimension of bounded subsets of some Euclidean space of any dimension, including: the box-counting dimension and equivalent definitions based on various box-counting functions;…
We show that every finite-dimensional Euclidean space contains compact universal differentiability sets of upper Minkowski dimension one. In other words, there are compact sets $S$ of upper Minkowski dimension one such that every Lipschitz…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
Approximative properties of linear summation methods of Fourier series are considered in the Orlicz type spaces ${\mathcal S}_{M}$. In particular, in terms of approximations by such methods, constructive characteristics are obtained for…
We present a new type of matrix regularization, which is based on matrix-valued functions defined on a cylinder. If non-commutative coordinates of a fuzzy space are defined by a regularization of such functions, we show that a classical…
In this paper we provide new several Jackson-type approximations results for continuous fuzzy-number-valued functions which improve several previous ones. We use alternative techniques adapted from Interval Analysis which rely on the…
We generalize Pach and de Zeeuw's bound for distinct distances between points on two curves, from algebraic curves to Pfaffian curves. Pfaffian curves include those that can be defined by any combination of elementary functions, including…
A distance-squared function is one of the most significant functions in the application of singularity theory to differential geometry. In this paper, we define naturally extended mappings of distance-squared functions, wherein each…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…
We study the level sets of the distance function from a boundary point of a convex set in Euclidean space. We provide a lower bound for the range of connectivity of the level sets, in terms of the critical points of the distance function in…
Given a function $f$ defined on a nonempty and convex subset of the $d$-dimensional Euclidean space, we prove that if $f$ is bounded from below and it satisfies a convexity-type functional inequality with infinite convex combinations, then…
In view of the minimization of a function which is the sum of a differentiable function $f$ and a convex function $g$ we introduce descent methods which can be viewed as produced by inexact auxiliary problem principleor inexact variable…
We consider sums of oscillating functions on intervals in cyclic groups of size close to the square root of the size of the group. We first prove non-trivial estimates for intervals of length slightly larger than this square root (bridging…
We use Fra\" iss\'e theoretic methods to construct several universal and ultrahomogeneous Polish metric structures. Namely, universal and ultrahomogeneous Polish metric space equipped with countably many closed subsets of its powers,…