Related papers: A repertoire for additive functionals of uniformly…
We consider the hierarchic tree Random Energy Model with continuous branching and calculate the moments of the corresponding partition function. We establish the multifractal properties of those moments. We derive formulas for the normal…
A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…
An important problem in combinatorial noncommutative algebra is to characterize the growth functions of finitely generated algebras (equivalently, semigroups, or hereditary languages). The growth function of every finitely generated,…
In this note we consider ternary trees naturally embedded in the plane in a deterministic way such that the root has position zero, or in other words label zero, and the children of a node with position $j$ have positions $j-1$, $j$, and…
Let $X_1, X_2, ..., X_n, ... $ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $LI_n$ be the length of the longest increasing subsequence of $X_1, X_2, ..., X_n.$ We express the limiting…
Sum-Product Networks with complex probability distribution at the leaves have been shown to be powerful tractable-inference probabilistic models. However, while learning the internal parameters has been amply studied, learning complex leaf…
For a complex number $\alpha$, we consider the sum of the $\alpha$th powers of subtree sizes in Galton--Watson trees conditioned to be of size $n$. Limiting distributions of this functional $X_n(\alpha)$ have been determined for $\Re\alpha…
This article studies the limit of binary search trees drawn from Mallows permutations under various topologies. The main result, pertaining to the standard local topology for graphs, requires the introduction of a generalization of binary…
The k-d tree was one of the first spatial data structures proposed for nearest neighbor search. Its efficacy is diminished in high-dimensional spaces, but several variants, with randomization and overlapping cells, have proved to be…
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
The height $H(n)$ of $n$ is the least integer $i$ such that the $i$-th iterate of Euler's totient function $\varphi^{(i)}(n)$ equals $1$. H. N. Shapiro showed that this $H$ is almost completely additive. Building on the fact that this…
In this paper (second in the series) we study the properties of tree-level binary amplitudes of the infinite-component effective field theory of strong interaction obeying the requirements of quark-hadron duality and maximal analyticity. In…
For every diffeomorphism $\varphi:M\to N$ between 3--dimensional Riemannian manifolds $M$ and $N$ there are in general locally two 2--dimensional distributions $D_{\pm}$ such that $\varphi$ is conformal on both of them. We state necessary…
We design exact polynomial expansions of a class of Feynman--Kac particle distributions. These expansions are finite and are parametrized by coalescent trees and other related combinatorial quantities. The accuracy of the expansions at any…
Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex…
Based on fundamental measure theory, a Helmholtz free energy density functional for three-component mixtures of hard spheres with general, non-additive interaction distances is constructed. The functional constitutes a generalization of the…
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…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…
The second derivative of a function r(t) with respect to a variable t is equal to -n times the function raised to the 2n-1 power of r(t); using this definition, an ordinary differential equation is constructed. Graphs with the horizontal…