Max-plus convex geometry

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

Abstract

Max-plus analogues of linear spaces, convex sets, and polyhedra have appeared in several works. We survey their main geometrical properties, including max-plus versions of the separation theorem, existence of linear and non-linear projectors, max-plus analogues of the Minkowski-Weyl theorem, and the characterization of the analogues of "simplicial" cones in terms of distributive lattices.

Original languageEnglish
Title of host publicationRelations and Kleene Algebra in Computer Science - 9th Int. Conf. on Relational Methods in Computer Science and 4th Int. Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Proceedings
PublisherSpringer Verlag
Pages192-206
Number of pages15
ISBN (Print)3540378731, 9783540378730
DOIs
Publication statusPublished - 1 Jan 2006
Event9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006 - Manchester, United Kingdom
Duration: 29 Aug 20062 Sept 2006

Publication series

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

Conference

Conference9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006
Country/TerritoryUnited Kingdom
CityManchester
Period29/08/062/09/06

Fingerprint

Dive into the research topics of 'Max-plus convex geometry'. Together they form a unique fingerprint.

Cite this