Home Trees of definable sets over the p-adics
Article
Licensed
Unlicensed Requires Authentication

Trees of definable sets over the p-adics

  • Immanuel Halupczok
Published/Copyright: February 9, 2010
Become an author with De Gruyter Brill
Journal für die reine und angewandte Mathematik
From the journal Volume 2010 Issue 642

Abstract

To a definable subset of (or to a scheme of finite type over ℤp) one can associate a tree in a natural way. It is known that the corresponding Poincaré series ∑NλZλ ∈ ℤ[[Z]] is rational, where Nλ is the number of nodes of the tree at depth λ. 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 , and for one-dimensional sets.

Received: 2008-06-27
Revised: 2009-02-02
Published Online: 2010-02-09
Published in Print: 2010-May

© Walter de Gruyter Berlin · New York 2010

Downloaded on 6.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/crelle.2010.040/html?lang=en
Scroll to top button