Non-archimedean Yomdin-Gromov parametrizations and points of bounded height

We prove an analogue of the Yomdin-Gromov Lemma for $p$-adic definable sets and more broadly in a non-archimedean, definable context. This analogue keeps track of piecewise approximation by Taylor polynomials, a nontrivial aspect in the totally disconnected case. We apply this result to bound the number of rational points of bounded height on the transcendental part of $p$-adic subanalytic sets, and to bound the dimension of the set of complex polynomials of bounded degree lying on an algebraic variety defined over $\mathbb{C} ((t))$, in analogy to results by Pila and Wilkie, resp. by Bombieri and Pila. Along the way we prove, for definable functions in a general context of non-archimedean geometry, that local Lipschitz continuity implies piecewise global Lipschitz continuity.Comment: 54 pages; revised, section 5.6 adde

Timed pushdown automata revisited

This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by this result, we advocate the framework of first-order definable PDA, a specialization of PDA in sets with atoms, as the right setting to define and investigate timed extensions of PDA. The general model obtained in this way is Turing complete. As our second result we prove NEXPTIME upper complexity bound for the non-emptiness problem for an expressive subclass. As a byproduct, we obtain a tight EXPTIME complexity bound for a more restrictive subclass of PDA with timeless stack, thus subsuming the complexity bound known for dense-timed PDA.Comment: full technical report of LICS'15 pape