相关论文: Merge Trees of Periodic Filtrations
Tree embedding has been a fundamental method in algorithm design with wide applications. We focus on the efficiency of building tree embedding in various computational settings under high-dimensional Euclidean $\mathbb{R}^d$. We devise a…
Periodic trees are combinatorial structures which are in bijection with cluster tilting objects in cluster categories of affine type $\tilde{A}_{n-1}$. The internal edges of the tree encode the $c$-vectors corresponding to the cluster…
Periodic point sets model all solid crystalline materials (crystals) whose atoms can be considered zero-sized points with or without atomic types. This paper addresses the fundamental problem of checking whether claimed crystals are novel,…
We show how a collection of Euler-tour trees for a forest on $n$ vertices can be stored in $2 n + o (n)$ bits such that simple queries take constant time, more complex queries take logarithmic time and updates take polylogarithmic amortized…
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant requires merging two paths in a single operation. In contrast to the standard…
The persistence barcode is a topological descriptor of data that plays a fundamental role in topological data analysis. Given a filtration of the space of data, a persistence barcode tracks the evolution of its homological features. In this…
Merge trees are a topological descriptor of a filtered space that enriches the degree zero barcode with its merge structure. The space of merge trees comes equipped with an interleaving distance $d_I$, which prompts a naive question: is the…
This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials…
Merge trees, a type of topological descriptor, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First,…
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
Periodic frameworks with crystallographic symmetry are investigated from the perspective of a general deformation theory of periodic bar-and-joint structures in $R^d$. It is shown that natural parametrizations provide affine section…
We study equilibrium configurations of non-Euclidean plates, in which the reference metric is uniaxially periodic. This work is motivated by recent experiments on thin sheets of composite thermally responsive gels [1]. Such sheets bend…
Due to the lack of long-range order, it remains challenging to characterize the structure of disordered solids and understand the nature of the glass transition. Here we propose a new structural order parameter by taking into account…
In computational models of particle packings with periodic boundary conditions, it is assumed that the packing is attached to exact copies of itself in all possible directions. The periodicity of the boundary then requires that all of the…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
This paper introduces decorated merge trees (DMTs) as a novel invariant for persistent spaces. DMTs combine both $\pi_0$ and $H_n$ information into a single data structure that distinguishes filtrations that merge trees and persistent…
In particle simulations, the weights of particles determine how many physical particles they represent. Adaptively adjusting these weights can greatly improve the efficiency of the simulation, without creating severe nonphysical artifacts.…
The paper is devoted to equipartition of measured information for finite state processes over regular trees whose laws are invariant under all parity preserving tree automorphisms. We show almost everywhere equipartition for ergodic…
Jaramillo Puentes et al. give a Grothendieck-Witt valued floor-diagram formula for rational curves in smooth toric del Pezzo surfaces with simple and quadratic double point conditions. We study its dependence on the choice of merge…