23 search results - page 4 / 5 » jsc 2007 |
JSC
2007
13 years 6 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 6 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 6 months ago
2007
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
JSC
2007
13 years 6 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 6 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...