Related papers: A H\"older-type inequality on a regular rooted tre…
We construct measures invariant with respect to equivalence relations which are graphed by horospheric products of trees. The construction is based on using conformal systems of boundary measures on treed equivalence relations. The…
The boxicity of a graph G, denoted as box(G) is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf power if there exists a tree T such that the leaves of the…
We give exact formulas for the transmission (i.e. the sum of all distances between vertices) of perfect trees and rooted powers of (connected finite) graphs.
Hopf algebra structures on rooted trees are by now a well-studied object, especially in the context of combinatorics. In this work we consider a Hopf algebra H by introducing a coproduct on a (commutative) algebra of rooted forests,…
Haagerup's inequality for convolvers on free groups may be interpreted as a result on $\tA_1$ buildings, i.e. trees. Here are proved analogous inequalities for discrete groups acting freely on the vertices of $\tA_1\times\tA_1$ and $\tA_2$…
In this paper, we study merge trees induced by a discrete Morse function on a tree. Given a discrete Morse function, we provide a method to constructing an induced merge tree and define a new notion of equivalence of discrete Morse…
The aim of this paper is to present necessary and sufficient conditions for generalized H\"{o}lder's inequality on generalized Morrey spaces. We also obtain similar results on weak Morrey spaces and on generalized weak Morrey spaces. The…
In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…
In this paper, we study certain inequalities and a related result for weighted Sobolev spaces on H\"older-$\alpha$ domains, where the weights are powers of the distance to the boundary. We obtain results regarding the divergence equation's…
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
Let $I(G)^{[k]}$ denote the $k$th squarefree power of the edge ideal of $G$. When $G$ is a forest, we provide a sharp upper bound for the regularity of $I(G)^{[k]}$ in terms of the $k$-admissable matching number of $G$. For any positive…
We describe an inequality of finite or infinite sequences of real numbers and their quotients. More precisely, we compare the quotient of H\"older functionals of two sequences of numbers with the sum of their quotients. In the last section…
Measures of tree balance play an important role in many different research areas such as mathematical phylogenetics or theoretical computer science. Typically, tree balance is quantified by a single number which is assigned to the tree by a…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties 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…
We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…
We use the H\"{o}lder inequality for mixed exponents to prove some optimal variants of the generalized Hardy--Littlewood inequality for $m$-linear forms on $\ell _{p}$ spaces with mixed exponents. Our results extend recent results of Araujo…