相关论文: Cutting the same fraction of several measures

We present three methods to construct majorizing measures in various settings. These methods are based on direct constructions of increasing sequences of partitions through a simple exhaustion procedure rather than on the construction of…

We show that for any two convex curves $C_1$ and $C_2$ in $\mathbb R^d$ parametrized by $[0,1]$ with opposite orientations, there exists a hyperplane $H$ with the following property: For any $t\in [0,1]$ the points $C_1(t)$ and $C_2(t)$ are…

Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…

In this paper, we address the problem of reconstruction of support of a measure from its moments. More precisely, given a finite subset of the moments of a measure, we develop a semidefinite program for approximating the support of measure…

Supervised learning is ubiquitous in medical image analysis. In this paper we consider the problem of meta-learning -- predicting which methods will perform well in an unseen classification problem, given previous experience with other…

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…

We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When cutting away a region from a solid piece of material -- such as steel, wood, ceramics, or plastic -- using a rough tool in a…

We will prove the following generalization of the ham sandwich Theorem, conjectured by Imre B\'ar\'any. Given a positive integer $k$ and $d$ nice measures $\mu_1, \mu_2,..., \mu_d$ in $\mathbb{R}^d$ such that $\mu_i (\mathds{R}^d) = k$ for…

We provide approximation algorithms for two problems, known as NECKLACE SPLITTING and $\epsilon$-CONSENSUS SPLITTING. In the problem $\epsilon$-CONSENSUS SPLITTING, there are $n$ non-atomic probability measures on the interval $[0, 1]$ and…

We consider regularized cutting-plane methods to minimize a convex function that is the sum of a large number of component functions. One important example is the dual problem obtained from Lagrangian relaxation on a decomposable problem.…

We show that in doubling, geodesic metric measure spaces (including, for example, Euclidean space), sets of positive measure have a certain large-scale metric density property. As an application, we prove that a set of positive measure in…

Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…

The aim of this paper is to study properties of sections of convex bodies with respect to different types of measures. We present a formula connecting the Minkowski functional of a convex symmetric body K with the measure of its sections.…

Two analogues of the crank function are defined for overpartitions -- the first residual crank and the second residual crank. This suggests an exploration of crank functions defined for overpartitions whose parts are divisible by an…

Unitary equivariance is a natural symmetry that occurs in many contexts in physics and mathematics. Optimization problems with such symmetry can often be formulated as semidefinite programs for a $d^{p+q}$-dimensional matrix variable that…

In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

We consider a class of nonsmooth fractional programming problems with fixed-point constraints, where the numerator is convex and the denominator is concave. To solve this problem, we propose splitting algorithms that compute subgradient…

This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…

The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference $d(n)$ between the largest and the smallest areas of the rectangles partitioning…