Related papers: Mumford dendrograms and discrete p-adic symmetries
Consider matrices of order $k+N$ over $p$-adic field determined up to conjugations by elements of $GL$ over $p$-adic integers. We define a product of such conjugacy classes and construct the analog of characteristic functions (transfer…
We continue an investigation initiated by Consani-Marcolli of the relation between the algebraic geometry of p-adic Mumford curves and the noncommutative geometry of graph C*-algebras associated to the action of the uniformizing p-adic…
In this paper, we describe a stratification on the reduced special fiber of the basic unramified unitary Rapoport-Zink space of signature $(1,n-1)$ and at arbitrary parahoric level. We prove the smoothness, irreducibility and compute the…
Partial orders and directed acyclic graphs are commonly recurring data structures that arise naturally in numerous domains and applications and are used to represent ordered relations between entities in the domains. Examples are task…
Many real discrete optimization problems (DOPs) are $NP$-hard and contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. Large DOPs can be solved due to their special tructure…
We construct a compactification of the Bruhat-Tits building associated to the group PGL(V) which can be identified with the space of homothety classes of seminorms on V endowed with the topology of pointwise convergence. Then we define a…
Permutation decoding is a process that utilizes the permutation automorphism group of a linear code to correct errors in received words. Given a received word, a set of automorphisms, called a PD set, moves errors out of the information…
Let $k$ be an algebraically closed field of positive characteristic $p$. We first classify the $D$-truncations mod $p$ of Shimura $F$-crystals over $k$ and then we study stratifications defined by inner isomorphism classes of these…
We develop a new approach for distributed distance computation in planar graphs that is based on a variant of the metric compression problem recently introduced by Abboud et al. [SODA'18]. One of our key technical contributions is in…
In this note we prove the classical decomposition theorems for certain subgroups of the automorphism group of the Bruhat-Tits tree associated to $\mathrm{PGL}_{2}(F)$, where $F$ is a local field. The results can be used to understand the…
The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…
Mumford showed that Schottky subgroups of $PGL(2,K)$ give rise to certain curves, now called Mumford curves, over a non-Archimedean field K. Such curves are foundational to subjects dealing with non-Archimedean varieties, including…
We develop the theory and practical implementation of p-adic sparse coding of data. Rather than the standard, sparsifying criterion that uses the $L_0$ pseudo-norm, we use the p-adic norm. We require that the hierarchy or tree be…
Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study the problem of designing efficient dynamic programming…
We give an algorithm to explicitly compute the largest subtree, in the local Bruhat-Tits tree for PSL_2(k), whose vertices correspond to orders containing a given suborder H, in terms of a set of generators for H. The shape of this subtree…
We present a new way to summarize and select mixture models via the hierarchical clustering tree (dendrogram) constructed from an overfitted latent mixing measure. Our proposed method bridges agglomerative hierarchical clustering and…
Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural…
Computing a Single-Linkage Dendrogram (SLD) is a key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree $T$, the SLD of $T$ is a binary dendrogram that summarizes the $n-1$ clusterings…
In [27], we provided results on the $p$-modulus of the family of all bases of matroids and showed that it recovers various concepts in matroid theory, including strength, fractional arboricity, and principal partitions. In particular, the…
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.…