K. Shirayanagi
ABSTRACT
Binomial algebras are finitely presented algebras defined by monomials or binomials. Given two binomial algebras, one important problem is to decide whether or not they are isomorphic as algebras. We study an algorithm for solving this problem, when both algebras are finite-dimensional over a field. In particular, when they are monomial algebras (i.e. binomial algebras defined by monomials only), the problem has already been completely solved by the presentation uniqueness.
In this paper, we provide some necessary conditions in terms of partially ordered sets for two certain binomial algebras to be isomorphic. In other words, invariants of the binomial algebras are presented. These conditions together serve as an effective procedure for solving the isomorphism problem.
- 1.Buchberger, B., GrObner Bases: An Algorithmic Method in Polynomial Ideal Thex)ry, Chapter 6 in Multidimensional Systems Theory (N. K. Bose ed.), D. Reidel Publishing Company (1985), 184-232,Google Scholar
Cross Ref
- 2.Gateva-Ivanova, T. and Latyshev, V., On recognisable properties of associative algebras, J. Symbolic Computation 6 (1988), 371-388. Google ScholarDigital Library
- 3.Haile, D., Larson, R., and Sweexller, M., A new invariant for C over R: Almost inverfible cohomology theory and the classification of idempotent cohomology class and algebras by partially ordered sets with a Galois group action, Amer. J. of Math. 105 (1983), 689- 814.Google ScholarCross Ref
- 4.Mora, T., Groebner bases for non-commutativepolynomial rings, Proc. AAECC3. L.N. Comp. Sci. 229 (1986), 353-362. Google ScholarDigital Library
- 5.Shirayanagi, K., Algebras associated with LSGOP, J. Algebra 113(2) (1988), 318-338.Google ScholarCross Ref
- 6.S hirayanagi, K., A classification of finite-dimensional monomial algebras, to appear in Proc. of the Meeting on Effective Methods in Algebraic Geometry (MEGA 90) ( ~ 990).Google Scholar
- 7.Terada, I., An algorithm to compute the dimensions of algebras A and A-modules from their generators and relations, "Commutative algebra and combinatorics," Advanced Stuch'es in Pure Mathematics 11 (1987), 245- 248.Google ScholarCross Ref
- 8.Ufnarovskij, V., A growth criterion for graphs and algebras defined by words, Mat. Zametla' 31, 465-472 (in Russian); English transl., Math. Notes 31 (1982), 238- 241.Google ScholarCross Ref
Index Terms
- On the isomorphism problem for finite-dimensional binomial algebras
Recommendations
On the isomorphism problem of concept algebras
Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on concepts. They have been introduced to capture the equational theory of concept algebras (Wille 2000; Kwuida 2004). They generalize Boolean ...
Commutative pseudo-equality algebras
Pseudo-equality algebras were initially introduced by Jenei and Kóródi as a possible algebraic semantic for fuzzy-type theory, and they have been revised by Dvureăźenskij and Zahiri under the name of JK-algebras. In this paper, we define and study the ...
Comments