相关论文: New Strategies for Standard Bases over Z

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…

In the paper, we establish Gr\"obner-Shirshov bases for semirings and commutative semirings. As applications, we obtain Gr\"obner-Shirshov bases and A. Blass's (1995) and M. Fiore -T. Leinster's (2004) normal forms of the semirings…

In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…

We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the…

The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Groebner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced…

Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…

In this study we find height bounds for polynomial rings over integral domains. We apply nonstandard methods and hence our constants will be ineffective. Then we find height bounds in the polynomial ring over algebraic numbers to test…

The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…

We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…

In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…

Classical orthogonal polynomials have widespread applications including in numerical integration, solving differential equations, and interpolation. Changing basis between classical orthogonal polynomials can affect the convergence,…

For any polynomial ideal $I$, let the minimal triangular set contained in the reduced Buchberger-Gr\"obner basis of $I$ with respect to the purely lexicographical term order be called the W-characteristic set of $I$. In this paper, we…

We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…

Tate algebras are fundamental objects in the context of analytic geometry over the p-adics. Roughly speaking, they play the same role as polynomial algebras play in classical algebraic geometry. In the present article, we develop the…

Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Gr{\"o}bner bases taking into account the valuation of K. Because of the use of the valuation, the theory of tropical Gr{\"o}bner bases…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…

In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…

We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…