Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 26 February

Numerical Analysis · Cross-listed from physics.chem-ph

Drifting to Boltzmann: Million-Fold Acceleration in Boltzmann Sampling with Force-Guided Drifting

Sampling molecular conformations from the Boltzmann distribution is essential for computational chemistry, but iterative diffusion methods are prohibitively slow. Drifting Models offer one-step generation, yet their equilibrium matches the training distribution, which may deviate from the true Boltzmann distribution due to sampling bias. We introduce Drifting Models to molecular conformation generation for the first time, establishing a theoretical bridge via the Drifting Score Identity: for Gaussian kernels, the drifting field's attraction equals a kernel-weighted average of any distribution's score function. Substituting molecular force labels – which directly encode the Boltzmann score – yields the Drifting Force Identity and decomposes the field into standard drift plus a Boltzmann correction. We further discover a striking phenomenon unique to molecular systems: force incorporation's effectiveness reverses across representations. In coordinate space, Force-Interpolated Drifting (FI) dominates by blending physical force directions with data displacements. In distance feature space, Force-Aligned Kernel (FK) achieves superior accuracy by modifying only kernel weights, thereby preserving the manifold of geometrically valid molecules. On MD17 Ethanol, both approaches achieve one-step generation with over 1000x speedup relative to recent score-matching methods with Boltzmann guiding, providing more than million-fold acceleration over traditional molecular dynamics, while ensuring perfect structural validity and distributional accuracy rivaling multi-step methods.
Read the full abstract

Complex Variables

Sharp Bohr Radii for Schwarz Functions and Directional derivative Operators in \mathbb{C}^n

This paper is devoted to the investigation of multidimensional analogues of refined Bohr-type inequalities for bounded holomorphic mappings on the unit polydisc $\mathbb{P}\Delta(0;1_n)$. We provide a definitive resolution to the Bohr phenomenon in several complex variables by determining sharp radii for functional power series involving the class of Schwarz functions $\omega_{n,m}\in\mathcal{B}_{n,m}$ and the local modulus $|f(z)|$. By employing the directional derivative operator $\partial_uf(z) = \sum_{k=1}^{n} u_k \frac{\partial f(z)}{\partial z_k}$, where $u=(u_1,u_2,\ldots,u_n)\in\mathbb{C}^n$ such that $|u_1|+|u_2|+\ldots+|u_n|=1$, we obtain refined growth estimates for derivatives that generalize well-known univariate results to $\mathbb{C}^n$. The optimality of the obtained constants is rigorously verified, demonstrating that all established radii are sharp.
Read the full abstract

Algebraic Geometry

On the Chow ring of double EPW quartics

Double EPW quartics are hyperkähler varieties of dimension 4, first introduced by Iliev, Kapustka, Kapustka, and Ranestad. The general double EPW quartic is isomorphic to a moduli space of twisted sheaves on a $K3$ surface. They have a rich geometry: they are equipped with an anti-symplectic involution and are related to conics in Verra fourfolds in the same way Fano varieties of lines on cubic fourfolds are related to cubic fourfolds themselves. In this work, we exploit this geometry to establish general conjectures about algebraic cycles on hyperkähler varieties in the case of double EPW quartics.
Read the full abstract

Information Theory · Cross-listed from cs.CR

Privacy-Preserving Proof of Human Authorship via Zero-Knowledge Process Attestation

Process attestation verifies human authorship by collecting behavioral biometric evidence, including keystroke dynamics, typing patterns, and editing behavior, during the creative process. However, the very data needed to prove authenticity can reveal intimate details about an author's cognitive state, health conditions, and identity, constituting sensitive biometric data under GDPR Article 9. We resolve this privacy-attestation paradox using zero-knowledge proofs. We present ZK-PoP, a construction that allows a verifier to confirm that (a) sequential work function chains were computed correctly, (b) behavioral feature vectors fall within human population distributions, and (c) content evolution is consistent with incremental human editing, all without learning the underlying behavioral data, exact timing, or intermediate content. Our construction uses Groth16 proofs over arithmetic circuits with Pedersen commitments and Bulletproof range proofs. We prove that ZK-PoP is computationally zero-knowledge, computationally sound, and achieves unlinkability across sessions. Evaluation shows proof generation in under 30 seconds for a 1-hour writing session, with 192-byte proofs verifiable in 8.2 ms, while incurring less than 5% accuracy loss in simulation at practical privacy levels (epsilon >= 1.0) compared to non-private baselines.
Read the full abstract

