Related papers: Modules in Robinson Spaces

We study the problem of circular seriation, where we are given a matrix of pairwise dissimilarities between $n$ objects, and the goal is to find a {\em circular order} of the objects in a manner that is consistent with their dissimilarity.…

Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be reordered. We present a new polynomial time algorithm to…

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…

We prove that the error of the best nonlinear $L_p$-approximation by piecewise constants on convex partitions is $\mathcal{O}\big(N^{-\frac{2}{d+1}}\big)$, where $N$ the number of cells, for all functions in the Sobolev space…

A partition $\mathcal{P}$ of $\mathbb{R}^d$ is called a $(k,\varepsilon)$-secluded partition if, for every $\vec{p} \in \mathbb{R}^d$, the ball $\overline{B}_{\infty}(\varepsilon, \vec{p})$ intersects at most $k$ members of $\mathcal{P}$. A…

The moduli space ${\rm M}_{d}$, of complex rational maps of degree $d \geq 2$, is a connected complex orbifold which carries a natural real structure, coming from usual complex conjugation. Its real points are the classes of rational maps…

We compute the intersection cohomology of the moduli spaces $M_{r,d}$ of semistable vector bundles having rank $r$ and degree $d$ over a curve. We do this by relating the Hodge-Deligne polynomial of the intersection cohomology of $M_{r,d}$…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum…

Let ${\cal D}^k$ be the space of $k$-th order linear differential operators on ${\bf R}$: $A=a_k(x)\frac{d^k}{dx^k}+\cdots+a_0(x)$. We study a natural 1-parameter family of $\Diff(\bf R)$- (and $\Vect(\bf R)$)-modules on ${\cal D}^k$. (To…

This paper studies intersection theory on the compactified moduli space M(n,d) of holomorphic bundles of rank n and degree d over a fixed compact Riemann surface of genus g > 1 where n and d may have common factors. Because of the presence…

We study the problem of assortative and disassortative partitions on random $d$-regular graphs. Nodes in the graph are partitioned into two non-empty groups. In the assortative partition every node requires at least $H$ of their neighbors…

Determining whether two particle systems are similar is a common problem in particle simulations. When the comparison should be invariant under permutations, orthogonal transformations, and translations of the systems, special techniques…

The tropical semiring (R, min, +) has enjoyed a recent renaissance, owing to its connections to mathematical biology as well as optimization and algebraic geometry. In this paper, we investigate the space of labeled n-point configurations…

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…

Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. We find and prove a general formula for Dyson's ranks by considering the deviation of the ranks from…

An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance d_H between any two distinct elements of C is at least equal to d. In this paper, we use the characterisation of the isometry group of the metric space…

How to divide floor plans or navigation maps into semantic representations, such as rooms and corridors, is an important research question in fields such as human-robot interaction, place categorization, or semantic mapping. While most…