Combinatorially equivalent hyperplane arrangements

Elisa Palezzato, Michele Torielli

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong σ-Gröbner bases. Moreover, we prove that the Terao's conjecture over finite fields implies the conjecture over the rationals.

Original languageEnglish (US)
Article number102202
JournalAdvances in Applied Mathematics
Volume128
DOIs
StatePublished - Jul 2021
Externally publishedYes

Keywords

  • Combinatorially equivalent
  • Hyperplane arrangements
  • Lattice of intersections
  • Modular methods
  • Terao's conjecture

ASJC Scopus subject areas

  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Combinatorially equivalent hyperplane arrangements'. Together they form a unique fingerprint.

Cite this