Information Theory

Automated Discovery of Improved Constant Weight Binary Codes

A constant weight binary code consists of $n$-bit binary codewords, each with exactly $w$ bits equal to 1, such that any two codewords are at least Hamming distance $d$ apart. $A(n,d,w)$ is the maximum size of a constant weight binary code with parameters $n,d,w$. We establish improved lower bounds on $A(n,d,w)$ by constructing new larger codes, for 24 values of $(n,d,w)$ with $6 \leq d \leq 18$ and $18 \leq n \leq 35$. The improved lower bounds come from two strategies. The first is a tabu search that operates at the level of bit swaps. The second is a novel greedy heuristic that repeatedly chooses the candidate codeword that maximizes a randomly-scored histogram of distances to previously-added codewords. These strategies were proposed by CPro1, an automated protocol that generates, implements, and tests diverse strategies for combinatorial constructions.
Read the full abstract

Geometric Topology

A Rigidity Theorem for Convex Sets in Hyperbolic 3-Space

Pogorelov's rigidity theorem states that a compact convex body in the hyperbolic 3-space is determined up to isometry by the intrinsic path metric on its boundary. The main result of this paper addresses a rigidity problem for non-compact closed convex 3-dimensional subsets in hyperbolic 3-space. We show that the intrinsic path metric on the boundary determines a closed convex set up to isometry, provided that the set of limit points of the convex set at infinity of the hyperbolic 3-space has vanishing 1-dimensional Hausdorff measure, i.e., zero length. Furthermore, this zero-length condition is optimal. This can be considered as an analogue of the Painlevé removability theorem in complex analysis, which states that sets of zero length are removable for bounded holomorphic functions. As a corollary, we show that if the underlying complex structure of a connected polyhedral surface is of parabolic type, then it is discrete conformal, unique up to scaling, to a complete flat surface marked with a discrete subset. The proof uses Pogorelov's rigidity theorem for compact convex bodies in $\mathbb R^3$, the Pogorelov map, and the Tabor–Tabor theorem on the extension of locally convex functions.
Read the full abstract

Numerical Analysis · Cross-listed from cs.MS

Hyper-reduction methods for accelerating nonlinear finite element simulations: open source implementation and reproducible benchmarks

Hyper-reduction methods have gained increasing attention for their potential to accelerate reduced order models for nonlinear systems, yet their comparative accuracy and computational efficiency are not well understood. Motivated by this gap, we evaluate a range of hyper-reduction techniques for nonlinear finite element models across benchmark problems of varying complexity, assessing the inevitable tradeoff between accuracy and speedup. More specifically, we consider interpolation methods based on the gappy proper orthogonal decomposition as well as the empirical quadrature procedure (EQP), and apply them to the hyper-reduction of problems in nonlinear diffusion, nonlinear elasticity and Lagrangian hydrodynamics. Our numerical results are generated using the open source libROM, Laghos and MFEM numerical libraries. Our findings reveal that the comparative performance between hyper-reduction methods depends on both the problem and the choice of time integration method. The EQP method generally achieves lower relative errors than interpolation methods and is more efficient in terms of quadrature point usage, resulting in a lower wall time for the nonlinear diffusion and elasticity problems. However, its online computational cost is observed to be relatively high for Lagrangian hydrodynamics problems. Conversely, interpolation methods exhibit greater variability, especially with respect to the use of different time integration methods in the Lagrangian hydrodynamics problems. The presented results underscore the need for problem specific method selection to balance accuracy and efficiency, while also offering useful guidance for future comparisons and refinements of hyper-reduction techniques.
Read the full abstract

All authors Axel Larsson, Minji Kim, Chris Vales, Sigrid Adriaenssens, Dylan Matthew Copeland, Youngsoo Choi, Siu Wun Cheung

Probability

Bulk Directed Landscape Convergence and Phase Transitions in Half-Space Models

