Papers › Free resolution of the logarithmic derivation modules of close to free arrangements
Free resolution of the logarithmic derivation modules of close to free arrangements
Junyan Chu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper studies the algebraic structure of a new class of hyperplane arrangement A obtained by deleting two hyperplanes from a free arrangement. We provide information on the minimal free resolutions of the logarithmic derivation module of A, which can be used to compute a lower bound for the graded Betti numbers of the resolution. Specifically, for the three-dimensional case, we determine the minimal free resolution of the logarithmic derivation module of A. We present illustrative examples of our main theorems to provide insights into the relationship between algebraic and combinatorial properties for close-to-free arrangements.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections