Related papers: Inverse sequences, rooted trees and their end spac…

We prove boundary inequalities in arbitrary bounded Lipschitz domains on the trace space of Sobolev spaces. For that, we make use of the trace operator, its Moore-Penrose inverse, and of a special inner product. We show that our trace…

When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…

A metric tree ($M$, $d$), also known as $\mathbb{R}$-trees or $T$-theory, is a metric space such that between any two points there is an unique arc and that arc is isometric to an interval in $\mathbb{R}$. In this paper after presenting…

We prove a transverse diameter theorem in the context of Lorentzian foliations, which can be interpreted as a Hawking--Penrose-type singularity theorem for timelike geodesics transverse to the foliation. In order to develop the necessary…

A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…

We calculate curvature tensors of metrics on the total spaces of holomorphic fibrations. Our main tool is a theory of Chern connections and curvature forms for possibly degenerate Hermitian forms on holomorphic vector bundles. We prove a…

Using uniformization, Cantor type sets can be regarded as boundaries of rooted trees. In this setting, we show that the trace of a first-order Sobolev space on the boundary of a regular rooted tree is exactly a Besov space with an explicit…

Model sets (also called cut and project sets) are generalizations of lattices. Here we show how the self-similarities of model sets are a natural replacement for the group of translations of a lattice. This leads us to the concept of…

Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstructed through a simple first-order interpretation. A prominent…

We study metric properties of manifolds with conic singularities and present a natural interplay between metrically conic and metrically asymptotically conic behaviour. As a consequence, we prove that a singular sub-manifold is Lipschitz…

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…

We consider weighted, directed graphs with a notion of absorption on the vertices, related to absorbing random walks on graphs. We define a generalized inverse of the graph Laplacian, called the absorption inverse, that reflects both the…

We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…

In this paper we prove that the Scott topology $\mathfrak S$ on a rooted non-metric tree $\mathcal T$ is strictly coarser than the weak tree topology. Moreover, for each $t\in \mathcal T$, we consider a natural order $\preceq_t$ on…

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 consider Hilbert series associated to modules over various categories of trees. Using the technology of Sam and Snowden, we show that these Hilbert series must be algebraic. We then apply these technical theorems to prove facts about…

The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…

A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…

In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…

While inverse estimates in the context of radial basis function approximation on boundary-free domains have been known for at least ten years, such theorems for the more important and difficult setting of bounded domains have been notably…