The maximal minors of a p× (m+p)-matrix of univariate polynomials of degree n with indeterminate coefficients are themselves polynomials of degree np. The subalgebra generated by their coefficients is the coordinate ring of the quantum Grassmannian, a singular compactification of the space of rational curves of degree np in the Grassmannian of p-planes in (m + p)-space. These subalgebra generat...

We introduce canonical bases for subalgebras of quotients of the commutative and non-commutative polynomial ring. A more complete exposition can be found in 4]. Canonical bases for subalgebras of the commutative polynomial ring were introduced by Kapur and Madlener (see 2]), and independently by Robbiano and Sweedler ((5]). Some notes on the non-commutative case can be found in 3]. Using the la...

Let V be a finite dimensional representation of a p-group, G, over a field, k, of characteristic p. We show that there exists a choice of basis and monomial order for which the ring of invariants, k[V ]G, has a finite SAGBI basis. We describe two algorithms for constructing a generating set for k[V ]G. We use these methods to analyse k[2V3]3 where U3 is the p-Sylow subgroup of GL3(Fp) and 2V3 i...

The classical reduction techniques of bifurcation theory, Liapunov–Schmidt reduction and centre manifold reduction, are investigated where symmetry is present. The symmetry is given by the action of a finite or continuous group. The symmetry is exploited systematically by using the algebraic structure of the module of equivariant polynomial tuples. We generalize the concept of SAGBI-bases to mo...

Non-commutative calculations are considered from the molecular computing point of view. The main idea is that one can get more advantage in using molecular computing for noncommutative computer algebra compared with a commutative one. The restrictions, connected with the coefficient handling in Gröbner basis calculations are investigated. Semigroup and group cases are considered as more appropr...

We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.

We present a characteristic-free algorithm for computing minimal generating sets of invariant rings of permutation groups. We circumvent the main weaknesses of the usual approaches (using classical Gröbner basis inside the full polynomial ring, or pure linear algebra inside the invariant ring) by relying on the theory of SAGBI-Gröbner basis. This theory takes, in this special case, a strongly c...

The theory of “subalgebra basis” analogous to standard basis (the generalization of Gröbner bases to monomial ordering which are not necessarily well ordering [1].) for ideals in polynomial rings over a field is developed. We call these bases “SASBI Basis” for “Subalgebra Analogue to Standard Basis for Ideals”. The case of global orderings, here they are called “SAGBI Basis” for “Subalgebra Ana...