pith. sign in

arxiv: 1411.2653 · v3 · pith:AATE2TF4new · submitted 2014-11-10 · 🧮 math.DS

Combinatorics of line arrangements and polynomial vector fields

classification 🧮 math.DS
keywords mathcalfieldspolynomialvectorcombinatoricsinvariantlinelines
0
0 comments X
read the original abstract

Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$-derivations view as the set of polynomial vector fields which possess $\mathcal{A}$ as an invariant set. We first characterize polynomial vector fields having an infinite number of invariant lines. Then we prove that the minimal degree of polynomial vector fields fixing only a finite set of lines in $\mathcal{D}(\mathcal{A})$ is not determined by the combinatorics of $\mathcal{A}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.