Related papers: The Largest Respectful Function
We introduce the notion of admissible functions and show that the family of L-functions introduced by Lim in [Nonlinear Anal. 46(2001), 113--120] and the family of test functions introduced by Geraghty in [Proc. Amer. Math. Soc., 40(1973),…
The notion of constructible functions in the setting of tame real geometry has been introduced by Cluckers and Dan Miller in their work on parametric integration of globally subanalytic functions. A function on a globally subanalytic set is…
We prove that the maximum of two smooth strictly plurisubharmonic functions on an almost complex manifold can be uniformly approximated by smooth strictly plurisubharmonic functions.
The article discusses the representation of discrete functions defined in an analytic form without the use of approximations, namely the Heaviside function, identity function, the Dirac delta function and the prime-counting function. Also…
The piecewise-concave function may be used to approximate a wide range of other functions to arbitrary precision over a bounded set. In this short paper, this property is proven for three function classes: (a) the multivariate twice…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
We prove that one may approximate parametric suprema of constructible and power-constructible functions using functions within the same class. This resolves a conjecture by Adiceam and Cluckers, which was posited after studying a question…
In this article, we use a class of harmonic functions (maybe multi-valued) to study the equality part in a weighted version of Suita conjecture for higher derivatives and finite points case, and we obtain some sufficient and necessary…
We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…
Given noisy data, function estimation is considered when the unknown function is known apriori to consist of a small number of regions where the function is either convex or concave. When the regions are known apriori, the estimate is…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…
Under mild assumptions, we prove that any random multifunction can be represented as the set of minimizers of an infinitely many differentiable normal integrand, which preserves the convexity of the random multifunction. We provide several…
In the recent development in a various disciplines of physics, it is noted the need for including the deformed versions of the exponential functions. In this paper, we consider the deformations which have two purposes: to have them like…
We describe the supports of a class of real-valued maps on $C*(X)$ introduced by Radul. Using this description, a characterization of compact-valued retracts of a given space in terms of functional extenders is obtained. For example, if…
We propose a novel definition of Shapley values with uncertain value functions based on first principles using probability theory. Such uncertain value functions can arise in the context of explainable machine learning as a result of…
This paper demonstrates that the space of piecewise smooth functions can be well approximated by the space of functions defined by a set of simple (non-linear) operations on smooth uniform splines. The examples include bivariate functions…
Subadditive set functions play a pivotal role in computational economics (especially in combinatorial auctions), combinatorial optimization or artificial intelligence applications such as interpretable machine learning. However, specifying…
To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…
In analogy with the Thurston norm, we define for an orientable 3-manifold $M$ a numerical function on $H_2(M;Q/Z)$. This function measures the minimal complexity of folded surfaces representing a given homology class. A similar function is…