Related papers: A repertoire for additive functionals of uniformly…
In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…
We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…
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…
In the field of enumeration of weighted walks confined to the quarter plane, it is known that the generating functions behave very differently depending on the chosen step set; in practice, the techniques used in the literature depend on…
The "shape" of a planar curve and/or landmark configuration is considered its equivalence class under translation, rotation and scaling, its "form" its equivalence class under translation and rotation while scale is preserved. We extend…
We initiate an exploration of on-shell functions in $\mathcal{N}=4$ SYM beyond the planar limit by providing compact, combinatorial expressions for all leading singularities of MHV amplitudes and showing that they can always be expressed as…
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…
An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…
Tree search is a fundamental tool for planning, as many sequential decision-making problems can be framed as searching over tree-structured spaces. We propose an uncertainty-guided tree search algorithm for settings where the reward…
We introduce a model for the retrieval of information hidden in legal texts. These are typically organised in a hierarchical (tree) structure, which a reader interested in a given provision needs to explore down to the "deepest" level…
We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…
This paper introduces a novel supervised classification strategy that integrates functional data analysis (FDA) with tree-based methods, addressing the challenges of high-dimensional data and enhancing the classification performance of…
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…
A set of Green functions ${\cal G}_{\alpha}(x-y), \alpha \in [0, 2 \pi [$, for free scalar field theory is introduced, varying between the Hadamard Green function $\Delta_1(x-y) \equiv \linebreak[2] \lsta{0} \hspace{-0.1cm} \{ \varphi(x),…
We describe the implementation and usage of `fermionic_amplitudes.m', a Mathematica package for the computation of tree amplitudes involving arbitrary numbers of gauge bosons and arbitrarily-charged massless fermions of (possibly) distinct…
This paper is concerned with a shape optimization problem, where the functional to be maximized describes the total sunlight collected by a distribution of tree leaves, minus the cost for transporting water and nutrient from the base of the…
In this paper, we explore parking distributions on caterpillar trees, focusing on two primary statistics: the number of lucky cars and the frequency with which cars prefer specific parking spaces. We use first-return decomposition to reveal…
Formulas are obtained that express the Schur S-functions indexed by Young diagrams of rectangular shape as linear combinations of "mixed" products of Schur's S- and Q-functions. The proof is achieved by using representations of the affine…
Addition formulas exist in trigonometric functions. Double-angle and half-angle formulas can be derived from these formulas. Moreover, the relation equation between the trigonometric function and the hyperbolic function can be derived using…
In this work we prove formulas of quasi-additivity for the capacity associated to kernels of radial type in the setting of the boundary of a tree structure and in the setting of compact Ahlfors-regular spaces. We also define a notion of…