Deletion theorem and combinatorics of hyperplane arrangements
Deletion theorem and combinatorics of hyperplane arrangements
复制标题
超平面排列的删除定理和组合学
DOI:
10.1007/s00208-018-1713-9
复制
发表时间:
2019
影响因子:
1.4
通讯作者:
Takuro Abe
中科院分区:
文献类型:
--
作者:
Takuro Abe
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give a sufficient and necessary condition for the deletion theorem in terms of characteristic polynomials. As a corollary, we prove that whether a free arrangement has a free filtration is also combinatorial. The proof is based on the result about a minimal set of generators of a logarithmic derivation module of a multiarrangement which satisfies the-equality.
登录
查看更多内容
DOI:
10.1090/s0002-9939-1993-1134624-x
发表时间:
1993
期刊:
--
影响因子:
--
作者:
Paul H. Edelman;V. Reiner
通讯作者:
V. Reiner
影响因子:
0.4
作者:
Рыбников Григорий Леонидович
通讯作者:
Рыбников Григорий Леонидович
DOI:
--
发表时间:
2015
期刊:
arXiv: Algebraic Geometry
影响因子:
--
作者:
A. Dimca;Gabriel Sticlaru
通讯作者:
Gabriel Sticlaru
DOI:
10.1007/978-3-319-58971-8_14
发表时间:
2016
期刊:
arXiv: Commutative Algebra
影响因子:
--
作者:
T. Abe
通讯作者:
T. Abe
DOI:
--
发表时间:
2015
期刊:
影响因子:
--
作者:
寺尾宏明;吉永正彦;Hiroaki Terao;Hiroaki Terao;Hiroaki Terao;Hiroaki Terao;Hiroaki Terao
通讯作者:
Hiroaki Terao