We study the effects of the boundary in the bulk of two half-space models. For half-space exponential last passage percolation (LPP) and the half-space log-gamma polymer, we establish convergence of their respective rescaled last passage time and free energy to the directed landscape when the observation window is at distance $f(n)n^{2/3}$ from the boundary and the attractive boundary strength is $o(f(n)n^{-1/3})$, where $f(n)\to\infty$ may diverge arbitrarily slowly. We also show that this condition on the boundary strength is sharp at the level of scales: any boundary strength of order $f(n)n^{-1/3}$ changes the limiting behavior for sufficiently large temporal separations. For exponential LPP, we prove a phase transition in the point-to-point last passage time as the boundary attraction varies on the scale \(f(n)n^{-1/3}\). As the attraction increases, the fluctuations transition from a bulk-dominated KPZ regime to a boundary-dominated Gaussian regime, with a critical window governed by the positive part of a shifted Gaussian. The limiting law in the critical window manifests the competition between a Gaussian boundary contribution and a bulk contribution whose magnitude vanishes under the Gaussian scaling.
Read the full abstract

Optimization and Control

The Continuous p-Dispersion Problem in Three Dimensions

The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and the boundary of this compact set is maximized. This problem finds applications in facility placement, communication network design, sampling theory, and particle simulation; however, finding optimal solutions is NP-hard and existing algorithms focus on providing approximate solutions in two-dimensional space. In this paper, we introduce an almost-everywhere differentiable optimization model and global optimization algorithm for approximating solutions to the CpDP with boundary constraints in convex and non-convex polyhedra with respect to any metric in a three-dimensional Euclidean space. Our algorithm generalizes two-dimensional dispersion techniques to three dimensions by leveraging orientation, linear-algebraic projections for point-to-face distances, and a ray-casting procedure for point-in-polyhedron testing, enabling optimization in arbitrary convex and non-convex three dimensional polyhedra. We validate the proposed algorithm by comparing with analytical optima where available and empirical benchmarks, observing close agreement with optimal solutions and improvements over empirical benchmarks.
Read the full abstract

Information Theory

Are Stacked Intelligent Metasurfaces (SIMs) Better than Single-layer Reconfigurable Intelligent Surfaces (RISs) for Wideband Multi-user MIMO Communication Systems?

Cascaded or stacked intelligent metasurfaces (SIMs) have emerged as a promising technology to overcome the physical limitations of single-layer reconfigurable intelligent surfaces (RISs) in wideband wireless communication. By intelligently manipulating electromagnetic waves, SIMs enhance signal propagation in complex environments and offer additional degrees of freedom for beamforming. This paper proposes a coupling-aware, wideband, circuit-based framework that captures frequency-dependent mutual coupling and wideband channel responses over multiple subbands. Based on this model, we formulate a joint active and passive beamforming design that optimizes the base-station precoder to enable carrier aggregation across frequency-selective subbands, together with metasurface phase shifts, to maximize spectral efficiency. Simulation results reveal the importance of accounting for coupling and wideband effects, and show that performance depends strongly on operating conditions. Single-layer RIS configurations can be favorable in narrowband and/or low-SNR regimes, whereas SIMs can significantly outperform under wideband multi-user conditions by mitigating coupling-induced distortion and maintaining a more consistent phase response across frequencies. The results provide physical insights into design trade-offs between structural simplicity and wideband adaptability, highlighting SIMs as a scalable solution for future-generation wideband multi-user MIMO systems. We further show that partially reconfigurable SIM architectures achieve near-optimal performance with reduced complexity.
Read the full abstract

Category Theory

The category of formations of finite groups and topology

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete posetal category of group classes, $\mathrm{CG}$. Second, we formalize the collection of closure operators themselves as a category, CL, proving it is a complete lattice. This provides the essential machinery for combining algebraic operations and understanding their universal properties via adjunctions. Finally, we apply this framework to topology. We show that additive universally anchored operators induce homotopically equivalent contractible spaces, revealing a principle of global simplicity that contrasts with local algebraic friction. We then use the lattice structure of CL to analyze the operators for Formations and Fitting classes, uncovering a profound topological asymmetry between these dually defined structures.
Read the full abstract

Probability

Functional inequalities for Boolean entropy

Building on the recently introduced notion of Boolean entropy, we define the corresponding Boolean Fisher information via a de Bruijn identity. We study the monotonicity of this Fisher information in the Boolean Central Limit Theorem and establish several functional inequalities involving these quantities, including a logarithmic Sobolev inequality. We also develop Non-microstate counterparts and prove the associated functional inequalities. In addition, we introduce a notion of Stein discrepancy in the Boolean setting, which leads to new Berry–Esseen type bounds in the Boolean central limit theorem.
Read the full abstract

