z-logo
open-access-imgOpen Access
Non-factorizable C-valued functions induced by finite connected graphs
Author(s) -
Ilwoo Cho
Publication year - 2017
Publication title -
rocznik akademii górniczo-hutniczej im. stanisława staszica. opuscula mathematica/opuscula mathematica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.481
H-Index - 16
eISSN - 2300-6919
pISSN - 1232-9274
DOI - 10.7494/opmath.2017.37.2.225
Subject(s) - mathematics , combinatorics
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here