相关论文: On Merge Trees and Discrete Morse Functions on Pat…

There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…

We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…

In bounding the homology of a manifold, Forman's Discrete Morse theory recovers the full precision of classical Morse theory: Given a PL triangulation of a manifold that admits a Morse function with c_i critical points of index i, we show…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

On a locally finite point set, a navigation defines a path through the point set from one point to another. The set of paths leading to a given point defines a tree known as the navigation tree. In this article, we analyze the properties of…

Since they became observable, neuron morphologies have been informally compared with biological trees but they are studied by distinct communities, neuroscientists, and ecologists. The apparent structural similarity suggests there may be…

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…

We consider injective first-order interpretations that input and output trees of bounded height. The corresponding functions have polynomial output size, since a first-order interpretation can use a k-tuple of input nodes to represent a…

In recent work the author investigates perfect matchings of a bipartite graph obtained from a knot diagram and demonstrates that these correspond to discrete Morse functions on a 2-complex for the 2-sphere. This relationship is expounded…

The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green's functions in terms of enumerating trees and forests…

We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…

The register function (or Horton-Strahler number) of a binary tree is a well-known combinatorial parameter. We study a reduction procedure for binary trees which offers a new interpretation for the register function as the maximal number of…

A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. In this paper, we study the embedded homology as well as the homology of the (lower-)associated simplicial complexes for hypergraphs. We…

We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…

Recently Csikv\'ari \cite{csik} proved a conjecture of Nikiforov concerning the number of closed walks on trees. Our aim is to extend his theorem to all walks. In addition, we give a simpler proof of Csikv\'ari's result and answer one of…

We introduce a notion of Morse shellings (and tilings) on finite simplicial complexes which extends the classical one and its relation to discrete Morse theory.Skeletons and barycentric subdivisions of Morse shellable (or tileable)…

Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…

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…

In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…

Our main result is a local-to-global principle for Morse quasigeodesics, maps and actions. As an application of our techniques we show algorithmic recognizability of Morse actions and construct Morse ``Schottky subgroups'' of higher rank…