Numerical Analysis

Implementing FFTs in Practice

This review article was first published in 2008 as chapter 11 in the book "Fast Fourier Transforms," edited by C. S. Burrus, for the Connexions project at Rice University, which is sadly no longer online. It gives a high-level overview of some of the engineering considerations that arise in high-performance implementations of fast Fourier trasnforms (FFTs). It explains why optimized FFTs are very different from textbook "radix-2 Cooley-Tukey" FFT algorithms, in order to compensate for the memory hierarchy and exploit the large register sets and deep pipelines of modern CPUs. Using the FFTW library as a case study, it talks about tradeoffs in the use of recursion, generation of twiddle factors, code generation, and other algorithmic choices.
Read the full abstract

Information Theory

Coordinate-View Confusability Graphs and Matroid Rank Certificates

A coordinate-view presentation specifies a large confusability graph by coordinates rather than by an edge list. The problem is to certify zero-error recovery and Shannon capacity from the succinct presentation, before the exponentially large graph is materialized. For affine presentations over $\mathbb F_q$, Gaussian elimination gives a polynomial-time rank upper certificate from $O(rd\log q+Ld)$ input bits for a graph with $q^r$ vertices. Exactness of that certificate is equivalent to positivity of a Grassmannian avoidance count $N_{t^*}$. Positivity of $N_k$ is NP-complete for every fixed $k$, already over $\mathbb F_2$, while the ambient-rank parameter gives a fixed-parameter algorithm. The rank-one reduction is parsimonious for $\#SAT$. For arbitrary $t$, the finite decoder for $N_t$ reads the signed rank profile of the represented forbidden-point matroid; the kernel-intersection lattice alone does not determine the count. On the positive side, kernel sections give the exact formula $\Theta(G)=\log\alpha(G)=\min_{S\in\mathcal V}t(S)\log q$, with a projection-equality matrix optimal for Haemers minrank. A finite-field blocking theorem gives exactness when $q\ge L$, and Reed-Solomon/MDS codes give exact all-$k$-view families beyond that regime. Full-tuple coordinate-view graphs also have a polynomial-time cofinal-antichain normal form; transitive confusability is exactly intersection closure.
Read the full abstract

Combinatorics

Regular $K_3$-regular graphs

We study graphs that are simultaneously regular with respect to the ordinary vertex degree and regular with respect to the triangle degree, that is, the number of triangles containing a given vertex. We call such graphs regular $K_3$-regular. We investigate the (non-)existence of regular $K_3$-regular graphs with prescribed parameters $(r_2,r_3)$, where $r_2$ is the vertex degree and $r_3$ is the triangle degree. General bounds relating vertex and edge triangle degrees are derived, and non-existence results are established for broad ranges of these parameters. Special attention is paid to Turán graphs, for which we establish uniqueness results for certain parameters. The paper concludes with a summary of admissible parameters and several open problems.
Read the full abstract

All authors Artem Hak, Sergiy Kozerenko, Denys Lohvynov, Yurii Yarosh

2602.23517 · 26 Feb · Second version. We added references to related works on (r,c)-constant graphs and vertex-girth-regular graphs, clarified the relation between our results and existing literature, and extended the section on Turán graphs with new results. Any comments are welcome

Functional Analysis

Spherical Radon transforms with smoothly varying radii

We present an analysis of a novel spherical Radon transform, $R$, which defines the integrals of a function, $f$, in $\mathbb{R}^n$ over spheres with arbitrary center ($\mathbf{y}$) and radii, $r(\mathbf{y})$, which vary smoothly with $\mathbf{y}$. We first establish sufficient and necessary conditions on $r$ and $\text{supp}(f)$ so that $R$ satisfies the Bolker condition, and further conditions which allow $f$ to be recovered stably from $Rf$. We then apply this theory to a number of example applications in Compton Scatter Tomography (CST) and Ultrasound Reflection Tomography (URT). For each application considered, we also provide injectivity proofs and explicit inversion formulae, some of which are based on the generalized theory presented by Palamodov ("Palamodov, V. P. (2012). A uniform reconstruction formula in integral geometry. Inverse Problems, 28(6), 065014."). We then combine our microlocal theory and injectivity results to prove stability estimates for our transforms. In addition, to validate our theory, we provide simulated image reconstructions.
Read the full abstract

