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)

Tuesday 3 March

Combinatorics

Graphs whose Eulerian trails have unique labels

Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that each “$3$-connected part” is labeled over a group which is isomorphic to $\mathbb{Z}_2^k$ for some $k$. We also show that the algorithmic problem admits a polynomial-time reduction to the word problem for the group.
Read the full abstract

Information Theory

E-variables and tests of randomness for distribution classes

E-variables are a relatively new approach for testing statistical hypotheses that has been experiencing major development during the last several years. In this paper we introduce the method of e-variable-approximability and use it to develop a general approximation technique allowing us to construct e-variables for popular distribution classes important for applications. E-variables were originally based on a concept of Levin's (average-bounded) randomness tests from Algorithmic Information Theory. We show that our construction of e-variables can be used to provide an explicit construction for a randomness test with respect to a class of distributions.
Read the full abstract

Information Theory

RIS-Enabled Wireless Channel Equalization: Adaptive RIS Equalizer and Deep Reinforcement Learning

Reconfigurable Intelligent Surfaces (RISs) offer a promising means of reshaping the wireless propagation environment, yet practical methods for configuring large passive arrays to achieve reliable signal equalization remain limited. Equalization is essential in wideband links to counteract multipath-induced pulse distortion that otherwise degrades symbol recovery. This work investigates RIS-assisted pulse response equalization and signal boosting using both classical adaptive filtering and model-free deep reinforcement learning (DRL). We develop a steepest descent (SD) method that exploits cascaded BS-RIS-UE channel information to configure RIS coefficients for multipath mitigation and SNR enhancement, and we show that the tradeoffs between SD and DRL primarily arise from the extensive channel estimation required for accurate equalization with passive RIS hardware. Unlike traditional adaptive filtering, which updates delayed filter coefficients after signal reception, our approach uses the RIS positioned within the cascaded channel to perform equalization without delay elements, prior to reception at the UE. In this framework, the channel is estimated before equalization, forming the basis of what we term adaptive RIS equalization (ARISE). To overcome the reliance on channel estimation required for ARISE, we explore several DRL algorithms – DDPG, TD3, and SAC – that optimize RIS coefficients directly from the received pulse response without explicit channel estimation. Through extensive simulations across diverse channel conditions and RIS sizes, we show that SAC achieves fast, stable convergence and equalization performance comparable to ARISE while offering significantly lower implementation complexity. These results highlight the potential of DRL as a practical and scalable solution for real-time RIS control in future wireless systems.
Read the full abstract

Optimization and Control · Cross-listed from cs.RO

COLREGs Compliant Collision Avoidance and Grounding Prevention for Autonomous Marine Navigation

Maritime Autonomous Surface Ships (MASS) are increasingly regarded as a promising solution to address crew shortages, improve navigational safety, and improve operational efficiency in the maritime industry. Nevertheless, the reliable deployment of MASS in real-world environments remains a significant challenge, particularly in congested waters where the majority of maritime accidents occur. This emphasizes the need for safe and regulation-aware motion planning strategies for MASS that are capable of operating under dynamic maritime conditions. This paper presents a unified motion planning method for MASS that achieves real time collision avoidance, compliance with International Regulations for Preventing Collisions at Sea (COLREGs), and grounding prevention. The proposed work introduces a convex optimization method that integrates velocity obstacle-based (VO) collision constraints, COLREGs-based directional constraints, and bathymetry-based grounding constraints to generate computationally efficient, rule-compliant optimal velocity selection. To enhance robustness, the classical VO method is extended to consider uncertainty in the position and velocity estimates of the target vessel. Unnavigable shallow water regions obtained from bathymetric data, which are inherently nonconvex, are approximated via convex geometries using a integer linear programming (ILP), allowing grounding constraints to be incorporated into the motion planning. The resulting optimization generates optimal and dynamically feasible input velocities that meet collision avoidance, regulatory compliance, kinodynamic limits, and grounding prevention requirements. Simulation results involving multi-vessel encounters demonstrate the effectiveness of the proposed method in producing safe and regulation-compliant maneuvers, highlighting the suitability of the proposed approach for real time autonomous maritime navigation.
Read the full abstract

All authors Mayur S. Patil, Nataraj Sudharsan, Veneela Ammula, Jude Tomdio, Jin Wang, Michael Kei, Sivakumar Rathinam, Prabhakar R. Pagilla

