Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences
نویسندگان
چکیده
Inspired by Faugère and Mou’s sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decomposition of an ideal, by computing the annihilator of one or several such sequences.
منابع مشابه
A Survey of Primary Decomposition using GrSbner Bases
A Survey of Primary Decomposition using GrSbner Bases MICHELLE WILSON Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Master of Science We present a survey of primary decomposition of ideals in a noetherian commutative polynomial ring R[x] = R[xi,..., x,]. With the use of ideal operations introduced and the lexicographical Gr6bner bases of...
متن کاملLinear Algebra Methods for the Transformation of Grr Obner Bases Linear Algebra Methods for the Transformation of Grr Obner Bases
A solution to the problem of converting a Grr obner basis between different orderings for a given ideal is known for the zero-dimensional case. We show how to solve this problem for one-dimensional ideals in two variables by using the same linear algebra techniques that are exploited in the existing algorithm. For ideals in more than two variables we describe two other known approaches that als...
متن کاملZero sets in pointfree topology and strongly $z$-ideals
In this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. We study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. For strongly z-ideals, we analyze prime ideals using the concept of zero sets. Moreover, it is proven that the intersection of all zero sets of a prime ideal of C(L),...
متن کاملSolving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications
Polynomial systems can be used to formulate a large variety of non-linear problems. Polynomial systems over finite fields are of particular interest because of their applications in Cryptography, Coding Theory, and other areas of information science and technologies. Solving polynomial systems is a central topic in Computer Algebra and has stimulated the development in this area. In this thesis...
متن کاملCommon Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms
In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...
متن کامل