Related papers: Metrics on trees I. The tower algorithm for interv…
A well-known result of Bill Parry shows that a topologically transitive continuous piecewise monotone mapping with positive topological entropy is conjugate to a uniformly piecewise linear mapping with slope determined by the entropy. In…
For a class of Fibonacci-like unimodal maps, the restriction to the $\omega$-limit set of the unique turning point defines a minimal Cantor system. We construct these Cantor sets geometrically using a nested sequence of finite covers with a…
Many computational problems admit fast algorithms on special inputs, however, the required properties might be quite restrictive. E.g., many graph problems can be solved much faster on interval or cographs, or on graphs of small…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
We generalize the definition of topological entropy given by Adler, Konheim, and McAndrew (AKM) for piecewise continuous self-maps defined on a compact interval (pc-maps). For this notion of entropy, we prove that the properties of the…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with spanning tree modulus is known to produce two hierarchical…
In this paper we study the liftability property for piecewise continuous maps of compact metric spaces, which admit inducing schemes in the sense of Pesin and Senti [PS05, PS06]. We show that under some natural assumptions on the inducing…
We develop a framework for applying treewidth-based dynamic programming on graphs with "hybrid structure", i.e., with parts that may not have small treewidth but instead possess other structural properties. Informally, this is achieved by…
In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of…
Any continuous, transitive, piecewise monotonic map is determined up to a binary choice by its dimension module with the associated finite sequence of generators. The dimension module by itself determines the topological entropy of any…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
We propose an inverse approach for dealing with interval maps based on the manner whereby their branches are related (folding property), instead of addressing the map equations as a whole. As a main result, we provide a symmetry-breaking…
The main purpose of this paper is to present a kneading theory for two-dimensional triangular maps. This is done by defining a tensor product between the polynomials and matrices corresponding to the one-dimensional basis map and fiber map.…
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
We introduce a class of continuous maps f of a compact metric space I admitting inducing schemes and describe the tower constructions associated with them. We then establish a thermodynamical formalism, i.e., describe a class of real-valued…
Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm\"uller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal…
We investigate the use of piecewise linear systems, whose coefficient matrix is a piecewise constant function of the solution itself. Such systems arise, for example, from the numerical solution of linear complementarity problems and in the…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…