Related papers: Computing Covers of Plane Forests

We show that if $N$, an open connected $n$-manifold with finitely generated fundamental group, is $C^{2}$ foliated by closed planes, then $\pi_{1}(N)$ is a free group. This implies that if $\pi_{1}(N)$ has an Abelian subgroup of rank…

Let $\phi$ be a quasiconformal mapping, and let $T_\phi$ be the composition operator which maps $f$ to $f\circ\phi$. Since $\phi$ may not be bi-Lipschitz, the composition operator need not map Sobolev spaces to themselves. The study begins…

A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^\phi = a^\phi | b^\phi$, as we do for ordinary representations, we only require that $c^\phi\supseteq a^\phi |…

Given a permutation $\pi\in \Sn\_n$, construct a graph $G\_\pi$ on the vertex set $\{1,2, ..., n\}$ by joining $i$ to $j$ if (i) $i<j$ and $\pi(i)<\pi(j)$ and (ii) there is no $k$ such that $i < k < j$ and $\pi(i)<\pi(k)<\pi(j)$. We say…

Treemaps have been widely applied to the visualization of hierarchical data. A treemap takes a weighted tree and visualizes its leaves in a nested planar geometric shape, with sub-regions partitioned such that each sub-region has an area…

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Given a negative plurisubharmonic function $\phi$ in a bounded pseudoconvex domain of ${\mathbb C}^n$, we introduce and study its residual function $g_\phi$ determined by the asymptotic behavior of $\phi$ near its singularity points, both…

The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…

In this work, we study the composition operators on the little Lipschitz space ${\mathcal L}_0$ of a rooted tree $T$, defined as the subspace of the Lipschitz space ${\mathcal L}$ consisting of the complex-valued functions $f$ on $T$ such…

In this paper, we consider covering graphs obtained by lifting a tree with a loop at each vertex as a voltage graph over a cyclic group. We generalize a tool of Hell, Nishiyama, and Stacho, known as the billiard strategy, for constructing…

Recursive partitioning is the core of several statistical methods including CART, random forest, and boosted trees. Despite the popularity of tree based methods, to date, there did not exist methods for combining multiple trees into a…

Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…

We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…

We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…

We present an MPI-parallel algorithm for the in-situ visualization of computational data that is built around a distributed linear forest-of-octrees data structure. Such octrees are frequently used in element-based numerical simulations;…

We give a necessary and sufficient condition for a map defined on a simply-connected quasiconvex metric space to factor through a tree. In case the target is the Euclidean plane and the map is H\"older continuous with exponent bigger than…

While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tight complexity bounds are elusive for many problems even when…

We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed…

A connected graph has tree-depth at most $k$ if it is a subgraph of the closure of a rooted tree whose height is at most $k$. We give an algorithm which for a given $n$-vertex graph $G$, in time $\mathcal{O}(1.9602^n)$ computes the…

Let $G$ be the group $SL(2,\mathbb{R})$, $P\subset G$ be the parabolic subgroup of upper triangular matrices and $\Gamma\subset G$ be a cocompact lattice. A right action of $P$ on $\Gamma\backslash G$ defines an orbit foliation…