Related papers: On Preparation Theorems for $\mathbb{R}_{an,exp}$-…
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.…
This paper presents ReasonFormer, a unified reasoning framework for mirroring the modular and compositional reasoning process of humans in complex decision-making. Inspired by dual-process theory in cognitive science, the representation…
We analyze definably compact groups in o-minimal expansions of ordered groups as a combination of semi-linear groups and groups definable in o-minimal expansions of real closed fields. The analysis involves structure theorems about their…
We consider a definably complete locally o-minimal expansion of an ordered field. We treat two topics in this paper. The first topic is a definable $\mathcal C^r$ approximation of a definable $\mathcal C^{r-1}$ map between definable…
$L$-functions can be viewed axiomatically, such as in the formulation due to Selberg, or they can be seen as arising from cuspidal automorphic representations of $\textrm{GL}(n)$, as first described by Langlands. Conjecturally these two…
We determine sufficient conditions under which certain recursively defined functions are well defined for all real inputs. Given a function $f:\mathbb R\to\mathbb R$, call a decreasing sequence $x_1>x_2>x_3>\cdots$ "$f$-bad" if…
Let $\exp[x_0,x_1,\dots,x_n]$ denote the divided difference of the exponential function. (i) We prove that exponential divided differences are log-submodular. (ii) We establish the four-point inequality $…
Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…
We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
We introduce two-sorted theories in the style of Cook and Nguyen for the complexity classes ParityL and DET, whose complete problems include determinants over GF(2) and Z, respectively. The definable functions in these theories are the…
Given an o-minimal structure expanding the field of reals, we show a piecewise Weierstrass preparation theorem and a piecewise Weierstrass division theorem for definable holomorphic functions. In the semialgebraic setting and for the…
In this article we study definable functions in tame expansions of algebraically closed valued fields. For a given definable function we have two types of results: of type (I), which hold at a neighborhood of infinity, and of type (II),…
Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…
We introduce a new notion of computable function on $\R^N$ and prove some basic properties. We give two applications, first a short proof of Yoshinaga's theorem that periods are \el (they are actually low). We also show that the low complex…
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…
We introduce a notion of distributions on $\mathbb{R}^n$, called distributions of C$^{{\mathrm{exp}}}$-class, based on wavelet transforms of distributions and the theory from Cluckers, Comte, Miller, Rolin, Servi (2018) about…
Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…
While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…