- Startseite
- →
- Fakultäten
- →
- Fakultät für Mathematik und Physik
- →
- Dokumentanzeige
JavaScript is disabled for your browser. Some features of this site may not work without it.
Originalpublikation
Cuntz, M.: A Greedy Algorithm to Compute Arrangements of Lines in the Projective Plane. In: Discrete & computational geometry : an international journal of mathematics and computer science 68 (2022), Nr. 1, S. 107-124. DOI: https://doi.org/10.1007/s00454-021-00351-y
Version im Repositorium
Zum Zitieren der Version im Repositorium verwenden Sie bitte diesen DOI:
https://doi.org/10.15488/12923
| Zusammenfassung: | |
|
We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We apply this algorithm to the case of simpliciality: it recovers all known simplicial arrangements of lines in a very short time and also produces a yet unknown simplicial arrangement with 35 lines. We compute a (certainly incomplete) database of combinatorially simplicial complex arrangements of hyperplanes with up to 50 lines. Surprisingly, it contains several examples whose matroids have an infinite space of realizations up to projectivities. © 2021, The Author(s).
|
|
| Lizenzbestimmungen: | CC BY 4.0 Unported - https://creativecommons.org/licenses/by/4.0/ |
| Publikationstyp: | Article |
| Publikationsstatus: | publishedVersion |
| Erstveröffentlichung: | 2021 |
| Schlagwörter (englisch): | Matroid, Reflection group, Simplicial arrangement |
| Fachliche Zuordnung (DDC): | 510 | Mathematik, 004 | Informatik |
Die Publikation erscheint in Sammlung(en):
-
Fakultät für Mathematik und Physik
Frei zugängliche Publikationen aus der Fakultät für Mathematik und Physik