Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Monday 4 May

Probability · Cross-listed from cond-mat.dis-nn

The free energy limit of the SYK model at high temperature

The Sachdev-Ye-Kitaev (SYK) model is a disordered quantum mean-field model studied in condensed matter physics and the holographic theory of black holes. Its structural properties can be derived heuristically using a combination of the replica method and path integration techniques. Analyzing it mathematically rigorously, however, turned out to be notoriously difficult, even for basic questions such as computing the annealed free energy. In this paper we rigorously compute the free energy limit (annealed and quenched) for this model at high enough but constant temperature. Our results are in numerical agreement with the results derived by physics methods. Remarkably, though, our method of proof is novel and is different from the physics approach. It is based on (a) the theory of the component structure of sparse random graphs and (b) a variant of the cavity method, used widely in prior rigorous and heuristic treatments of classical spin glasses.
Read the full abstract

All authors David Gamarnik, Francisco Pernice, Alexander Schmidhuber, Alexander Zlokapa

Algebraic Geometry

Birational invariance of higher Amitsur groups

Let $k$ be a field of characteristic zero and $G$ a finite group. We prove that for all $n\geq 2$, the $n$th Amitsur group is a stable $G$-birational invariant of smooth projective $G$-varieties over $k$. This was previously known for $n=2,3$. For smooth projective $G$-varieties with free and finitely generated Picard group, we also prove that the vanishing of the $G$-equivariant universal torsor obstruction implies the vanishing of the $n$th Amitsur group, for all $n\geq 2$. This was known for $n=2$. Our approach allows for effective computations of these obstructions; we illustrate this with several examples.
Read the full abstract

Algebraic Topology

Equivariant CW-complexes homotopy equivalent to spheres: a survey

This is a survey about finite group actions on CW-complexes and related topics, primarily based on our joint work. The main applications are to finite $G$-CW-complexes which are homotopy equivalent to spheres. We have tried to give a fairly short overview of the extensive literature in this area, and we apologize in advance for our oversights and omissions.
Read the full abstract

Optimization and Control

Transferability of Error Bounds and the Kurdyka-Łojasiewicz Property under $C^1$ Partial Smoothness

This work studies how a generalized error bound (GEB) property in the ambient Euclidean space transfers to the active manifold under $C^1$ partial smoothness. The GEB generalizes the standard error bound, which upper bounds the distance to a subset of critical points using first-order stationarity residuals, by allowing the distance to be composed with a gauge function. In the ambient space, these residuals are measured by the subdifferential or the slope of the original function, while on the manifold they are measured by the Riemannian gradient or the slope of the restricted function. We develop complementary geometric and metric analyses to show that the ambient and manifold GEBs are equivalent with the same gauge function. The geometric argument shows that the projection of the subdifferential onto the tangent space coincides with the Riemannian gradient, while the metric approach combines slope estimates, identifiability, and a new uniform linear-growth result for $C^1$ manifolds. We further extend our analysis to establish the analogous equivalence for the Kurdyka–Łojasiewicz (KL) property, with the same desingularizer, and separately characterize their connections with the GEB. Finally, for regularized optimization, we relate subdifferential and proximal error bounds, thereby placing the previously established equivalence between proximal and manifold error bounds for $\ell_1$-regularization within a broader framework.
Read the full abstract

Metric Geometry

Functional perimeter and the dimensional Brunn-Minkowski inequality for log-concave measures

This paper is dedicated to two geometric problems associated to log-concave measures on $\mathbb{R}^n$. First, we study the dimensional Brunn-Minkowski inequality for even log-concave probability measures $\mu$ on $\mathbb{R}^n$ via an analytic approach based on diffusion operators and gradient estimates. We prove that for every pair of symmetric convex sets $K,L$ in $\mathbb{R}^n$ and every $\lambda\in(0,1)$, $$\mu(\lambda K+(1-\lambda)L)^{c_n} \geq \lambda \mu(K)^{c_n}+(1-\lambda)\mu(L)^{c_n},$$ where $c_n\geq c/n^3\ln n$ for some absolute constant $c>0$. Secondly, we study the maximal perimeter $\Gamma(\mu)$ of an isotropic log-concave measure $\mu$, without symmetry assumptions. We prove that $$\Gamma_n = \sup\{\Gamma(\mu): \ \mu \ \mbox{is an isotropic log-concave measure on } \mathbb{R}^n \} \approx n.$$ A key ingredient in both our proofs is a bound due to Eldan and Klartag (2008), which states that $$\int_{\mathbb{R}^n} |\nabla\psi|\,d\mu \leq Cn$$ for every isotropic log-concave probability measure $\mu$ on $\mathbb{R}^n$ with density $e^{-\psi}$. We also present further applications of this estimate to projections of log-concave functions projections, moment and surface area measures of isotropic log-concave functions, highlighting the central role of the gradient of the logarithmic potential in high-dimensional convexity.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Bound States and Resonance Analysis of One-Dimensional Relativistic Parity-Symmetric Two Point Interactions

We consider the one-dimensional Dirac equation with the most general relativistic contact interaction supported on two points symmetrically located with respect to the origin. In order to determine the shape of the interaction, we use a distributional method, which in the present case is equivalent to the standard method of defining contact interactions by self-adjoint extensions of symmetric operators. The interaction on each of these two points depends on four parameters, each one having a clear physical meaning. We are interested in the scattering and confining properties of this model. We focus our attention on even or odd interactions under parity transformations and investigate the existence of critical and supercritical states, bound states, confinement and scattering resonances for some particular interactions of special interest.
Read the full abstract

All authors Carlos A. Bonin, Manuel Gadella, José T. Lunardi, Luiz A. Manzoni

Combinatorics

Existence of cycles of length divisible by 3 or 4

Dean conjectured that for each integer $k \ge 3$, every graph with minimum degree at least $k$ has a cycle whose length is divisible by $k$; this conjecture is known to be true for all $k\neq 5$. For $k\in\{3,4\}$, stronger statements are true: every graph with minimum degree at least $2$ and at most $k-2$ vertices of degree $2$ has a cycle whose length is divisible by $k$. We further strengthen these results by characterizing all graphs with minimum degree at least $2$ and at most three vertices of degree $2$ that have no cycle of length divisible by $k$, for each $k\in\{3,4\}$. As a corollary, we obtain that every graph with minimum degree at least $2$ and at most two vertices of degree $2$ has a cycle whose length is divisible by $3$, and that every graph on at least nine vertices with minimum degree at least $2$ and at most three vertices of degree $2$ has a cycle whose length is divisible by $4$.
Read the full abstract

All authors Ilkyoo Choi, Hojin Chu, Ringi Kim, Boram Park

Logic

More on expressibility of satisfiability in submodels and extensions

We study expressibility in infinitary languages of the modal operators associated with satisfiability of sentences of these languages in submodels and extensions of models. We give a syntactic criterion for expressibility in finitary predicate languages, show that in many cases infinitary languages are closed under the operator associated with submodels, and that this is so in any language with a purely monadic signature. Finally, we prove that in finitary or strongly compact languages, the operator associated with extensions, though can be inexpressible by a single sentence, is always expressible by a universal theory, in striking contrast with the submodel case.
Read the full abstract

Combinatorics

Classification of isomorphism classes of lattices from Construction A and B