Number Theory

Duffin–Schaeffer examples, real residue systems, and Bohr-set primes

We prove the following generalization of a well-known result of Duffin and Schaeffer: For any given countable sets $Y \subset\mathbb{R}$ and $Z\subset\mathbb{R}\setminus\operatorname{span}_\mathbb{Q}(\{1\}\cup Y)$, there exist functions $\psi$ such that the set of inhomogeneously $\psi$-approximable numbers has zero measure or full measure, according as the inhomogeneous parameter lies in $Y$ or $Z$. The proof uses an analogue of residue systems where the residues can take arbitrary real values, and it also requires information about the distribution of primes lying in Bohr sets. We extend a theorem of Rogers to the more general real residues setting, and we extend Dirichlet's theorem for prime numbers lying in arithmetic progressions to prime numbers lying in Bohr sets. We also prove that circle rotations equidistribute when sampled along such primes, provided the rotation angle is rationally independent of the Bohr set parameter, generalizing a theorem of Vinogradov. An appendix by Manuel Hauke answers a combinatorial question that is posed in the introduction.
Read the full abstract

Representation Theory

A Note on Scopes Equivalences for Ariki–Koike Algebras as Categorical Actions

A categorical action of a Kac–Moody algebra $\mathfrak{g}$ is built on a category $\mathcal{C}$ decomposed according to the weights $P$ of $\mathfrak{g}$, as well as biadjoint endofunctors $\mathcal{E}_i$ and $\mathcal{F}_i$, abstracting $i$-induction and $i$-restriction, which act on the weight spaces of $\mathcal{C}$ in the same way that the Chevalley generators would act on a regular representation. Chuang and Rouquier initially developed these notions for $\mathfrak{sl}_2$-categorical actions, using them to prove Broué's abelian defect group conjecture for symmetric groups by establishing derived equivalences between blocks of the same defect. In the setting of general categorical actions Webster later showed that many of these derived equivalences are, in fact, $t$-exact, and that, as a result, such an action can be used to separate weight spaces of a categorical action into a finite number of Morita equivalence classes, where these equivalences also preserve decomposition numbers. The combinatorics of these powerful abstract results were concretely established in the case of Ariki–Koike algebras by the first author in arxiv:2301.05153v2, and in this short note we discuss how to translate between the two settings.
Read the full abstract

Mathematical Physics

Dispersionless Hirota system and hidden symmetries of heavenly equation

In 2021 Konopelchenko, Schief and Szereszewski observed that solutions of 4D dispersionless Hirota system also solve the general heavenly equation describing self-dual vacuum Einstein metrics in neutral signature. They also noticed that the symmetry $f\mapsto \Phi(f)$ of the Hirota system essentially changes the properties of the corresponding metric. In this paper we restate these observations in the context of I and II Plebański heavenly equation (I,II PHE). Namely, we first find 5D analogues of these equations. We then consider a special type of symmetry generalizing the so-called tri-holomorphic symmetry of I or II PHE. The reduction with respect to this symmetry (which in a sense imitates the reduction of self-dual vacuum Einstein metrics with respect to a tri-holomorphic symmetry ending in special Einstein–Weyl structures) gives an analogue of the dispersionless Hirota system for I and II PHE. Such a point of view allows to reinterpret the symmetry $f\mapsto \Phi(f)$ mentioned and obtain explicit formulas for the metric depending on $\Phi$. We present some examples showing how the Weyl spinor changes along with $\Phi$.
Read the full abstract

Statistics Theory

How to recover a permutation group amidst errors

We consider the problem of recovering a permutation group $G \leq S_n$ from an error-prone sampling process $X$. We model $X$ as an $S_n$-valued random variable, defined as a mixture of the uniform distributions on $G$ and $S_n$ . Our suite of tools recovers properties of $G$ from $X$ and bolsters our main method for recovering $G$ itself. Our algorithms are motivated by the numerical computation of monodromy groups, a setting where such error-prone sampling procedures occur organically.
Read the full abstract

Quantum Algebra

NIM-representations of Tambara-Yamagami generalizations

