The Buchberger Algorithm as a Tool for Ideal Theory of...

The Buchberger Algorithm as a Tool for Ideal Theory of Polynomial Rings in Constructive Mathematics

Henri Lombardi, Hervé Perdry
0 / 0
0 comments
Sukakah anda buku ini?
Bagaimana kualiti fail ini?
Muat turun buku untuk menilai kualitinya
Bagaimana kualiti fail yang dimuat turun?
Kategori:
Mathematics - Algebra
Tahun:
2009
Edisi:
version 19 Aug 2009
Bahasa:
english
Halaman:
12
Nama siri:
expository notes
Fail:
PDF, 207 KB
IPFS:
CID , CID Blake2b
english, 2009
Baca dalam Talian
  • pdf 207 KB Current page
  • Checking other formats...
  • Fail yang ditukar boleh berbeza dari fail asli. Sekiranya boleh, lebih baik memuat turun fail dalam format asalnya
Penukaran menjadi sedang dijalankan
Penukaran menjadi gagal

Istilah utama

 
generated
finitely
algorithm
gröbner
constructive
ideals
multideg
lemma
buchberger
ideal
monomial
classical
polynomial
theorem
acc
coherent
dcc
exists
finite
discrete
module
polynomials
poset
remark
dickson’s
nonincreasing
proposition
satisfies
submodules
xα
αs
rings
acceptable
monomials
remainder
submodule
vnj
compute
γi
leading
nondecreasing
vector
xαs
xγi
αi
aα
compatible
consider
denote
noetherian
ordered
previous
recall
version
constructively
deduce
define
detachable
generators
hilbert