Class number formulas, Kroneckerʼs limit formulas, Chowla–Selberg formulas and the generalized gamma functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trace formulas and class number sums

We specialize the Eichler-Selberg trace formula to obtain trace formulas for the prime-to-level Hecke action on cusp forms for certain congruence groups of arbitrary level. As a consequence, we determine the asymptotic in the prime p of the number of (weighted) SL2(Z)-conjugation orbits of 2 × 2 matrices of determinant p whose reductions modulo N lie in a given conjugacy class in GL2(Z/NZ). Thi...

متن کامل

Refined Class Number Formulas and Kolyvagin Systems

We use the theory of Kolyvagin systems to prove (most of) a refined class number formula conjectured by Darmon. We show that for every odd prime p, each side of Darmon’s conjectured formula (indexed by positive integers n) is “almost” a p-adic Kolyvagin system as n varies. Using the fact that the space of Kolyvagin systems is free of rank one over Zp, we show that Darmon’s formula for arbitrary...

متن کامل

The Prime Number Formulas

There are many proposed partial prime number formulas, however, no formula can generate all prime numbers. Here we show three formulas which can obtain the entire prime numbers set from the positive integers, based on the Möbius function plus the “omega” function, or the Omega function, or the divisor function. The history of searching for a prime number formula goes back to the ancient Egyptia...

متن کامل

Some Asymptotic Formulas on Generalized Divisor Functions

1 . Throughout this paper, we use the following notation : c•1 , c2 , . . ., X0 , X1 , . . . denote positive absolute constants. We denote the number of elements of the finite set S by BSI . We write ex =exp (x) . We denote the least prime factor of n by p(n) . We write pall n if pain but pa+1 f n . v(n) denotes the number of the distinct prime factors of n, while the number of all the prime fa...

متن کامل

Linear Formulas in Continuous Logic

We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2013

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2012.12.002