Related papers: The Largest Respectful Function

We prove that every randomized Boolean function admits a supersimulator: a randomized polynomial-size circuit whose output on random inputs cannot be efficiently distinguished from reality with constant advantage, even by polynomially…

Polyregular functions form a robust class of string-to-string functions with polynomial growth, as evidenced by Bojanczyk (2018). This class admits numerous descriptions and enjoys several closure properties. Most notably, polyregular…

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

Eremenko and Lyubich proved that an entire function whose set of singular values is bounded is expanding at points where its image has large modulus. These expansion properties have been at the centre of the subsequent study of this class…

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…

A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…

Distance function to a compact set plays a central role in several areas of computational geometry. Methods that rely on it are robust to the perturbations of the data by the Hausdorff noise, but fail in the presence of outliers. The…

We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…

If uncertainty is modelled by a probability measure, decisions are typically made by choosing the option with the highest expected utility. If an imprecise probability model is used instead, this decision rule can be generalised in several…

For a Tychonoff space $X$, we will denote by $USC_{p}(X)$ ($B_1(X)$) a set of all real-valued upper semicontinuous functions (a set of all Baire functions of class 1) defined on $X$ endowed with the pointwise convergence topology. In this…

In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for…

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

This is the English translation of my old paper 'Definici\'on y estudio de una funci\'on indefinidamente diferenciable de soporte compacto', Rev. Real Acad. Ciencias 76 (1982) 21-38. In it a function (essentially Fabius function) is defined…

We consider transcendental entire functions of finite order for which the zeros and $1$-points are in disjoint sectors. Under suitable hypotheses on the sizes of these sectors we show that such functions must have a specific form, or that…

In this paper, we explore the concept of $\sigma$-quasiconvexity for functions defined on normed vector spaces. This notion encompasses two important and well-established concepts: quasiconvexity and strong quasiconvexity. We start by…

A new classification of real functions and other related real objects defined within a compact interval is proposed. The scope of the classification includes normal real functions and distributions in the sense of Schwartz, referred to…

Ultrafunctions are a particular class of functions defined on a Non Archimedean field R^{*}\supset R. They have been introduced and studied in some previous works ([1],[2],[3]). In this paper we introduce a modified notion of ultrafunction…

Following the ideas of Andrei Lerner in [ A pointwise estimate for the local sharp maximal function with applications to singular integrals" Bull. London Math. Soc. 42 (2010) 843856], we obtain another decomposition of an arbitrary…

Confidence bands are confidence sets for an unknown function f, containing all functions within some sup-norm distance of an estimator. In the density estimation, regression, and white noise models, we consider the problem of constructing…

We extend the Stainless deductive verifier with floating-point support, providing the first automated verification support for floating-point numbers for a subset of Scala that includes polymorphism, recursion and higher-order functions. We…