Zobrazeno 1 - 10
of 160
pro vyhledávání: '"Deift, Percy"'
Autor:
Deift, Percy, Piorkowski, Mateusz
Publikováno v:
SIGMA 20 (2024), 004, 48 pages
We prove an asymptotic formula for the recurrence coefficients of orthogonal polynomials with orthogonality measure $\log \bigl(\frac{2}{1-x}\bigr) {\rm d}x$ on $(-1,1)$. The asymptotic formula confirms a special case of a conjecture by Magnus and ex
Externí odkaz:
http://arxiv.org/abs/2307.09277
This is a survey of Harold Widom's work in random matrices. We start with his pioneering papers on the sine-kernel determinant, continue with his and Craig Tracy's groundbreaking results concerning the distribution functions of random matrix theory,
Externí odkaz:
http://arxiv.org/abs/2201.05665
We consider the open Toda chain with external forcing, and in the case when the forcing stretches the system, we derive the longtime behavior of solutions of the chain. Using an observation of J\"{u}rgen Moser, we then show that the system is complet
Externí odkaz:
http://arxiv.org/abs/2012.02244
We consider the normalized distribution of the overall running times of some cryptographic algorithms, and what information they reveal about the algorithms. Recent work of Deift, Menon, Olver, Pfrang, and Trogdon has shown that certain numerical alg
Externí odkaz:
http://arxiv.org/abs/1905.08408
Autor:
Deift, Percy
These lectures introduce the method of nonlinear steepest descent for Riemann-Hilbert problems. This method finds use in studying asymptotics associated to a variety of special functions such as the Painlev\'{e} equations and orthogonal polynomials,
Externí odkaz:
http://arxiv.org/abs/1903.08304
Autor:
Deift, Percy
The author discusses integrability of Hamiltonian dynamical systems in the aftermath of KdV. The author also discusses the role of integrable systems in certain numerical computations, particularly the computation of the eigenvalues of a random symme
Externí odkaz:
http://arxiv.org/abs/1902.10267
Autor:
Deift, Percy, Trogdon, Thomas
We prove that the number of iterations required to solve a random positive definite linear system with the conjugate gradient algorithm is almost deterministic for large matrices. We treat the case of Wishart matrices $W = XX^*$ where $X$ is $n \time
Externí odkaz:
http://arxiv.org/abs/1901.09007
We review the authors' recent work \cite{BDIK1,BDIK2,BDIK3} where we obtain the uniform large $s$ asymptotics for the Fredholm determinant $D(s,\gamma):=\det(I-\gamma K_s\upharpoonright_{L^2(-1,1)})$, $0\leq\gamma\leq 1$. The operator $K_s$ acts with
Externí odkaz:
http://arxiv.org/abs/1807.11387