Related papers: Trees and Homogeneous LOTS
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,…
The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift $X$ and its associated hom tree-shift $\mathcal{T}_{X}$, as well as the equivalence in the sofic shift. On the…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…
We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition…
The structure of topological spaces is analysed here through the lenses of fibrous preorders. Each topological space has an associated fibrous preorder and those fibrous preorders which return a topological space are called spacial. A…
A datatset $X$ on $R^2$ is a finite topological space. Current research of a dataset focuses on statistical methods and the algebraic topological method \cite{carlsson}. In \cite{hu}, the concept of typed topological space was introduced…
Here, we classify Lie groups acting isometrically on compact Lorentz manifolds, and in particular we describe the geometric structure of compact homogeneous Lorentz manifolds.
We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…
The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees, those chronological trees admitting the self-similarity property where individuals give birth, at constant rate, to iid copies of themselves. It also established…
We prove an analogue for homogeneous trees and certain affine buildings of a result of Bourgain on pinned distances in sets of positive density in Euclidean spaces. Furthermore, we construct an example of a non-homogeneous tree with…
Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely one cleverly designed data representations and algorithms. We present here the formalization in Coq/SSReflect…
The two pillars of Algebraic topology - Homology and homotopy theory rely on the availability of basic building blocks called cells. Cells take the form of simplexes, and have properties such as faces, sub-cells, convexity and…
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…
Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet,…
We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…
Tree ensembles (TEs) find a multitude of practical applications. They represent one of the most general and accurate classes of machine learning methods. While they are typically quite concise in representation, their operation remains…
We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…
For a topological space X, let (RX)s := (RX,Ts) be the cartesian product of |X| copies of the real line R with the topology of the uniform convergence on separable subsets of X. In this article we analyze the subspace C(X) of (RX)s of all…
We construct an infinite sequence of projectively flat manifolds by using castling transformations of prehomogeneous vector spaces. We also give a classification of manifolds equipped with a flat projective structure obtained by a finite…