English
Related papers

Related papers: Complexity of the Sherrington-Kirkpatrick Model in…

200 papers

Motivated by SYK-like models describing near-BPS black holes in string/M-theory, we consider gauging the U$(1)$ symmetry of the complex SYK model in the presence of a Wilson line with charge $k$. At a fixed background gauge field, solutions…

High Energy Physics - Theory · Physics 2025-10-10 Ziruo Zhang , Cheng Peng

We investigate some aspects of the geometry of two classical generalisations of the Hilbert schemes of points. Precisely, we show that parity conjecture for $\text{Quot}_r^d\mathbb{A}^3$ already fails for $d=8$ and $r=2$ and that lots of…

Algebraic Geometry · Mathematics 2024-06-24 Franco Giovenzana , Luca Giovenzana , Michele Graffeo , Paolo Lella

Hermite-Pad\'e approximants of type II are vectors of rational functions with common denominator that interpolate a given vector of power series at infinity with maximal order. We are interested in the situation when the approximated vector…

Classical Analysis and ODEs · Mathematics 2017-02-22 Alexander I. Aptekarev , Walter Van Assche , Maxim L. Yattselev

We derive the off-shell nilpotent (anti-)BRST symmetry transformations by exploiting the (anti-)chiral superfield approach (ACSA) to Becchi-Rouet-Stora-Tyutin (BRST) formalism for the four (3+1)-dimensional (4D)…

High Energy Physics - Theory · Physics 2023-02-02 S. Kumar , B. Chauhan , A. Tripathi , R. P. Malik

We first provide a classical analysis proof of a version of the Alexandroff-Bakelman-Pucci inequality (ABP) for compactly supported $C^2$ functions in dimension $2$, inspired by the symplectic geometry proof method of Viterbo, which avoids…

Analysis of PDEs · Mathematics 2026-05-14 Daniel Maienshein , Juan J. Manfredi

In functional analysis it is well known that every linear functional defined on the dual of a locally convex vector space which is continuous for the weak topology is the evaluation at a uniquely determined point of the given vector space.…

Logic in Computer Science · Computer Science 2017-01-11 Klaus Keimel

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…

Logic · Mathematics 2010-03-26 Guido Gherardi , Alberto Marcone

We study the integrability of a (almost) complex structure calibrated by a symplectic form. We find new sufficent conditions.

Symplectic Geometry · Mathematics 2014-05-26 Luigi Vezzoni

This note establishes smooth approximation from above for J-plurisubharmonic functions on an almost complex manifold (X,J). The following theorem is proved. Suppose X is J-pseudoconvex, i.e., X admits a smooth strictly J-plurisubharmonic…

Complex Variables · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson, , Szymon Pliś

In this paper we study the bipartite version of Sherrington-Kirkpatrick model. We prove that the free energy density is given by an analogue of the Parisi formula, that contains both the usual overlap and an additional new type of overlap.…

Disordered Systems and Neural Networks · Physics 2018-12-18 Liming Pan , Simone Franchini

A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…

Complex Variables · Mathematics 2015-10-06 Y. A. Antipov

We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We…

Logic · Mathematics 2008-09-22 Bakhadyr Khoussainov , Mia Minnes

An integral invariant model derived from the coupling of the transport equation and its adjoint equation is investigated.Despite extensive research on the numerical implementation of this model,no studies have yet explored the…

Numerical Analysis · Mathematics 2026-02-27 Zhengrong Xie

We consider the p-spin spherical spin-glass model in the presence of an external magnetic field as a general example of a mean-field system where a one step replica symmetry breaking (1-RSB) occurs. In this context we compute the complexity…

Disordered Systems and Neural Networks · Physics 2009-10-31 Andrea Cavagna , Juan P. Garrahan , Irene Giardina

We provide a simple extension of Bolthausen's Morita type proof of the replica symmetric formula [E. Bolthausen, Stat. Mech. of Classical and Disordered Systems, pp. 63-93 (2018)] for the Sherrington-Kirkpatrick model and prove the replica…

Mathematical Physics · Physics 2022-07-20 Christian Brennecke , Horng-Tzer Yau

This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…

Discrete Mathematics · Computer Science 2021-05-04 Etienne Moutot , Coline Petit-Jean

For large but finite systems the static properties of the infinite ranged Sherrington-Kirkpatrick model are numerically investigated in the entire the glass regime. The approach is based on the modified Thouless-Anderson-Palmer equations in…

Disordered Systems and Neural Networks · Physics 2019-07-18 T. Plefka

We consider a spin system obtained by coupling two distinct Sherrington-Kirkpatrick (SK) models with the same temperature and external field whose Hamiltonians are correlated. The disorder chaos conjecture for the SK model states that the…

Probability · Mathematics 2013-10-04 Wei-Kuo Chen

Homogeneous compatible almost complex structures on symplectic manifolds are studied, focusing on those which are special, meaning that their Chern-Ricci form is a multiple of the symplectic form. Non Chern-Ricci flat ones are proven to be…

Symplectic Geometry · Mathematics 2019-12-02 Alberto Della Vedova

While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact computational complexity of these problems has not been established…

Artificial Intelligence · Computer Science 2012-06-18 Johan Kwisthout , Linda C. van der Gaag
‹ Prev 1 8 9 10 Next ›