In this paper, we completely classify the isomorphism classes of certain lattices $L_A(C)$ and $L_B(C)$ from a self-orthogonal code $C$ over the finite field $\mathbb{F}_p$, where $p$ is an odd prime. These lattices are obtained by Construction A and B for a code $C$ over $\mathbb{F}_p$ introduced by Lam and Shimakura, which arose from a study of orbifolds of lattice vertex operator algebras. For self-orthogonal codes $C$ and $D$ of the same length over $\mathbb{F}_p$, we show that $L_X(C) \cong L_X(C)$ as lattices if and only if $C \cong D$ as codes, where $X=A$ or $B$. This can be expected to be lattice analogues of classifications of the isomorphism classes of lattice vertex operator algebras and its orbifolds. To prove the result, we generalize the notion of a frame of a lattice and define some codes which are analogues of codes constructed from Kleinian codes studied by Höhn.
Read the full abstract

Probability

Before and beyond the mixing time: New approximations for additive functionals of stationary Gauss-Markov processes

Whereas classical invariance principles for ergodic Markov chains address the situation in which the time horizon of observations is much larger than the mixing time, the quality of approximation is questionable when this is not the case anymore – even when starting the Markov chain in the invariant law. In this article, we prove quantitative and functional limit theorems for additive functionals along triangular arrays of stationary Gaussian Markov processes when the mixing time $t_{\text{mix}}$ scales sub-, super- and proportionately to the number of observations $n$. Our major finding is a phase-transition at $t_{\text{mix}}\asymp n$, together with the identification and interrelation properties of the emerging new limit processes at and before the mixing time.
Read the full abstract

Combinatorics

Factorization of invariant polynomials and generalized spectral characterizations of graphs

The problem of characterizing graphs by their generalized spectra has received significant attention in recent years. This paper provides a complete proof of a conjecture proposed by Wang, Wang, and Zhu (European J. Combin., 2023), which asserts that the square-root polynomial of the invariant polynomial $\Phi_p(G;x) \in \mathbb{F}_p[x]$ can replace its square-free part to yield a more effective criterion for a graph to be determined by its generalized spectrum (DGS). A key ingredient of our proof is a novel algebraic factorization: we show that the polynomial $\Phi_p(G;x)$ is the product of the characteristic polynomials of the adjacency operator restricted to the left null space of the walk matrix and its radical, respectively. Based on this refined DGS-criterion, a broad family of DGS-graphs is constructed via rooted products, significantly generalizing the recent result of Wang, Shen, and Mao (Discrete Appl. Math., 2026).
Read the full abstract

Algebraic Geometry

From Finite-Node Conifold Geometry to BPS Structures III: Mediated Triangle Transport and Graded Interaction Data

In previous work, we extracted from a finite-node conifold degeneration the state-data package $A_\Sigma=(V_\Sigma,E_\Sigma,c_\Sigma)$ and then constructed the support-level interaction package encoded by a binary incidence structure and finite quiver-theoretic skeleton \cite{RahmanQuiverDataI,RahmanQuiverDataII}. The present paper introduces the next layer: a graded pairwise interaction package refining binary support. Since the support matrix records where a mediated channel is present, but not its derived size, cohomological degree, or exact-triangle behavior, we introduce mediated triangle transport (MTT). An MTT datum combines bulk-mediated schober transport, localized probes, corrected-extension shadow compatibility, and derived interaction profunctors. For each ordered pair $(i,j)$, it produces $\mathbb T_{ij}(X,Y):=\RHom_{\mathcal C_{p_j}}(\Psi_j\Phi_i(X),Y)$ and the probe interaction complex $\mathsf H_{ij}:=\mathbb T_{ij}(L_i,L_j)=\RHom_{\mathcal C_{p_j}}(\Psi_j\Phi_i(L_i),L_j)$. We prove exactness and long exact interaction sequences, isolate a triangle-visible nonvanishing criterion, and formulate a conditional bridge theorem showing that supported channels yield nontrivial pairwise interaction complexes under the stated probe, content, and detector hypotheses. Under a bounded Hom-finite convention, the cohomology of $\mathsf H_{ij}$ defines $P_{ij}(q)=\sum_m \dim H^m(\mathsf H_{ij})q^m$, and these polynomials assemble into $I_\Sigma^{\mathrm{gr}}$. Thus $(A_\Sigma,I_\Sigma^{(0/1)},I_\Sigma^{\mathrm{gr}})$ provides the first graded interaction input for later stability, BPS, and wall-crossing theory.
Read the full abstract

