Related papers: The integrally representable trees of norm 3

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…

We classify the possibilities for the fixed field of the kernel of an irreducible three-dimensional Artin representation of $\Q$ with solvable image ramified at one prime by using the classification of the finite irreducible subgroups of…

The automorphisms group of the 3-dimensional Reeb component with complex leaves is computed in the case where the component is obtained by the Hopf construction and the holonomy of the boundary leaf is not tangent to the identity to the…

In this paper, we give a class of reconstructible graphs.

We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set…

We give a classification of iwip outer automorphisms of the free group, by discussing the properties of their attracting and repelling trees.

We present an algorithm that, on input $n$, lists every unlabeled tree of order $n$.

In this note, a new class of representations of the braid groups $B_{N}$ is constructed. It is proved that those representations contain three kinds of irreducible representations: the trivial (identity) one, the Burau one, and an…

A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…

Let $I(G)^{[k]}$ denote the $k$th squarefree power of the edge ideal of $G$. When $G$ is a forest, we provide a sharp upper bound for the regularity of $I(G)^{[k]}$ in terms of the $k$-admissable matching number of $G$. For any positive…

This is a review paper of recent results in the perturbative symmetry approach in the symbolic representation.

We introduce and study the essential inputs (variables) for terms (trees) and tree automata.

We consider three different schemes for signal routing on a tree. The vertices of the tree represent transceivers that can transmit and receive signals, and are equipped with i.i.d. weights representing the strength of the transceivers. The…

We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.

We introduce equivariant tree models in algebraic statistics, which unify and generalise existing tree models such as the general Markov model, the strand symmetric model, and group based models. We focus on the ideals of such models. We…

Tree spanners approximate distances within graphs; a subtree of a graph is a tree $t$-spanner of the graph if and only if for every pair of vertices their distance in the subtree is at most $t$ times their distance in the graph. When a…

We completely describe the structure of the connected components of transversals to a collection of n line segments in R^3. We show that n>2 arbitrary line segments in R^3 admit 0, 1, ..., n or infinitely many line transversals. In the…

We prove that given a fixed finite tree $P$, almost all trees contain $P$ as a subtree. Moreover, the inclusion can be made so that it induces an embedding of the corresponding (quantum) automorphism groups, thereby providing generic…

We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the…