Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Polytope

Related publications (23)

Robust numerical integration on curved polyhedra based on folded decompositions

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces correspond to the g ...

ELSEVIER SCIENCE SA2022

Fluctuation estimates for the multi-cell formula in stochastic homogenization of partitions

In this paper we derive quantitative estimates in the context of stochastic homogenization for integral functionals defined on finite partitions, where the random surface integrand is assumed to be stationary. Requiring the integrand to satisfy in addition ...

2022

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

A Low-Parametric Rhombic Microstructure Family for Irregular Lattices

Francis Julian Panetta

New fabrication technologies have significantly decreased the cost of fabrication of shapes with highly complex geometric structure. One important application of complex fine-scale geometric structures is to create variable effective elastic material prope ...

2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Tropical Ehrhart Theory and Tropical Volume

Matthias Schymura, Georg Peter Loho

We introduce a novel intrinsic volume concept in tropical geometry. This is achieved by developing the foundations of a tropical analog of lattice point counting in polytopes. We exhibit the basic properties and compare it to existing measures. Our exposit ...

2019

Extended Formulations from Communication Protocols in Output-Efficient Time

Yuri Faenza, Manuel Francesco Aprile

Deterministic protocols are well-known tools to obtain extended formulations, with many applications to polytopes arising in combinatorial optimization. Although constructive, those tools are not output-efficient, since the time needed to produce the exten ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

On some problems related to 2-level polytopes

Manuel Francesco Aprile

In this thesis we investigate a number of problems related to 2-level polytopes, in particular from the point of view of the combinatorial structure and the extension complexity. 2-level polytopes were introduced as a generalization of stable set polytopes ...

EPFL2018

On 2-Level Polytopes Arising In Combinatorial Settings

Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arisi ...

SIAM Publications2018

The hamburger theorem

Jan Kyncl

We generalize the ham sandwich theorem to d +1 measures on R-d as follows. Let mu(1), mu(2),..., mu(d+1) be absolutely continuous finite Borel measures on R-d. Let omega(i) = mu(i) (R-d) for i is an element of [d + 1], omega = min{omega(i) : i is an elemen ...

Elsevier Science Bv2018

Non-Normal Very Ample Polytopes - Constructions and Examples

Michal Lason

We answer several questions posed by Beck, Cox, Delgado, Gubeladze, Haase, Hibi, Higashitani, and Maclagan in [Cox et al. 14, Question 3.5 (1),(2), Question 3.6], [Beck et al. 15, Conjecture 3.5(a),(b)], and [Hasse et al. 07, Open question 3 (a),(b) p. 231 ...

Taylor & Francis Inc2017

Extension complexity of stable set polytopes of bipartite graphs

Yuri Faenza, Manuel Francesco Aprile

The extension complexity xc(P) of a polytope P is the minimum number of facets of a polytope that affinely projects to P. Let G be a bipartite graph with n vertices, m edges, and no isolated vertices. Let STAB(G) be the convex hull of the stable sets of G. ...

Springer2017

Sparse inverse problems for Fourier imaging : applications to Optical Interferometry and Diffusion Magnetic Resonance Imaging

Anna Auria Rasclosa

Many natural images have low intrinsic dimension (a.k.a. sparse), meaning that they can be represented with very few coefficients when expressed in an adequate domain. The recent theory of Compressed Sensing exploits this property offering a powerful frame ...

EPFL2017

The mixing time of the Dikin walk in a polytope-A simple proof

Nisheeth Vishnoi

We study the mixing time of the Dikin walk in a polytope a random walk based on the log-barrier from the interior point method literature. This walk, and a close variant, were studied by Narayanan (2016) and Kannan-Narayanan (2012). Bounds on its mixing ti ...

Elsevier Science Bv2016

On vertices and facets of combinatorial 2-level polytopes

Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano

2-level polytopes naturally appear in several areas of mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. We investigate upper bounds on the product of the number of facets and the number ...

Springer2016

Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

Friedrich Eisenbrand

This paper features two main contributions. On the one hand, it gives an impressive survey on the progress on the diameter problem, including the breakthrough of the author with his disproof of the Hirsch conjecture among many other recent results. On the ...

Springer2013

On The Convergence Of The Affine Hull Of The Chvatal-Gomory Closures

Yuri Faenza, Marco Di Summa

Given an integral polyhedron P subset of R-n and a rational polyhedron Q subset of R-n containing the same integer points as P, we investigate how many iterations of the Chvatal-Gomory closure operator have to be performed on Q to obtain a polyhedron conta ...

SIAM Publications2013

Extended Reverse Convex Programming: An Active-Set Approach to Global Optimization

Gene Bunin

Reverse convex programming (RCP) represents an important class of global optimization problems consisting of concave cost and inequality constraint functions. While useful in many practical scenarios due to the frequent appearance of concave models, a more ...

Springer Verlag2016

Weakly regular subdivisions

Lionel Pournin

It is shown that 2-dimensional subdivisions can be made regular by moving their vertices within parallel 1-dimensional spaces. As a consequence, any 2-dimensional subdivision is projected from the boundary complex of a 4-polytope. ...

Springer-Verlag2012

Crystal structure and location of gp131 in the bacteriophage phiKZ virion

Petr Leiman, Mikhail Shneyder, Lada Sycheva

Pseudomonas phage phi KZ and its two close relatives phi PA3 and 201 phi 2-1 are very large bacteriophages that form a separate branch in phage classification because their genomes are very different from the rest of GenBank sequence data. The contractile ...

Elsevier2012