Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
In the o-minimal setting, parametrizations of definable sets form a key component of the Pila-Wilkie counting theorem. A similar strategy based on parametrizations was developed by Cluckers-Comte-Loeser and Cluckers-Forey-Loeser to prove an analogue of the Pila-Wilkie theorem for subanalytic sets in p-adic fields. In joint work with R. Cluckers and I. Halupczok, we prove the existence of parametriza- tions for arbitrary definable sets in Hensel minimal fields, leading to a counting theorem in this general context.
[-]
In the o-minimal setting, parametrizations of definable sets form a key component of the Pila-Wilkie counting theorem. A similar strategy based on parametrizations was developed by Cluckers-Comte-Loeser and Cluckers-Forey-Loeser to prove an analogue of the Pila-Wilkie theorem for subanalytic sets in p-adic fields. In joint work with R. Cluckers and I. Halupczok, we prove the existence of parametriza- tions for arbitrary definable sets in Hensel ...
[+]
14G05 ; 03C98 ; 11D88