Combinatorics on Heavy (3,2n+1)-Multinets


Creative Commons License

Suluyer H.

Arrangements in Ticino, Bellinzona, İsviçre, 27 Haziran - 01 Temmuz 2022

  • Yayın Türü: Bildiri / Yayınlanmadı
  • Basıldığı Şehir: Bellinzona
  • Basıldığı Ülke: İsviçre
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

A (k,d)-multinet is a certain configuration of lines and points with multiplicities in CP^2. If there is at least one multiple line in a class of a (k,d)-multinet, it is called heavy. By using the main result proved by Yuzvinsky and the article written by Bassa and Ki¸sisel, we conclude that if a multinet is heavy, the only k value is 3. Therefore, each heavy multinet is of the form (3,d). A heavy (3,2n)-multinet is constructed for n > 1. We discuss the possibilities for combinatorics of lines and points inside a heavy (3,2n+1)-multinet and have showed that there exists neither a heavy (3,3) nor a heavy (3,5)-multinet. Moreover, we have discovered several numerical results of a heavy (3,2n+1)-multinet containing a multiple line consisting of three points from X