Related papers: Modules and PQ-trees in Robinson spaces

The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…

We denote by $\mathcal{P}_q$ the vector space of functions from a finite field $\mathbb{F}_q$ to itself, which can be represented as the space $\mathcal{P}_q := \mathbb{F}_q[x]/(x^q-x)$ of polynomial functions. We denote by $\mathcal{O}_n…

Let $p$ be a prime and let $\pi^n(X;\mathbb{Z}/p^r)=[X,M_n(\mathbb{Z}/p^r)]$ be the set of homotopy classes of based maps from CW-complexes $X$ into the mod $p^r$ Moore spaces $M_n(\mathbb{Z}/p^r)$ of degree $n$, where $\mathbb{Z}/p^r$…

We introduce an algorithm that performs a one-directional mesh overset of a parallel forest of octrees with another distributed mesh of unrelated partition. The forest mesh consists of several adaptively refined octrees. Individual smooth…

In [Matveev-Petrov 2016](arXiv:1504.00666) a $q$-deformed Robinson-Schensted-Knuth algorithm ($q$RSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and…

The relationship according to which one physical theory encompasses the domain of empirical validity of another is widely known as "reduction." Here it is argued that one popular methodology for showing that one theory reduces to another,…

The Neighbor-Joining algorithm is a popular distance-based phylogenetic method that computes a tree metric from a dissimilarity map arising from biological data. Realizing dissimilarity maps as points in Euclidean space, the algorithm…

A square symmetric matrix is a Robinson similarity matrix if entries in its rows and columns are non-decreasing when moving towards the diagonal. A Robinson similarity matrix can be viewed as the affinity matrix between objects arranged in…

Given a distance $D$ on a finite set $X$ with $n$ elements, it is interesting to understand how the ranking $R_x = z_1,z_2,\dots,z_n$ obtained by ordering the elements in $X$ according to increasing distance $D(x,z_i)$ from $x$, varies with…

Let $\mathbb R^{m|n}$ be the usual super space. It is known that the algebraic functions on $\mathbb R^{m|n}$ is a Koszul algebra, whose Koszul dual algebra, however, is not the set of functions on $\mathbb R^{n|m}$, due to the…

Min-Cut queries are fundamental: Preprocess an undirected edge-weighted graph, to quickly report a minimum-weight cut that separates a query pair of nodes $s,t$. The best data structure known for this problem simply builds a cut-equivalent…

We look at Poisson geometry taking the viewpoint of singular foliations, understood as suitable submodules generated by Hamiltonian vector fields rather than partitions into (symplectic) leaves. The class of Poisson structures which behave…

The range-minimum query (RMQ) problem is a fundamental data structuring task with numerous applications. Despite the fact that succinct solutions with worst-case optimal $2n+o(n)$ bits of space and constant query time are known, it has been…

We study the global structure of moduli spaces of quasi-isogenies of p-divisible groups introduced by Rapoport and Zink. We determine their dimensions and their sets of connected components and of irreducible components. If the isocrystals…

A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…

A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new ``normalized information distance'', based on the noncomputable notion of…

A quasi-metric is a distance function which satisfies the triangle inequality but is not symmetric: it can be thought of as an asymmetric metric. The central result of this thesis, developed in Chapter 3, is that a natural correspondence…

Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we…

The performance of many machine learning techniques depends on the choice of an appropriate similarity or distance measure on the input space. Similarity learning (or metric learning) aims at building such a measure from training data so…

We consider subsemimodules and convex subsets of semimodules over semirings with an idempotent addition. We introduce a nonlinear projection on subsemimodules: the projection of a point is the maximal approximation from below of the point…