Related papers: The Largest Respectful Function
A parking function is a function $\pi:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking…
Approximating a manifold-valued function from samples of input-output pairs consists of modeling the relationship between an input from a vector space and an output on a Riemannian manifold. We propose a function approximation method that…
A new representation is proposed for functions in a Sobolev space with dominating mixed smoothness on an $N$-dimensional hyperrectangle. In particular, it is shown that these functions can be expressed in terms of their highest-order mixed…
Interestingness is an important criterion by which we judge knowledge discovery. But, interestingness has escaped all attempts to capture its intuitive meaning into a concise and comprehensive form. A unifying paradigm is formulated by…
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
In this paper we present an abstraction-refinement approach to Satisfiability Modulo the theory of transcendental functions, such as exponentiation and trigonometric functions. The transcendental functions are represented as uninterpreted…
Granville and Soundararajan have recently introduced the notion of pretentiousness in the study of multiplicative functions of modulus bounded by 1, essentially the idea that two functions which are similar in a precise sense should exhibit…
We consider the massive {perturbation} of the Generalised Minimal Model introduced by Al. Zamolodchikov. The one-point functions in this case are supposed to be described by certain function $\omega(\z,\xi)$. We prove that this function…
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…
Bellantoni and Cook have given a function-algebra characterization of the polynomial-time computable functions via an unbounded recursion scheme which is called safe recursion. Inspired by their work, we characterize the exponential-time…
In the present paper a new concept of representability is introduced, which can be applied to not total and also to intransitive relations (semiorders in particular). This idea tries to represent the orderings in the simplest manner,…
A soft-max function has two main efficiency measures: (1) approximation - which corresponds to how well it approximates the maximum function, (2) smoothness - which shows how sensitive it is to changes of its input. Our goal is to identify…
In the frequentist program, inferential methods with exact control on error rates are a primary focus. The standard approach, however, is to rely on asymptotic approximations, which may not be suitable. This paper presents a general…
In this note we axiomatize the classes of rudimentary functions, primitive recursive functions, safe recursive set functions, and predicatively computable functions.
We prove that every smooth closed manifold admits a smooth real-valued function with only two critical values. We call a function of this type a \emph{Reeb function}. We prove that for a Reeb function we can prescribe the set of minima (or…
It is known that a subharmonic function of finite order $\rho$ can be approximated by the logarithm of the modulus of an entire function at the point $z$ outside an exceptional set up to $C\log|z|$. In this article we prove that if such an…
In this article, we define a special function called the Bigamma function. It provides a generalization of Euler's gamma function. Several algebraic properties of this new function are studied. In particular, results linking this new…
Exponential-constructible functions are an extension of the class of constructible functions. This extension was formulated by Cluckers-Loeser in the context of semi-algebraic and sub-analytic structures, when they studied stability under…
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…
The representation theory of tensor functions is a powerful mathematical tool for constitutive modeling of anisotropic materials. A major limitation of the traditional theory is that many point groups require fourth- or sixth-order…