Related papers: On some branches of the Bruhat-Tits tree

We describe the set of maximal orders in a 2-by-2 matrix algebra over a non-commutative local division algebra B containing a given suborder, for certain important families of such suborders, including rings of integers of division…

Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i \leq n$ vertices and $\ell$ leaves in $G$. We study the associated optimization problem, that…

For a permutation $\pi$ in the symmetric group $S_n$ let the {\it total degree} be its valency in the Hasse diagram of the strong Bruhat order on $S_n$, and let the {\it down degree} be the number of permutations which are covered by $\pi$…

The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…

The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a finite-dimensional vector space V; or, equivalently, the closure of an orbit of the group GL(V) acting on the direct product of two full flag…

The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…

Let $B$ be a central simple algebra of degree $n$ over a number field $K$, and $L\subset B$ a strictly maximal subfield. We say that the ring of integers $\mathcal O_L$ is "selective" if there exists an isomorphism class of maximal orders…

Tree shape statistics quantify some aspect of the shape of a phylogenetic tree. They are commonly used to compare reconstructed trees to evolutionary models and to find evidence of tree reconstruction bias. Historically, to find a useful…

Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are…

Let $G=(V,E)$ and $H$ be two graphs. Packing problem is to find in $G$ the largest number of independent subgraphs each of which is isomorphic to $H$. Let $U\subset{V}$. If the graph $G-U$ has no subgraph isomorphic to $H$, $U$ is a cover…

We prove a conjecture of W.~Hackbusch in a bigger generality than in our previous article. Here we consider Tensor Train (TT) model with an arbitrary number of leaves and a corresponding "almost binary tree" for Hierarchical Tucker (HT)…

The notion of $\mathcal{H}$-treewidth, where $\mathcal{H}$ is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly speaking, a graph of $\mathcal{H}$-treewidth at most $k$…

This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…

In this paper we find the generating function for the number of vertices that have k elements in their subtree and use this generating function to calculate the probability that a vertex has a size k subtree. We also show how this same…

In this work we continue the investigation launched in [FHR16] of the structural properties of the structural properties of the Layers model, a dependent percolation model. Given an undirected graph $G=(V,E)$ and an integer $k$, let…

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

Polytrees are a subclass of Bayesian networks that seek to capture the conditional dependencies between a set of $n$ variables as a directed forest and are motivated by their more efficient inference and improved interpretability. Since the…

Let $G=(V,E)$ be a simple and connected graph. A $h$-order invariant of $G$ based on the path sequence is defined from a set of real numbers ${f(x_{0},x_{1},\cdots,x_{h})}$ as $^{h}I_f(G)=\sum\limits_{v_{0}v_{1}v_{2}\cdots…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

We define and study a simplicial complex which is a homogeneous space for the group $PGL(2, K)$ over a two-dimensional local field $K$. The complex is a generalization of the tree studied by F. Bruhat, J. Tits, J.-P. Serre and P. Cartier in…