Related papers: A repertoire for additive functionals of uniformly…
To advance the foundation of one-particle reduced density matrix functional theory (1RDMFT) we refine and relate some of its fundamental features and underlying concepts. We define by concise means the scope of a 1RDMFT, identify its…
Building on our proposal in arXiv:2405.06629, we present in detail the construction of the extended phase space for Yang-Mills at null infinity, containing the asymptotic symmetries and the charges responsible for sub$^n$-leading soft…
We study the additive functional $X_n(\alpha)$ on conditioned Galton-Watson trees given, for arbitrary complex $\alpha$, by summing the $\alpha$th power of all subtree sizes. Allowing complex $\alpha$ is advantageous, even for the study of…
A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…
Given a formal map $F=(F_1...,F_n)$ of the form $z+\text{higher}$ order terms, we give tree expansion formulas and associated algorithms for the D-Log of F and the formal flow F_t. The coefficients which appear in these formulas can be…
We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field of odd characteristic. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
Following an argument advanced by Feynman, we consider a method for obtaining the effective action which generates the sum of tree diagrams with external physical particles. This technique is applied, in the unbroken \lambda \phi^4 theory,…
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang's extension. We give…
In a recent paper, the question of determining the fraction of binary trees that contain a fixed pattern known as the snowflake was posed. We show that this fraction goes to 1, providing two very different proofs: a purely combinatorial one…
In this paper, estimates for Kolmogorov, Gelfand and linear widths of function classes on sets with a tree-like structure are obtained. As examples we consider weighted Sobolev classes on a John domain, as well as some function classes on a…
Consider a rooted N-ary tree. For every vertex of this tree, we atttach an i.i.d. Bernoulli random variable. A path is called open if all the random variables that are assigned on the path are 1. We consider limiting behaviors for the…
In this paper, we define two kinds of hook length for internal vertices of complete $m$-ary trees, and deduce their corresponding hook length formulas, which generalize the main results obtained by Du and Liu.
We consider the cost of general orthogonal range queries in random quadtrees. The cost of a given query is encoded into a (random) function of four variables which characterize the coordinates of two opposite corners of the query rectangle.…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
The Maximum (Minimum) Leaf Spanning Tree problem asks for a spanning tree with the largest (smallest) number of leaves. As spanning trees are often computed using graph search algorithms, it is natural to restrict this problem to the set of…
We consider the tree-level amplitude, describing all 3 channels of the binary (pi ,K)-reaction, as a meromorphic polynomially bounded function of 3 dependent complex variables. Relying systematically on the Mittag-Leffler theorem, we…
An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expensive so the most efficient algorithms construct almost…