English
Related papers

Related papers: Mumford dendrograms and discrete p-adic symmetries

200 papers

An effective $p$-adic encoding of dendrograms is presented through an explicit embedding into the Bruhat-Tits tree for a $p$-adic number field. This field depends on the number of children of a vertex and is a finite extension of the field…

Discrete Mathematics · Computer Science 2010-05-18 Patrick Erik Bradley

Dendrograms used in data analysis are ultrametric spaces, hence objects of nonarchimedean geometry. It is known that there exist $p$-adic representation of dendrograms. Completed by a point at infinity, they can be viewed as subtrees of the…

Machine Learning · Statistics 2008-06-28 Patrick Erik Bradley

A conceptual framework for cluster analysis from the viewpoint of p-adic geometry is introduced by describing the space of all dendrograms for n datapoints and relating it to the moduli space of p-adic Riemannian spheres with punctures…

Machine Learning · Statistics 2009-12-01 Patrick Erik Bradley

In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…

Number Theory · Mathematics 2018-06-01 Ekaterina Yurova Axelsson , Andrei Khrennikov

A $p$-adic version of Gromov-Witten invariants for counting plane curves of genus $g$ and degree $d$ through a given number of points is discussed. The multiloop version of $p$-adic string theory considered by Chekhov and others motivates…

Mathematical Physics · Physics 2008-11-26 Patrick Erik Bradley

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

Group Theory · Mathematics 2017-01-30 Daniel C. Mayer

In this sequel to [1], we take up a second approach in bending the Bruhat-Tits tree. Inspired by the BTZ black hole connection, we demonstrate that one can transplant it to the Bruhat-Tits tree, at the cost of defining a novel "exponential…

High Energy Physics - Theory · Physics 2021-10-04 Lin Chen , Xirong Liu , Ling-Yan Hung

The p-adic AdS/CFT correspondence relates a CFT living on the p-adic numbers to a system living on the Bruhat-Tits tree. Modifying our earlier proposal for a tensor network realization of p-adic AdS/CFT, we prove that the path integral of a…

High Energy Physics - Theory · Physics 2019-05-23 Ling-Yan Hung , Wei Li , Charles M. Melby-Thompson

With the help of Wick rotation over $p$-adic numbers $\mathbb{Q}_p$, the $p$-adic version of Euclidean $\textrm{dS}_2$ space(noted as $p\textrm{dS}_2$) is obtained based on $p\textrm{AdS}_2$($p$-adic version of Euclidean $\textrm{AdS}_2$…

High Energy Physics - Theory · Physics 2021-05-24 Feng Qu

The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some…

Data Structures and Algorithms · Computer Science 2015-10-09 Mateus de Oliveira Oliveira

We introduce a decomposition method for the distributed calculation of exact Euclidean Minimum Spanning Trees in high dimensions (where sub-quadratic algorithms are not effective), or more generalized geometric-minimum spanning trees of…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-05 Richard Lettich

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…

High Energy Physics - Theory · Physics 2021-06-30 Lin Chen , Xirong Liu , Ling-Yan Hung

This paper is originally designed as a part of revision of the author's preprint math.AG/9908174 "P-adic Schwarzian triangle groups of Mumford type". Recently, Yves Andr'e pointed out a flaw in that preprint; more precisely, Proposition II…

Algebraic Geometry · Mathematics 2007-05-23 Fumiharu Kato

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…

Computational Geometry · Computer Science 2023-03-16 Corentin Lunel , Arnaud de Mesmay

Raising the order of the multipole expansion is a feasible approach for improving the accuracy of the treecode algorithm. However, a uniform order for the expansion would result in the inefficiency of the implementation, especially when the…

Numerical Analysis · Mathematics 2024-12-31 Zixuan Cui , Lei Yang

In this paper we study the $p$-adic analytic geometry of the basic unitary group Rapoport-Zink spaces $\M_K$ with signature $(1,n-1)$. Using the theory of Harder-Narasimhan filtration of finite flat groups developed by Fargues in…

Algebraic Geometry · Mathematics 2014-04-22 Xu Shen

Let p > 2 be a prime. Let Q(zeta) be the p-cyclotomic field. Let pi be the prime ideal of Q(zeta) lying over p. This article aims to describe some pi-adic congruences characterizing the structure of the p-class group and of the unit group…

Number Theory · Mathematics 2007-05-23 Roland Queme

In this summary of my talk at Strings 2016, I explain how classical dynamics on an infinite tree graph can be dual to a conformal field theory defined over the $p$-adic numbers. An informal introduction to $p$-adic numbers is followed by a…

High Energy Physics - Theory · Physics 2017-05-02 Steven S. Gubser

Using Bruhat-Tits theory, we analyse the restriction of depth-zero representations of a semisimple simply connected $p$-adic group $G$ to a maximal compact subgroup $K$. We prove the coincidence of branching rules within classes of…

Representation Theory · Mathematics 2014-09-15 Monica Nevins

In this paper we propose, implement, and test the first practical decomposition algorithms for the width parameters treecut width and treedepth. These two parameters have recently gained a lot of attention in the theoretical research…

Data Structures and Algorithms · Computer Science 2019-12-02 Robert Ganian , Neha Lodha , Sebastian Ordyniak , Stefan Szeider
‹ Prev 1 2 3 10 Next ›