arXiv Analytics

Sign in

arXiv:2306.09072 [math.CO]AbstractReferencesReviewsResources

Decomposition of an Integrally Convex Set into a Minkowski Sum of Bounded and Conic Integrally Convex Sets

Kazuo Murota, Akihisa Tamura

Published 2023-06-15Version 1

Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as integrally convex sets, L-natural-convex sets, and M-natural-convex sets.

Comments: 23 pages
Categories: math.CO
Subjects: 52A41, 90C27, 90C25
Related articles: Most relevant | Search more
arXiv:2305.09192 [math.CO] (Published 2023-05-16)
Decomposition of (infinite) digraphs along directed 1-separations
arXiv:math/0512291 [math.CO] (Published 2005-12-13, updated 2006-01-10)
Some bounds on convex combinations of $ω$ and $χ$ for decompositions into many parts
arXiv:1910.06385 [math.CO] (Published 2019-10-14)
Decomposition of tripartite graphs into 5-cycles; A review and some more results

Links

Toolbox