Related papers: Rooted tree maps for multiple $L$-values from a pe…
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…
We describe for any Riemannian manifold a certain infinitesimal neighbourhood of the diagonal. Semi-conformal maps are analyzed as those that preserve such neighbourhoods; harmonic maps are analyzed as those that preserve mirror image…
Morphisms between schemes arising from multigraded rings are essential for understanding geometric relationships in algebraic geometry, yet a systematic theory for such maps has been lacking. In this paper, we develop a comprehensive…
In the case where both the domain and target manifolds are almost Hermitian, we introduce the concept of Hermitian pluriharmonic maps. We prove that any holomorphic or anti-holomorphic map between almost Hermitian manifolds is Hermitian…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
We prove that the mirror map is the SYZ map for every toric Calabi-Yau surface. As a consequence one obtains an enumerative meaning of the mirror map. This involves computing genus-zero open Gromov-Witten invariants, which is done by…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…
We construct symmetric monoidal categories $\LRF, \FD$ of rooted forests and Feynman graphs. These categories closely resemble finitary abelian categories, and in particular, the notion of Ringel-Hall algebra applies. The Ringel-Hall Hopf…
In this paper, we study the relation between geodesic and harmonic mappings. Harmonic mappings are defined between Riemannian manifolds as critical points of the energy functional, on the other hand, geodesic mappings are defined in a more…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
Both bi-harmonic map and $f$-harmonic map have nice physical motivation and applications. In this paper, by combination of these two harmonic maps, we introduce and study $f$-bi-harmonic maps as the critical points of the $f$-bi-energy…
The AHU-algorithm solves the computationally difficult graph isomorphism problem for rooted trees, and does so with a linear time complexity. Although the AHU-algorithm has remained state of the art for almost 50 years, it has been…
This paper is a continuation of our papers \cite{EK1, EK2}. In \cite{EK2} we showed that for the root system $A_{n-1}$ one can obtain Macdonald's polynomials as weighted traces of intertwining operators between certain finite-dimensional…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Linked-twist maps are area-preserving, piece-wise diffeomorphisms, defined on a subset of the torus. They are non-uniformly hyperbolic generalisations of the well-known Arnold Cat Map. We show that a class of canonical examples have…
We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages…
We begin by considering the graded vector space with a basis consisting of rooted trees, graded by the count of non-root vertices. We define two linear operators on this vector space, the growth and pruning operators, which respectively…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…