Note on lower estimates of multiplicities
Atsushi Moriwaki

TL;DR
This paper presents a method to establish explicit lower bounds on multiplicities using lower saturated subsets of the non-negative real orthant, contributing to the theoretical understanding of multiplicity estimates.
Contribution
It introduces a new approach to deriving lower bounds on multiplicities through the use of lower saturated subsets of a0a0^n, providing explicit estimates.
Findings
Provides explicit lower bounds for multiplicities.
Uses lower saturated subsets to derive bounds.
Enhances theoretical tools for multiplicity estimation.
Abstract
In this note we would like to give an explicit lower bound by using a lower saturated subset of \mathbb{R}_{\geq 0}^n.
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
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Algebraic Geometry and Number Theory
