Changeset 1e1ec4 in git for Singular/LIB/ratgb.lib

Timestamp:

Jan 4, 2013, 5:54:18 PM (11 years ago)

Author:

Oleksandr Motsak <motsak@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')

Children:

42ea852aa2e1e683808b1ac3305dda96677af761

Parents:

8f296a6216092a84f1ebb509dbcda5fe428004f7

git-author:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2013-01-04 17:54:18+01:00

git-committer:

Oleksandr Motsak <motsak@mathematik.uni-kl.de>2013-01-15 20:41:56+01:00

Message:

Updated LIBs according to master

add: new LIBs from master
fix: updated LIBs due to minpoly/(de)numerator changes
fix: -> $Id$
fix: Fixing wrong rebase of SW on master (LIBs)

File:

• Singular/LIB/ratgb.lib (modified) (2 diffs)

Singular/LIB/ratgb.lib

@@ -10 +10 @@
 The operators are usually denoted by @code{d1,..,dM}.
 
-Assume, that A is a @code{G}-algebra, then the set @code{S=R-{0}} is multiplicatively
+Assume, that A is a @code{G}-algebra, then the set @code{S=R-0} is multiplicatively
 closed Ore set in A.
 That is, for any s in S and a in A, there exist t in S and b in A, such that @code{sa=bt}.
-In other words, one can transform any left fraction into the right fraction.
+In other words, one can transform any left fraction into a right fraction.
 The algebra @code{A_S} is called an Ore localization of A with respect to S.
 
@@ -23 +23 @@
 Assumptions: in order to treat such localizations constructively, some care need to be taken.
 We will assume that the variables @code{x1,...,xN} from above (which will become invertible
-in the localization) come as the first block in the basering.
+in the localization) come as the first block among the variables of the basering.
 Moreover, the ordering on the basering must be an antiblock ordering, that is its
-matrix form has the left upper @code{NxN} block zero. Here is a recipy to create such
+matrix form has the left upper @code{NxN} block zero. Here is a recipe to create such
 an ordering easily: use 'a(w)' definitions of the ordering N times with intvecs @code{w_i}
 of the following form: @code{w_i} has first N components zero. The rest entries need to