Mumford dendrograms and discrete p-adic symmetries
Abstract
In this article, we present an effective encoding of dendrograms by embedding them into the Bruhat-Tits trees associated to -adic number fields. As an application, we show how strings over a finite alphabet can be encoded in cyclotomic extensions of and discuss -adic DNA encoding. The application leads to fast -adic agglomerative hierarchic algorithms similar to the ones recently used e.g. by A. Khrennikov and others. From the viewpoint of -adic geometry, to encode a dendrogram in a -adic field means to fix a set of -rational punctures on the -adic projective line . To is associated in a natural way a subtree inside the Bruhat-Tits tree which recovers , a method first used by F. Kato in 1999 in the classification of discrete subgroups of . Next, we show how the -adic moduli space of with punctures can be applied to the study of time series of dendrograms and those symmetries arising from hyperbolic actions on . In this way, we can associate to certain classes of dynamical systems a Mumford curve, i.e. a -adic algebraic curve with totally degenerate reduction modulo . Finally, we indicate some of our results in the study of general discrete actions on , and their relation to -adic Hurwitz spaces.
Cite
@article{arxiv.0809.1570,
title = {Mumford dendrograms and discrete p-adic symmetries},
author = {Patrick Erik Bradley},
journal= {arXiv preprint arXiv:0809.1570},
year = {2009}
}
Comments
14 pages, 6 figures