Related papers: Quantitative approximate definable choices
Hausdorff relation, topologically identifying points in a given space, belongs to elementary tools of modern mathematics. We show that if subtle enough mathematical methods are used to analyze this relation, the conclusions may be…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are…
In a recent paper it was shown that all the Hilbert space formulas for quantum probabilities can be realized as functions of geometric properties of the associated projective space, but those functions were expressed using the structures of…
This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
Given a compact basic semi-algebraic set we provide a numerical scheme to approximate as closely as desired, any finite number of moments of the Hausdorff measure on the boundary of this set. This also allows one to approximate interesting…
Given a compact semialgebraic set S of R^n and a polynomial map f from R^n to R^m, we consider the problem of approximating the image set F = f(S) in R^m. This includes in particular the projection of S on R^m for n greater than m. Assuming…
An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…
The structured low-rank approximation problem for general affine structures, weighted 2-norms and fixed elements is considered. The variable projection principle is used to reduce the dimensionality of the optimization problem. Algorithms…
A semi-projective representation is a homomorphism of a finite group into the group of semi-projective transformations of a finite dimensional vector space over a field. Schur's concept of a representation group for projective…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
This paper is concerned with restricted families of projections in $\mathbb{R}^{3}$. Let $K \subset \mathbb{R}^{3}$ be a Borel set with Hausdorff dimension $\dim K = s > 1$. If $\mathcal{G}$ is a smooth and sufficiently well-curved…
We consider the problem of finding for a given $N$-tuple of polynomials (real or complex) the closest $N$-tuple that has a common divisor of degree at least $d$. Extended weighted Euclidean seminorm of the coefficients is used as a measure…
The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that appear in imprecise-probabilistic decision…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
Haver's near-selection theorem deals with approximate selections of Hausdorff continuous CE-valued mappings defined on $\sigma$-compact metrizable $C$-spaces. In the present paper, we extend this theorem to all paracompact $C$-spaces. The…