Related papers: The Power-Set Construction for Tree Algebras
In this paper, estimates for Kolmogorov, Gelfand and linear widths of function classes on sets with a tree-like structure are obtained. As examples we consider weighted Sobolev classes on a John domain, as well as some function classes on a…
The treewidth boundedness problem for a logic asks for the existence of an upper bound on the treewidth of the models of a given formula in that logic. This problem is found to be undecidable for first order logic. We consider a…
We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…
We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…
Binary rooted trees, both in the ordered and in the un-ordered case, are well studied structures in the field of combinatorics. The aim of this work is to study particular patterns in these classes of trees. We consider completely…
A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…
The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…
We consider actions of completely metrisable groups on simplicial trees in the context of the Bass--Serre theory. Our main result characterises continuity of the amplitude function corresponding to a given action. Under fairly mild…
Rooted tree maps assign to an element of the Connes-Kreimer Hopf algebra of rooted trees a linear map on the noncommutative polynomial algebra in two letters. Evaluated at any admissible word these maps induce linear relations between…
We consider complex Mandelbrot multiplicative cascades on a random weigh\-ted tree. Under suitable assumptions, this yields a dynamics $\T$ on laws invariant by random weighted means (the so called fixed points of smoothing transformations)…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
We demonstrate that a tree-based theory for various dynamical processes yields extremely accurate results for several networks with high levels of clustering. We find that such a theory works well as long as the mean intervertex distance…
We consider a transitive relation on the power set of $\omega_1$ and show if there is a maximal element with respect to this relation then there is a Kurepa tree with no Aronszajn subtree. We also show that if there is a maximal subset of…
Let $X$ be a finite set. We give criterion to say if a system of trees ${\cal P}=\{T_i\}_i$ with leaf sets $L(T_i) \in {X \choose 5}$ can be amalgamated into a supertree, that is, if there exists a tree $T$ with $L(T)=X$ such that $T$…
It is well known that the set of universal functions on a tree contains a vector space except zero which is dense in the set of harmonic functions. In this paper we improve this result by proving that the set of universal functions on a…
In this paper a Bass-Serre theory in the groupoid setting is developed and a structure theorem is established. Any groupoid action without inversion of edges on a forest induces a graph of groupoids, while any graph of groupoids satisfying…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.