Trees of definable sets over the p-adics

From MaRDI portal
Publication:3577938

DOI10.1515/CRELLE.2010.040zbMATH Open1202.14023arXiv0806.4469OpenAlexW2139153169WikidataQ59903314 ScholiaQ59903314MaRDI QIDQ3577938FDOQ3577938


Authors: Immanuel Halupczok Edit this on Wikidata


Publication date: 13 July 2010

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Abstract: To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = sum_i N_i X^i is rational, where N_i is the number of nodes of the tree at depth i. This suggests that the trees themselves are far from arbitrary. We state a conjectural, purely combinatorial description of the class of possible trees and provide some evidence for it. We verify that any tree in our class indeed arises from a definable set, and we prove that the tree of a definable set (or of a scheme) lies in our class in three special cases: under weak smoothness assumptions, for definable subsets of Z_p^2, and for one-dimensional sets.


Full work available at URL: https://arxiv.org/abs/0806.4469




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Trees of definable sets over the \(p\)-adics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577938)