About the Project

Dirichlet%20L-functions

AdvancedHelp

(0.003 seconds)

11—20 of 124 matching pages

11: 20 Theta Functions
Chapter 20 Theta Functions
12: 25.21 Software
§25.21(ix) Dirichlet L -series
13: 27.9 Quadratic Characters
§27.9 Quadratic Characters
The Legendre symbol ( n | p ) , as a function of n , is a Dirichlet character (mod p ). … The Jacobi symbol ( n | P ) is a Dirichlet character (mod P ). …
14: 23.2 Definitions and Periodic Properties
23.2.5 ζ ( z ) = 1 z + w 𝕃 { 0 } ( 1 z w + 1 w + z w 2 ) ,
23.2.6 σ ( z ) = z w 𝕃 { 0 } ( ( 1 z w ) exp ( z w + z 2 2 w 2 ) ) .
15: 27.11 Asymptotic Formulas: Partial Sums
§27.11 Asymptotic Formulas: Partial Sums
For example, Dirichlet (1849) proves that for all x 1 , …Dirichlet’s divisor problem (unsolved as of 2022) is to determine the least number θ 0 such that the error term in (27.11.2) is O ( x θ ) for all θ > θ 0 . … where ( h , k ) = 1 , k > 0 . Letting x in (27.11.9) or in (27.11.11) we see that there are infinitely many primes p h ( mod k ) if h , k are coprime; this is Dirichlet’s theorem on primes in arithmetic progressions. …
16: Bibliography G
  • G. Gasper (1975) Formulas of the Dirichlet-Mehler Type. In Fractional Calculus and its Applications, B. Ross (Ed.), Lecture Notes in Math., Vol. 457, pp. 207–215.
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • K. Girstmair (1990b) Dirichlet convolution of cotangent numbers and relative class number formulas. Monatsh. Math. 110 (3-4), pp. 231–256.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.
  • 17: 25.11 Hurwitz Zeta Function
    See accompanying text
    Figure 25.11.1: Hurwitz zeta function ζ ( x , a ) , a = 0. …8, 1, 20 x 10 . … Magnify
    25.11.36Removed because it is just (25.15.1) combined with (25.15.3).
    18: 24.16 Generalizations
    §24.16(ii) Character Analogs
    Let χ be a primitive Dirichlet character mod f (see §27.8). Then f is called the conductor of χ . …
    24.16.11 B n , χ ( x ) = k = 0 n ( n k ) B k , χ x n k .
    24.16.12 B n ( x ) = B n , χ 0 ( x 1 ) ,
    19: Software Index
    20: Bibliography M
  • H. Maass (1971) Siegel’s modular forms and Dirichlet series. Lecture Notes in Mathematics, Vol. 216, Springer-Verlag, Berlin.
  • A. J. MacLeod (1996b) Rational approximations, software and test methods for sine and cosine integrals. Numer. Algorithms 12 (3-4), pp. 259–272.
  • Fr. Mechel (1966) Calculation of the modified Bessel functions of the second kind with complex argument. Math. Comp. 20 (95), pp. 407–412.
  • R. Metzler, J. Klafter, and J. Jortner (1999) Hierarchies and logarithmic oscillations in the temporal relaxation patterns of proteins and other complex systems. Proc. Nat. Acad. Sci. U .S. A. 96 (20), pp. 11085–11089.
  • D. S. Moak (1981) The q -analogue of the Laguerre polynomials. J. Math. Anal. Appl. 81 (1), pp. 20–47.