Related papers: Low functions of reals

We give a construction of quasiminimal fields equipped with pseudo-analytic maps, generalising Zilber's pseudo-exponential function. In particular we construct pseudo-exponential maps of simple abelian varieties, including…

A function f is continuous iff the PRE-image f^{-1}[V] of any open set V is open again. Dual to this topological property, f is called OPEN iff the IMAGE f[U] of any open set U is open again. Several classical Open Mapping Theorems in…

Exploring further the connection between exponentiation on real closed fields and the existence of an integer part modelling strong fragments of arithmetic, we demonstrate that each model of true arithmetic is an integer part of an…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

A theorem of Davis, Figiel, Johnson and Pe{\l}czy\'nski tells us that weakly-compact operators between Banach spaces factor through reflexive Banach spaces. The machinery underlying this result is that of the real interpolation method,…

We give a new elementary proof of the following theorem: if all critical points of a rational function g belong to the real line then there exists a fractional linear transformation L such that L(g) is a real rational function. Then we…

Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular that the so-called first Feigenbaum constant is a polynomial…

It is known that rational approximations of elementary analytic functions (exp, log, trigonometric, and hyperbolic functions, and their inverse functions) are computable in the weak complexity class $\mathrm{TC}^0$. We show how to formalize…

Inspired by the idea of blurring the exponential function, we define blurred variants of the $j$-function and its derivatives, where blurring is given by the action of a subgroup of $\rm{GL}_2(\mathbb{C})$. For a dense subgroup (in the…

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…

We show quantifier elimination theorems for real closed valued fields with separated analytic structure and overconvergent analytic structure in their natural one-sorted languages and deduce that such structures are weakly o-minimal. We…

Cluckers and Lipshitz have shown that real closed fields equipped with real analytic structure are o-minimal. This generalizes the well-known subanalytic structure $\mathbb{R}_{\mathrm{an}}$ on the real numbers. We extend this line of…

We construct compact descriptions of function fields and number fields.

Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…

We prove a contraction property of certain classes of smooth functions, whose absolute values of elements are log-hyperharmonic functions in the unit ball, thus extending the results of Kulikov to higher-dimensional space (GAFA (2022)).…

In the algebra $\Cal A=\Cal L(PSL(2,\Bbb Z)\otimes B(H)=\Cal L(F_N)\otimes B(H)$, $N$ finite, there exists a bounded subnormal operator $Z$, such that $\Cal A$ is the weak closure of linear span of the set ${(Z^*)^n Z^m| n,m=0,1,2...}$.

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which formalises computing with real numbers. A fundamental…