Related papers: Rooted tree maps for multiple $L$-values from a pe…
A self-dual map $G$ is said to be \emph{antipodally self-dual} if the dual map $G^*$ is antipodal embedded in $\mathbb{S}^2$ with respect to $G$. In this paper, we investigate necessary and/or sufficient conditions for a map to be…
We compare two maps that arise in study of the cohomology of number fields with ramification restricted to a finite set S of primes. One of these maps, which we call an S-reciprocity map, interpolates the values of cup products in…
This article shows that every non-isotropic harmonic 2-torus in complex projective space factors through a generalised Jacobi variety related to the spectral curve. Each map is composed of a homomorphism into the variety and a rational map…
We study moduli spaces of twisted maps to a smooth pair in arbitrary genus, and give geometric explanations for previously known comparisons between orbifold and logarithmic Gromov--Witten invariants. Namely, we study the space of twisted…
A cohomology theory of root systems emerges naturally in the context of Automorphic Lie Algebras, where it helps formulating some structure theory questions. In particular, one can find concrete models for an Automorphic Lie Algebra by…
We prove that finding a rooted subtree with at least $k$ leaves in a digraph is a fixed parameter tractable problem. A similar result holds for finding rooted spanning trees with many leaves in digraphs from a wide family $\cal L$ that…
The early development of a zygote can be mathematically described by a developmental tree. To compare developmental trees of different species, we need to define distances on trees. If children cells after a division are not…
A modified trace for a finite k-linear pivotal category is a family of linear forms on endomorphism spaces of projective objects which has cyclicity and so-called partial trace properties. We show that a non-degenerate modified trace…
The renormalization of quantum field theory twists the antipode of a noncocommutative Hopf algebra of rooted trees, decorated by an infinite set of primitive divergences. The Hopf algebra of undecorated rooted trees, ${\cal H}_R$, generated…
We define a symmetric monoidal structure on the parametrised stable homotopy category over a base space with an action of an $E_\infty$ operad. We discuss products, orientations and push-forwards in parametrised cohomology theories…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
The purpose of the paper is to present quantitative estimates for the principal eigenvalue of discrete p-Laplacian on the set of rooted trees. Alternatively, it is studying the optimal constant of a class of weighted Hardy inequality. Three…
Tree-based methods are powerful nonparametric techniques in statistics and machine learning. However, their effectiveness, particularly in finite-sample settings, is not fully understood. Recent applications have revealed their surprising…
Tree kernels are fundamental tools that have been leveraged in many applications, particularly those based on machine learning for Natural Language Processing tasks. In this paper, we devise a parallel implementation of the sequential…
The purpose of this paper is twofold. On one hand, we introduce a modification of the dual canonical basis for invariant tensors of the 3-dimensional irreducible representation of $U_q(sl_2)$, given in terms of Jacobi diagrams, a central…
We define harmonic maps between sub-Riemannian manifolds by generalizing known definitions for Riemannian manifolds. We establish conditions for when a horizontal map into a Lie group with a left-invariant metric structure is a harmonic…
This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
The topology of $SU(3)$-representation varieties of the fundamental groups of planar webs so that the meridians are sent to matrices with trace equal to $-1$ are explored, and compared to data coming from spider evaluation of the webs.…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…