We compute and classify the irreducible non-negative integer matrix (NIM-)representations of two proposed generalizations of the Tambara-Yamagami fusion ring, as studied by Jordan-Larson and Galindo-Lentner-Möller, respectively. We also detect the algebra objects associated to these NIM-representations.
Read the full abstract

All authors Agustina Czenky, Emily McGovern, Melody Molander, Monique Müller, Ana Ros Camacho

Analysis of PDEs

Continuous dependence results for quasilinear evolution equations

We study continuous dependence of solutions to quasilinear evolution equations of parabolic-type in the framework of maximal $L^p$-regularity. For equations of the form \[ \frac{d\phi}{dt} + A(t,\phi)\phi = f(t,\phi), \] we establish continuous dependence of strong solutions on initial data, and suitable approximations of the nonlinear operators $A$ and $f$. An important step for proving the main result is the fact that the maximal regularity constant of the operator $A(t,\phi)$, with $t$ and $\phi$ fixed, admits a uniform bound over compact subsets of the relevant Banach spaces. As an application, we consider a class of non-Newtonian fluid models with a Carreau-type viscosity and mixed boundary conditions. We show that, as the nonlinear contribution in the viscosity vanishes and the initial data converge, solutions of the non-Newtonian fluid model converge to those of the classical Navier–Stokes equations.
Read the full abstract

Classical Analysis and ODEs

Singularities of the First Painlevé Transcendent

Consider the solution $y(t)$ for the ordinary differential equation $y' = f(t, y)$ with $t$ complex. Second-order nonlinear differential equations often exhibit patterns in their poles, branch points, and essential singularities, explored by \Pain and colleagues, 1888–1915. A variant of the ratio test applied to the Taylor series for the solution $y$ estimates the locations and orders of singularities in the First Painlevé Transcendent as an example. Can you suggest applications in which our singularity location analysis can provide useful insights?
Read the full abstract

Classical Analysis and ODEs

Bounded and measurable common fundamental domains for two lattices

Suppose that $L, M$ are two full-rank lattices in Euclidean space with $\text{vol}(L)=\text{vol}(M)$. We give a new proof on the existence of a bounded and Lebesgue measurable set that tiles $\mathbb{R}^d$ with both $L,M$ using the measurable Hall's Theorem which was proved by T.Ciésla and M. Sabok. This proof is direct and does not go through the intermediate results on cut-and-project sets involved in the proof given by S.Grepstad and M.Kolountzakis. We also show the existence of a bounded, set-theoretic (i.e., not necessarily measurable) common fundamental domain of $L,M$ assuming only that $\text{vol}(L)=\text{vol}(M)$. Combining these results we show the existence of a bounded and Lebesgue measurable common fundamental domain for any two full-rank lattices of equal volumes. Finally we show that a set-theoretic bounded, common fundamental domain cannot exist when $\text{vol}(L)\neq \text{vol}(M)$.
Read the full abstract

Optimization and Control

Solving Linear-Quadratic Stochastic Control Problems with Signatures

We study a signature-driven numerical scheme to solve multi-dimensional linear-quadratic (LQ) stochastic control problems. Using that linear signature functionals are dense in the natural class of admissible controls, we show that our approach turns the original LQ problem into a deterministic convex quadratic polynomial optimisation. To underpin a numerical approach based on truncated signatures, we prove that the problem's value function can be approximated by finite-dimensional polynomial approximations when the truncation levels are chosen sufficiently high. Remarkably, our numerical experiments show very decent accuracy already for small truncation levels. Key tools for our analysis are (i) the algebraic representation of controlled stochastic differential equations and the associated cost function as linear functionals of the path signatures of the driving noise, (ii) the convergence of the truncated linear functionals, and (iii) the density of signature controls.
Read the full abstract

Analysis of PDEs

Geometry of the Minimal Level Set of the Effective Hamiltonian in Two Dimensions

