Related papers: Mumford dendrograms and discrete p-adic symmetries

We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…

Let $K$ be a finite extension of $\mathbb{Q}_p$, and let $\mathfrak{m}_K$ be its maximal ideal. The image of the group of principal units $1+\mathfrak{m}_K$ under $p$-adic logarithm plays important role in several areas of number theory. In…

Convolution trees, loopy belief propagation, and fast numerical p-convolution are combined for the first time to efficiently solve networks with several additive constraints between random variables. An implementation of this "convolution…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Let $\mathcal{T}$ be a locally finite tree, $\Gamma$ be a discrete subgroup of $\textrm{Aut}(\mathcal{T})$ and $\widetilde{F}$ be a $\Gamma$-invariant potential. Suppose that the length spectrum of $\Gamma$ is not arithmetic. In this case,…

Algebraic codes that achieve list decoding capacity were recently constructed by a careful ``folding'' of the Reed-Solomon code. The ``low-degree'' nature of this folding operation was crucial to the list decoding algorithm. We show how…

Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate the link between iterative decoding and classical…

We formulate a renormalisation procedure for IR divergences of tree-level in-in late-time de Sitter correlators. These divergences are due to the infinite volume of spacetime and are analogous to the divergences that appear in AdS dealt…

Over the past years, Polar codes have arisen as a highly effective class of linear codes, equipped with a decoding algorithm of low computational complexity. This family of codes share a common algebraic formalism with the well-known…

We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…

We introduce a new directed graph structure into the set of alternating sign matrices. This includes Bruhat graph (Bruhat order) of the symmetric groups as a subgraph (subposet). Drake-Gerrish-Skandera (2004, 2006) gave characterizations of…

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…

Mixtures of Unigrams are one of the simplest and most efficient tools for clustering textual data, as they assume that documents related to the same topic have similar distributions of terms, naturally described by Multinomials. When the…

Let $K$ be a complete discrete valuation field with finite residue field of characteristic $p$, and let $D$ be a central division algebra over $K$ of finite index $d$. Thirty years ago, Suslin and Yufryakov showed that for all prime numbers…

Finding dense components in graphs is of great importance in analyzing the structure of networks. Popular and computationally feasible frameworks for discovering dense subgraphs are core and truss decompositions. Recently, Sariyuce et al.…

We show that perfectoidization can be (almost) calculated by using $p$-root closure in certain cases, including the semiperfectoid case. To do this, we focus on the universality of perfectoidization and uniform completion, as well as the…

Let $\mathcal{A}$ be an abelian variety over a number field, with a good reduction at a prime ideal containing a prime number $p$. Denote by ${\rm A}$ an abelian variety over a finite field of characteristic $p$, obtained by the reduction…

In the Directed Steiner Tree (DST) problem the input is a directed edge-weighted graph $G=(V,E)$, a root vertex $r$ and a set $S \subseteq V$ of $k$ terminals. The goal is to find a min-cost subgraph that connects $r$ to each of the…

We consider $N$-way data arrays and low-rank tensor factorizations where the time mode is coded as a sparse linear combination of temporal elements from an over-complete library. Our method, Shape Constrained Tensor Decomposition (SCTD) is…

Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming…