Related papers: On optimal embeddings and trees

We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…

We explore a natural action of Hecke operators acting on formal sums of optimal embeddings of real quadratic orders into Eichler orders. By associating an optimal embedding to its root geodesic on the corresponding Shimura curve, we can…

Let k be an imaginary quadratic number field, let F be a rational quaternion algebra and M an extension of F as a quaternion k-algebra. We are going to classify the F-orders which arise as an intersection of F with a maximal M-order; and we…

We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\sqrt n$ by $\sqrt n$ grid. We also show that testing whether a given binary tree has…

We consider the problem of constructing an an optimal-weight tree from the 3*(n choose 4) weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologiesis optimal (so it can be the…

We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…

Worst-case optimal join algorithms have gained a lot of attention in the database literature. We now count with several algorithms that are optimal in the worst case, and many of them have been implemented and validated in practice.…

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…

We give a new algorithm to construct optimal alphabetic ternary trees, where every internal node has at most three children. This algorithm generalizes the classic Hu-Tucker algorithm, though the overall computational complexity has yet to…

The problem of {\em efficiently} finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied in literature. However, a closely related problem of efficiently…

In his pioneering work [Crelle's Journal, 1955], Eichler established the theory of trace formulas for Brandt matrices of quaternion orders. From it he derived a class number formula for Eichler orders in a totally definite quaternion…

In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree…

Let $B$ be a central simple algebra of degree 3 over a number field $F$ and $K/F$ be a finite extension of degree 3. For an order $S$ of $K$, we determine exactly when $S$ cannot be optimally embedded into all maximal orders of $B$.…

The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…

In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be…

Tree tensor networks (TTNs) are widely used in low-rank approximation and quantum many-body simulation. In this work, we present a formal analysis of the differential geometry underlying TTNs. Building on this foundation, we develop…

This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. The first part deals with bases of…

We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…

Two areas of mathematics which have received substantial attention in recent years are the theory of optimal transport and the Elliott classification programme for C*-algebras. We combine these two seemingly unrelated disciplines to make…

We construct embeddings of spaces of non-quasianalytic ultradistributions into differential algebras enjoying optimal properties in view of a Schwartz type impossibility result, also shown in this article. We develop microlocal analysis in…