Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.13095 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915738389839872 |
|---|---|
| author | Cousaert, Alice |
| author_facet | Cousaert, Alice |
| contents | A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number of combinatorial types of equiprojective polytopes. We also establish the pathwise connectedness of a subset of the Grassmannian in the case of (d-2)-dimensional spaces with conditions on the explicit path. This makes it possible to extend the Hasan--Lubiw characterisation of equiprojectivity to higher dimensions. Equiprojectivity provides cases relevant to the study of the Shadow Vertex algorithm, showing there is no hope minimising the complexity of the projection. It also offers a reverse point of view on the usual study of planar projections of polytopes as the projections have a fixed size. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_13095 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Equiprojective polytopes in higher dimension Cousaert, Alice Combinatorics Metric Geometry Optimization and Control 52B11 A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number of combinatorial types of equiprojective polytopes. We also establish the pathwise connectedness of a subset of the Grassmannian in the case of (d-2)-dimensional spaces with conditions on the explicit path. This makes it possible to extend the Hasan--Lubiw characterisation of equiprojectivity to higher dimensions. Equiprojectivity provides cases relevant to the study of the Shadow Vertex algorithm, showing there is no hope minimising the complexity of the projection. It also offers a reverse point of view on the usual study of planar projections of polytopes as the projections have a fixed size. |
| title | Equiprojective polytopes in higher dimension |
| topic | Combinatorics Metric Geometry Optimization and Control 52B11 |
| url | https://arxiv.org/abs/2601.13095 |