Skip to main content
SpringerLink
Log in

A generalized Ufnarovski graph

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

An important tool for studying standard finitely presented algebras is the Ufnarovski graph. In this paper we extend the use of the Ufnarovski graph to automaton algebras, introducing the generalized Ufnarovski graph. As an application, we show how this construction can be used to test Noetherianity of automaton algebras.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belov, A. Y., Borisenko, V.V., Latyshev, V.N.: Monomial algebras. J. Math. Sci. (New York) 87(3), 3463–3575 (1997). Algebra, 4

    Article  MathSciNet  Google Scholar 

  2. Dickson, L.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math. 35, 413–426 (1913)

    MATH  MathSciNet  Google Scholar 

  3. Eilenberg, S.: Automata languages and machines. Vol. A. Academic Press [A subsidiary of Harcourt Brace Jovanovich, Publishers], Pure and Applied Mathematics Vol. 58, New York, 1974

  4. Ellingsen, Jr., H.W.: Graphs and the growth of monomial algebras. In: Computational algebra (Fairfax VA 1993). Dekker, New York, pp. 99–109 (1994)

  5. Ellingsen, Jr., H.W., Farkas D. R.: Graphs and Bergman's GK gap theorem. J. Alg. 164(2), 586–594 (1994)

    Article  MathSciNet  Google Scholar 

  6. Månsson, J.: Formal Languages and Automata in Computational Algebra. PhD thesis, Lund University (2002)

  7. Mora, T.: An introduction to commutative and noncommutative Gröbner bases. Theoret. Comput. Sci. 134(1), 131–173 (1994). Second International Colloquium on Words Languages and Combinatorics (Kyoto 1992)

    Article  MathSciNet  Google Scholar 

  8. Nordbeck, P.: Canonical Bases for Algebraic Computations. PhD thesis, Lund University (2001)

  9. Nordbeck, P.: On the Finiteness of Gröbner Bases Computation in Quotients of the Free Alg. Appl. Alg. Eng. Comm. Comput. 11(3), 157–180 (2001)

    Article  MathSciNet  Google Scholar 

  10. Ufnarovski, V.A.: Criterion for the growth of graphs and algebras given by words. Mat. Zametki 31(3), 465–472, 476 (1982)

    Google Scholar 

  11. Ufnarovski, V.A.: On the use of graphs for calculating the basis growth and Hilbert series of associative algebras. Mat. Sb. 180(11), 1548–1560, 1584 (1989)

    Google Scholar 

  12. Ufnarovski, V.A.: Combinatorial and asymptotic methods in algebra [MR 92h:16024]. Algebra VI pp. 1–196. Springer, Berlin Heidelberg Newyork, (1995)

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematical Sciences, Lund University, Box 118, 221 00, Lund, Sweden

    Jonas Månsson & Patrik Nordbeck

Authors
  1. Jonas Månsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrik Nordbeck
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrik Nordbeck.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Månsson, J., Nordbeck, P. A generalized Ufnarovski graph. AAECC 16, 293–306 (2005). https://doi.org/10.1007/s00200-005-0178-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-005-0178-8

Keywords

Search

Navigation