diff options
| author | dos-reis <gdr@axiomatics.org> | 2008-05-11 03:28:45 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2008-05-11 03:28:45 +0000 |
| commit | 51422a0c6bc0128cd5635a01c402ef56ad4ed770 (patch) | |
| tree | d7f4cb13310b177e1691acd1307eb420d70b2546 /src/algebra/sgcf.spad.pamphlet | |
| parent | d2412069e4fc43a4bc6cc28ce4c57e02f8baee41 (diff) | |
| download | open-axiom-51422a0c6bc0128cd5635a01c402ef56ad4ed770.tar.gz | |
* interp/iterator.boot (compRepeatOrCollect): Don't iterator
variables and variables declared in a loop are local to that loop.
* interp/g-error.boot (needsToSplitMessage): New.
(errorSupervisor): Use it.
* interp/compiler.boot (compSymbol): Highlight erron=eous symbol.
* interp/wi1.boot (stackMessage): Remove duplicate.
* algebra/ffcat.spad.pamphlet (FiniteFieldCategory): Tidy.
* algebra/fff.spad.pamphlet (FiniteFieldFunctions): Likewie.
* algebra/groebsol.spad.pamphlet (GroebnerSolve): Likewise.
* algebra/intfact.spad.pamphlet (IntegerRoots): Likewise.
* algebra/mkfunc.spad.pamphlet (InputForm): Likewise.
* algebra/numtheor.spad.pamphlet (IntegerNumberTheoryFunctions):
Likewise.
* algebra/permgrps.spad.pamphlet (PermutationGroup): Likewise.
* algebra/random.spad.pamphlet (RandomFloatDistributions): Likewise.
* algebra/sgcf.spad.pamphlet
(SymmetricGroupCombinatoricFunctions): Likewise.
* algebra/triset.spad.pamphlet (PolynomialSetUtilitiesPackage):
Likewise.
* algebra/twofact.spad.pamphlet (TwoFactorize): Likewise.
Diffstat (limited to 'src/algebra/sgcf.spad.pamphlet')
| -rw-r--r-- | src/algebra/sgcf.spad.pamphlet | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/src/algebra/sgcf.spad.pamphlet b/src/algebra/sgcf.spad.pamphlet index c871cb18..a86554a0 100644 --- a/src/algebra/sgcf.spad.pamphlet +++ b/src/algebra/sgcf.spad.pamphlet @@ -210,6 +210,7 @@ SymmetricGroupCombinatoricFunctions(): public == private where error"there are not so many partitions" for t in 0..(m-2) repeat s : I := 0 + sOld: I for y in 0..n repeat sOld := s s := s + numberOfImproperPartitions(n-y,m-t-1) @@ -237,6 +238,7 @@ SymmetricGroupCombinatoricFunctions(): public == private where while n ~= 0 repeat s : I := 0 cm := cm - 1 + sOld : I for y in n..1 by -1 repeat --determination of the next son sOld := s -- remember old s -- this functions counts the number of elements in a subtree |