Criteria for Finite Difference Groebner Bases of Normal Binomial Difference Ideals

01/23/2017
by   Yu-Ao Chen, et al.
0

In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring Fy to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner bases if these criteria are satisfied. The novelty of these criteria lies in the fact that complicated properties about difference polynomial ideals are reduced to elementary properties of univariate polynomials in Z[x].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2018

Gröbner Bases of Modules and Faugère's F_4 Algorithm in Isabelle/HOL

We present an elegant, generic and extensive formalization of Gröbner ba...
research
02/05/2018

Signature-based Criteria for Möller's Algorithm for Computing Gröbner Bases over Principal Ideal Domains

Signature-based algorithms have become a standard approach for Gröbner b...
research
11/22/2020

A new algorithm for computing μ-bases of the univariate polynomial vector

In this paper, we characterized the relationship between Groebner bases ...
research
09/04/2019

Gröbner Bases with Reduction Machines

In this paper, we make a contribution to the computation of Gröbner base...
research
11/09/2022

Complexity of solving a system of difference constraints with variables restricted to a finite set

Fishburn developed an algorithm to solve a system of m difference constr...
research
05/05/2020

Subquadratic-Time Algorithms for Normal Bases

For any finite Galois field extension 𝖪/𝖥, with Galois group G = Gal(𝖪/𝖥...
research
02/08/2023

Order bounds for C^2-finite sequences

A sequence is called C-finite if it satisfies a linear recurrence with c...

Please sign up or login with your details

Forgot password? Click here to reset