diff options
| author | kurchan.jorge <kurchan.jorge@gmail.com> | 2020-12-09 14:31:48 +0000 |
|---|---|---|
| committer | overleaf <overleaf@localhost> | 2020-12-09 14:32:38 +0000 |
| commit | 8744de894d3ea6183e9677bea7d7ceee456d8b7b (patch) | |
| tree | 1ec69bedd20fba2a918e9fe1ab36ff3b887cf291 | |
| parent | 3ee1888e22f2571011de7aabd602502d89062cb5 (diff) | |
| download | PRR_3_023064-8744de894d3ea6183e9677bea7d7ceee456d8b7b.tar.gz PRR_3_023064-8744de894d3ea6183e9677bea7d7ceee456d8b7b.tar.bz2 PRR_3_023064-8744de894d3ea6183e9677bea7d7ceee456d8b7b.zip | |
Update on Overleaf.
| -rw-r--r-- | bezout.tex | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -23,7 +23,7 @@ \date\today \begin{abstract} - We study the saddle-points of the $p$-spin mode -- the best understood example of `complex (rugged) landscape' -- in the space in which all its $N$ variables are allowed to be complex. The problem becomes + We study the saddle-points of the $p$-spin model -- the best understood example of `complex (rugged) landscape' -- in the space in which all its $N$ variables are allowed to be complex. The problem becomes a system of $N$ random equations of degree $p-1$. We solve for quantities averaged over randomness in the $N \rightarrow \infty$ limit. We show that the number of solutions saturates the Bézout bound $\ln {\cal{N}}\sim N \ln (p-1) $\cite{Bezout_1779_Theorie}. |