JSC
2007
13 years 4 months ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
JSC
2007
13 years 4 months ago
2007
Abstract. We extend our recent work on set-theoretic solutions of the YangBaxter or braid relations with new results about their automorphism groups, strong twisted unions of solut...
JSC
2007
13 years 4 months ago
2007
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
JSC
2007
13 years 4 months ago
2007
We consider a class of sequences defined by triangular recurrence equations. This class contains Stirling numbers and Eulerian numbers of both kinds, and hypergeometric multiples...
JSC
2007
13 years 4 months ago
2007
JSC
2007
13 years 4 months ago
2007
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
JSC
2007
13 years 4 months ago
2007
We classify Moufang loops of order 64 and 81 up to isomorphism, using a linear algebraic approach to central loop extensions. In addition to the 267 groups of order 64, there are ...
JSC
2007
13 years 4 months ago
2007
We consider computer aided assessment (CAA) of mathematics in which a student provides an answer in the form of a mathematical expression. A common approach is for CAA system impl...
JSC
2007
13 years 4 months ago
2007
Abstract: This note describes the current reimplementation of mathscape that supports all the calculations in my paper ”Mathscapeand Molecular Integrals”.
JSC
2007
13 years 4 months ago
2007
Geometric constructions applied to a rational action of an algebraic group lead to a new algorithm for computing rational invariants. A finite generating set of invariants appear...