English

Mumford dendrograms and discrete p-adic symmetries

Discrete Mathematics 2009-06-24 v1 Mathematical Physics math.MP Genomics

Abstract

In this article, we present an effective encoding of dendrograms by embedding them into the Bruhat-Tits trees associated to pp-adic number fields. As an application, we show how strings over a finite alphabet can be encoded in cyclotomic extensions of Qp\mathbb{Q}_p and discuss pp-adic DNA encoding. The application leads to fast pp-adic agglomerative hierarchic algorithms similar to the ones recently used e.g. by A. Khrennikov and others. From the viewpoint of pp-adic geometry, to encode a dendrogram XX in a pp-adic field KK means to fix a set SS of KK-rational punctures on the pp-adic projective line P1\mathbb{P}^1. To P1S\mathbb{P}^1\setminus S is associated in a natural way a subtree inside the Bruhat-Tits tree which recovers XX, a method first used by F. Kato in 1999 in the classification of discrete subgroups of PGL2(K)\textrm{PGL}_2(K). Next, we show how the pp-adic moduli space M0,n\mathfrak{M}_{0,n} of P1\mathbb{P}^1 with nn punctures can be applied to the study of time series of dendrograms and those symmetries arising from hyperbolic actions on P1\mathbb{P}^1. In this way, we can associate to certain classes of dynamical systems a Mumford curve, i.e. a pp-adic algebraic curve with totally degenerate reduction modulo pp. Finally, we indicate some of our results in the study of general discrete actions on P1\mathbb{P}^1, and their relation to pp-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

R2 v1 2026-06-21T11:18:23.151Z