Related papers: Mumford dendrograms and discrete p-adic symmetries
Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertree-width is a measure for the cyclicity and therefore tractability of the encoded computation problem. Many NP-hard…
Clustering is a well-known and studied problem, one of its variants, called contiguity-constrained clustering, accepts as a second input a graph used to encode prior information about cluster structure by means of contiguity constraints…
We address the problem of computing a single linkage dendrogram. A possible approach is to: (i) Form an edge weighted graph $G$ over the data, with edge weights reflecting dissimilarities. (ii) Calculate the MST $T$ of $G$. (iii) Break the…
This paper offers a new authentication algorithm based on image matching of nano-resolution visual identifiers with tree-shaped patterns. The algorithm includes image-to-tree conversion by greedy extraction of the fractal pattern skeleton…
There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…
We study ordinary abelian schemes in characteristic $p$ and their moduli spaces from the perspective of char $p$ Mumford--Tate, log Ax--Lindemann, and geometric Andr\'e--Oort conjectures (abbreviated as $\MTT_p$, $\mathrm{logAL}_p$ and…
Efficiently computing accurate representations of high-dimensional data is essential for data analysis and unsupervised learning. Dendrograms, also known as ultrametrics, are widely used representations that preserve hierarchical…
In this work, following the discrete de Rham (DDR) approach, we develop a discrete counterpart of a two-dimensional de Rham complex with enhanced regularity. The proposed construction supports general polygonal meshes and arbitrary…
Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently on instances of small…
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…
The p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its nearest open site. We study a Benders decomposition of the most…
Periodic solutions of delay equations are usually approximated as continuous piecewise polynomials on meshes adapted to the solutions' profile. In practical computations this affects the regularity of the (coefficients of the) linearized…
A Mumford group is a discontinuous subgroup $\Gamma$ of PGL(2,K), where K denotes a non archimedean valued field, such that the quotient by $\Gamma$ is a curve of genus 0. As abstract group $\Gamma$ is an amalgam of a finite tree of finite…
Let $\wh K$ be the field of formal Laurent series in $X^{-1}$ over the finite field $k$, and let $A$ be the ring of polynomials in $X$ over $k$. One of the main results of the paper is to give a particularly nice coding of the geodesic flow…
We study the problem of enumerating all rooted directed spanning trees (arborescences) of a directed graph (digraph) $G=(V,E)$ of $n$ vertices. An arborescence $A$ consisting of edges $e_1,\ldots,e_{n-1}$ can be represented as a monomial…
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…
Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called Singleton Tree Grammars (STG),…
We give a deterministic polynomial time algorithm to compute the endomorphism ring of a supersingular elliptic curve in characteristic p, provided that we are given two noncommuting endomorphisms and the factorization of the discriminant of…
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…
Sparse coding consists in representing signals as sparse linear combinations of atoms selected from a dictionary. We consider an extension of this framework where the atoms are further assumed to be embedded in a tree. This is achieved…