Related papers: Tripod in uniform spanning tree and three-sided ra…
In this paper, we study local bifurcations of an indefinite elliptic system with multiple components: \begin{equation*} \left\{\begin{array}{ll} -\Delta u_j + au_j = \mu_ju_j^3+\beta\sum_{k\ne j}u_k^2u_j, u_j>0\ \ \hbox{in}\ \Omega, u_j=0 \…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
It is well known that a triangulation of a closed 2-manifold is tight with respect to a field of characteristic two if and only if it is neighbourly; and it is tight with respect to a field of odd characteristic if and only if it is…
The size of the largest common subtree (maximum agreement subtree) of two independent uniform random binary trees on $n$ leaves is known to be between orders $n^{1/8}$ and $n^{1/2}$. By a construction based on recursive splitting and…
Finding a minimum spanning tree (MST) for $n$ points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes $\Omega(n^2)$ time to even approximate. We introduce a…
The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…
We show that any two geometric triangulations of a closed hyperbolic, spherical or Euclidean manifold are related by a sequence of Pachner moves and barycentric subdivisions of bounded length. This bound is in terms of the dimension of the…
Let $D$ be a directed graphs with distinguished sets of sources $S\subseteq V(D)$ and sinks $T\subseteq V(D)$. A tripod in $D$ is a subgraph consisting of the union of two $S$-$T$-paths that have distinct start-vertices and the same…
Stack triangulations appear as natural objects when defining an increasing family of triangulations by successive additions of vertices. We consider two different probability distributions for such objects. We represent, or "draw" these…
This is the first of three papers on the geometric and combinatorial characterization of global Sturm attractors which consist of a single closed 3-ball. The underlying scalar PDE is parabolic, $$ u_t = u_{xx} + f(x,u,u_x)\,, $$ on the unit…
In the research scope of forest stand self-thinning, the analysis reveals a broad picture in which the -3/2 rule takes a definite and special place. The application of the simple geometrical model to the Douglas-fir and Scots pine data…
Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path…
We prove that the interface of critical site percolation on the triangular lattice converges to SLE$_6$ in its natural parametrization, where the discrete interface is parametrized such that each edge is crossed in one unit of time, while…
It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge…
We investigate the nonlinear Schr\"odinger equation on a three-edge star graph, where each edge contains a linear localized inhomogeneity in the form of a Dirac delta linear potential. Such systems are of significant interest in studying…
We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…
We express the partition functions of the spanning tree on finite square lattices under five different sets of boundary conditions (free, cylindrical, toroidal, M\"obius strip, and Klein bottle) in terms of a principal partition function…
Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…