Related papers: Modules in Robinson Spaces

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…

Partial Isometries are important constructs that help give nontrivial solutions once a simple solution is known. We generalize this notion to Extended Partial Isometries and include operators which have right inverses but no left inverses…

We study the problem of supervised learning a metric space under discriminative constraints. Given a universe $X$ and sets ${\cal S}, {\cal D}\subset {X \choose 2}$ of similar and dissimilar pairs, we seek to find a mapping $f:X\to Y$, into…

A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been…

In this paper, we consider modular local polynomials. These functions satisfy modularity while they are locally defined as polynomials outside of an exceptional set. We prove an inequality for the dimension of the space of such forms when…

We propose a novel algorithm for supervised dimensionality reduction named Manifold Partition Discriminant Analysis (MPDA). It aims to find a linear embedding space where the within-class similarity is achieved along the direction that is…

For any natural $d \ge k \ge 2$ we calculate the cohomology groups of the space of homogeneous polynomials $R^2 \to R$ of degree $d$, which do not vanish with multiplicity $\ge k$ on real lines. For $k=2$ this problem provides the simplest…

In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…

Let D be a divisor in a complex analytic manifold X. A natural problem is to determine when the de Rham complex of meromorphic forms on X with poles along D is quasi-isomorphic to its subcomplex of logarithmic forms. In this mostly…

A metric space $(X,d)$ is called a $subline$ if every 3-element subset $T$ of $X$ can be written as $T=\{x,y,z\}$ for some points $x,y,z$ such that $d(x,z)=d(x,y)+d(y,z)$. By a classical result of Menger, every subline of cardinality $\ne…

Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…

We prove formulas (found by Witten in 1992 using physical methods) for intersection pairings in the cohomology of the moduli space M(n,d) of stable holomorphic vector bundles of rank n and degree d (assumed coprime) on a Riemann surface of…

Given a finite set $X \subset \mathbb{R}^d$ and a binary linear classifier $c: \mathbb{R}^d \to \{0,1\}$, how many queries of the form $c(x)$ are required to learn the label of every point in $X$? Known as \textit{point location}, this…

We give new lower bounds for $M(n,d)$, for various positive integers $n$ and $d$ with $n>d$, where $M(n,d)$ is the largest number of permutations on $n$ symbols with pairwise Hamming distance at least $d$. Large sets of permutations on $n$…

Let $1<d<e$ be two coprime integers and let $m_e$ denote the Mullineux map, which for $e$ prime describes tensor products of the irreducible modules of symmetric groups with the sign in characteristic $e$. We prove that if $\lambda$ is an…

The Grassmannian of affine subspaces is a natural generalization of both the Euclidean space, points being zero-dimensional affine subspaces, and the usual Grassmannian, linear subspaces being special cases of affine subspaces. We show…

Let $(N,g)$ be a Riemannian manifold with the distance function $d(x,y)$ and an open subset $M\subset N$. For $x\in M$ we denote by $D_x$ the distance difference function $D_x:F\times F\to \mathbb R$, given by…

We give a dimensionality reduction procedure to approximate the sum of distances of a given set of $n$ points in $R^d$ to any "shape" that lies in a $k$-dimensional subspace. Here, by "shape" we mean any set of points in $R^d$. Our…

Let $I \subset R = \mathbb{F}[x_1,x_2]$ be a height two ideal minimally generated by three homogeneous polynomials of the same degree $d$, where $\mathbb{F}$ is a field of characteristic zero. We use the theory of $D$-modules to deduce…

In the problem of semialgebraic range searching, we are to preprocess a set of points in $\mathbb{R}^D$ such that the subset of points inside a semialgebraic region described by $O(1)$ polynomial inequalities of degree $\Delta$ can be found…