Related papers: A H\"older-type inequality on a regular rooted tre…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…
Let us have a family of ideals of holomorphic functions vanishing at N distinct points of a complex manifold, all tending to a single point. As is known, convergence of the ideals does not guarantee the convergence of the pluricomplex Green…
Let $\Gamma^{(x_0)}$ be a finite rooted tree, for which $\Gamma$ is the underlying tree and $x_0$ the root. Let $T$ be the Terwilliger algebra of $\Gamma$ with respect to $x_0$. We study the structure of the principal $T$-module. As a…
We present various results concerning the two-weight Hardy's inequality on infinite trees. Our main scope is to survey known characterizations (and proofs) for trace measures, as well as to provide some new ones. Also for some of the known…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
A \emph{matching} is a subset of edges in a graph $G$ that do not share an endpoint. A matching $M$ is a \emph{$\mathcal{P}$-matching} if the subgraph of $G$ induced by the endpoints of the edges of $M$ satisfies property $\mathcal{P}$. For…
Let $T$ be a tree with induced partial order $\preceq$. We investigate centered Gaussian processes $X=(X_t)_{t\in T}$ represented as $$ X_t=\sigma(t)\sum_{v \preceq t}\alpha(v)\xi_v $$ for given weight functions $\alpha$ and $\sigma$ on $T$…
We prove an analogue for trees of Courant's theorem on the interlacing property of zeros of eigenfunctions of a Schr\"{o}dinger operator. Let $\Gamma$ be a finite tree, and $\mathcal A$ a Schr\"{o}dinger operator on $\Gamma$. If the…
We review a method to obtain optimal Poincar\'e-Hardy-type inequalities on the hyperbolic spaces, and discuss briefly generalisations to certain classes of Riemannian manifolds. Afterwards, we recall a corresponding result on homogeneous…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
In this work, some combinatorial lower bound for regularity of powers of the edge ideal of a uniform hypergarph is gained. A family of hypergraphs whose regularity of edge ideal attains this bound and has a significant difference from the…
A mapping M(t) is considered to obtain some preliminary results and a new trapezoidal form of Fejer inequality related to the h-convex functions. Furthermore the obtained results are applied to achieve some new inequalities in connection…
Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…
If $G$ is a group acting on a tree $X$, and ${\mathcal S}$ is a $G$-equivariant sheaf of vector spaces on $X$, then its compactly-supported cohomology is a representation of $G$. Under a finiteness hypothesis, we prove that if $H_c^0(X,…
A new class of (not necessarily bounded) operators related to (mainly infinite) directed trees is introduced and investigated. Operators in question are to be considered as a generalization of classical weighted shifts, on the one hand, and…
An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…
We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…
We consider injective first-order interpretations that input and output trees of bounded height. The corresponding functions have polynomial output size, since a first-order interpretation can use a k-tuple of input nodes to represent a…