MOC
2002
13 years 4 months ago
2002
It is well-known, that the ring C[X1, . . . , Xn]An of polynomial invariants of the alternating group An has no finite SAGBI basis with respect to the lexicographical order for any...
CSR
2008
Springer
13 years 6 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
CADE
2008
Springer
13 years 6 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...