Ngo Viet Trung
D. Bayer and M. Stillman showed that Grobner bases can be used to compute the Castelnuovo-Mumford regularity, which is a measure for the vanishing of graded local cohomology modules. The aim of this paper is to show that the same method can be applied to study other cohomological invariants as well as the reduction number.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Grassmann manifolds $G_{k,n}$ are among the central objects in geometry and topology. The Borel picture of the mod 2 cohomology of $G_{k,n}$ is given as a polynomial algebra modulo a certain ideal $I_{k,n}$. The purpose of this paper is to understand this cohomology via Gröbner bases. Reduced Gröbner bases for the ideals $I_{k,n}$ are determined. An application of these bases is given by proving an immersion theorem for Grassmann manifolds $G_{5,n}$, which establishes new immersions for an infinite family of these manifolds.
Effective generic freeness and applications to local cohomology
该研究探讨诺特整环上有限生成代数模的一般自由性，证明光滑代数下局部上同调模的一般自由性，并借助格罗比纳基理论给出显式判定的有效方法。
Taylor presented an explicit resolution for arbitrary monomial ideals. Later, Lyubeznik found that already a subcomplex defines a resolution. We show that the Taylor resolution may be obtained by repeated application of the Schreyer Theorem from the theory of Grobner bases, whereas the Lyubeznik resolution is a consequence of Buchberger's chain criterion. Finally, we relate Froberg's contracting homotopy for the Taylor complex to normal forms with respect to our Grobner bases and use it to derive a splitting homotopy that leads to the Lyubeznik complex.
We establish the first previously unknown case of the Eisenbud-Harris conjecture in Castelnuovo theory concerning algebraic curves of high genus in ${\bf P}^n$. The problem is reduced to a question about zero-dimensional schemes $Γ\subset {\bf P}^{n-1}$ in symmetric position with certain constrains on the Hilbert function. The method of Gröbner bases is then applied to study the homogeneous ideal of $Γ$.
We describe the support of $F$-finite $F$-modules over polynomial rings $R$ of prime characteristic. Our description yields an algorithm to compute the support of such modules; the complexity of our algorithm is also analyzed. To the best of our knowledge, this is the first algorithm to avoid extensive use of Gröbner bases and hence of substantial practical value. We also use the idea behind this algorithm to prove that the support of $H^j_I(S)$ is Zariski closed for each ideal $I$ of $S$ where $R$ is noetherian commutative ring of prime characteristic with finitely many isolated singular poin…
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable position or quasi stable position. Furthermore, we exhibit new dimension- (and depth-)dependent upper bounds for the Castelnuovo-Mumford regularity and the degrees of the elements of the reduced Grobner basis (w.r.t. the degree reverse lexicographical ordering) of a homogeneous ideal in these positions.
In this expository style of writing I will give an introduction of Gröbner bases and compute it for some algebras and then show how to use it to compute Hilbert series for algebras from chains.
In the article "Non-commutative Grobner bases for commutative algebras", Eisenbud-Peeva-Sturmfels proved a number of results regarding Grobner bases and initial ideals of those ideals in the free associative algebra which contain the commutator ideal. We prove similar results for ideals which contains the anti-commutator ideal (the defining ideal of the exterior algebra). We define one notion of generic initial ideals in the free assoicative algebra, and show that gin's of ideals containing the commutator ideal, or the anti-commutator ideal, are finitely generated.
A new iterative algorithm for comprehensive Grobner systems
本文提出一种受 Nabeshima 算法启发的新迭代算法，用于计算参数理想的综合 Gröbner 系统，通过跟踪子情形并使用廉价的理想成员测试避免冗余分支。
Learning to Compute Gröbner Bases
本文首次用Transformer学习Gröbner基计算，提出随机生成与反向转换方法，并设计混合嵌入，实验证明数据集生成快数个数量级，验证了可学习性。
Grobner bases for determinantal facet ideals of simplicial complexes
本文研究了简单复形行列式面理想在对角术语序下具有约简格基的条件，引入了强闭合和贫闭合概念，并修正了相关格基特征化结果。
In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal contains elements with suitable linear leading monomials. This can be explained in terms of Noetherianity of the corresponding quotient algebra. Among these Noetherian quotients we find finitely generated polynomial algebras where the action of suitable finite dimensional commutative algebras and in particular finite abelian groups is defined. We obtain ther…
We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gröbner bases tools. It allows to get some insight in the problem of determining whether two codes are permutation equivalent or not. Also an application to the decoding problem is presented, with particular emphasis on the binary case.
In this note we consider monoidal complexes and their associated algebras, called toric face rings. These rings generalize Stanley-Reisner rings and affine monoid algebras. We compute initial ideals of the presentation ideal of a toric face ring, and determine its graded Betti numbers. Our results generalize celebrated theorems of Hochster in combinatorial commutative algebra.
Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Faugere's F4 is a well-known Grobner bases algorithm to solve this problem. However, a serious drawback exists in the Grobner bases based algebraic attacks, namely, any information won't be got if we couldn't work out the Grobner bases of the polynomial equations system. In this paper, we in-depth research the F4 algorithm over GF(2). By using S-polynomials to replace critical pairs and computing the normal form of the productions with respect to the field equations in certain steps, many "redun…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。