Super solvability and Freeness for 𝝍 Graphical Arrangements

Authors

Dr. Priyanka Shingade

Department of Mathematics, JSPM University Pune (India)

Article Information

DOI: 10.47772/IJRISS.2026.10200241

Subject Category: Social science

Volume/Issue: 10/2 | Page No: 3217-3220

Publication Timeline

Submitted: 2026-02-15

Accepted: 2026-02-20

Published: 2026-03-03

Abstract

We present a self-contained exposition of super solvability and freeness for 𝜓-graphical arrangements, including full statements of the main characterization theorems, proof sketches, worked examples, and a short discussion of methods used (modular chains, vertex-weighted graphs, and the addition–deletion techniques for free arrangements). The paper collects and arranges the results that answer Stanley's conjectures on 𝜓-graphical arrangements: the characterization of super solvability due to Mu & Stanley and the subsequent resolution of the freeness conjecture by Suyama & Tsujie. We highlight the key combinatorial and algebraic tools (chordality, modular chains in intersection lattices, and Terao's addition–deletion framework), indicate how they are applied in this context, and point out directions for further research.

Keywords

solvability, Stanley's conjectures, freeness conjecture

Downloads

References

1. L. Mu and R. P. Stanley, Supersolvability and Freeness for (\psi)-Graphical Arrangements, arXiv:1501.07612 (2015). (Published: Discrete & Computational Geometry / Springer). (arXiv) [Google Scholar] [Crossref]

2. D. Suyama and S. Tsujie, Vertex-weighted graphs and freeness of (\psi)-graphical arrangements, arXiv:1511.04853 (2015). (This paper proves Stanley’s freeness conjecture for (\psi)-graphical arrangements.) (arXiv) [Google Scholar] [Crossref]

3. H. Terao, Arrangements of hyperplanes and their freeness I & II, J. Fac. Sci. Univ. Tokyo (1980—1981). (Foundational work introducing freeness and the addition–deletion framework.) (repository.dl.itc.utokyo.ac.jp) [Google Scholar] [Crossref]

4. M. Yoshinaga, Freeness of hyperplane arrangements and related topics, Ann. Fac. Sci. Toulouse (2014). (Survey and techniques for freeness.) (EuDML) [Google Scholar] [Crossref]

5. T. N. Tran (with S. Tsujie), MAT-free graphic arrangements and characterization of MAT-freeness, arXiv (2022) / Algebraic Combinatorics (2024). (Related advances on freeness for classes of graphic arrangements.) (arXiv) [Google Scholar] [Crossref]

Metrics

Views & Downloads

Similar Articles