On supersolvable and nearly supersolvable line arrangements (Q2279154)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    On supersolvable and nearly supersolvable line arrangements
    scientific article

      Statements

      On supersolvable and nearly supersolvable line arrangements (English)
      0 references
      0 references
      0 references
      12 December 2019
      0 references
      The authors define a new class of arrangements called nearly supersolvable arrangements. They are defined as those arrangements $\mathcal{A}$ which are not supersolvable but having a nearly modular intersection point $p$. A supersolvable arrangement $\mathcal{B}$ can be obtained from a nearly supersolvable arrangement $\mathcal{A}$ by adding the line $L=\overline{pp'}$ with $p'\neq p$ where $p'$ is the unique double point of $\mathcal{A}$. In the main theorem, it is proved that for a nearly supersolvable arrangement $\mathcal{A}:f=0$ of $d$ lines, the multiplicity of a nearly modular point $p$ determines the minimal degree $\mathrm{mdr}(f)$ and the arrangement $\mathcal{A}$ is either free or nearly free. They prove either $\mathrm{mdr}(f)=d-m_p(\mathcal{A})$ and $\mathcal{A}$ is nearly free or $d=2d_1+1,~\mathrm{mdr}(f)=m_p(\mathcal{A})=d_1$ and $\mathcal{A}$ is free. The first case occurs when $2m_p(\mathcal{A})\geq d$, while the second case occurs when $2m_p(\mathcal{A})=d-1$. As a by-product it is proved that for a non-collinear configuration of $n$ points in the affine plane $\mathbb{R}^2$ or $\mathbb{C}^2$ having two points determining a unique slope, the number of distinct slopes of the lines determined by them is atleast $n$. It is proved later that the generic splitting type of the sheaf $T(\mathcal{A})$ of logarithmic vector fields along $\mathcal{A}$ is determined by combinatorics. For a nearly supersolvable arrangement $\mathcal{A}:f=0$ with $d$ lines and $p$ a nearly modular intersection point, \begin{itemize} \item either $2m_p(\mathcal{A})<d$ with $d=2m_p(\mathcal{A})+1$ is odd and $\mathcal{A}$ is free with exponents $(d_1,d_1)$ where $d_1=m_p(\mathcal{A})$, the generic splitting type is $(d_1,d_1)$ with no jumping lines, \item or $2m_p(\mathcal{A})=d$ and $\mathcal{A}$ is nearly free with exponents $(d_1,d_1)$ where $d_1=m_p(\mathcal{A})$, the generic splitting type is $(d_1-1,d_1)$ with no jumping lines, \item or $2m_p(\mathcal{A})>d$ and $\mathcal{A}$ is nearly free with exponents $(d_1,d_2)$ where $d_1=d-m_p(\mathcal{A}),d_2=m_p(\mathcal{A})$, the generic splitting type is $(d_1,d_2-1)$. \end{itemize} A line $L$ is a jumping line if and only if it passes through the jumping point $P(\mathcal{A})$ of the nearly free arrangement $\mathcal{A}$ and the corresponding splitting type is $(d_1-1,d_2)$.
      0 references
      Jacobian syzygy
      0 references
      Tjurina number
      0 references
      free line arrangement
      0 references
      nearly free line arrangement
      0 references
      slope problem
      0 references
      Terao's conjecture
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references