Computing j-multiplicity
Koji Nishida, Bernd Ulrich

TL;DR
This paper investigates the computability of the j-multiplicity invariant in Noetherian local rings, providing new proofs for key formulas and enhancing understanding of its calculation methods.
Contribution
It offers new proofs for the length and additive formulas of j-multiplicity, advancing the computational techniques for this invariant.
Findings
Provided a new proof for the length formula of j-multiplicity
Established an additive formula for j-multiplicity
Enhanced methods for computing j-multiplicity in local rings
Abstract
The j-multiplicity is an invariant that can be defined for any ideal in a Noetherian local ring . It is equal to the Hilbert-Samuel multiplicity if the ideal is -primary. In this paper we explore the computability of the j-multiplicity, giving another proof for the length formula and the additive formula.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Distributed systems and fault tolerance
