Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Constructing neighbo ...
Conference paper

Constructing neighborly polytopes and oriented matroids

Arnau Padrol ORCID (1) (2) (3)
(1) Universitat Politècnica de Catalunya [Barcelona]
(2) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne [Barcelona]
(3) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne = Polytechnic University of Catalunya [Barcelona]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Proceedings
DOI
10.46298/dmtcs.3032
License
https://about.hal.science/hal-authorisation-v1
Indicators
650
Views
601
Downloads

Constructing neighborly polytopes and oriented matroids

Arnau Padrol ORCID (1) (2) (3)
(1) Universitat Politècnica de Catalunya [Barcelona]
(2) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne [Barcelona]
(3) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne = Polytechnic University of Catalunya [Barcelona]
Abstract
English
A $d$-polytope $P$ is neighborly if every subset of $\lfloor\frac{d}{2}\rfloor $vertices is a face of $P$. In 1982, Shemer introduced a sewing construction that allows to add a vertex to a neighborly polytope in such a way as to obtain a new neighborly polytope. With this, he constructed superexponentially many different neighborly polytopes. The concept of neighborliness extends naturally to oriented matroids. Duals of neighborly oriented matroids also have a nice characterization: balanced oriented matroids. In this paper, we generalize Shemer's sewing construction to oriented matroids, providing a simpler proof. Moreover we provide a new technique that allows to construct balanced oriented matroids. In the dual setting, it constructs a neighborly oriented matroid whose contraction at a particular vertex is a prescribed neighborly oriented matroid. We compare the families of polytopes that can be constructed with both methods, and show that the new construction allows to construct many new polytopes.
French
Un $d$-polytope $P$ est $\textit{neighborly}$ si tout sous-ensemble de $\lfloor\frac{d}{2}\rfloor $ sommets forme une face de $P$. En 1982, Shemer a introduit une construction de couture qui permet de rajouter un sommet à un polytope $\textit{neighborly}$ et d'obtenir un nouveau polytope $\textit{neighborly}$. Cette construction lui permet de construire un nombre super-exponentiel de polytopes $\textit{neighborly}$ distincts. Le concept de $\textit{neighborliness}$ s'étend naturellement aux matroïdes orientés. Les duaux de matroïdes orientés $\textit{neighborly}$ ont de plus une belle caractérisation: ce sont les matroïdes orientés équilibrés. Dans cet article, nous généralisons la construction de couture de Shemer aux matroïdes orientés, ce qui en fournit une démonstration plus simple. Par ailleurs, nous proposons une nouvelle technique qui permet de construire matroïdes orientés équilibrés. Dans le cadre dual, on obtient un matroïde $\textit{neighborly}$ dont la contraction à un sommet distinguè est un matroïde $\textit{neighborly}$ prescrit. Nous comparons les familles de polytopes qui peuvent être construites avec ces deux méthodes, et montrons que la nouvelle construction permet de construire plusieurs nouveaux polytopes.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • polytope
  • oriented matroid
  • neighborly
  • Gale dual
  • sewing construction.
Preview
Loading PDF preview...