Optimization and Control

Robust and Fast Training via Per-Sample Clipping

We propose a robust gradient estimator based on per-sample gradient clipping and analyze its properties both theoretically and empirically. We show that the resulting method, per-sample clipped SGD (PS-Clip-SGD), achieves optimal in-expectation convergence rates for non-convex optimization problems under heavy-tailed gradient noise. Moreover, we establish high-probability convergence guarantees that match the in-expectation rates up to polylogarithmic factors in the failure probability. We complement our theoretical results with multiple numerical experiments. In particular, we demonstrate that PS-Clip-SGD outperforms both vanilla SGD with momentum and standard gradient clipping when training AlexNet on the CIFAR-100 dataset, even after accounting for the additional computational time caused by per-sample clipping. We also empirically show that, in the presence of gradient accumulation, applying clipping at the mini-batch level can improve training performance while incurring virtually no additional computational cost. This finding is particularly interesting, as it contradicts the common practice of applying clipping only after all accumulation steps have been completed.
Read the full abstract

Combinatorics

Structure of $t$-Intersecting Families of Vector Spaces

We study $t$-intersecting and $t$-cross-intersecting families of $k$-dimensional subspaces in finite vector spaces of dimension $n$. We show that all large $t$-intersecting families admit a governing low-dimensional structure for $n \ge 2k+1$. This result, together with its cross-intersecting variant, allows us to prove analogues of several classical extremal set-theoretic results. In particular, we determine the intersecting families with the largest diversity, and we establish a Frankl-type degree-diversity result that generalizes the Hilton-Milner theorem. Our proofs rely on simplification procedures for $t$-intersecting and $t$-cross-intersecting families of subspaces. These procedures are based on the concept of subspace spreadness, a generalization of the classical notion of spreadness for set systems.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Phase-space measurements and decoherence for angular momentum systems

The monitoring of the three independent components of the angular momentum (or spin) of a quantum system by its environment that does not isolate any preferred orientation is modelled in two different ways. One describes the dynamics by the Lindblad equation generated by three independent angular momentum operators. The other uses iterated measurements of the “phase-space” point on the sphere in terms of the positive operator-valued measure generated by SU(2) coherent states. In contrast to the equivalent scenario on a flat phase space, these two models give rise to subtle differences. Specifically, it is shown that the two super-operators corresponding to the two decoherence models for angular momentum systems are commutative, but their eigenvalues are different. Hence although both models give rise to phase-space decoherence, their dynamical behaviours are not equivalent. In either model, we find that the characterisation of classicality as represented by the decay rates of the elements of the density matrix (i.e. decoherence) and that as represented by the positivity of the quasiprobability distribution are not equivalent for angular momentum systems.
Read the full abstract

Differential Geometry

A note on the Slicing of $(k+1)$-Currents in the Heisenberg Group $\mathbb{H}^n$ in the case $k=n$

This paper aims to expand on the open case $k=n$ regarding Proposition 3.6[1] and hopefully foster curiosity for its resolution.

Combinatorics

A universal dichotomy for concentration in randomly colored graphs

Let $\zeta$ be Euclidean norm of the degree sequence of a graph normalized by the graph size. We prove that when the vertices of a graph are randomly colored with $s$ colors such that the fraction of vertices in each color class is bounded away from zero, only two asymptotic regimes emerge. If $\zeta=o(1)$, then the sizes of the subgraphs induced by the color classes concentrate around their expected values. If $\zeta=\Theta(1)$, then concentration depends on the color balance: for colorings with persisting imbalance, the total number $M$ of monochromatic edges stays bounded away from its mean with positive probability; otherwise, for vanishing imbalance, $M$ still concentrates. The same dichotomy holds for a broad class of randomly colored random graphs.
Read the full abstract

