Related papers: A symmetry on weakly increasing trees and multiset…
Recently the CHY approach has been extended to one loop level using elliptic functions and modular forms over a Jacobian variety. Due to the difficulty in manipulating these kind of functions, we propose an alternative prescription that is…
A classical result of Kahn and Saks states that given any partially ordered set with two distinguished elements, the number of linear extensions in which the ranks of the distinguished elements differ by $k$ is log-concave as a function of…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
Recently F\'eray, Goulden and Lascoux gave a proof of a new hook summation formula for unordered increasing trees by means of a generalization of the Pr\"ufer code for labelled trees and posed the problem of finding a bijection between…
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…
We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…
We introduce Joint Probability Trees (JPT), a novel approach that makes learning of and reasoning about joint probability distributions tractable for practical applications. JPTs support both symbolic and subsymbolic variables in a single…
This article is devoted to the study of Jack connection coefficients, a generalization of the connection coefficients of the classical commutative subalgebras of the group algebra of the symmetric group closely related to the theory of Jack…
Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $\pi$ angle of the skew…
We introduce an augmented form of the van Trees inequality, that yields uniformly tighter lower bounds on the minimax squared Bayes risk of estimators compared with the classical van Trees inequality. Our augmented inequality also…
In the present paper, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of orthogonal polynomials are provided based on 2-parameters weight functions. Such classes englobe the well…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
We study Jack characters, which are the coefficients of the power-sum expansion of Jack symmetric functions with a suitable normalization. These quantities have been introduced by Lassalle who formulated some challenging conjectures about…
The study of spanning trees and related structures is central in graph theory, closely connected to understanding functions between finite sets. This paper generalizes the established relationship between rooted trees and eventually…
This is an elementary presentation of the arithmetic of trees. We show how it is related to the Tamari poset. In the last part we investigate various ways of realizing this poset as a polytope (associahedron), including one inferred from…
We design a theoretic tree-based functional representation of a class of Feynman-Kac particle distributions, including an extension of the Wick product formula to interacting particle systems. These weak expansions rely on an original…
Let $G$ be a simple strongly connected weighted directed graph. Let $\mathcal{G}$ denote the spanning tree graph of $G$. That is, the vertices of $\mathcal{G}$ consist of the directed rooted spanning trees on $G$, and the edges of…
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that the number of compacted binary trees of size $n$ grows…
In this paper, we study the relationship between polynomial integrals on the unitary group and the conjugacy class expansion of symmetric functions in Jucys-Murphy elements. Our main result is an explicit formula for the top coefficients in…