In this paper, we characterize the geometric structure of the boundary of the minimal level set $F_0$ of the effective Hamiltonian $\overline{H}$ associated with the mechanical Hamiltonian \[ H(p,x)=\frac12|p|^2+V(x) \] in dimension $n=2$, where $V$ on $\mathbb{T}^2=\mathbb{R}^2/\mathbb{Z}^2$ has a unique maximum and Hessian at this maximizer has two distinct negative eigenvalues. For $n=2$, the geometry of the level sets of $\overline{H}$ strictly above the minimum has been largely understood since the 1990s, mainly through the equivalent formulation in terms of stable norms; we fill the remaining gap at the minimal level by providing an explicit, verifiable characterization of $\partial F_0$. In particular, we show that $p \in \partial F_0$ does not lie on any flat edge if and only if $\partial F_0$ is differentiable at $p$ and its outer normal direction is irrational, except possibly at one exceptional pair of points $\pm p_0$. Consequently, flat edges are dense along $\partial F_0$. We also construct an example demonstrating that this exceptional pair can occur, showing the result is sharp.
Read the full abstract

Numerical Analysis

On the Limits of Interpretable Machine Learning in Quintic Root Classification

Can Machine Learning (ML) autonomously recover interpretable mathematical structure from raw numerical data? We aim to answer this question using the classification of real-root configurations of polynomials up to degree five as a structured benchmark. We tested an extensive set of ML models, including decision trees, logistic regression, support vector machines, random forest, gradient boosting, XGBoost, symbolic regression, and neural networks. Neural networks achieved strong in-distribution performance on quintic classification using raw coefficients alone (84.3% + or - 0.9% balanced accuracy), whereas decision trees perform substantially worse (59.9% + or - 0.9%). However, when provided with an explicit feature capturing sign changes at critical points, decision trees match neural performance (84.2% + or - 1.2%) and yield explicit classification rules. Knowledge distillation reveals that this single invariant accounts for 97.5% of the extracted decision structure. Out-of-distribution, data-efficiency, and noise robustness analyses indicate that neural networks learn continuous, data-dependent geometric approximations of the decision boundary rather than recovering scale-invariant symbolic rules. This distinction between geometric approximation and symbolic invariance explains the gap between predictive performance and interpretability observed across models. Although high predictive accuracy is attainable, we find no evidence that the evaluated ML models autonomously recover discrete, human-interpretable mathematical rules from raw coefficients. These results suggest that, in structured mathematical domains, interpretability may require explicit structural inductive bias rather than purely data-driven approximation.
Read the full abstract

Analysis of PDEs

Weak mean random attractors for non-local random and stochastic reaction-diffusion equations

In this paper, we prove the existence of weak pullback mean random attractors for a non-local stochastic reaction-diffusion equation with a nonlinear multiplicative noise. Also, we establish the existence and uniqueness of solutions and weak pullback mean random attractors for a deterministic nonlocal reaction-diffusion equations with random initial data.
Read the full abstract

Dynamical Systems

Lesche stability of the Shannon strong hyperbolic entropy and some hyperbolic extensions

In recent decades, several definitions of new entropy measures have been proposed, which expands the range of applications for this important tool. The present work focuses on the extension of the classical Shannon entropy to the hyperbolic number plane $\mathbb{D}$ with the notion of valued hyperbolic probability. It is shown that the Shannon strong hyperbolic entropy over a discrete hyperbolic probability distribution $(\rho_{1}, \ldots,\rho_{N})$ can be established by the action of the hyperbolic derivative on the generating function $\sum_{s=1}^{N}{\rho}_{s}^{-\xi}$ with respect to the hyperbolic variable $\xi$ and then we tend $\xi$ to $-1_{\mathbb{D}}$. Furthermore, we prove that this hyperbolic extension possesses the Lesche stability property, also known as experimental robustness. Finally, we present some results on the hyperbolic extension of the Rényi entropy and hyperbolic extropy.
Read the full abstract

All authors Juan Adrián Ramírez Belman, Juan Bory Reyes, José Oscar González Cervantes, Gamaliel Yafte Tellez Sanchez

Dynamical Systems

About the structure of attractors for a nonlocal Chafee-Infante problem

In this paper, we study the structure of the global attractor for the multivalued semiflow generated by a nonlocal reaction-diffusion equation in which we cannot guarantee uniqueness of the Cauchy problem. First, we analyse the existence and properties of stationary points, showing that the problem undergoes the same cascade of bifurcations as in the Chafee-Infante equation. Second, we study the stability of the fixed points and establish that the semiflow is dynamically gradient. We prove that the attractor consists of the stationary points and their heteroclinic connections and analyse some of the possible connections.
Read the full abstract

All authors Rubén Caballero, Alexandre Nolasco Carvalho, Pedro Marín-Rubio, José Valero