ﻻ يوجد ملخص باللغة العربية
We introduce the package textbf{arrangements} for the software CoCoA. This package provides a data structure and the necessary methods for working with hyperplane arrangements. In particular, the package implements methods to enumerate many commonly studied classes of arrangements, perform operations on them, and calculate various invariants associated to them.
In the theory of hyperplane arrangements, the most important and difficult problem is the combinatorial dependency of several properties. In this atricle, we prove that Teraos celebrated addition-deletion theorem for free arrangements is combinatoria
Given a semisimple complex linear algebraic group $G$ and a lower ideal $I$ in positive roots of $G$, three objects arise: the ideal arrangement $mathcal{A}_I$, the regular nilpotent Hessenberg variety $mbox{Hess}(N,I)$, and the regular semisimple He
We establish a general theory for projective dimensions of the logarithmic derivation modules of hyperplane arrangements. That includes the addition-deletion and restriction theorem, Yoshinaga-type result, and the division theorem for projective dime
In this paper, we study the class of free hyperplane arrangements. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over $mathbb{Q}$.
In this article, we study the $k$-Lefschetz properties for non-Artinian algebras, proving that several known results in the Artinian case can be generalized in this setting. Moreover, we describe how to characterize the graded algebras having the $k$