Numerical Analysis

Parameter estimation for evaporation-driven tear film model in two space dimensions

The tear film (TF) plays a critical role in maintaining ocular surface health, and its disruption through tear breakup (TBU) is closely associated with dry eye disease. Evaporation-driven thinning is a primary mechanism underlying TBU, yet quantitative in vivo estimates of key physical parameters remain limited. In this work, we fit an evaporation-driven TF thinning model, originally developed by Braun et al. and extended to two dimensions using proper orthogonal decomposition (POD) by Chen et al., to experimental fluorescence (FL) imaging data from normal subjects. The use of dimension reduction enables efficient solution of the governing PDEs and facilitates parameter estimation from imaging data. Our results provide in vivo estimates of evaporation-related and thinning parameters within TBU regions. These findings enhance understanding of TF thinning and dry-spot formation and establish a quantitative baseline for comparison with dry eye patient data.
Read the full abstract

Numerical Analysis

Efficient generation of Gaussian random fields on metric graphs via domain decomposition and mass matrix lumping

We consider Gaussian Random Fields on metric graphs defined implicitly as the stationary solution to a fractional SPDE driven by Gaussian white noise. Sampling from the finite element approximation requires the Cholesky factorization of the mass matrix, causing non-linear execution time explosions and massive memory fill-in on large graphs. Hence, we combine Neumann-Neumann graph decomposition with mass matrix lumping and demonstrate empirically, that our approach preserves exact theoretical convergence rates established in [8] while achieving multi-order speedups and massive memory reductions.
Read the full abstract

Combinatorics

A generalization in affine type A of Coxeter sortable elements and Reading's bijection with noncrossing partitions

This paper generalizes in the affine symmetric group the notion of Coxeter sortable (or c-sortable for short) elements, as well as the classical bijection between c-sortable elements and c-noncrossing partitions defined by Reading in finite Coxeter groups. The generalization to the affine symmetric group of the c-sortable elements is achieved by using biclosed sets of reflections. Using recent works from Barkley and Speyer, these biclosed sets admit a sort of "one-line notation" called a TITO on $\mathbb{Z}$ (translation-invariant total order on $\mathbb{Z}$) that coincides with the usual one-line notation in the case of an affine permutation. We characterize the c-sortable elements of the affine symmetric group by pattern avoidance on their one-line notation, mirroring the well-known characterizations of c-sortable elements in the classical finite types. Based on this criterion, we then define the c-sortable biclosed sets, generalizing the c-sortable elements, as biclosed sets such that their TITOs on $\mathbb{Z}$ avoid certain patterns. We also build a bijection from our set of c-sortable biclosed sets to the set of c-noncrossing partitions using various combinatorial objects and their one-to-one correspondences. First, the TITOs, in bijection with the biclosed sets of the affine symmetric group using results from Barkley and Speyer. Second, the c-noncrossing partitions of an annulus, in bijection with the c-noncrossing partitions of the affine symmetric group, using results from Digne and Reading. Finally, the cyclic noncrossing arc diagrams, defined by Barkley, for which we exhibit a subset in bijection with both the set of c-sortable biclosed sets and the set of c-noncrossing partitions.
Read the full abstract

Algebraic Geometry

Twisting Higgs Modules and Functorial Aspects of the p-adic Simpson Correspondence

