Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.14843 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908972065226752 |
|---|---|
| author | Briec, Walter |
| author_facet | Briec, Walter |
| contents | In [14], B-convexity was defined as an appropriate Painlevé-Kuratowski limit of linear convexities. More recently, an alternative algebraic formulation over the entire Euclidean vector space was proposed in [9] and [10]. The issue with the definition presented in [14] is that it was not developed from an algebraic perspective, but rather as the upper limit of a sequence of generalized convex polytopes whose form was not explicitly given. In this paper, we build on recent work and provide an algebraic formulation for these limiting polytopes. Consequently, we deduce a multiary algebraic form of B-convexity that involves an idempotent, non-associative algebraic structure, extending the formalism proposed in [9] to an arbitrary number of points. Among other things, we demonstrate that these limiting polytopes do not satisfy the idempotent symmetrical convex structure defined in [9]. In the context of this formalism, we derive a general separation result in Rn by approximating convex sets by polytopes. We conclude by clarifying some points regarding the external representation of polytopes proposed in [11] and analyze the structure of the polytopes that arise in this context. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_14843 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Multiary Algebraic Formulation of an Idempotent Symmetric Limit Convex Structure Briec, Walter Optimization and Control In [14], B-convexity was defined as an appropriate Painlevé-Kuratowski limit of linear convexities. More recently, an alternative algebraic formulation over the entire Euclidean vector space was proposed in [9] and [10]. The issue with the definition presented in [14] is that it was not developed from an algebraic perspective, but rather as the upper limit of a sequence of generalized convex polytopes whose form was not explicitly given. In this paper, we build on recent work and provide an algebraic formulation for these limiting polytopes. Consequently, we deduce a multiary algebraic form of B-convexity that involves an idempotent, non-associative algebraic structure, extending the formalism proposed in [9] to an arbitrary number of points. Among other things, we demonstrate that these limiting polytopes do not satisfy the idempotent symmetrical convex structure defined in [9]. In the context of this formalism, we derive a general separation result in Rn by approximating convex sets by polytopes. We conclude by clarifying some points regarding the external representation of polytopes proposed in [11] and analyze the structure of the polytopes that arise in this context. |
| title | On the Multiary Algebraic Formulation of an Idempotent Symmetric Limit Convex Structure |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2509.14843 |