Related papers: Projective Fra\"{\i}ss\'{e} limits of trees
It has long been known that the following basic objects are obstructions to bounded tree-width: for arbitrarily large $t$, $(1)$ the complete graph $K_t$, $(2)$ the complete bipartite graph $K_{t,t}$, $(3)$ a subdivision of the $(t \times…
We show that $(n,d,\lambda)$-graphs with $\lambda=O(d/\log^3 n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang of the form…
In this thesis we study toric degenerations of projective varieties. We compare different constructions to understand how and why they are related as s first step towards developing a global framework. In focus are toric degenerations…
A symbolic-computational algorithm, fully implemented in Maple, is described, that computes explicit expressions for generating functions that enable the efficient computations of the expectation, variance, and higher moments, of the random…
We study homeomorphisms and the homeomorphism groups of compact metric spaces using the automorphism groups of projective Fra\"iss\'e limits. In our applications, we investigate the Polish group ${\rm Homeo}(P)$ of all homeomorphisms of the…
We prove that the edge-end space of an infinite graph is metrizable if and only if it is first-countable. This strengthens a recent result by Aurichi, Magalhaes Jr.\ and Real (2024). Our central graph-theoretic tool is the use of tree-cut…
We study structures of solutions for SUSY Minkowski F-term equations on two toroidal orientifolds with $h^{2, 1} = 1$. Following our previous study \cite{Ishiguro:2020tmo}, with fixed upper bounds of a flux D3-brane charge $N_{\rm flux}$,…
In Athreya, L\"ohr, Winter (2016), an invariance principle is stated for a class of strong Markov processes on tree-like metric measure spaces. It is shown that if the underlying spaces converge Gromov vaguely, then the processes converge…
We construct forests that span $\mathbb{Z}^d$, $d\geq2$, that are stationary and directed, and whose trees are infinite, but for which the subtrees attached to each vertex are as short as possible. For $d\geq3$, two independent copies of…
We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to tensor networks with arbitrary bond dimensions, open legs, and…
We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…
We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…
The seminal papers of Edmonds \cite{Egy}, Nash-Williams \cite{NW} and Tutte \cite{Tu} have laid the foundations of the theories of packing arborescences and packing trees. The directed version has been extensively investigated, resulting in…
In this paper, we investigate normal trees of directed graphs, which extend the fundamental concept of normal trees of undirected graphs. We prove that a directed graph $D$ has a normal spanning tree if and only if the topological space…
Numerical experiments by Werness, Lee and the third author suggested that dessin d'enfants associated to large trivalent trees approximate the developed deltoid introduced by Lee, Lyubich, Makarov and Mukherjee. In this paper, we confirm…
Mutations of genetic sequences are often accompanied by their recombinations, known as phylogenetic networks. These networks are typically reconstructed from coalescent processes that may arise from optimal merging or fitting together a…
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…
Given any infinite tree in the plane satisfying certain topological conditions, we construct an entire function $f$ with only two critical values $\pm 1$ and no asymptotic values such that $f^{-1}([-1,1])$ is ambiently homeomorphic to the…
We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the…