<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:iop="http://iopscience.iop.org" xmlns:prism="http://prismstandard.org/namespaces/basic/1.2/">
  <channel rdf:about="https://iopscience.iop.org/journal/rss/1751-8121">
    <title>Journal of Physics A: Mathematical and Theoretical - latest papers</title>
    <link>https://iopscience.iop.org/journal/rss/1751-8121</link>
    <description>Latest articles for Journal of Physics A: Mathematical and Theoretical</description>
    <items>
      <rdf:Seq>
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
        <rdf:li />
      </rdf:Seq>
    </items>
  </channel>
  <image rdf:about="">
    <title>IOPscience</title>
    <url>https://iopscience.iop.org/image/iopscience-rss.gif</url>
    <link>https://iopscience.iop.org/journal/rss/1751-8121</link>
  </image>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebcda">
    <title>Robust retrieval in a hierarchical associative memory</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebcda</link>
    <description>We study a hierarchical associative-memory model inspired by hierarchical Hopfield networks with hidden layers. While such architectures are often viewed as biologically plausible realisations of dense associative memories, it remains less clear which mathematical advantages are provided by the hierarchical organisation itself. To address this question, we introduce a sparse stroke–concept model in which elementary feature patterns (strokes) are first stored and subsequently combined into higher-level memories (concepts). Retrieval proceeds in two stages: a feature cue activates candidate strokes, and a second-layer decoding rule identifies the most likely concept. Our main result shows that successful concept retrieval does not require exact recovery of all constituent strokes. Instead, it is sufficient to control aggregate false negatives and false positives at the intermediate stroke layer. We derive deterministic and probabilistic retrieval criteria that quantify the interplay between stroke-layer errors and overlaps among competing concepts. In particular, the second retrieval stage can compensate for a substantial amount of first-layer noise. We analyse both fixed-size and variable-size concept ensembles. For variable concept sizes, we introduce suitable penalised and normalised scoring rules and establish corresponding retrieval guarantees. The results provide a rigorous mathematical description of how hierarchical organisation can improve retrieval robustness, even in situations where it does not alter the classical Hopfield-type storage-capacity scaling.</description>
    <dc:creator>Markus Heydenreich, Christian Hirsch and Matthias Löwe</dc:creator>
    <dc:date>2026-11-18T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Markus Heydenreich &lt;em&gt;et al&lt;/em&gt;</iop:authors>
    <iop:citation>Markus Heydenreich &lt;em&gt;et al&lt;/em&gt; 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 465003</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebcda/pdf</iop:pdf>
    <prism:coverDisplayDate>18/November/2026</prism:coverDisplayDate>
    <prism:number>46</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>465003</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebcda</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebddb">
    <title>Limit joint distributions of SYK models with partial interactions, mixed q-Gaussian models and asymptotic ε ...</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebddb</link>
    <description>We study the joint distribution of the SYK Hamiltonians for different systems with specified overlaps. We demonstrate that, in the large-system limit, the joint distribution converges in moments to a mixed -Gaussian system. Furthermore, we explain that the graph product of diffusive abelian von Neumann algebras is isomorphic to a -probability space generated by the corresponding -freely independent random variables with semicircular laws. Because these variables form a special case of mixed -Gaussian systems, they can be approximated by our SYK Hamiltonian models. As a byproduct, we obtain Gaussian random matrix models for asymptotic -freeness.</description>
    <dc:creator>Weihua Liu and Haoqi Shen</dc:creator>
    <dc:date>2026-11-18T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Weihua Liu and Haoqi Shen</iop:authors>
    <iop:citation>Weihua Liu and Haoqi Shen 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 465203</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebddb/pdf</iop:pdf>
    <prism:coverDisplayDate>18/November/2026</prism:coverDisplayDate>
    <prism:number>46</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>465203</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebddb</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebddd">
    <title>Quantum estimates for classical polynomial optimization</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebddd</link>
    <description>The problem of finding lower and upper bounds on multivariate homogeneous polynomials is both difficult and important given its applications to questions ranging from dynamical stability in complex potential landscapes to data analysis. From the standpoint of tensor eigenvalue theory, the question is equivalent to finding the smallest and the largest eigenvalues of the coefficient tensor corresponding to the given polynomial. Standard approaches outlined in the literature amount to running nonlinear iterations in search for the optimal rays along which the growth of the polynomial is fastest or slowest. Unlike the case of matrices (or their corresponding multivariate quadratic forms) convergence of such algorithms for higher-rank tensors is capricious due to the complex topography of polynomial objective functions. In this essay, a very different strategy, inspired by quantum-mechanical variational methods, is introduced for finding bounds on polynomials. The original polynomial is replaced by an operator acting in a suitably chosen (large) space of states, such that in an appropriate ‘classical’ limit, this operator approaches the original polynomial expression made of commutative variables. As a result, approximating the smallest and largest eigenvalues of the coefficient tensor, and thus finding bounds on polynomials, amounts to diagonalizing the resulting quantum operator, represented as a large matrix, and then inspecting the smallest and largest eigenvalues of this matrix. This approach is then successfully applied to standard test examples from tensor eigenvalue literature and other problems of interest in mathematical physics including Strichartz-type inequalities.</description>
    <dc:creator>Oleg Evnin</dc:creator>
    <dc:date>2026-11-18T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Oleg Evnin</iop:authors>
    <iop:citation>Oleg Evnin 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 465202</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebddd/pdf</iop:pdf>
    <prism:coverDisplayDate>18/November/2026</prism:coverDisplayDate>
    <prism:number>46</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>465202</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebddd</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebcf1">
    <title>Tau-functions of integrable discrete massive Thirring model under nonvanishing boundary conditions</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebcf1</link>
    <description>The connection between the massive Thirring (MT) model and the KP hierarchy is made clear recently and it is shown that the MT model can be derived from a set of four bilinear equations under nonvanishing boundary conditions. In the present work, we demonstrate that all four bilinear equations originate from a set of four discrete KP equations, thus the integrable discretizations of these four bilinear equations are naturally given. Based on this finding, the semi- and fully discrete MT model equations are re-derived, the dark soliton, breather and first-order rogue wave solutions are constructed.</description>
    <dc:creator>Junchao Chen and Bao-Feng Feng</dc:creator>
    <dc:date>2026-11-17T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Junchao Chen and Bao-Feng Feng</iop:authors>
    <iop:citation>Junchao Chen and Bao-Feng Feng 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 465201</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebcf1/pdf</iop:pdf>
    <prism:coverDisplayDate>17/November/2026</prism:coverDisplayDate>
    <prism:number>46</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>465201</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebcf1</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebd29">
    <title>Analytic level statistics of the quantum Rabi model</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebd29</link>
    <description>We derive an analytic expression for the distribution of level spacings in the quantum Rabi model. At high energies, the spectrum in a fixed parity sector takes the asymptotic form of a uniformly spaced ladder modulated by a decaying oscillation. The alternating sign of this oscillation separates successive spacings into two branches. For a finite window containing many oscillations, counting how often the two branches exceed a given spacing yields an analytic expression for the spacing density at leading order. The oscillation amplitude at the lower end of the window sets the range of spacings, and its value at the upper end fixes the positions of two cusps that form twin peaks. Spacing histograms from exact diagonalization agree with the analytic density, including its spacing range and twin peak positions. At leading order, the same spectral analysis also yields an expression for the ratio of consecutive spacings, a statistic that requires no spectral unfolding. The resulting ratio statistics agree closely with those from exact diagonalization. For windows that continue to contain many oscillations, the spacing and ratio peaks move toward unity at higher energies as the spectrum approaches a uniformly spaced ladder. The same counting approach can be explored in other systems with controlled spectral asymptotics, slowly varying spacing branches, and windows containing many oscillations.</description>
    <dc:creator>Zi-Min Li, Long-Jie Li, Germán Sierra and Murray T Batchelor</dc:creator>
    <dc:date>2026-11-17T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Zi-Min Li &lt;em&gt;et al&lt;/em&gt;</iop:authors>
    <iop:citation>Zi-Min Li &lt;em&gt;et al&lt;/em&gt; 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 465301</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebd29/pdf</iop:pdf>
    <prism:coverDisplayDate>17/November/2026</prism:coverDisplayDate>
    <prism:number>46</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>465301</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebd29</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebdde">
    <title>Quantum resetting with memory</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebdde</link>
    <description>We introduce a quantum stochastic resetting protocol with uniform memory, in which each resetting event returns the system to a state visited at a time chosen uniformly from its entire history. The resulting dynamics is nonunitary, non-Markovian and a direct quantum generalization of the classical preferential relocation model. Working in the energy eigenbasis, we derive the exact evolution of every density-matrix element for an arbitrary time-independent Hamiltonian and show that the Hamiltonian enters the dynamics only through the corresponding Bohr frequencies. This leads to a natural distinction between two classes of quantum systems: gapped and gapless. In gapped systems (systems with a discrete energy spectrum), while the diagonal elements remain unchanged, the off-diagonal elements of the density matrix in the energy eigenbasis decay algebraically with a continuously varying exponent and with an amplitude that oscillates periodically in . The system therefore approaches a stationary state that is independent of the resetting rate and retains a strong memory of the initial state. In gapless systems (systems with a continuous energy spectrum), arbitrarily small Bohr frequencies prevent stationarity. Instead, the position distribution spreads on the universal (ultra-slow) scale , independently of the initial state and of the details of the Hamiltonian. We illustrate these results with a two-level system, a harmonic oscillator, and a free quantum particle, and contrast them with their classical counterparts.</description>
    <dc:creator>Gabriele de Mauro, Manas Kulkarni and Satya N. Majumdar</dc:creator>
    <dc:date>2026-11-17T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Gabriele de Mauro &lt;em&gt;et al&lt;/em&gt;</iop:authors>
    <iop:citation>Gabriele de Mauro &lt;em&gt;et al&lt;/em&gt; 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 465002</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebdde/pdf</iop:pdf>
    <prism:coverDisplayDate>17/November/2026</prism:coverDisplayDate>
    <prism:number>46</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>465002</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebdde</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebde0">
    <title>2D target search with boundary-induced resetting</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebde0</link>
    <description>Stochastic resetting has seen many applications in nonequilibrium statistical physics. The general framework involves a stochastic search process resetting back to its initial state prior to finding the target. Most studies focus on spontaneous resetting whereby resetting events occur at a random sequence of times typically generated by a Poisson process. One of the major consequences of spontaneous resetting is that it yields a finite mean first passage time (MFPT) in unbounded domains, resulting in an optimal resetting rate that minimises the MFPT. An optimal resetting rate can also occur in bounded domains provided that the reset point is not too far from the target. Recently, there has been growing interest in event-based rather than spontaneous resetting, where resetting is triggered when a specific threshold is reached. Identifying the threshold with a physical non-target boundary then leads to so-called boundary-induced resetting. In this paper, we explore the effects of boundary-induced resetting on single-particle diffusive search in a two-dimensional bounded domain containing one or more small interior targets. The interior target boundaries are totally absorbing, whereas the exterior boundary is sticky. That is, whenever the particle reaches a point on it remains attached for a random waiting time after which it immediately resets to a fixed interior point . Using renewal theory, matched asymptotic analysis and Green’s functions we calculate the unconditional MFPT for absorption by any of the targets and compare this with the corresponding MFPT of a search process on the same domain with a reflecting surface and no resetting. We show that boundary-induced resetting only reduces the MFPT relative to the no resetting case if the searcher’s reset point is sufficiently close to one of the targets. The exact condition depends on the geometry of the domain , details of the target configuration, and the mean waiting time at the sticky boundary.</description>
    <dc:creator>Kevin Chen and Paul C Bressloff</dc:creator>
    <dc:date>2026-11-17T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Kevin Chen and Paul C Bressloff</iop:authors>
    <iop:citation>Kevin Chen and Paul C Bressloff 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 465001</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebde0/pdf</iop:pdf>
    <prism:coverDisplayDate>17/November/2026</prism:coverDisplayDate>
    <prism:number>46</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>465001</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebde0</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebc28">
    <title>The time-dependent Kepler problem and its solution via the time-dependent harmonic oscillator and Ermakov invariants</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebc28</link>
    <description>We present a method for solving certain time-dependent Kepler problems using the Ermakov–Lewis invariants of the associated time-dependent harmonic oscillator (HO) problem. We also show that both the time-dependent HO and the Kepler problems can be further transformed in to time-independent problems. We obtain explicit expressions for the invariants for the time-dependent Kepler system, as well as expressions for the equation of the orbit and the Laplace–Runge–Lenz vector. Finally, we present some examples of time-dependent Kepler problems where the method is used.</description>
    <dc:creator>Yahaira E Alonso, Adrian Ortega and Hernán Larralde</dc:creator>
    <dc:date>2026-11-12T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Yahaira E Alonso &lt;em&gt;et al&lt;/em&gt;</iop:authors>
    <iop:citation>Yahaira E Alonso &lt;em&gt;et al&lt;/em&gt; 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 455202</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebc28/pdf</iop:pdf>
    <prism:coverDisplayDate>12/November/2026</prism:coverDisplayDate>
    <prism:number>45</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>455202</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebc28</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aeb83b">
    <title>Second-order superintegrable systems from semi-simple and nilpotent Frobenius structures</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aeb83b</link>
    <description>Recently, it was shown that a rich class of second-order (maximally) superintegrable systems has an underpinning Hesse–Frobenius structure, i.e. a Frobenius structure that is compatible with a Hessian structure such that the Hessian pre-potential is also a Frobenius pre-potential. Hence, these superintegrable systems arise, locally, from (possibly non-unital) Frobenius algebras. We present a conification to lift systems of non-zero constant sectional curvature to flat ones, thus reducing the problem on the Frobenius algebra side to the associative case. Furthermore, we employ a direct product construction to generate higher-dimensional second-order maximally superintegrable systems on flat spaces. We apply this approach to some basic semi-simple and nilpotent algebras and explicitly construct the arising second-order superintegrable systems using a Neumann series expansion. We find that all non-degenerate second-order maximally superintegrable systems in three dimensions arise from these examples.</description>
    <dc:creator>Andreas Vollmer</dc:creator>
    <dc:date>2026-11-11T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Andreas Vollmer</iop:authors>
    <iop:citation>Andreas Vollmer 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 455201</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aeb83b/pdf</iop:pdf>
    <prism:coverDisplayDate>11/November/2026</prism:coverDisplayDate>
    <prism:number>45</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>455201</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aeb83b</prism:doi>
  </item>
  <item rdf:about="https://iopscience.iop.org/article/10.1088/1751-8121/aebd28">
    <title>Dynamical cooling driven by self-similar fronts in the 2D nonlinear Schrödinger model</title>
    <link>https://iopscience.iop.org/article/10.1088/1751-8121/aebd28</link>
    <description>We analyse the dynamics towards partial thermalisation and subsequent cooling in the defocusing two-dimensional nonlinear Schrödinger model, using direct simulations, and insights from the wave-kinetic equation (WKE) and a fourth-order differential approximation model (DAM). We show that the evolving WKE spectrum exhibits two distinct similarity ranges–the quasi-thermal core and the ultraviolet (UV) tail–whereas in the DAM, an additional range of infrared self-similarity appears. By stretching the quasi-thermal region, the self-similar fronts drive an effective dynamical cooling process towards the formal but ill-defined equilibrium state at vanishing temperature—analogous to an UV catastrophe in a system of classical waves.</description>
    <dc:creator>Jason Laurie, Simon Thalabard and Sergey Nazarenko</dc:creator>
    <dc:date>2026-11-11T00:00:00Z</dc:date>
    <dc:source>Journal of Physics A: Mathematical and Theoretical</dc:source>
    <iop:authors>Jason Laurie &lt;em&gt;et al&lt;/em&gt;</iop:authors>
    <iop:citation>Jason Laurie &lt;em&gt;et al&lt;/em&gt; 2026 &lt;em&gt;Journal of Physics A: Mathematical and Theoretical&lt;/em&gt; &lt;b&gt;59&lt;/b&gt; 455701</iop:citation>
    <iop:pdf>https://iopscience.iop.org/article/10.1088/1751-8121/aebd28/pdf</iop:pdf>
    <prism:coverDisplayDate>11/November/2026</prism:coverDisplayDate>
    <prism:number>45</prism:number>
    <prism:volume>59</prism:volume>
    <prism:publicationName>Journal of Physics A: Mathematical and Theoretical</prism:publicationName>
    <prism:startingPage>455701</prism:startingPage>
    <prism:doi>10.1088/1751-8121/aebd28</prism:doi>
  </item>
</rdf:RDF>
