Related papers: Computable valued fields

We conjecture that a $p$-algebra over a complete discrete valued field $K$ contains a totally ramified purely inseparable subfield if and only if it contains a totally ramified cyclic maximal subfield. We prove the conjecture in several…

Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…

We prove a tight bound on the number of realized $0/1$ patterns (or equivalently on the Vapnik-Chervonenkis codensity) of definable families in models of the theory of algebraically closed valued fields with a non-archimedean valuation. Our…

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

We give a characterization of finitely ramified $\omega$-pseudo complete valued fields of mixed characteristic $(0, p)$, with fixed residue field $k$ and value group $G$ of cardinality $\aleph_{1}$, in terms of a Hahn-like construction over…

Let $K$ be an NIP field and let $v$ be a henselian valuation on $K$. We ask whether $(K,v)$ is NIP as a valued field. By a result of Shelah, we know that if $v$ is externally definable, then $(K,v)$ is NIP. Using the definability of the…

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

Let $p$ be a prime and let $\mathbb{Q}_p$ be the field of $p$-adic numbers. It is known that the finite extensions of $\mathbb{Q}_p$ of a given degree are finite up to isomorphism. Given a cubic field extension $L$ of $\mathbb{Q}_p$…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Some aspects of analysis involving fields with absolute value functions are discussed, which includes the real or complex numbers with their standard absolute values, as well as ultrametric situations like the p-adic numbers.

We classify Artin-Schreier extensions of valued fields with non-trivial defect according to whether they are connected with purely inseparable extensions with non-trivial defect, or not. We use this classification to show that in positive…

For an arbitrary valued field $(K,v)$ and a given extension $v(K^*)\hookrightarrow\Lambda$ of ordered groups, we analyze the structure of the tree formed by all $\Lambda$-valued extensions of $v$ to the polynomial ring $K[x]$. As an…

We study when the property that a field is dense in its real and p-adic closures is elementary in the language of rings and deduce that all models of the theory of algebraic fields have this property.

Let $(K,\nu)$ be an arbitrary-rank valued field, $R_\nu$ its valuation ring, $K(\alpha)/K$ a separable finite field extension generated over $K$ by a root of a monic irreducible polynomial $f\in R_\nu[X]$. We give necessary and sufficient…

Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…

We associate canonical virtual motives to definable sets over a field of characteristic zero. We use this construction to show that very general p-adic integrals are canonically interpolated by motivic ones.

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),…

The following conjecture is due to Shelah-Hasson: Any infinite strongly NIP field is either real closed, algebraically closed, or admits a non-trivial definable henselian valuation, in the language of rings. We specialise this conjecture to…

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is defined through Turing machines with infinite inputs which can…