Related papers: Trees meet octahedron comparison

Let $G$ be a discrete countable group and $C$ its central subgroup with $G/C$ treeable. We show that for any treeable action of $G/C$ on a standard probability space $X$, the groupoid $G\ltimes X$ is isomorphic to the direct product of $C$…

We show that the links associated with positive elements of the Thompson group $F$ coincide with the closures of bipartite arborescent tangles.

In this work a composition-decomposition technique is presented that correlates tree eigenvectors with certain eigenvectors of an associated so-called skeleton forest. In particular, the matching properties of a skeleton determine the…

We discuss the combinatorics of faces of trees in the context of dendroidal sets and develop a systematic treatment of dendroidal anodyne extensions. As the main example and our motivation, we prove the pushout-product property for the…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

Motivated by applications to crystalline materials, we generalize the merge tree and the related barcode of a filtered complex to the periodic setting in Euclidean space. They are invariant under isometries, changing bases, and indeed…

The early development of a zygote can be mathematically described by a developmental tree. To compare developmental trees of different species, we need to define distances on trees. If children cells after a division are not…

We develop a theoretical framework for the analysis of oblique decision trees, where the splits at each decision node occur at linear combinations of the covariates (as opposed to conventional tree constructions that force axis-aligned…

The Poisson boundary of a finite direct product of affine automorphism groups of homogeneous trees is considered. The Poisson boundary is shown to be a product of ends of trees with a hitting measure for spread-out, aperiodic measures of…

In this paper, a theorem about similar triangles is proved. It shows that two small and four large triangles similar to the original triangle can appear if we choose well among several intersections of the perpendicular bisectors of the…

We identify a link between regular matroids and torus representations all of whose isotropy groups have an odd number of components. Applying Seymour's 1980 classification of the former objects, we obtain a classification of the latter. In…

We show the Graceful Tree Conjecture holds.

Let $G$ be an undirected simple connected graph. We say a vertex $u$ is eccentric to a vertex $v$ in $G$ if $d(u,v)=\max\{d(v,w): w\in V(G)\}$. The eccentric graph, $E(G)$ of $G$ is a graph defined on the same vertex set as of $G$ and two…

Every irreducible odd dimensional representation of the $n$'th symmetric or hyperoctahedral group, when restricted to the $(n-1)$'th, has a unique irreducible odd-dimensional constituent. Furthermore, the subgraph induced by odd-dimensional…

In 10.1093/imrn/rnac258, the authors conjecture a combinatorial formula for the expressions $\Xi e_\alpha \rvert_{t=1}$, known as Symmetric Theta Trees Conjecture, in terms of tiered trees with an inversion statistic. In…

A heuristic extending the Squarified Treemap technique for the representation of hierarchical information as treemaps is presented. The original technique gives high quality treemap views, since items are laid out with rectangles that…

We give a geometric method for determining the cohomology groups of a polyhedral product under suitable freeness conditions or with coefficients taken in a field. This is done by considering first the special case for which the pairs of…

We show that the higher-order matching problem is decidable using a game-theoretic argument.

An important problem in geometric computing is defining and computing similarity between two geometric shapes, e.g. point sets, curves and surfaces, etc. Important geometric and topological information of many shapes can be captured by…

We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for…