Related papers: A P-adic structure which does not interpret an inf…

We study infinite groups interpretable in three families of valued fields: $V$-minimal, power bounded $T$-convex, and $p$-adically closed fields. We show that every such group $G$ has unbounded exponent and that if $G$ is dp-minimal then it…

The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…

We present new examples of finite-dimensional Nichols algebras over fields of positive characteristic. The corresponding braided vector spaces are not of diagonal type, admit a realization as Yetter-Drinfeld modules over finite abelian…

We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.

Using the theory of $(\phi,\Gamma)$-modules and the formalism of Selmer complexes we construct the p-adic height for p-adic representations with coefficients in an affinoid algebra over $Q_p$.

We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…

Let $G$ be a finite $p$-group. We construct a $G$-extension $K/k$ of number fields such that the $p$-adic completion of the unit group of $K$ has a prescribed $\mathbb{Z}_p[G]$-module structure, up to free direct summands.

We show there are intermediate $P$-minimal structures between the semi-algebraic and sub-analytic languages which do not have definable Skolem functions. As a consequence, by a result of Mourgues, this shows there are $P$-minimal structures…

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…

The Pila-Wilkie theorem states that if a set $X\subseteq \mathbb R^n$ is definable in an o-minimal structure $\mathcal R$ and contains `many' rational points, then it contains an infinite semialgebraic set. In this paper, we extend this…

The $H$-ring structure of certain infinite(-dimensional) Grassmannians is discussed using various algebraic and analytical methods but so that cellular arguments are avoided. These methods allow us to discuss these Grassmannian in greater…

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

We present a theory that produces several examples where the homotopy Lie algebra of a complex hyperplane arrangement is not finitely presented. We also present examples of hyperplane arrangements where the enveloping algebra of this Lie…

We construct a matrix algebra $\Lambda(A,B)$ from two given finite dimensional elementary algebras $A$ and $B$ and give some sufficient conditions on $A$ and $B$ under which the derived Jordan--H\"older property (DJHP) fails for…

We present techniques that allow to decide that the dimension of some pointed Hopf algebras associated with non-abelian groups is infinite. These results are consequences of arXiv:0803.2430v1. We illustrate each technique with applications.

Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…

We introduce three notions of partial bihamiltonian structures ($\operatorname{PQ}$, $\operatorname{PN}$ et $\operatorname{P\Omega}$) in the convenient setting defined by Fr\"{o}licher, Kriegl and Michor. We study geometrical objects linked…

In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power…

Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.

In this note we show that no extension of bi-intuitionistic logic, except for classical logic, is structurally complete; indeed, none of them are passively structurally complete. A direct proof of active structural completeness is given for…