Related papers: On a criterion for a cutoff regularization in the …
This article defines a complement of a function and conditions for existence of such a complement function and presents few algorithms to construct a complement.
We extend an implicit regularization scheme to be applicable in the $n$-dimensional space-time. Within this scheme divergences involving parity violating objects can be consistently treated without recoursing to dimensional continuation.…
The paper concerns a new method to obtain a direct proof of the openness at linear rate/metric regularity of composite set-valued maps on metric spaces by the unification and refinement of several methods developed somehow separately in…
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…
We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.
In this paper a novel criterion for the slicing of the jump set of a function is provided, which bypasses the codimension-one and the parallelogram law techniques developed in $BD$-spaces. The approach builds upon a recent rectifiability…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but…
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…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
We propose a totally functional view of geometric matrix completion problem. Differently from existing work, we propose a novel regularization inspired from the functional map literature that is more interpretable and theoretically sound.…
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecreasing function of the inner product then the learned vector…
We prove that the Hausdorff dimension of the set of points where a function in the Zygmund class in the euclidean space has bounded divided differences, is bigger or equal to 1. A similar result for functions in the Small Zygmund class is…
By a conformal string in Euclidean space is meant a closed critical curve with non-constant conformal curvatures of the conformal arclength functional. We prove that (1) the set of conformal classes of conformal strings is in 1-1…
I explore the possibility of finding an equivalent string representation of two dimensional QCD. I develop the large N expansion of the ${\rm QCD_2}$ partition function on an arbitrary two dimensional Euclidean manifold. If this is related…
We establish an explicit criterion for determining whether a $4 \times 4$ upper-triangular matrix is a contraction with respect to the Euclidean operator norm.
The explicit computation of higher-point conformal blocks in any dimension is usually a challenging task. For two-dimensional conformal field theories in Euclidean signature, the oscillator formalism proves to be very efficient. We…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at…
This paper is devoted to studying of some properties of multivalued mappings in Euclidean space. There were proved theorems on a fixed point for multivalued mappings whose restrictions to some subset in the closure of a domain satisfy "a…