Related papers: A symmetry on weakly increasing trees and multiset…
Divided symmetrization of a function $f(x_1,\dots,x_n)$ is symmetrization of the ratio $$DS_G(f)=\frac{f(x_1,\dots,x_n)}{\prod (x_i-x_j)},$$ where the product is taken over the set of edges of some graph $G$. We concentrate on the case when…
Using the Cachazo-He-Yuan (CHY) formalism, we prove a recursive expansion of tree level single trace Einstein-Yang-Mills (EYM) amplitudes with arbitrary number of gluons and gravitons, which is valid for general spacetime dimensions and any…
We study the growth of degrees in many autonomous and non-autonomous lattice equations defined by quad rules with corner boundary values, some of which are known to be integrable by other characterisations. Subject to an enabling…
This work investigates the role of the $U(N) \times U(\tilde{N})$ global symmetry in tree-level scattering amplitudes of the bi-adjoint $\phi^3$ theory from three perspectives: combinatorics, correlation functions, and a massive extension…
The theory of Ihara zeta functions is extended to non-compact arithmetic quotients of Bruhat-Tits trees. This new zeta function turns out to be a rational function, despite the infinite-dimensional setting. In general it has zeros and…
We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.
We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…
We define a graph Laplacian with vertex weights in addition to the more classical edge weights, which unifies the combinatorial Laplacian and the normalised Laplacian. Moreover, we give a combinatorial interpretation for the coefficients of…
Building on the prior work in [1] we locate a family of positive geometries in the kinematic space which are a specific class of convex realisations of the associahedron. These realisations are obtained by scaling and translating the…
We consider a set of measures on the real line and the corresponding system of multiple orthogonal polynomials (MOPs) of the first and second type. Under some very mild assumptions, which are satisfied by Angelesco systems, we define…
We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
Stanley asked whether a tree is determined up to isomorphism by its chromatic symmetric function. We approach Stanley's problem by studying the relationship between the chromatic symmetric function and other invariants. First, we prove…
We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…
We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…
Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…
This article is devoted to the computation of Jack connection coefficients, a generalization of the connection coefficients of two classical commutative subalgebras of the group algebra of the symmetric group: the class algebra and the…
A tree, embedded into plane, is a dessin d'enfant and its Belyi function is a polynomial --- Shabat polynomial. The Zapponi form of this polynomial is unique, so we can correspond to an embedded tree the Julia set of its Shabat-Zapponi…
In this paper, we introduce iterated integrals associated with colored rooted trees and give proofs for the shuffle relations for $\boldsymbol{p}$-adic finite and $t$-adic symmetric polylogarithms. This method generalizes the theory of the…
The theory of DAHA-Jones polynomials is extended from torus knots to their arbitrary iterations (for any reduced root systems and weights), which incudes the polynomiality, duality and other properties of the DAHA superpolynomials.…