Related papers: Dynamic computations inside the algebraic closure …
We investigate what henselian valuations on ordered fields are definable in the language of ordered rings. This leads towards a systematic study of the class of ordered fields which are dense in their real closure. Some results have…
Suppose that $k$ is an arbitrary field. Consider the field $k((x_1,...,x_n))$, which is the quotient field of the ring $k[[x_1,...,x_n]]$ of formal power series in the variables $x_1,...,x_n$, with coefficients in $k$. Suppose that $\sigma$…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We consider the expansion of the real field by the group of rational points of an elliptic curve over the rational numbers. We prove a completeness result, followed by a quantifier elimination result. Moreover we show that open sets…
We develop the basic theory of geometrically closed rings as a generalisation of algebraically closed fields, on the grounds of notions coming from positive model theory and affine algebraic geometry. For this purpose we consider several…
The work is devoted to the variety of $2$-dimensional algebras over an algebraically closed field. Firstly, we classify such algebras modulo isomorphism. Then we describe the degenerations and the closures of principal algebra series in the…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
Given an algebraically closed field $K$, a dynamical sequence over $K$ is a $K$-valued sequence of the form $a(n):= f(\phi^n(x_0))$, where $\phi\colon X\to X$ and $f\colon X\to\mathbb{A}^1$ are rational maps defined over $K$, and $x_0\in X$…
We introduce the notions of open-closed field algebra and open-closed field algebra over a vertex operator algebra V. In the case that V satisfies certain finiteness and reductivity conditions, we show that an open-closed field algebra over…
In this memoir, we seek to construct a dynamical theory as complete as possible to describe the algebraic properties of the field of real numbers in constructive mathematics without axiom of dependent choice. We propose a theory which turns…
We give an automata-theoretic description of the algebraic closure of the rational function field F_q(t) over a finite field, generalizing a result of Christol. The description takes place within the Hahn-Mal'cev-Neumann field of…
We introduce a graded version of dagger closure and prove that it coincides with solid closure for homogeneous ideals in two dimensional $\mathbb{N}$-graded domains of finite type over a field.
Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression whose input changes slightly from one iteration to the next.…
The Lie algebra of planar vector fields with coefficients from the field of rational functions over an algebraically closed field of characteristic zero is considered. We find all finite-dimensional Lie algebras that can be realized as…
Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…
Pseudo algebraically closed, pseudo real closed, and pseudo $p$-adically closed fields are examples of unstable fields that share many similarities, but have mostly been studied separately. In this text, we propose a unified framework for…
We construct some inverse-closed algebras of bounded integral operators with operator-valued kernels, acting in spaces of vector-valued functions on locally compact groups. To this end we make systematic use of covariance algebras…
In this manuscript, the authors derive closed formula for definite integrals of combinations of powers and logarithmic functions of complicated arguments and express these integrals in terms of the Hurwitz zeta. These derivations are then…
We give a valuation theoretic characterization for a real closed field to be recursively saturated. Our result extends the characterization of Harnik and Ressayre \cite{hr} for a divisible ordered abelian group to be recursively saturated.
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…