Monday 2 March

General Mathematics

On a nonlocal fractional thermostat eigenvalue problem

We study the existence of positive solutions for a parameter-dependent nonlocal boundary value problem involving a Caputo fractional derivative, which generalizes a classic thermostat model. Our approach extends previous work by considering two nonlinear functionals occurring in the boundary conditions and, crucially, by analyzing cases where the associated Green's function is not necessarily positive and is allowed to change sign. We employ a Birkhoff-Kellogg type theorem in cones to establish the existence of positive eigenvalues with associated eigenfunctions with given norms. Furthermore, we provide explicit intervals that localize the corresponding positive eigenvalues. The applicability of our theoretical framework is illustrated with examples.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Machine Learning Models to Identify Promising Nested Antiresonance Nodeless Fiber Designs

Hollow-core fibers offer superior loss and latency characteristics compared to solid-core alternatives, yet the geometric complexity of nested antiresonance nodeless fibers (NANFs) makes traditional optimization computationally prohibitive. We propose a high-efficiency, two-stage machine learning framework designed to identify high-performance NANF designs using minimal training data. The model employs a neural network (NN) classifier to filter for single-mode designs (suppression ratio $\ge$ 50 dB), followed by a regressor that predicts confinement loss (CL). By training on the common logarithm of the loss, the regressor overcomes the challenges of high dynamic range. Using a sparse data set of only 1,819 designs, all with CL greater or equal to 1 dB/km, the model successfully identified optimized designs with a confirmed CL of 0.25 dB/km. {This demonstrates the NN has captured underlying physical behavior and is able to extrapolate to regions of lower CL. We show that small data sets are sufficient for stable, high-accuracy performance prediction, enabling the exploration of design spaces as large as $14e6$ cases at a negligible computational cost compared to finite element methods.
Read the full abstract

Category Theory · Cross-listed from stat.ML

The Theory behind UMAP?

In 2018, McInnes et al. introduced a dimensionality reduction algorithm called UMAP, which enjoys wide popularity among data scientists. Their work introduces a finite variant of a functor called the metric realization, based on an unpublished draft by Spivak. This draft contains many errors, most of which are reproduced by McInnes et al. and subsequent publications. This article aims to repair these errors and provide a self-contained document with the full derivation of Spivak's functors and McInnes et al.'s finite variant. We contribute an explicit description of the metric realization and related functors. At the end, we discuss the UMAP algorithm, as well as claims about properties of the algorithm and the correspondence of McInnes et al.'s finite variant to the UMAP algorithm.
Read the full abstract

General Mathematics

Perimeter of an Ellipse: Understanding Ramanujan's Approximation

It is well known that there is no closed form analytic expression for the perimeter of an ellipse. In 1927, Srinivasa Ramanujan provides two approximations to the perimeter of an ellipse that are amazingly accurate. However, he does not provide an explanation of how he arrived at those expressions. In this paper, we will try to provide such an explanation that is likely how he derived those expressions. Using insights from our analysis, we improve on these approximations. To the best of our knowledge, ours is the first attempt to explain Ramanujan's ellipse perimeter formula and our approximation is uniformly better than his expression.
Read the full abstract

Number Theory

On Permutation Trinomials and Complete Permutation Polynomials via Fiber Criteria over Finite Fields

We give new, short proofs of recent permutation polynomial results of Bousalmi, Bayad, and Derbal by reducing the verification to explicit computations on a three-element multiplicative subgroup via Zieve's fiber criterion. Building on this approach, we develop a general framework – combining Zieve's theorem with the AGW criterion – for constructing complete permutation polynomials over finite fields through a fiber decomposition over the cube roots of unity. A scalar specialization of the criterion yields families that are easy to produce and verify. We illustrate the construction with concrete examples and show through counterexamples that the underlying arithmetic conditions are sharp.
Read the full abstract

Combinatorics

Pell-Padovan tetranacci numbers and their Hadamard product with classical sequences

A quick way to compute generating functions related to Pell-Padovan tetranacci numbers and classical sequences of recursions of order two is provided. Eight special instances can be computed at once.

General Mathematics

Structural Components Dominate Asymptotic Behavior on Sombor Index with Iterated Pendant Constructions

The Sombor index, a degree-based topological descriptor introduced by Gutman in 2021, lacks closed-form expressions for complex hierarchical trees with multi-level pendant structures and nonuniform degree distributions, despite extensive results for simpler families such as paths, stars, cycles, and basic caterpillars. For a simple graph $\mathcal{G}$, the Sombor index is defined as \[ \mathrm{SO}(\mathcal{G}) = \sum_{uv \in E(\mathcal{G})} \sqrt{d(v)^2 + d(u)^2}. \] In this work, we derive a general recursive formula for the Sombor index of multi-level pendant-augmented path trees. These trees are constructed from a spine path $\mathcal{P}_n$ ($n \ge 2$) in which each vertex has degree $2+k$ and are iteratively augmented over $m \ge 1$ hierarchical levels. Pendants attached to odd-indexed spine vertices branch with replication factor $k$ and terminal degree $\ell_i$, whereas those stemming from even-indexed vertices incorporate an initial offset $\ell_1>2$ that propagates through subsequent levels. These results significantly advance the theoretical and computational study of degree-based topological descriptors in iteratively constructed graphs.
Read the full abstract

Number Theory · Cross-listed from cs.MS

GoldbachGPU: An Open Source GPU-Accelerated Framework for Verification of Goldbach's Conjecture

We present GoldbachGPU, an open-source framework for large-scale computational verification of Goldbach's conjecture using commodity GPU hardware. Prior GPU-based approaches reported a hard memory ceiling near 10^11 due to monolithic prime-table allocation. We show that this limitation is architectural rather than fundamental: a dense bit-packed prime representation provides a 16x reduction in memory footprint, and a segmented double-sieve design removes the VRAM ceiling entirely. By inverting the verification loop and combining a GPU fast-path with a multi-phase primality oracle, the framework achieves exhaustive verification up to 10^12 on a single NVIDIA RTX 3070 (8 GB VRAM), with no counterexamples found. Each segment requires 14 MB of VRAM, yielding O(N) wall-clock time and O(1) memory in N. A rigorous CPU fallback guarantees mathematical completeness, though it was never invoked in practice. An arbitrary-precision checker using GMP and OpenMP extends single-number verification to 10^10000 via a synchronised batch-search strategy. The segmented architecture also exhibits clean multi-GPU scaling on data-centre hardware (tested on 8 x H100). All code is open-source, documented, and reproducible on both commodity and high-end hardware.
Read the full abstract

Information Theory

Video TokenCom: Textual Intent-Guided Multi-Rate Video Token Communications with UEP-Based Adaptive Source-Channel Coding

Token Communication (TokenCom) is a new paradigm, motivated by the recent success of Large AI Models (LAMs) and Multimodal Large Language Models (MLLMs), where tokens serve as unified units of communication and computation, enabling efficient semantic- and goal-oriented information exchange in future wireless networks. In this paper, we propose a novel Video TokenCom framework for textual intent-guided multi-rate video communication with Unequal Error Protection (UEP)-based source-channel coding adaptation. The proposed framework integrates user-intended textual descriptions with discrete video tokenization and unequal error protection to enhance semantic fidelity under restrictive bandwidth constraints. First, discrete video tokens are extracted through a pretrained video tokenizer, while text-conditioned vision-language modeling and optical-flow propagation are jointly used to identify tokens that correspond to user-intended semantics across space and time. Next, we introduce a semantic-aware multi-rate bit-allocation strategy, in which tokens highly related to the user intent are encoded using full codebook precision, whereas non-intended tokens are represented through reduced codebook precision differential encoding, enabling rate savings while preserving semantic quality. Finally, a source and channel coding adaptation scheme is developed to adapt bit allocation and channel coding to varying resources and link conditions. Experiments on various video datasets demonstrate that the proposed framework outperforms both conventional and semantic communication baselines, in perceptual and semantic quality on a wide SNR range.
Read the full abstract

All authors Jingxuan Men, Mahdi Boloursaz Mashhadi, Ning Wang, Yi Ma, Mike Nilsson, Rahim Tafazolli

Combinatorics

Classification of equiangular lines with fixed angle $\arccos(1/(1+2\sqrt2))$

We determine the maximum number $N_\alpha(d)$ of equiangular lines with fixed angle $\arccos\alpha$ for $\alpha = 1/(1+2\sqrt2)$ in $d$-dimensional Euclidean space: $2,3,4,6,8,10,14,15,16,17,18,20,22$ for $d \in \{2,\dots,14\}$, and $\max(24, \lfloor 3(d-1)/2 \rfloor)$ for $d \ge 15$. This appears to be the first complete determination of $N_\alpha(d)$ in all dimensions $d$ for a fixed nontrivial $\alpha$, since the work of Lemmens and Seidel for $\alpha = 1/3$ in 1973.
Read the full abstract

All authors Theodore Gossett, Zilin Jiang, Adam Teets, Zoe Wellner

Numerical Analysis

Error analysis of scalar auxiliary variable finite element methods for the Landau–Lifshitz–Bloch equation

The Landau–Lifshitz–Bloch (LLB) equation is a well-established micromagnetic model for describing magnetisation dynamics in ferromagnets at elevated temperatures. In this paper, we propose and analyse two fully discrete, conforming finite element schemes based on the scalar auxiliary variable (SAV) approach for solving the LLB equation in the high-temperature regime above the Curie point. The first scheme employs a semi-implicit Euler time discretisation, while the second is based on a linearly extrapolated BDF2 method. Both schemes are linear, unconditionally stable with respect to the energy norm, and satisfy a discrete energy law involving the SAV-based energy functional that approximates the true micromagnetic energy. Under suitable regularity assumptions, we establish unconditional energy stability and derive optimal-order error estimates in $\mathbb{L}^2, \mathbb{H}^1$, and $\mathbb{L}^\infty$ norms. To the best of our knowledge, this is the first rigorous error analysis of a fully discrete SAV-based method for a quasilinear vector-valued problem, as well as the first linear, energy-stable scheme for the LLB equation in the high-temperature regime that achieves second-order temporal accuracy. Numerical experiments validate the theoretical convergence rates and compare the efficiency of the proposed schemes with existing methods; additional tests with adaptive time stepping illustrate the behaviour of the SAV-based modified energy in relation to the physical energy.
Read the full abstract

Numerical Analysis

A survey of sampling discretization of integral and uniform norms

This paper surveys recent developments in the sampling discretization of integral and uniform norms for functions in general finite-dimensional spaces. These results generalize the classical Marcinkiewicz-Zygmund inequalities for trigonometric and algebraic polynomials, which play a crucial role in Fourier analysis, interpolation, and approximation theory. We focus on the problem in the broad context of finite-dimensional subspaces, where norms defined by general probability measures are approximated by their discrete counterparts. The primary emphasis is on results closely related to the authors' recent research. A key objective is to highlight the main ideas and techniques that form the foundation of the proofs in this area. This survey serves as a complement to three recently published survey papers on sampling discretization \cite{DPTT, KKLT, LMT}.
Read the full abstract

Functional Analysis

Distributional and mean Li-Yorke chaos for weighted shifts on Fréchet sequence spaces

In this paper, we give characterizations of distributional chaos and mean Li$-$Yorke chaos for weighted backward shifts acting on general Fréchet sequence spaces. As an application, we derive criteria for these two types of chaos in the setting of Köthe sequence spaces $\lambda_p(A,J)$ for $p \in \{0\}\cup [1, \infty)$ and $J=\mathbb{N}$ or $J=\mathbb{Z}$.
Read the full abstract

Analysis of PDEs

Whispering Gallery Modes for Semilinear Dirichlet Eigenvalue Problems

We study the boundary localization phenomenon, known as whispering gallery modes, for weak solutions to semilinear Dirichlet eigenvalue problems in the unit ball $B_1 \subseteq \mathbb{R}^d$ ($d \geq 2$) of the form \[ \begin{cases} -\Delta u + f(u) = \lambda u & \text{in } B_1,\\ u = 0 & \text{on } \partial B_1. \end{cases} \] Here, $f = F'$ where $F$ is a nonnegative $C^2$-function with superquadratic polynomial growth. We prove the existence of a sequence of solutions $(u_n, \lambda_n)$ with $\lambda_n \to +\infty$ such that, for any $\tau \in (0,1)$, \[ \lim_{n \to \infty} \frac{E_\tau(u_n)}{E_1(u_n)} = 0, \] where $E_\rho(u) = \int_{B_\rho} \bigl( \frac{1}{2} |\nabla u|^2 + F(u) \bigr) \, dx$ is the energy over the ball of radius $\rho$. This establishes that the energy of these high-eigenvalue solutions concentrates near the boundary, extending the classical whispering gallery mode phenomenon from linear Laplacian eigenfunctions to the semilinear setting. As a direct application, the case $F(u) = u^4 /4$ yields, after suitable scaling, a sequence of high-eigenvalue boundary-concentrating solutions, providing a nonlinear analogue of whispering gallery modes for the Allen-Cahn equations. The approach combines spectral properties of the linear Laplacian with local nonlinear bifurcation and is expected to adapt to related interior localization phenomena, such as bouncing ball modes, in other geometries where linear eigenfunctions exhibit analogous localization behaviors (e.g., filled ellipses or elliptical annuli).
Read the full abstract

Mathematical Physics

Multi-dimensional consistency of principal binets

Principal binets are a discretization of curvature line parametrized surfaces defined on the vertices and faces of the square lattice $\Z^2$. They generalize the previously established discretizations given by circular nets, conical nets, and principal contact element nets. We show that principal binets constitute a discrete integrable system in the sense of multi-dimensional consistency. In particular, they generalize to higher-dimensional square lattices $\Z^N$. We also discuss relations to the notion of discrete orthogonal coordinate systems as previously established for discrete confocal quadrics.
Read the full abstract

Functional Analysis

Li-Yorke chaotic weighted composition operators on Hardy and Bergman spaces over the unit disk

We study Li–Yorke and mean Li–Yorke chaos for weighted composition operators $C_{w,\varphi}$ on Banach spaces of analytic functions on the unit disk $\mathbb{D}$. Under natural conditions on the space, we show that $C_{w,\varphi}$ is (densely) Li–Yorke chaotic if and only if it is not power-bounded, and (densely) mean Li–Yorke chaotic if and only if it is not absolutely Cesàro bounded. These results are applied to Hardy spaces $H^p(\mathbb{D})$, $1 \le p \le \infty$, and weighted Bergman spaces $A^p_\beta(\mathbb{D})$, $-1 < \beta < \infty$ and $1 < p < \infty$.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Dimension-Independent Convergence of Underdamped Langevin Monte Carlo in KL Divergence

Underdamped Langevin dynamics (ULD) is a widely-used sampler for Gibbs distributions $\pi\propto e^{-V}$, and is often empirically effective in high dimensions. However, existing non-asymptotic convergence guarantees for discretized ULD typically scale polynomially with the ambient dimension $d$, leading to vacuous bounds when $d$ is large. The main known dimension-free result concerns the randomized midpoint discretization in Wasserstein-2 distance (Liu et al.,2023), while dimension-independent guarantees for ULD discretizations in KL divergence have remained open. We close this gap by proving the first dimension-free KL divergence bounds for discretized ULD. Our analysis refines the KL local error framework (Altschuler et al., 2025) to a dimension-free setting and yields bounds that depend on $\mathrm{tr}(\mathbf{H})$, where $\mathbf{H}$ upper bounds the Hessian of $V$, rather than on $d$. As a consequence, we obtain improved iteration complexity for underdamped Langevin Monte Carlo relative to overdamped Langevin methods in regimes where $\mathrm{tr}(\mathbf{H})\ll d$.
Read the full abstract

All authors Shiyuan Zhang, Qiwei Di, Xuheng Li, Quanquan Gu

Optimization and Control · Cross-listed from stat.ML

Mini-Batch Covariance, Diffusion Limits, and Oracle Complexity in Stochastic Gradient Descent: A Sampling-Design Perspective

Stochastic gradient descent (SGD) is central to simulation optimization, stochastic programming, and online M-estimation, where sampling effort is a decision variable. We study the mini-batch gradient noise as a sampling-design object. Under exchangeable fresh-sampling mini-batches, the conditional covariance given the de Finetti directing measure mu is b^{-1} G_mu(theta), and under identifiability the projected population object is b^{-1} G*(theta) – projected Fisher information for correctly specified likelihoods, the sandwich partner of the Hessian otherwise. This identification fixes the noise matrix entering the diffusion analysis of constant-step SGD: the raw iterate path has a deterministic fluid limit, and the sqrt(b/eta)-scaled fluctuations satisfy a functional CLT with noise covariance G*; near a nondegenerate optimum the limit is Ornstein-Uhlenbeck, and its Lyapunov covariance scaled by eta/b matches the linearized discrete recursion at leading order. Under a curvature-noise compatibility condition mu_F > 0, we prove 1/N mean-square upper bounds and an i.i.d. parametric Fisher van Trees lower bound of the same rate order, with oracle-complexity guarantees depending on an effective dimension d_eff and condition number kappa_F. Numerical experiments verify the identification and confirm the Lyapunov predictions in direct SGD.
Read the full abstract

Geometric Topology

Tight Bounds for Tight Links: Ropelength of T(Q,Q) torus links

Ropelength, L, is a parameter characterizing the minimum contour length of a knot or link. There exist upper and lower bounds on ropelength with respect to crossing number, C, including a universal lower bound constraining $L\geq\alpha_0 C^{3/4}$ for some constant $\alpha_0$. There is currently an order-of-magnitude range for the value of $\alpha_0$ between 1.105 and 10.76. In this work, we show that T(Q,Q) torus links can be constructed such that the upper bound is within a factor of 1.77 of the lower bound. We derive a stronger lower bound based on the convex hull around close-packed disks of approximately $\alpha_{T_{QQ}}>\sqrt{8\pi\sqrt{3}}+(2\pi+\sqrt{2\pi+7\sqrt{3}-12}\ )Q^{-1/2}\approx6.60+7.61Q^{-1/2}$, significantly higher than the best universal lower bound of 1.105. We show that a link can be constructed without any free parameters or geometric optimization that, when $Q$ is large, has a coefficient $\alpha_{T_{QQ}}<1.005\cdot 4\pi(5\sqrt{5}-8)/3\approx13.39$, and can be improved to to 11.68 by solving a helical no-overlap constraint equation that requires a conjectural approximation. For $Q$ up to 20 we construct links from smooth planar curves or toroidal helices minimized with respect to a small number of geometric parameters, that are between 6 and 60% greater in ropelength than the lower bound. Many such links can be annealed to within 10% of the lower bound using gradient descent. This represents significant progress towards developing sharp bounds on the ropelengths of specific classes of knots and links.
Read the full abstract

Dynamical Systems

Invariant Curves and the Variational Structure in Tubular Origami Dynamical Systems

We present a theoretical and numerical dynamical-systems analysis of tubular origami tessellations by identifying the inverse module number, $N^{-1}$, as a perturbation parameter within the framework of Kolmogorov–Arnold–Moser (KAM) theory. In the large-module limit ($N \to \infty$), we show that the conservative dynamics formally converges to an integrable map with a variational structure, whose generating function corresponds to the total discrete mean curvature. From the viewpoint of KAM theory, nonresonant invariant curves of the integrable limit are expected to persist for sufficiently large $N$. Consistent with this expectation, numerical computations with increasing $N$ show that large regions of the phase space are filled with structures that appear to be invariant curves. By adjusting mountain-valley fold assignments and fold lengths, the system can be transformed into a nontwist map that exhibits multiple zero frequencies. The frequency profile in the integrable limit and the persistence of invariant curves allow us to control the number and arrangement of stable folding regions appearing as coexisting elliptic islands. These islands provide a phase-space interpretation of distinct folding modes, separated by invariant curves that act as geometric barriers to continuous deformation and obstruct transitions without self-intersection. Finally, we analyze the expanding and contracting dynamics of the origami structure within the framework of conformally symplectic systems. By introducing a virtual auxiliary fold as a drift control mechanism, we numerically confirm the existence of stable quasi-periodic attractors.
Read the full abstract

Optimization and Control

Stochastic Optimization for Resource Adequacy in Capacity Markets with Storage and Renewables

The integration of storage and renewable resources fundamentally alters resource-adequacy analysis. Because storage couples decisions across time, it invalidates the traditional reliability models that are based on time-independent capacity demand curves. Moreover, renewables introduce temporally correlated intermittency. To address this, we formulate the capacity procurement problem as a two-stage stochastic program, where the capacity decision is made in the first stage, while the expected unserved energy is evaluated by a second-stage dispatch problem that considers uncertainties such as generator failures via Markov chains, temporally correlated renewable output, and stochastic load. We implement the resulting stochastic capacity procurement (SCP) model on a New England system with 305 generators, including conventional, renewable, and storage units. Using the stochastic decomposition (SD) algorithm, we solve the SCP with up to 20,000 Monte Carlo samples, each representing a six-month trajectory of more than 4,300 hours of uncertainty across all units. We analyze the convergence behavior of SD and show that convergence for the stochastic program happens faster than reliable estimation of the reliability metrics, which require more samples than are used in typical stochastic programs. These results show that chronologically detailed Monte Carlo sampling can be integrated into capacity procurement optimization in a computationally tractable manner, enabling reliability evaluation with controlled statistical accuracy at realistic system scales.
Read the full abstract

All authors Baptiste Rabecq, Andy Sun, Feng Zhao, Tongxin Zheng, Xiaochu Wang, Yufan Zhang

Analysis of PDEs

Discrete wave turbulence for a coupled system of quintic Schrödinger equations

We derive rigorously the non-linear macroscopic system associated to a microscopic system of coupled quintic Schrödinger equations in the framework of discrete wave turbulence under a particular scaling law that describes the limiting process. Our system evolves from a pair of well-prepared random initial data. More precisely, in dimensions $d\geq2$, we set up our microscopic system on a large box of size $L$ with weak non-linearity of strength $\epsilon$. In the limit $L\to\infty$ and $\epsilon\to0$, under the scaling law $\epsilon L^{\frac{1}{\beta}}=1$ with $\beta\in(1,\infty)$, we prove that the long-time behaviour of our microscopic system is statistically described up to times $\delta\epsilon^{-1}$ by a non-linear resonant system whose dynamics are driven by exact resonances, where $\delta$ is independent of $L$ and $\epsilon$. Our system does not display generic symmetries, in particular not mass conservation. In such systems with fewer invariances, exact resonances contribute significantly compared to quasi-resonances and are essentially responsible for the effective dynamics in the large-box limit. We justify the emergence of discrete wave turbulence for our microscopic model.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Universality classes, Thermodynamics of Group Entropies, and Black Holes

Conventional Boltzmann–Gibbs statistical mechanics successfully describes systems with weak to moderate correlations, in which the number of accessible configurations $W(N)$ grows exponentially with the number of degrees of freedom $N$. However, this framework breaks down for systems for which the effectively occupied configuration space exhibits non-exponential growth. While numerous generalized entropies have been proposed to address this limitation, a coherent link to classical thermodynamic laws has remained elusive. Here, we propose group entropies as a unifying framework, defining universality classes of entropies through the asymptotic scaling of $W(N)$, each yielding an extensive entropy. We show that this approach provides the basis for a consistent thermodynamic formulation beyond the Boltzmann–Gibbs paradigm. In particular, by expressing these entropies in terms of thermodynamic state variables, we demonstrate their consistency with classical thermodynamics, in close analogy to the emergence of the Clausius entropy from the Boltzmann–Gibbs formalism. Focusing on the zeroth thermodynamic law, we identify the empirical temperature and, by using Carathéodory's formulation of the second law, we derive the associated absolute temperature. As an application, we analyse black-hole thermodynamics using the extensive group entropy class corresponding to stretched-exponential behaviour of $W(N)$ and derive a negative heat capacity, known to be a hallmark property of black holes. This result holds for the stretched-exponential entropies associated with both the Bekenstein–Hawking and Barrow entropy scalings.
Read the full abstract

Analysis of PDEs

Sharp remainder formulae for general weighted Hardy and Rellich type inequalities for $1<p<\infty$

Inspired by the work of Cossetti and D'Arca [CD25], we show that the general weighted $L^{p}$-Hardy type inequalities [CD25, Theorems 1.1 and 1.2] and the corresponding identities hold for all $1<p<\infty$, thus extending their results beyond the case $p\geq 2$. In addition, we present a general weighted $L^{p}$-Rellich type inequality with a sharp remainder term for quasilinear second order degenerate elliptic differential operators. In particular, even for the classical Laplacian, these identities appear to be new.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Analysis of Quartic Potential Problems Using Fredholm Integral Operators with Airy Functions

Fredholm integral operators that commute with the Hamiltonians of certain quantum mechanical systems with quartic potentials are introduced in closed analytical form. The operators are expressed in terms of the Airy function, and their eigenvalues fall off exponentially. Using these operators we obtain an exact dual description in terms of infinite one-dimensional chains. The systems discussed include the anharmonic quartic oscillator as well as multivariable potentials and higher dimensional systems. We compute a few moments of the Fredholm operators, using matrix models in the higher dimensional case, and we show how those can be used to approximate the energy spectrum and obtain estimates of the asymptotic behavior of the wavefunctions.
Read the full abstract