Related papers: Modules in Robinson Spaces

The differential-geometric structure of the manifold of smooth shapes is applied to the theory of shape optimization problems. In particular, a Riemannian shape gradient with respect to the first Sobolev metric and the Steklov-Poincar\'{e}…

We consider structured approximation of measures in Wasserstein space $\mathrm{W}_p(\mathbb{R}^d)$ for $p\in[1,\infty)$ using general measure approximants compactly supported on Voronoi regions derived from a scaled Voronoi partition of…

We establish an Excision type theorem for niceness of group structure on the orbit space of unimodular rows of length $n$ modulo elementary action. This permits us to establish niceness for relative versions of results for the cases when $n…

Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…

The theory of spin models intersects with condensed matter physics, complex systems, graph theory, combinatorial optimization, computational complexity and neural networks. Many ensuing applications rely on the fact that complicated spin…

We address the following general question: given a graph class C on which we can solve Maximum Matching in (quasi) linear time, does the same hold true for the class of graphs that can be modularly decomposed into C ? A major difficulty in…

We give a polynomial-time algorithm for learning high-dimensional halfspaces with margins in $d$-dimensional space to within desired TV distance when the ambient distribution is an unknown affine transformation of the $d$-fold product of an…

We consider structured optimisation problems defined in terms of the sum of a smooth and convex function, and a proper, l.s.c., convex (typically non-smooth) one in reflexive variable exponent Lebesgue spaces $L_{p(\cdot)}(\Omega)$. Due to…

A set of points $S$ in Euclidean space $\mathbb{R}^d$ is called \textit{Ramsey} if any finite partition of $\mathbb{R}^{\infty}$ yields a monochromatic copy of $S$. While characterization of Ramsey set remains a major open problem in the…

A set of polynomials $M$ is called a {\it submodule} of $\mathbb{C} [x_1, \dots, x_n ]$ if $M$ is a translation invariant linear subspace of $\mathbb{C} [x_1, \dots, x_n ]$. We present a description of the submodules of $\mathbb{C} [x,y]$…

Let $C$ be an arrangement of affine hyperplanes in a complex affine space $X$, $D$ the ring of algebraic differential operators on $X$. We define a category of quivers associated with $C$. A quiver is a collection of vector spaces, attached…

The number partitioning problem is a classic problem of combinatorial optimization in which a set of $n$ numbers is partitioned into two subsets such that the sum of the numbers in one subset is as close as possible to the sum of the…

Let $V$ be a quasi-conformal grading-restricted vertex algebra, $W$ be its module, and $\W_{z_1, \ldots, z_n}$ be the space of rational differential forms with complex parameters $(z_1, \ldots, z_n)$ for $n \ge 0$. Using geometric…

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

We prove a conjecture of Mills, Robbins and Rumsey [Alternating sign matrices and descending plane partitions, J. Combin. Theory Ser. A 34 (1983), 340-359] that, for any n, k, m and p, the number of nxn alternating sign matrices (ASMs) for…

In data sequences measured over space or time, an important problem is accurate detection of abrupt changes. In partially labeled data, it is important to correctly predict presence/absence of changes in positive/negative labeled regions,…

Stochastic partition models divide a multi-dimensional space into a number of rectangular regions, such that the data within each region exhibit certain types of homogeneity. Due to the nature of their partition strategy, existing partition…

Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…

Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…