The classical Simpson correspondence describes complex linear representations of the fundamental group of a smooth complex projective variety in terms of linear algebra objects, namely Higgs bundles. Its p-adic analogue, introduced by G. Faltings, aims to understand continuous p-adic representations of the geometric fundamental group of a smooth projective variety over a p-adic local field. The main goal of this work is to establish a robust framework for studying the functoriality of the p-adic Simpson correspondence. We introduce a new method for twisting Higgs modules via Higgs-Tate algebras. This construction builds on one of our earlier approaches to the p-adic Simpson correspondence, which it recovers as a special case. The resulting framework yields twisted pullbacks and higher direct images of Higgs modules, thereby enabling a systematic study of the functoriality of the p-adic Simpson correspondence under arbitrary pullbacks and proper (log)smooth direct images, including for morphisms that do not admit liftings to the infinitesimal deformations used in the construction of the correspondence. We also clarify how this new twisting relates to the constructions of Heuer and Heuer-Xu, involving line bundles on the spectral variety.
Read the full abstract

Number Theory

Reductions of $\mathrm{GL}_2(\mathbb Q_{p^f})$-Banach spaces of slopes in $(0,1)$

Let $p$ be an odd prime and $f \geq 1$. We consider a $p$-adic locally algebraic $\text{GL}_2(\mathbb Q_{p^f})$-representation attached to a tuple of $f$ weights $k=(k_i)$ for $0 \leq i \leq f-1$ and a $p$-adic integer $a_p$ with valuation in $(0,1)$. We give conditions under which the irreducible quotients of the subquotients in a filtration on the reduction mod $p$ of the natural integral structure on this space are supercuspidal. We also check that for small $k$ and $f$ the integral structure is a lattice so that the mod $p$ reduction is nonzero.
Read the full abstract

Optimization and Control

Mirror Descent for Deterministic Optimal Control

We study an explicit mirror-descent method for finite-horizon deterministic optimal control problems. The method is motivated by Pontryagin's maximum principle: at each iteration, one solves the state and adjoint equations and updates the control by maximizing a first-order approximation of the regularized Hamiltonian penalized by a Bregman divergence. In the Euclidean case, the update reduces to a projected gradient step in the control variable. Under global smoothness assumptions and uniform convexity of the mirror map, we prove a relative smoothness estimate for the cost functional and derive an energy dissipation inequality for sufficiently small step sizes. Under an additional concavity assumption on the unregularized Hamiltonian and convexity of the terminal cost, we establish relative convexity of the regularized objective. These estimates yield an $O(1/n)$ convergence rate in the unregularized convex case and a geometric rate when the control regularization parameter is positive. Numerical examples illustrate the behavior of the method in linear-quadratic, degenerate convex, and nonlinear high-dimensional settings.
Read the full abstract

Combinatorics

Books versus Triangles near the n/6 Threshold

