An Algorithm for Reducibility of 3-Arrangements
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{CMR-27-62,
author = {Gao , Ruimei and Pei , Donghe},
title = {An Algorithm for Reducibility of 3-Arrangements},
journal = {Communications in Mathematical Research },
year = {2021},
volume = {27},
number = {1},
pages = {62--68},
abstract = {
We consider a central hyperplane arrangement in a three-dimensional vector space. The definition of characteristic form to a hyperplane arrangement is given and we could make use of characteristic form to judge the reducibility of this arrangement. In addition, the relationship between the reducibility and freeness of a hyperplane arrangement is given.
}, issn = {2707-8523}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/cmr/19107.html} }
TY - JOUR
T1 - An Algorithm for Reducibility of 3-Arrangements
AU - Gao , Ruimei
AU - Pei , Donghe
JO - Communications in Mathematical Research
VL - 1
SP - 62
EP - 68
PY - 2021
DA - 2021/05
SN - 27
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/cmr/19107.html
KW - hyperplane arrangement, reducibility, freeness.
AB -
We consider a central hyperplane arrangement in a three-dimensional vector space. The definition of characteristic form to a hyperplane arrangement is given and we could make use of characteristic form to judge the reducibility of this arrangement. In addition, the relationship between the reducibility and freeness of a hyperplane arrangement is given.
Gao , Ruimei and Pei , Donghe. (2021). An Algorithm for Reducibility of 3-Arrangements.
Communications in Mathematical Research . 27 (1).
62-68.
doi:
Copy to clipboard