Related papers: Two examples concerning existential undecidability…
We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…
For every natural number $m$, the existentially closed models of the theory of fields with $m$ commuting derivations can be given a first-order geometric characterization in several ways. In particular, the theory of these differential…
We present a heuristic argument based on Honda-Tate theory against many conjectures in `unlikely intersections' over the algebraic closure of a finite field; notably, we conjecture that every abelian variety of dimension 4 is isogenous to a…
We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…
Query answering under existential rules -- implications with existential quantifiers in the head -- is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [BLM10, BLMS11]. Query answering is also…
We address the problem of finding necessary and sufficient conditions for an arbitrary group, not necessarily finite, to admit a faithful irreducible representation over an arbitrary field.
Associative algebras with involution over a field of zero characteristic are considered. It is proved that in this case for any finitely generated associative algebra with involution there exists a finite dimensional algebra with involution…
We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.
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$…
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…
In an earlier paper, we determined the finite fields with indecomposable multiplicative groups and conjectured that there is no infinite field whose multiplicative group is indecomposable. In this paper, we prove this conjecture for several…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…
We show that hereditarily indecomposable spaces can be characterized by a special instance of the Intermediate Value Theorem in their rings of continuous functions.
We extend the construction of bad fields of characteristic zero to the case of arbitrary prescribed divisible green torsion.
The main result of this paper is that if E is a field extension of finite odd degree over a real field Q, and if E is a repeated radical extension of Q, then every intermediate field is also a repeated radical extension of Q. This paper…
We construct a nil algebra over a countable field which has finite but non-zero Gelfand-Kirillov dimension.
We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two-dimensional graph-directed iterated function systems. These…
We prove that for p-optimal fields (a very large subclass of p-minimal fields containing all the known examples) a cell decomposition theorem follows from methods going back to Denef's paper [Invent. Math, 77 (1984)]. We derive from it the…