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

For an essentially tame supercuspidal representation $\pi$ of a connected reductive $p$-adic group $G$, we establish two distinct and complementary sufficient conditions for the irreducible components of its restriction to a maximal compact…

Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…

Let $D$ be a totally definite quaternion algebra over a totally real number field $F$, and $\mathcal{O}$ be an $O_F$-order (of full rank) in $D$. The type number $t(\mathcal{O})$ is an important arithmetic invariant of $\mathcal{O}$ that…

Let $P$ and $S$ be two disjoint sets of $n$ and $m$ points in the plane, respectively. We consider the problem of computing a Steiner tree whose Steiner vertices belong to $S$, in which each point of $P$ is a leaf, and whose longest edge…

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

Let G be a real form of a complex reductive group. Suppose that we are given involutions \sigma and \theta of G. Let H=G^\sigma denote the fixed group of \sigma and let K=G^\theta denote the fixed group of \theta. We are interested in…

Let $K$ be the fraction field of a 2-dimensional, henselian, excellent local domain with finite residue field $k$. When the characteristic of $k$ is not 2, we prove that every quadratic form of rank $\ge 9$ is isotropic over $K$ using…

A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A classical result states that for any 2-tree $T$ with…

We give an algorithm that, given an $n$-vertex graph $G$ and an integer $k$, in time $2^{O(k)} n$ either outputs a tree decomposition of $G$ of width at most $2k + 1$ or determines that the treewidth of $G$ is larger than $k$. This is the…

Using Bruhat-Tits theory, we analyse the restriction of depth-zero representations of a semisimple simply connected $p$-adic group $G$ to a maximal compact subgroup $K$. We prove the coincidence of branching rules within classes of…

R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to construct and maintain R-trees for two-dimensional points, due to Kamel and Faloutsos, is to keep the points in the order in which they…

Building on prior work, we analyze the decomposition of the restriction of an irreducible representation of SL_2(k), for k a p-adic field of odd residual characteristic, to a maximal compact subgroup K. The pattern of the decomposition…

Random forests and, more generally, (decision\nobreakdash-)tree ensembles are widely used methods for classification and regression. Recent algorithmic advances allow to compute decision trees that are optimal for various measures such as…

We consider a variant of treewidth that we call clique-partitioned treewidth in which each bag is partitioned into cliques. This is motivated by the recent development of FPT-algorithms based on similar parameters for various problems. With…

Let K be a function field with constant field k and let "infinity" be a fixed place of K. Let C be the Dedekind domain consisting of all those elements of K which are integral outside "infinity". The group G=GL_2(C) is important for a…

Algorithms are given for determining $L_\infty$ isotonic regression of weighted data. For a linear order, grid in multidimensional space, or tree, of $n$ vertices, optimal algorithms are given, taking $\Theta(n)$ time. These improve upon…

Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H2, however Motwani and Sudan proved that it is NP-complete to determine…

For a local field $F$ and an Artinian local coefficient ring $\Lambda$ with the same positive residue characteristic $p$ we define, for any $e\in{\mathbb N}$, a category ${\mathfrak C}^{(e)}(\Lambda)$ of ${\rm GL}_2(F)$-equivariant…

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

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…