Abstract

Given a set S endowed with a convexity structure, a hemispace is a convex subset of S which has convex complement. We recall that Rmaxn is a semimodule over the max-plus semifield (Rmax:=R∪{−∞},max⁡,+). A convexity structure of current interest is provided by Rmaxn naturally endowed with the max-plus (or tropical) convexity. In this paper we provide a geometric description of a max-plus hemispace in Rmaxn. We show that a max-plus hemispace has a conical decomposition as a finite union of disjoint max-plus cones. These cones can be interpreted as faces of several max-plus hyperplanes. Briec and Horvath proved that the closure of a max-plus hemispace is bounded by a max-plus hyperplane. Given a hyperplane, we give a simple condition for the assignment of the faces between a pair of complementary max-plus hemispaces. Our result allows for counting and enumeration of the associated max-plus hemispaces. We recall that an n-dimensional max-plus hyperplane is called strictly affine and nondegenerate if it has a linear equation that contains all variables x1,x2,…,xn and a free term. We prove that the number of max-plus hemispaces in Rmaxn, supported by strictly affine nondegenerate hyperplanes centered in the origin, is twice the n-th ordered Bell number. Our work can be viewed as a complement to the recent results of Katz, Nitica, and Sergeev, who described generating sets for max-plus hemispaces, and the results of Briec and Horvath, who proved that closed/open max-plus hemispaces are max-plus closed/open halfspaces.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.