Related papers: Relative decidability and definability in henselia…

We prove that an infinite field interpretable in a $p$-adically closed field $K$ is definably isomorphic to a finite extension of $K$. The result remains true in any $P$-minimal field where definable functions are generically…

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…

For valued fields $K$ of rank higher than 1, we describe how elements in the henselization $K^h$ of $K$ can be approximated from within $K$; our result is a handy generalization of the well-known fact that in rank 1, all of these elements…

This paper is concerned with algebraic geometry over complete discretely valued fields $K$ of equicharacteristic zero. Several results are given including: the canonical projection $K^{n} \times K\mathbb{P}^{m} \longrightarrow K^{n}$ and…

In his unpublished preprint "Definable Valuations" Koenigsmann shows that every field that admits a t-henselian topology is either real closed or separably closed or admits a definable valuation inducing the t-henselian topology. To show…

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that…

Let $R$ be a real closed field and $K:=R(i)$ its algebraic closure. Let $U\subset K^n$ be an open and definable set in a fixed o-minimal structure. In this note, we study the relationship between definability of a $K$-holomorphic function…

We show that every henselian valued field $L$ of residue characteristic 0 admits a proper subfield $K$ which is dense in $L$. We present conditions under which this can be taken such that $L|K$ is transcendental and $K$ is henselian. These…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

A linear map between two vector spaces has a very important characteristic: a determinant. In modern theory two generalizations of linear maps are intensively used: to linear complexes (the nilpotent chains of linear maps) and to non-linear…

While the natural model-theoretic ranks available in differentially closed fields (of characteristic zero), namely Lascar and Morley rank, are known not to be definable in families of differential varieties; in this note we show that the…

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…

We show that an infinite group $G$ definable in a $1$-h-minimal field admits a strictly $K$-differentiable structure with respect to which $G$ is a (weak) Lie group, and show that definable local subgroups sharing the same Lie algebra have…

We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its…

We give a construction of a large first-order definable family of subrings of finitely generated fields $K$ of any characteristic. We deduce that for any such $K$ there exists a first-order sentence $\varphi_K$ characterising $K$ in the…

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…