About the Project

Fuchs–Frobenius theory

AdvancedHelp

(0.000 seconds)

41—50 of 144 matching pages

41: Frank Garvan
42: Alexander A. Its
43: Robb J. Muirhead
His book Aspects of Multivariate Statistical Theory was published by John Wiley & Sons in 1982. …
44: Gergő Nemes
Nemes has research interests in asymptotic analysis, Écalle theory, exact WKB analysis, and special functions. …
45: Abdou Youssef
Youssef has published numerous papers on theory and algorithms for search and retrieval, audio-visual data processing, and data error recovery. …
46: Wolter Groenevelt
Groenevelt’s research interests is in special functions and orthogonal polynomials and their relations with representation theory and interacting particle systems. …
47: 32.2 Differential Equations
See Fuchs (1907), Painlevé (1906), Gromak et al. (2002, §42); also Manin (1998). …
48: Bibliography I
  • K. Ireland and M. Rosen (1990) A Classical Introduction to Modern Number Theory. 2nd edition, Springer-Verlag, New York.
  • A. R. Its and V. Yu. Novokshënov (1986) The Isomonodromic Deformation Method in the Theory of Painlevé Equations. Lecture Notes in Mathematics, Vol. 1191, Springer-Verlag, Berlin.
  • C. Itzykson and J. Drouffe (1989) Statistical Field Theory: Strong Coupling, Monte Carlo Methods, Conformal Field Theory, and Random Systems. Vol. 2, Cambridge University Press, Cambridge.
  • C. Itzykson and J. B. Zuber (1980) Quantum Field Theory. International Series in Pure and Applied Physics, McGraw-Hill International Book Co., New York.
  • K. Iwasaki, H. Kimura, S. Shimomura, and M. Yoshida (1991) From Gauss to Painlevé: A Modern Theory of Special Functions. Aspects of Mathematics E, Vol. 16, Friedr. Vieweg & Sohn, Braunschweig, Germany.
  • 49: 18.38 Mathematical Applications
    §18.38(i) Classical OP’s: Numerical Analysis
    Approximation Theory
    Complex Function Theory
    Random Matrix Theory
    Coding Theory
    50: 27.2 Functions
    §27.2(i) Definitions
    This is the number of positive integers n that are relatively prime to n ; ϕ ( n ) is Euler’s totient. …
    27.2.8 a ϕ ( n ) 1 ( mod n ) ,
    27.2.9 d ( n ) = d | n 1