English
Related papers

Related papers: Lifting methods in mass partition problems

200 papers

In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…

Optimization and Control · Mathematics 2026-01-27 Weikang Qian , Keyan Li , Wei-Kun Chen , Yu-Hong Dai

The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and that this makes them successful in real-world applications.…

Optimization and Control · Mathematics 2009-12-23 Y. Censor , W. Chen , P. L. Combettes , R. Davidi , G. T. Herman

We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').

Combinatorics · Mathematics 2010-08-03 R. Nandakumar

We use mass-transportation as a tool to compare surfaces (2-manifolds). In particular, we determine the "similarity" of two given surfaces by solving a mass-transportation problem between their conformal densities. This mass transportation…

Numerical Analysis · Mathematics 2010-03-19 Y. Lipman , I. Daubechies

We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…

Combinatorics · Mathematics 2016-05-18 Brandon Dutra

We consider the equilibrium equations for a linearized Cosserat material and provide two perspectives concerning well-posedness. First, the system can be viewed as the Hodge Laplace problem on a differential complex. On the other hand, we…

Numerical Analysis · Mathematics 2024-10-22 Wietse Marijn Boon , Omar Duran , Jan Martin Nordbotten

$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}} \newcommand{\IntRange}[1]{[ #1 ]}…

Computational Geometry · Computer Science 2016-05-18 Sariel Har-Peled , Haim Kaplan , Micha Sharir

In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal…

Optimization and Control · Mathematics 2013-07-01 Sina Khoshfetrat Pakazad , Martin S. Andersen , Anders Hansson

In this paper, we prove a result on the bisection of mass assignments by parallel hyperplanes on Euclidean vector bundles. Our methods consist of the development of a novel lifting method to define the configuration space--test map scheme,…

Algebraic Topology · Mathematics 2025-07-11 Nikola Sadovek , Pablo Soberón

Gaussian processes can be considered as subsets of a standard Hilbert space, but the geometric understanding that would relate the size of a set with the size of its convex hull is still lacking. In this work, we adopt a geometric approach…

Probability · Mathematics 2022-08-09 Shih-Yu Chang

This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…

Numerical Analysis · Mathematics 2024-05-08 Sergio Blanes , Fernando Casas , Ander Murua

It has previously been hypothesized, and supported with some experimental evidence, that deeper representations, when well trained, tend to do a better job at disentangling the underlying factors of variation. We study the following related…

Machine Learning · Computer Science 2012-07-19 Yoshua Bengio , Grégoire Mesnil , Yann Dauphin , Salah Rifai

The polynomial partitioning method of Guth and Katz [arXiv:1011.4105] has numerous applications in discrete and computational geometry. It partitions a given $n$-point set $P\subset\mathbb{R}^d$ using the zero set $Z(f)$ of a suitable…

Data Structures and Algorithms · Computer Science 2015-07-20 Jiri Matousek , Zuzana Patakova

This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We…

Optimization and Control · Mathematics 2026-02-25 N. D. Dizon , Q. Y. Huang , T. D. Chuong , G. Li , V. Jeyakumar

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Metric Geometry · Mathematics 2025-04-23 Carl Schildkraut

In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coefficient functions. For this purpose we construct a generalized finite element basis that spans…

Numerical Analysis · Mathematics 2019-02-20 Patrick Henning , Axel Malqvist , Daniel Peterseim

We show that the slicing problem holds true for subspaces of $L_p,p>2$ in the setting of arbitrary measures in place of volume. This generalizes a result of Milman for the original slicing problem.

Metric Geometry · Mathematics 2016-01-12 Alexander Koldobsky , Alain Pajor

The aim of this review is to discuss the ways to obtain results based on gravity with higher derivatives in D-dimensional world. We considered the following ways: (1) reduction to scalar tensor gravity, (2) direct solution of the equations…

General Relativity and Quantum Cosmology · Physics 2023-04-20 Sergey G. Rubin , Arkadiy Popov , P. M. Petryakova

We study unimodular measures on the space $\mathcal M^d$ of all pointed Riemannian $d$-manifolds. Examples can be constructed from finite volume manifolds, from measured foliations with Riemannian leaves, and from invariant random subgroups…

Geometric Topology · Mathematics 2022-12-21 Miklos Abert , Ian Biringer

For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…

Combinatorics · Mathematics 2012-12-27 Arseniy Akopyan , Roman Karasev