Publication

A linear equation for Minkowski sums of polytopes relatively in general position

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Renormalized solutions to the continuity equation with an integrable damping term

Maria Colombo

We consider the continuity equation with a nonsmooth vector field and a damping term. In their fundamental paper, DiPerna and Lions (Invent Math 98:511-547, 1989) proved that, when the damping term is bounded in space and time, the equation is well posed i ...

2015

, ,

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

2015

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Afsaneh Asaei, Mohammadjavad Taghizadeh, Saeid Haghighatshoar

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

Idiap2015

Given d + 1 hyperplanes h(1),..., h(d+1) in general position in R-d, let Delta(h(1),..., h(d+1)) denote the unique bounded simplex enclosed by them. There exists a constant c(d) > 0 such that for any finite families H-1,..., Hd+1 of hyperplanes in R-d, the ...

Academic Press Inc Elsevier Science2014

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

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

Lifting simplicial complexes to the boundary of convex polytopes

Lionel Pournin

Abstract: A simplicial complex C on a d-dimensional configuration of n points is k-regular if its faces are projected from the boundary complex of a polytope with dimension at most d+k. Since C is obviously (n-d-1)-regular, the set of all integers k for wh ...

Elsevier2012

Belt distance between facets of space-filling zonotopes

To every d-dimensional polytope P with centrally symmetric facets one can assign a “subway map” such that every line of this “subway” contains exactly the facets parallel to one of the ridges of P. The belt diameter of P is the maximum number of subway lin ...

2012

Indecomposable Coverings with Concave Polygons

We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold covering of some point set by the translates of this polygon that cannot be decomposed into two coverings. Moreover, we give a complete classification of open ...

Springer-Verlag2010

, ,

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

2015

A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations

Afsaneh Asaei, Mohammadjavad Taghizadeh, Saeid Haghighatshoar

In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation

Ax=b

, where

A

is an

m\times n

full-rank matrix,

b

is a column-vector of dimension

m

, and

m

(the number of equations) is larger tha ...

Idiap2015