3.2k citations
- Centre National de la Recherche ScientifiqueFR238 papers
- Helmholtz-Zentrum Berlin für Materialien und EnergieDE229 papers
- Technische Universität BerlinDE205 papers
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)DE122 papers
- University of CambridgeGB113 papers
- Humboldt-Universität zu BerlinDE110 papers
- ETH ZurichCH105 papers
- Zuse Institute BerlinDE105 papers
- University of GenevaCH95 papers
- Sorbonne UniversitéFR94 papers
- Leiden UniversityNL91 papers
- Princeton UniversityUS90 papers
13 papers · 2 filters
A generalization of the discrete version of Minkowski's fundamental theorem
Bernardo González Merino, Matthias Henze
One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume o…
Comparable pairs in families of sets
Noga Alon, Shagnik Das, Roman Glebov +1
Given a family of subsets of , we say two sets are comparable if or . Sperner's celebrated theorem gives the si…
Using Brouwer's fixed point theorem
Anders Björner, Jiří Matoušek, Günter M. Ziegler
Brouwer's fixed point theorem from 1911 is a basic result in topology - with a wealth of combinatorial and geometric consequences. In these lecture notes we present some of them, r…
Many 2-level polytopes from matroids
Francesco Grande, Juanjo Rué
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids…
Non-normal very ample polytopes - constructions and examples
Michał Lasoń, Mateusz Michałek
We present a method of constructing non-normal very ample polytopes as a segmental fibration of unimodular graph polytopes. In many cases we explicitly compute their invariants - H…
Highly linked tournaments
Alexey Pokrovskiy
A (possibly directed) graph is -linked if for any two disjoint sets of vertices and there are vertex disjoint paths …