Related papers: Dp-minimality: basic facts and examples

We explain the concept of p-values presupposing only rudimentary probability theory. We also use the occasion to introduce the notion of p-function, so that p-values are values of a p-function. The explanation is restricted to the discrete…

We show quantifier elimination theorems for real closed valued fields with separated analytic structure and overconvergent analytic structure in their natural one-sorted languages and deduce that such structures are weakly o-minimal. We…

We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…

Dual lattice is an important concept of Euclidean lattices. In this paper, we first give the right definition of the concept of the dual lattice of a $p$-adic lattice from the duality theory of locally compact abelian groups. The concrete…

We study the definable topological dynamics $(G(M), S_G(M))$ of a definable group acting on its type space, where $M$ is either an $o$-minimal structure or a $p$-adically closed field, and $G$ a definable amenable group. We focus on the…

The aim of this paper is to propose an ``elementary" approach to Coleman's theory of p-adic abelian integrals. Our main tool is a theory of commutative p-adic Lie groups (the logarithm map); we use neither dagger analysis nor…

We discuss the relation of tiling, weak tiling and spectral sets in finite abelian groups. In particular, in elementary $p$-groups $(\mathbb{Z}_p)^d$, we introduce an averaging procedure that leads to a natural object of study: a 4-tuple of…

Recently, Schlage-Puchta proved super multiplicity of $p$-deficiency for normal subgroups of $p$-power index. We extend this result to all normal subgroups of finite index. We then use the methods of the proof to show that some groups with…

We study the model theory of covers of groups definable in o-minimal structures. This includes the case of covers of compact real Lie groups. In particular we study categoricity questions, pointing out some notable differences with the case…

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…

{Generalizing the notion of nil cleanness from \cite{D13}, in parallel to \cite{DM14}, we define the concept of {\it weak nil cleanness} for an arbitrary ring. Its comprehensive study in different ways is provided as well. A decomposition…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

In this paper, we construct a digraph structure on $p$-adic dynamical systems defined by rational functions. We study the conditions under which the functions are measure-preserving, invertible and isometric, ergodic, and minimal on…

For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the…

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…

Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…

The second author has recently shown ([20]) that any selectively (a) almost disjoint family must have cardinality strictly less than $2^{\alpeh_0}$, so under the Continuum Hypothesis such a family is necessarily countable. However, it is…

We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…

The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…