相关论文: Mumford dendrograms

The theory of p-adic strings is reviewed along with some of their applications, foremost among them to the tachyon condensation problem in string theory. Some open problems are discussed, in particular that of the superstring in 10…

We discuss recent developments in $p$-adic geometry, ranging from foundational results such as the degeneration of the Hodge-to-de Rham spectral sequence for "compact $p$-adic manifolds" over new period maps on moduli spaces of abelian…

We derive a relative version of the local monodromy theorem for ordinary differential equations on an annulus over a mixed-characteristic nonarchimedean field, and give several applications in $p$-adic cohomology and $p$-adic Hodge theory.…

Degeneracy of the genetic code is a biological way to minimize effects of the undesirable mutation changes. Degeneration has a natural description on the 5-adic space of 64 codons $\mathcal{C}_5 (64) = \{n_0 + n_1 5 + n_2 5^2 : n_i = 1, 2,…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\sqrt n$ by $\sqrt n$ grid. We also show that testing whether a given binary tree has…

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…

Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…

Using basic properties of p-adic numbers, we consider a simple new approach to describe main aspects of DNA sequence and genetic code. Central role in our investigation plays an ultrametric p-adic information space which basic elements are…

We construct a $p$-adic analog to AdS/CFT, where an unramified extension of the $p$-adic numbers replaces Euclidean space as the boundary and a version of the Bruhat-Tits tree replaces the bulk. Correlation functions are computed in the…

We study the holographic dual of the simplest notion of spin in a $p$-adic field theory, namely Green's functions which involve non-trivial sign characters over the $p$-adic numbers. In order to recover these sign characters from bulk…

We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…

We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…

Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

Applying machine learning to mathematical terms and formulas requires a suitable representation of formulas that is adequate for AI methods. In this paper, we develop an encoding that allows for logical properties to be preserved and is…

As an extended companion paper to [1], we elaborate in detail how the tensor network construction of a p-adic CFT encodes geometric information of a dual geometry even as we deform the CFT away from the fixed point by finding a way to…

The genetic code is connection between 64 codons, which are building blocks of the genes, and 20 amino acids, which are building blocks of the proteins. In addition to coding amino acids, a few codons code stop signal, which is at the end…

Let k be a local field and let A be the two-by-two matrix algebra over k. In our previous work we developed a theory that allows the computation of the set of maximal orders in A containing a given suborder. This set is given as a sub-tree…

We apply the theory of branches in Bruhat-Tits trees, developed in previous works by the second author and others, to the study of two dimensional representations of finite groups over the ring of integers of a number field. We provide a…