A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra*

نویسندگان

  • Deepak Kapur
  • Klaus Madlener
چکیده

A completion procedure for computing a canonical basis for a k-subalgebra is proposed. Using this canonical basis, the membership problem for a k-subalgebra can be solved. The approach follows Buchberger's approach for computing a Grr obner basis for a polynomial ideal and is based on rewriting concepts. A canonical basis produced by the completion procedure shares many properties of a Grr obner basis such as reducing an element of a k-subalgebra to 0 and generating unique normal forms for the equivalence classes generated by a k-subalgebra. In contrast to Shannon and Sweedler's approach using tag variables, this approach is direct. One of the limitations of the approach however is that the procedure may not terminate for some term orderings thus giving an innnite canonical basis. The procedure is illustrated using examples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new algorithm for computing SAGBI bases up to an arbitrary degree

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.

متن کامل

Canonical Bases for Subalgebras on two Generators in the Univariate Polynomial Ring

In this paper we examine subalgebras on two generators in the univariate polynomial ring. A set, S, of polynomials in a subalgebra of a polynomial ring is called a canonical basis (also referred to as SAGBI basis) for the subalgebra if all lead monomials in the subalgebra are products of lead monomials of polynomials in S. In this paper we prove that a pair of polynomials {f, g} is a canonical ...

متن کامل

A hybrid method to find cumulative distribution function of completion time of GERT networks

This paper proposes a hybrid method to find cumulative distribution function (CDF) of completion time of GERT-type networks (GTN) which have no loop and have only exclusive-or nodes. Proposed method is cre-ated by combining an analytical transformation with Gaussian quadrature formula. Also the combined crude Monte Carlo simulation and combined conditional Monte Carlo simulation are developed a...

متن کامل

On permutably complemented subalgebras of finite dimensional Lie algebras

Let $L$ be a finite-dimensional Lie algebra. We say a subalgebra $H$ of $L$ is permutably complemented in $L$ if there is a subalgebra $K$ of $L$ such that $L=H+K$ and $Hcap K=0$. Also, if every subalgebra of $L$ is permutably complemented in $L$, then $L$ is called completely factorisable. In this article, we consider the influence of these concepts on the structure of a Lie algebra, in partic...

متن کامل

Dual Canonical Bases for the Quantum Special Linear Group and Invariant Subalgebras

Abstract. A string basis is constructed for each subalgebra of invariants of the function algebra on the quantum special linear group. By analyzing the string basis for a particular subalgebra of invariants, we obtain a “canonical basis” for every finite dimensional irreducible Uq(sl(n))-module. It is also shown that the algebra of functions on any quantum homogeneous space is generated by quan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989