Neil Epstein, Adela Vraciu
The $*$-spread of an ideal is defined as the minimal number of generators of an ideal which is minimal with respect to having the same tight closure as the original ideal. We prove an asymptotic length formula for the $*$-spread.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
An equigenerated monomial ideal $I$ is a Freiman ideal if $μ(I^2)=\ell(I)μ(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $μ(I)$ is the least number of monomial generators of $I$. Freiman ideals are special since there exists an exact formula computing the least number of monomial generators of any of their powers. In this paper we give a complete classification of Freiman $t$-spread principal Borel ideals.
The symbolic and divisorial analytic spreads are finite
该研究证明域上本质有限型环的理想符号幂最小生成元个数为多项式有界，整环的ℝ-除子滤过理想的最小生成元个数也呈多项式有界，明确符号与除子解析扩张有限性。
Two-dimensional cyclic codes of length $n=\ell s$ over the finite field $\mathbb{F}$ are ideals of the polynomial ring $\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}$. The aim of this paper, is to present a novel method to study the algebraic structure of two-dimensional cyclic codes of any length $n=\ell s$ over the finite field $\mathbb{F}$. By using this method, we find the generator polynomials for ideals of $\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}$ corresponding to two dimensional cyclic codes. These polynomials will be applied to obtain the generator matrix for two- dimensional c…
An analogue of the theory of integral closure and reductions is developed for a more general class of closures, called Nakayama closures. It is shown that tight closure is a Nakayama closure by proving a ``Nakayama lemma for tight closure''. Then, after strengthening A. Vraciu's theory of $*$-independence and the special part of tight closure, it is shown that all minimal $*$-reductions of an ideal in an analytically irreducible excellent local ring of positive characteristic have the same minimal number of generators. This number is called the $*$-spread of the ideal, by analogy with the noti…
Numerical monoids (cofinite, additive submonoids of the non-negative integers) arise frequently in additive combinatorics, and have recently been studied in the context of factorization theory. Arithmetical numerical monoids, which are minimally generated by arithmetic sequences, are particularly well-behaved, admitting closed forms for many invariants that are difficult to compute in the general case. In~this paper, we answer the question "when does omitting generators from an arithmetical numerical monoid $S$ preserve its (well-understood) set of length sets and/or Frobenius number?" in two …
We introduce the concept of $t$-spread monomials and $t$-spread strongly stable ideals. These concepts are a natural generalization of strongly stable and squarefree strongly stable ideals. For the study of this class of ideals we use the $t$-fold stretching operator. It is shown that $t$-spread strongly stable ideals are componentwise linear. Their height, their graded Betti numbers and their generic initial ideal are determined. We also consider the toric rings whose generators come from $t$-spread principal Borel ideals.
Most factorization invariants in the literature extract extremal factorization behavior, such as the maximum and minimum factorization lengths. Invariants of intermediate size, such as the mean, median, and mode factorization lengths are more subtle. We use techniques from analysis and probability to describe the asymptotic behavior of these invariants. Surprisingly, the asymptotic median factorization length is described by a number that is usually irrational.
For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization lengths are equidistributed across all congruence classes that are not trivially ruled out by modular considerations.
An equigenerated monomial ideal $I$ in the polynomial ring $S= K[x_1,\ldots,x_n]$ is a Freiman ideal if $μ(I^2)=\ell(I)μ(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $μ(I)$ is the number of minimal generators of $I$. In this paper, we classify certain classes of Borel type ideals, including Borel ideals with multiple Borel generators and principal $k$-Borel ideals, which are Freiman.
For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length statistics. This involves a variety of tools that are not standard in the subject, such as algebraic combinatorics (Schur polynomials), probability theory (weak convergence of measures, characteristic functions), and harmonic analysis (Fourier transforms of distributions). We provide instructive examples which demonstrate the power and generality of our techniques. W…
A quasi-equigenerated monomial ideal $I$ in the polynomial ring $R= k[x_1, \ldots, x_n]$ is a Freiman ideal if $μ(I^2) = l(I)μ(I)- \binom{l(I)}{2}$ where $l(I)$ is the analytic spread of $I$ and $μ(I)$ is the number of minimal generators of $I$. Freiman ideals are special since there exists an exact formula computing the minimal number of generators of any of their powers. In this work we address the question of characterizing which cover ideals of simple graphs are Freiman.
Symbolic analytic spread: upper bounds and applications
本文研究理想的符号解析展形，在特定条件下利用其他不变量给出其上界，并应用于小平维数、算术秩和Frobenius复杂度，以及集合论完全交的判定。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。