Related papers: Low functions of reals
Partial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial…
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…
We study function spaces that are related to square-integrable, irreducible, unitary representations of several low-dimensional nilpotent Lie groups. These are new examples of coorbit theory and yield new families of function spaces on…
We prove that rationally connected varieties over the function field of a complex curve satisfy weak approximation for places of good reduction.
This is a survey of weak approximation over complex function fields, touching on the Koll'ar-Miyaoka-Mori theorem, places of good and bad reduction, the special case of rational surfaces, rationally simply connected varieties, and…
Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…
In this paper, we give a short proof of a theorem by Koll\'{a}r on hereditarily rational functions. This is an answer to his appeal to find an elementary proof which does not rely so much on resolution of singularities. Our approach does…
We exhibit explicit orthogonal decompositions of every multidimensional restricted root space of a real semi-simple Lie algebra. We then show a link between this result and a radiality property of smooth functions on G-homogeneous spaces…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
In this paper we give simple extension and uniqueness theorems for restricted additive and logarithmic functional equations.
We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…
Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
A further significant extension is presented of the infinitely large class of differential algebras of generalized functions which are the basic structures in the nonlinear algebraic theory listed under 46F30 in the AMS Mathematical Subject…
Abstrct: In this note, by considering fractionally linear functions over a finite field and consequently developing an abstract sequence, we study some of its properties.
A promising theory of quaternion-valued functions of one quaternionic variable, now called slice regular functions, has been introduced in 2006. The basic examples of slice regular functions are power series centered at 0 on their balls of…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
Using reduction of spherical functions, we obtain generators of the algebra and the field of invariants for the coadjoint representation of Borel and maximal nilpotent subalgebras of simple Lie algebras.
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…
We develop the theory of minimal realizations and factorizations of rational functions where the coefficient space is a ring of the type introduced in our previous work, the scaled quaternions, which includes as special cases the…