Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 81 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 450 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Bounding reduction number and the Hilbert coefficients of filtration (2409.14860v1)

Published 23 Sep 2024 in math.AC

Abstract: Let $(A,\m)$ be a Cohen-Macaulay local ring of dimension $d\geq 3$, $I$ an $\m$-primary ideal and $\mathcal{I}={I_n}_{n\geq 0}$ an $I$-admissible filtration. We establish bounds for the third Hilbert coefficient: (i) $e_3(\mathcal{I})\leq e_2(\mathcal{I})(e_2(\mathcal{I})-1)$ and (ii) $e_3(I)\leq e_2(I)(e_2(I)-e_1(I)+e_0(I)-\ell(A/I))$ if $I$ is an integrally closed ideal. Further, assume the respective boundary cases along with the vanishing of $e_i(\mathcal{I})$ for $4\leq i\leq d$. Then we show that the associated graded ring of the Ratliff-Rush filtration of $\mathcal{I}$ is almost Cohen-Macaulay, Rossi's bound for the reduction number $r_J(I)$ of $I$ holds true and the reduction number of Ratliff-Rush filtration of $\mathcal{I}$ is bounded above by $r_J(\I).$ In addition, if $\wt{I{r_J(I)}}=I{r_J(I)}$, then we prove that $\reg G_I(A)=r_J(I)$ and a bound on the stability index of Ratliff-Rush filtration is obtained. We also do a parallel discussion on the \textquotedblleft good behaviour of the Ratliff-Rush filtration with respect to superficial sequence''.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.