In this research communication on commutative algebra it was proposed to deal with Grobner Bases and its applications in signals and systems domain.This is one of the pioneering communications in dealing with Cryo-EM Image Processing application using multi-disciplinary concepts involving thermodynamics and electromagnetics based on first principles approach. keywords: Commutative Algebra/HOL/S...

Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the systematic encoding of GQC codes is equivalent to the division algorithm in the theory of Gröbner basis of modules, there has been no algorithm that computes G...

The definition and main results connected with Gröbner basis, Hilbert series and Anick's resolution are formulated. The method of the infinity behavior prediction of Gröbner basis in noncommu-tative case is presented. The extensions of BERGMAN package for IBM PC compatible computers are described. Let A =< X|R > be a finitely presented associative algebra over field K. Here are the main example...

A number of problems in control can be reduced to finding suitable real solutions of algebraic equations. In particular, such a problem arises in the context of switching surfaces in optimal control. Recently, a powerful new methodology for doing symbolic manipulations with polynomial data has been developed and tested, namely the use of Gröbner bases. In this paper, we apply the Gröbner basis ...

We prove an automorphic analogue of Deligne's conjecture for symmetric fourth L-functions Hilbert modular forms. extend the result Morimoto [41] based on generalization and refinement results Grobner Lin [18] to cohomological irreducible essentially conjugate self-dual cuspidal representations GL2 GL3 over CM-fields.

We consider the set M = { ( a . 11): n bh mod.rL') of all solutions of the key equation for alternant codes, where h is the syndrome polynomial. In decoding these codes a particular solution (d. (T) E M is sought, subject to d and being relatively prime and satisfying certain degree conditions. We prove that these requirements specify (d. (T ) uniquely as the minimal element of M (analogous to ...