Papers › Multidegrees of binomial edge ideals
Multidegrees of binomial edge ideals
Jacob Cooper, Ethan Leventhal
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.
Let G be a simple graph with binomial edge ideal J_G. We prove how to calculate the multidegree of J_G based on combinatorial properties of G. In particular, we study the set Sₘᵢₙ(G) defined as the collection of subsets of vertices whose prime ideals have minimum codimension. We provide results which assist in determining Sₘᵢₙ(G), then calculate Sₘᵢₙ(G) for star, horned complete, barbell, cycle, wheel, and friendship graphs, and use the main result of the paper to obtain the multidegrees of their binomial edge ideals.
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