Results 71 to 80 of about 3,441,413 (166)
Non-commutative computer algebra and molecular computing [PDF]
Computer Science Journal of Moldova, 2001 Non-commutative calculations are considered from the molecular computing point of view. The main idea is that one can get more advantage in using molecular computing for non-commutative computer algebra compared with a commutative one.
Svetlana Cojocaru, Victor Ufnarovski
doaj
The Gröbner basis of the ideal of vanishing polynomials [PDF]
, 2011 We construct an explicit minimal strong Gröbner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m≥2. The proof is done in a purely combinatorial way.
Frank Seelisch +5 more
core +1 more source
Simultaneously Computing a Maximal Independent Set Modulo an Ideal and a Gröbner Basis of the Ideal
MathematicsTo solve problems on a positive-dimensional ideal, I⊂k[X], a maximal independent set U⊂X modulo I, and a Gröbner basis of Ie, where Ie is the extension of I to k(U)[V](V:=X∖U), are widely used. As far as we know, they are usually computed separately, i.e.
Ping Liu, Baoxin Shang, Shugong Zhang
doaj +1 more source
Gröbner basis for norm-trace codes [PDF]
, 2013 Heegard, Little and Saints worked out a Gröbner basis algorithm for Hermitian codes.
Munuera, C. +3 more
core +1 more source
Block Ciphers Sensitive to Gröbner Basis Attacks
, 2008 . We construct and analyze Feistel and SPN ciphers that have a sound design strategy against linear and differential attacks but for which the encryption process can be described by very simple polynomial equations.
Johannes Buchmann, Andrei Pyshkin
core
A Gröbner basis criterion for birational equivalence of affine varieties [PDF]
, 1998 This paper presents a Gröbner basis criterion to determine whether a given rational map of two affine varieties is birational and if so, to compute the inverse.
Tang, Li-Zhong, Li-Zhong Tang
core +1 more source
PENDEKODEAN KODE GOLAY BINER [23,12,7] DENGAN BASIS GRÖBNER [PDF]
, 2009 In the transmission of digital message, that often have a distruction so can create errors to the received message. Golay code [23,12,7] is a binary code that can detect and correct until three error.
Dwi Pamungkas, Oktisa, IRAWANTO, BAMBANG
core +1 more source
The Grőbner basis of a Catalan path ideal [PDF]
Enumerative Combinatorics and Applications, 2022 Nantel Bergeron +2 more
doaj +1 more source
On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases [PDF]
Computer Science Journal of Moldova, 2000 In this paper we present algorithms to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains.
Jonas Mansson
doaj
On some basic applications of Gröbner bases in non-commutative polynomial rings
, 1998 In this paper we generalize some basic applications of Gröbner bases in commutative polynomial rings to the non-commutative case. We define a non-commutative elimination order. Methods of finding the intersection of two ideals are given.
Lund University., Nordbeck, Patrik,
core