The book number $b(G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. A strengthening of Mantel's theorem due to Rademacher states that every $n$-vertex graph with more than $\lfloor n^2/4\rfloor$ edges contains at least $\lfloor n/2\rfloor$ triangles. Another strengthening, initiated by Erdős, asserts that every such graph $G$ satisfies $b(G)\ge n/6$. Motivated by these results, Mubayi studied the tradeoff between the total number of triangles and the book number in such graphs, and asymptotically resolved the problem when $n/4\le b(G)\le n/2$. Conlon, Fox, and Sudakov conjectured that, for $n/6\le b< n/4$, every $n$-vertex graph with at least $\lfloor n^2/4\rfloor$ edges and book number at most $b$, other than the balanced complete bipartite graph, has at least $b^2(n-4b)$ triangles, with equality only for the blow-up $S_{b,n}$ of the $3$-prism. They proved the conjecture when $b$ lies in an interval with endpoint $n/4$, and also at the endpoint $b=n/6$, where they asked whether it remains valid in an interval containing this endpoint. In this paper, we answer this question affirmatively. We show that there exists a constant $\varepsilon>0$ such that the conjecture holds for all $n/6\le b\le (1/6+\varepsilon)n$. Our proof first establishes a stability theorem showing that every extremal graph is close to a blow-up of the $3$-prism, and then uses a detailed parameter analysis to force the exact six-partite structure.
Read the full abstract

Combinatorics

Real tensor factorizations and generalized inverses under the $t$-product

The algebraic theory of third-order tensors under the $t$-product is naturally formulated over the complex field via Fourier block diagonalization. However, many applications require real-valued representations. In this paper, we investigate structural conditions ensuring that tensor factorizations and generalized inverses admit real realizations. We show that these conditions can be characterized through the conjugate-pairing structure of the Fourier frontal slices, which determines when transform-domain constructions yield real tensors after inverse transformation. As applications, we obtain real versions of several tensor factorizations and analyze the existence and structure of associated generalized inverses. These results provide a framework for transferring matrix-based constructions to real tensors while preserving the algebraic constraints of the $t$-product.
Read the full abstract

Mathematical Physics

Generalized Kontsevich model, topological recursion, and $r$-spin theory

By employing polynomial-reduced KP integrability, combined with the string equation, this work establishes explicit relationships between the generalized Kontsevich model, the topological recursion of the spectral curve, and the geometry of moduli spaces of $r$-spin curves. For the generalized Kontsevich model with a polynomial potential, we derive an explicit formulation and provide a proof of these widely expected correspondences. Furthermore, the method is extended to the cases with admissible deformed potentials, where the corresponding geometric theory is a deformed version of $r$-spin theory.
Read the full abstract

All authors Shuai Guo, Ce Ji, Chenglang Yang, Qingsheng Zhang

Category Theory

Accessibility and Gorenstein injective envelopes

Let $\mathcal{G}$ be a Grothendieck category. We prove completeness of the Gorenstein injective cotorsion pair whenever $\mathcal{G}$ admits a set of Tate trivial generators, and show that having such generators is necessary for completeness. In this case it must be a perfect cotorsion pair, cogenerated by a set, and equivalent to an injective abelian model structure on $\mathcal{G}$. Examples include Grothendieck categories (possibly without enough projectives) that admit a generating set consisting of objects of finite projective dimension, such as the category of quasi-coherent sheaves on a quasi-compact and semi-separated scheme. More generally, for a given set $\mathcal{S}$, we characterize the completeness of the Gorenstein $\mathcal{B}$-injective cotorsion pair, where $\mathcal{B} = \mathcal{S}^\perp$, in terms of the existence of a set of $\mathcal{B}$-Tate trivial generators for $\mathcal{G}$. The key ingredient to our proof is the fact that any class of the form $\mathcal{B} :=\mathcal{S}^\perp$ is an accessibly embedded, accessible subcategory of $\mathcal{G}$. The general approach allows for further applications such as the existence of Ding injective envelopes and other relative Gorenstein injective envelopes without imposing additional assumptions on $\mathcal{G}$.
Read the full abstract

Number Theory

The generalized Fermat equation $Ax^2 + By^r = Cz^p$ and applications

In this paper, we develop the modular method for the generalized Fermat equation appearing in the title, within the framework of Darmon's program and using Frey hyperelliptic curves. As an application, we study a conjecture of Laradji, Mignotte, and Tzanakis concerning the equation $5x^2+q^{2n}=y^5$.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Comment on `On computing quantum waves exactly from classical action'

A recent article by Lohmiller & Slotine (Proc.\ R.\ Soc.\ A 482: 20250413) claims that the Schrödinger equation can be solved exactly using only classical least action and classical fluid density, asserting that this formulation avoids semiclassical approximations. We show that their mathematical derivation contains a foundational error. By neglecting the spatial derivatives of the probability density amplitude, the authors inadvertently omit the quantum potential – the term originally identified by Madelung and later emphasised by Bohm. Consequently, their proposed equivalence is not exact but rather constitutes the standard semiclassical approximation. We further demonstrate that each of the paper's illustrative examples either belongs to a class where the quantum potential vanishes identically due to the geometry of the problem, or recovers the correct quantum result by importing quantum eigenfunctions through the initial conditions, thereby concealing the error.
Read the full abstract