Skip to main navigation Skip to search Skip to main content

Formalizing the Face Lattice of Polyhedra

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library providing the basic constructions and operations over polyhedra, including projections, convex hulls and images under linear maps. Moreover, we design a special mechanism which automatically introduces an appropriate representation of a polyhedron or a face, depending on the context of the proof. We demonstrate the usability of this approach by establishing some of the most important combinatorial properties of faces, namely that they constitute a family of graded atomistic and coatomistic lattices closed under sublattices.

Original languageEnglish
Title of host publicationAutomated Reasoning - 10th International Joint Conference, IJCAR 2020, Proceedings
EditorsNicolas Peltier, Viorica Sofronie-Stokkermans
PublisherSpringer
Pages185-203
Number of pages19
ISBN (Print)9783030510534
DOIs
Publication statusPublished - 1 Jan 2020
Event10th International Joint Conference on Automated Reasoning, IJCAR 2020 - Virtual, Online
Duration: 1 Jul 20204 Jul 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12167 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Joint Conference on Automated Reasoning, IJCAR 2020
CityVirtual, Online
Period1/07/204/07/20

Fingerprint

Dive into the research topics of 'Formalizing the Face Lattice of Polyhedra'. Together they form a unique fingerprint.

Cite this