Supersolvability and Freeness for ψ-Graphical Arrangements
Let G be a simple graph on the vertex set {v[subscript 1],…,v[subscript n]} with edge set E. Let K be a field. The graphical arrangement A[subscript G] in K[superscript n] is the arrangement x[subscript i]−x[subscript j]=0,v[subscript i]v[subscript j] ∈ E. An arrangement A is supersolvable...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Springer US
2016
|
Online Access: | http://hdl.handle.net/1721.1/104653 https://orcid.org/0000-0003-3123-8241 |