Related papers: Degenerating families of dendrograms
Among Thurston maps (orientation-preserving, postcritically finite branched coverings of the 2-sphere to itself), those that arise as subdivision maps of a finite subdivision rule form a special family. For such maps, we investigate…
The main purpose of this paper is to show that ideas of deformation theory can be applied to "infinite dimensional geometry". We develop the deformation theory of Brody curves. Brody curve is a kind of holomorphic map from the complex plane…
A statistical manifold is a pseudo-Riemannian manifold endowed with a Codazzi structure. This structure plays an important role in Information Geometry and its related fields, e.g., a statistical model admits this structure with the…
Let $k$ be an algebraically closed field and $\alpha$, $\beta$, $\gamma$ be partitions. An algebraic group acts on the constructible set of short exact sequences of nilpotent $k$-linear operators of Jordan types $\alpha$, $\beta$, and…
In this work, we relate girth and path-degeneracy in classes with sub-exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor-closed classes that are tight up to a constant factor (and tight up to…
We give a vanishing theorem for the monodromy eigenspaces of the Milnor fibers of complex line arrangements. By applying the modular bound of the local system cohomology groups given by Papadima-Suciu, the result is deduced from the…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
Typed metagraphs are defined as hypergraphs with types assigned to hyperedges and their targets, and the potential to have targets of hyperedges connect to whole links as well as targets. Directed typed metagraphs (DTMGs) are introduced via…
We study the $p$-adic analogue of the $\ell$-adic hypergeometric sheaves for reductive groups, called the hypergeometric $\mathscr{D}^{\dagger}(\infty)$-modules. They are overholonomic objects in the derived category of arithmetic…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…
The concept of data depth leads to a center-outward ordering of multivariate data, and it has been effectively used for developing various data analytic tools. While different notions of depth were originally developed for finite…
We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…
We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to…
A field with an absolute value function is a basic type of metric space, which includes the real and complex numbers with their standard metrics, and ultrametrics on fields like the p-adic numbers. Here we try to give some perspectives of…
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in $\mathbb{R}^d$, the (augmented) persistent homology transform ((A)PHT) is a family of…
We develop various aspects of classical enumerative geometry, including Euler characteristics and formulas for counting degenerate fibres in a pencil, with the classical numerical formulas being replaced by identitites in the…
In this paper we present a method for finding the absorbing radical of a finite-dimensional evolution algebra. Such a method consists of finding the acyclic vertices of an oriented graph associated with the algebra. The set of generators…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Contour trees have been developed to visualize or encode scalar data in imaging technologies and scientific simulations. Contours are defined on a continuous scalar field. For discrete data, a continuous function is first interpolated,…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…