Opuscula Mathematica
Opuscula Math. 37, no. 2 (), 225-263
Opuscula Mathematica

Non-factorizable C-valued functions induced by finite connected graphs

Abstract. In this paper, we study factorizability of \(\mathbb{C}\)-valued formal series at fixed vertices, called the graph zeta functions, induced by the reduced length on the graph groupoids of given finite connected directed graphs. The construction of such functions is motivated by that of Redei zeta functions. In particular, we are interested in (i) "non-factorizability" of such functions, and (ii) certain factorizable functions induced by non-factorizable functions. By constructing factorizable functions from our non-factorizable functions, we study relations between graph zeta functions and well-known number-theoretic objects, the Riemann zeta function and the Euler totient function.
Keywords: directed graphs, graph groupoids, Redei zeta functions, graph zeta functions, non-factorizable graphs, gluing on graphs.
Mathematics Subject Classification: 05E15, 11G15, 11R47, 11R56, 46L10, 46L40, 46L54.
Cite this article as:
Ilwoo Cho, Non-factorizable C-valued functions induced by finite connected graphs, Opuscula Math. 37, no. 2 (2017), 225-263, http://dx.doi.org/10.7494/OpMath.2017.37.2.225
Download this article's citation as:
a .bib file (BibTeX), a .ris file (RefMan), a .enw file (EndNote)
or export to RefWorks.

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI https://doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.