About the Project

random graphs

AdvancedHelp

(0.001 seconds)

11—20 of 78 matching pages

11: 10.62 Graphs
§10.62 Graphs
12: 27.19 Methods of Computation: Factorization
Type II probabilistic algorithms for factoring n rely on finding a pseudo-random pair of integers ( x , y ) that satisfy x 2 y 2 ( mod n ) . …
13: Philip J. Davis
He also had a big influence on the development of the NBS Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables (A&S), which became one of the most widely distributed and highly cited publications in NIST’s history. … After receiving an overview of the project and watching a short demo that included a few preliminary colorful, but static, 3D graphs constructed for the first Chapter, “Airy and Related Functions”, written by Olver, Davis expressed the hope that designing a web-based resource would allow the team to incorporate interesting computer graphics, such as function surfaces that could be rotated and examined. … Davis’s comments about our uninspired graphs sparked the research and design of techniques for creating interactive 3D visualizations of function surfaces, which grew in sophistication as our knowledge and the technology for developing 3D graphics on the web advanced over the years. Today the DLMF contains close to 600 2D and 3D graphs and more than 200 interactive 3D visualizations. …
14: 10.48 Graphs
§10.48 Graphs
See accompanying text
Figure 10.48.7: 𝗂 5 ( 1 ) ( x ) , 𝗂 5 ( 2 ) ( x ) , 𝗄 5 ( x ) , 0 x 8 . Magnify
15: 10.26 Graphics
See accompanying text
Figure 10.26.7: I ~ 1 / 2 ( x ) , K ~ 1 / 2 ( x ) , 0.01 x 3 . Magnify
See accompanying text
Figure 10.26.8: I ~ 1 ( x ) , K ~ 1 ( x ) , 0.01 x 3 . Magnify
See accompanying text
Figure 10.26.9: I ~ 5 ( x ) , K ~ 5 ( x ) , 0.01 x 3 . Magnify
See accompanying text
Figure 10.26.10: K ~ 5 ( x ) , 0.01 x 3 . Magnify
16: 18.38 Mathematical Applications
Random Matrix Theory
Hermite polynomials (and their Freud-weight analogs (§18.32)) play an important role in random matrix theory. …
17: 6.3 Graphics
For a graph of li ( x ) see Figure 6.16.2. …
18: 9.3 Graphics
§9.3(i) Real Variable
19: Bibliography F
  • P. J. Forrester and N. S. Witte (2001) Application of the τ -function theory of Painlevé equations to random matrices: PIV, PII and the GUE. Comm. Math. Phys. 219 (2), pp. 357–398.
  • P. J. Forrester and N. S. Witte (2002) Application of the τ -function theory of Painlevé equations to random matrices: P V , P III , the LUE, JUE, and CUE. Comm. Pure Appl. Math. 55 (6), pp. 679–727.
  • P. J. Forrester and N. S. Witte (2004) Application of the τ -function theory of Painlevé equations to random matrices: P VI , the JUE, CyUE, cJUE and scaled limits. Nagoya Math. J. 174, pp. 29–114.
  • Y. V. Fyodorov (2005) Introduction to the Random Matrix Theory: Gaussian Unitary Ensemble and Beyond. In Recent Perspectives in Random Matrix Theory and Number Theory, London Math. Soc. Lecture Note Ser., Vol. 322, pp. 31–78.
  • 20: 26.9 Integer Partitions: Restricted Number and Part Size
    Table 26.9.1: Partitions p k ( n ) .
    n k
    A useful representation for a partition is the Ferrers graph in which the integers in the partition are each represented by a row of dots. …
    Figure 26.9.1: Ferrers graph of the partition 7 + 4 + 3 + 3 + 2 + 1 .
    The conjugate partition is obtained by reflecting the Ferrers graph across the main diagonal or, equivalently, by representing each integer by a column of dots. …