AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (370.1 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

The Characteristic polynomials of semigeneric graphical arrangements

Ruimei Gao( )Jingjing QiangMiao Zhang
School of Mathematics and Statistics, Changchun University of Science and Technology, Changchun 130022, China
Show Author Information

Abstract

The purpose of this paper is twofold. Firstly, we generalize the notion of semigeneric braid arrangement to semigeneric graphical arrangement. Secondly, we give a formula for the characteristic polynomial of the semigeneric graphical arrangement S G := { x i x j = a i : i j E ( G ) , 1 i < j n }, where a i s are generic. The formula is obtained by characterizing central subarrangements of S G via the corresponding graph G .

CLC number: 52C35, 32S22

References

【1】
【1】
 
 
AIMS Mathematics
Pages 3226-3235

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Gao R, Qiang J, Zhang M. The Characteristic polynomials of semigeneric graphical arrangements. AIMS Mathematics, 2023, 8(2): 3226-3235. https://doi.org/10.3934/math.2023166

10

Views

0

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 13 July 2022
Revised: 21 October 2022
Accepted: 09 November 2022
Published: 15 February 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)