Related papers: Modules and PQ-trees in Robinson spaces

This paper proposes a generalized framework with joint normalization which learns lower-dimensional subspaces with maximum discriminative power by making use of the Riemannian geometry. In particular, we model the similarity/dissimilarity…

The decision tree recursively partitions the input space into regions and derives axis-aligned decision boundaries from data. Despite its simplicity and interpretability, decision trees lack parameterized representation, which makes it…

We propose a novel technique, termed compact shape trees, for computing correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero or more features defined at each of n sample points on the shape's boundary, the compact…

This paper studies the "reduction mod $p$" method, which constructs large classes of representations for a semisimple algebraic group $G$ from representations for the corresponding Lusztig quantum group $U_\zeta$ at a $p^r$-th root of…

Given a reference set $R$ of $n$ points and a query set $Q$ of $m$ points in a metric space, this paper studies an important problem of finding $k$-nearest neighbors of every point $q \in Q$ in the set $R$ in a near-linear time. In the…

A standard construction in approximation theory is mesh refinement. For a simplicial or polyhedral mesh D in R^k, we study the subdivision D' obtained by subdividing a maximal cell of D. We give sufficient conditions for the module of…

Let ${\mathbf F}_q$ denote a finite field of characteristic $p$ and let $n$ be an effective divisor on the affine line over ${\mathbf F}_q$ and let $v$ be a point on the affine line outside $n$. In this paper, we get congruences between…

At the 1987 Ramanujan Centenary meeting Dyson asked for a coherent group-theoretical structure for Ramanujan's mock theta functions analogous to Hecke's theory of modular forms. Many of Ramanujan's mock theta functions can be written in…

In this work we formally derive and prove the correctness of the algorithms and data structures in a parallel, distributed-memory, generic finite element framework that supports h-adaptivity on computational domains represented as…

Cluster algebra structures for Grassmannians and their (open) positroid strata are controlled by a Postnikov diagram D or, equivalently, a dimer model on the disc, as encoded by either a bipartite graph or the dual quiver (with faces). The…

For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole for generalized Reed-Solomon codes is proved to be…

Deep metric learning (DML) is a cornerstone of many computer vision applications. It aims at learning a mapping from the input domain to an embedding space, where semantically similar objects are located nearby and dissimilar objects far…

An arborescence, which is a directed analogue of a spanning tree in an undirected graph, is one of the most fundamental combinatorial objects in a digraph. In this paper, we study arborescences in digraphs from the viewpoint of…

Let $M$ denote a two-dimensional Moore space (so $H_2(M; \Z) = 0$), with fundamental group $G$. The $M$-cellular spaces are those one can build from $M$ by using wedges, push-outs, and telescopes (and hence all pointed homotopy colimits).…

A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease along rows and columns when moving toward the diagonal. A…

MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of non-Reed-Solomon (non-RS) type MDS codes has emerged as an…

We construct and classify all Poisson structures on quasimodular forms that extend the one coming from the first Rankin-Cohen bracket on the modular forms. We use them to build formal deformations on the algebra of quasimodular forms.

We construct a new model structure on the category of dg presheaves over a topological space $X$, obtained through the right Bousfield localization of the local projective model structure. The motivation for this construction arises from…

We investigate quiver representations over $\mathbb{F}_1$. Coefficient quivers are combinatorial gadgets equivalent to $\mathbb{F}_1$-representations of quivers. We focus on the case when the quiver $Q$ is a pseudotree. For such quivers, we…

We define tropical analogues of the notions of linear space and Plucker coordinate and study their combinatorics. We introduce tropical analogues of intersection and dualization and define a tropical linear space built by repeated…