• 제목/요약/키워드: $PSL_2(\mathbb{Z})$

검색결과 4건 처리시간 0.011초

A CLASS OF ARITHMETIC FUNCTIONS ON PSL2(Z)

  • Spiegelhalter, Paul;Zaharescu, Alexandru
    • 대한수학회보
    • /
    • 제50권2호
    • /
    • pp.601-610
    • /
    • 2013
  • In [3] and [2], Atanassov introduced the two arithmetic functions $$I(n)=\prod_{p^{\alpha}{\parallel}n}\;p^{1/{\alpha}}\;and\;R(n)=\prod_{p^{\alpha}{\parallel}n}\;p^{{\alpha}-1}$$ called the irrational factor and the restrictive factor, respectively. Alkan, Ledoan, Panaitopol, and the authors explore properties of these arithmetic functions in [1], [7], [8] and [9]. In the present paper, we generalize these functions to a larger class of elements of $PSL_2(\mathbb{Z})$, and explore some of the properties of these maps.

A CLASS OF ARITHMETIC FUNCTIONS ON PSL2(ℤ), II

  • Spiegelhalter, Paul;Zaharescu, Alexandru
    • 대한수학회보
    • /
    • 제51권2호
    • /
    • pp.443-455
    • /
    • 2014
  • Atanassov introduced the irrational factor function and the strong restrictive factor function, which he defined as $I(n)=\displaystyle\prod_{p^{\alpha}||n}^{}p^{1/{\alpha}}$ and $R(n)=\displaystyle\prod_{p^{\alpha}||n}^{}p^{{\alpha}-1}$ in [2] and [3]. Various properties of these functions have been investigated by Alkan, Ledoan, Panaitopol, and the authors. In the prequel, we expanded these functions to a class of elements of $PSL_2(\mathbb{Z})$, and studied some of the properties of these maps. In the present paper we generalize the previous work by introducing real moments and considering a larger class of maps. This allows us to explore new properties of these arithmetic functions.

JOINING OF CIRCUITS IN PSL(2, ℤ)-SPACE

  • MUSHTAQ, QAISER;RAZAQ, ABDUL
    • 대한수학회보
    • /
    • 제52권6호
    • /
    • pp.2047-2069
    • /
    • 2015
  • The coset diagrams are composed of fragments, and the fragments are further composed of circuits at a certain common point. A condition for the existence of a certain fragment ${\gamma}$ of a coset diagram in a coset diagram is a polynomial f in ${\mathbb{Z}}$[z]. In this paper, we answer the question: how many polynomials are obtained from the fragments, evolved by joining the circuits (n, n) and (m, m), where n < m, at all points.