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)

Friday 15 May

Mathematical Physics · Cross-listed from quant-ph

Exact classical emergence from high-energy quantum superpositions

We examine the correspondence principle for an equiprobable superposition of high-energy eigenstates of the infinite square well using a fully analytical Fourier-based approach. We derive a closed-form asymptotic expression for the interference terms $\rho_{\alpha}^{\text{a}}(x)$ by expanding them into a geometric series of quantum Fourier coefficients. We show these terms act as functional envelopes that do not vanish individually but become asymptotically equivalent in the large-$n$ limit. Furthermore, we prove the total probability density for a superposition of $2\Delta+1$ states converges exactly to the uniform classical distribution as $\Delta \to \infty$. Dynamically, the expectation value of position reproduces the classical triangular trajectory asymptotically. Residual quantum deviations remain confined to boundary layers whose relative width vanishes under macroscopic resolution. These results establish a rigorous asymptotic realization of the classical limit for isolated bound systems in both static and dynamical contexts.
Read the full abstract

All authors Juan A. Cañas, Daniel A. Bonilla, J. Bernal, A. Martín-Ruiz

Combinatorics

Diameters and mixing times for giant components of random graphs with given degrees

A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence. We consider sequences $\{D_\ell\}_{\ell \geq 1}$ of feasible degree sequences which have a giant component. We show that with high probability this giant component is unique, and bound its diameter and the mixing time of the random walk on it. We also bound the size and diameter of the other components and show that many of these bounds are tight.
Read the full abstract

Analysis of PDEs

Sharp Ill-Posedness of the Euler Equations in Lorentz Spaces

We study vortex stretching for the three-dimensional axisymmetric Euler equations without swirl in vorticity formulation. Danchin (2007) established global existence and uniqueness for bounded vorticity $\omega_0$ provided $\omega_0/r$ lies in the endpoint Lorentz space $L^{3,1}(\mathbb{R}^3)$ (together with a decay assumption on $\omega_0$). We prove that this $L^{3,1}$ endpoint is sharp: for every Lorentz exponent $q>1$, we construct multi-ring data $\omega_0 \in L^\infty (\mathbb{R}^3)$ with $\omega_0/r\in L^{3,q}(\mathbb{R}^3)$ that produce $L^\infty$-norm inflation of the vorticity; moreover, within the same class, we obtain instantaneous blow-up from data with infinitely many rings. Our initial data are inspired by the Kim–Jeong dyadic ring superposition (2022), but we crucially generalize it by allowing flexible conical support geometry for the ring profile. In the regime where outer rings are dominant – a multiscale viewpoint appearing in recent works including Kim–Jeong (2022) and Cordoba–Martinez-Zoroa–Zheng (2025) – we obtain a forward-in-time ODE cascade for ring amplitudes and aspect ratios in which vortex stretching weakens its own future forcing: as a ring amplifies, incompressibility flattens it, the aspect ratio collapses, and the induced stretching coefficient is geometrically depleted. A key new ingredient is a profile-localization argument that freezes the relevant Biot–Savart kernel and makes this depletion explicit, enabling us to exploit a monotone "productive window" (controlled by the cone slope) together with an exact cascade identity. This propagates stretching across scales and gives a robust lower bound on cumulative stretching, yielding ill-posedness in the full range $q>1$.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Dynamical quasinormal mode excitation II: propagation and convergence in Schwarzschild

We study the dynamical excitation of quasinormal modes (QNMs) during the plunge of a particle into a Schwarzschild black hole, building on the framework of Phys. Rev. D 113 (2026) 2, 024048 (Paper I). Investigating the high-frequency behavior of Leaver's QNM solutions, we obtain a more accurate and general prescription for their propagation. We confirm the existence of a new "characteristic radius" for QNM excitation, the bounce radius $r_*=0$, in agreement with recent literature. To its right, the QNM signal scatters off this point before reaching the observer; to its left, it propagates directly on the light-cone. Applying the formalism of Paper I to inspiralling particles, and using this refined prescription, we obtain a QNM signal that accurately reproduces the oscillatory component of the waveform after the bounce crossing, yielding an essentially complete first-principles description of the waveform from shortly after the signal peak. The dynamical QNM signal undergoes a transition as the particle crosses the bounce radius: from a quasi-resonant regime, where successive overtones are driven in counter-phase and interfere destructively, to a free-oscillator one, where they are in phase and the QNM sum converges rapidly. These results provide a clear physical interpretation of the collective QNM behavior during the plunge, and a firm theoretical foundation for accurate ringdown modelling.
Read the full abstract

All authors Marina De Amicis, Enrico Cannizzaro, Gregorio Carullo, Adrien Kuntz, Laura Sberna

Group Theory

A nonabelian twist on differences of bijections

Hall's theorem on differences of bijections characterizes the multisets $$ \{a_1,\ldots,a_{|G|}\} $$ in a finite abelian group $G$ that can be written in the form $$ a_i=b_i-c_i, $$ where both $b_1,\ldots,b_{|G|}$ and $c_1,\ldots,c_{|G|}$ are enumerations of $G$. The necessary and sufficient condition is the zero-sum condition $$ a_1+\cdots+a_{|G|}=0. $$ This paper studies the corresponding problem for finite nonabelian groups, with differences replaced by quotients. Thus we ask when a multiset $A$ of cardinality $|G|$ can be represented as $$ A=\{b(i)c(i)^{-1}:1\le i\le |G|\}, $$ where $b$ and $c$ are bijections onto $G$. Passing to the abelianization gives a necessary condition, namely that the product of the images of the elements of $A$ is trivial in $ G_{\rm ab}. $ We show that this condition is not sufficient in general, even when the elements of $A$ admit an ordering whose product is the identity in $G$. The main structural result is a cycle-tiling criterion: quotient-realizability is equivalent to a decomposition of $A$ into product-one words whose partial-product sets tile $G$ by right translates. The use of permutation cycles is standard, but the criterion translates quotient-realizability into an exact tiling condition. We then use this criterion to construct a counterexample in $ S_3, $ and we extend the same obstruction to infinitely many finite nonabelian groups.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ML

Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures

Obtaining stable diffusion-based samplers in high- and infinite-dimensional settings is challenging because errors can accumulate across high-frequency coordinates and make the dynamics unstable under refinement of the finite-dimensional approximation of the underlying function-space problem. Discretization is a typical source of such errors, and preconditioning with a suitable spectral decay is one way to control their accumulation. In this paper, we study this problem for preconditioned annealed Langevin dynamics (ALD) applied to Gaussian mixtures. We first show that Euler-Maruyama (EM) discretization, by treating the stiff linear part of the annealed score with a forward Euler step, imposes a stability constraint coupling the preconditioner with the annealed covariance scale. Together with the conditions ensuring dimension-uniform control of the annealed dynamics, this constraint forces the initial smoothed law to remain uniformly close to the target across dimensions. We then consider an exponential-integrator scheme that integrates the stiff linear part of the annealed score exactly. Under explicit spectral summability conditions coupling the smoothing covariance, the component covariance spectra, and the preconditioner, we prove a dimension-uniform Kullback-Leibler (KL) bound for this scheme. This bound can be made arbitrarily small, uniformly in dimension, by allowing enough time for annealing and then refining the time mesh accordingly. Importantly, these conditions allow regimes in which the KL divergence between the target and the initial smoothed law diverges with dimension, showing that the restrictions imposed by EM are scheme-dependent rather than intrinsic to ALD.
Read the full abstract

All authors Lorenzo Baldassari, Josselin Garnier, Knut Solna, Maarten V. de Hoop

Operator Algebras · Cross-listed from quant-ph

Pre-Channel Entanglement Shaping Achieves Fundamental Superiority over Post-Distillation: A Geometric Entropy Perspective

Traditional entanglement distillation follows a post-processing paradigm, a noisy quantum state, after full transmission through a noisy channel, is treated as a static resource to be purified via LOCC (local operations and classical communication). This work demonstrates a fundamentally different paradigm,pre-channel entanglement shaping (PES) – actively engineering the system-environment coupling before or during channel transmission – achieves a level of purification capability that is physically unattainable by any post-distillation protocol. We prove this separation using the framework of geometric entropy (quantum relative entropy to separable states). In post-distillation, the protocol can only select low-entropy sub-ensembles from a fixed mixed state, leaving the global geometric entropy unchanged or increased. In contrast, PES suppresses the rate of geometric entropy production during channel evolution, resulting in a final state whose relative entropy of entanglement strictly exceeds the maximum achievable by post-distillation from the same channel. We provide explicit qubit channel examples, numerical simulations (with complete code in Appendix), and a geometric interpretation on the state manifold. Our result establishes pre-channel entanglement shaping as a distinct operational resource class, with immediate implications for quantum repeaters and entanglement-assisted communication. Very recently, Li et al. experimentally demonstrated that preprocessing the entangling channel with optimally tailored local unitaries achieves entanglement fidelities unreachable by any postprocessing, revealing an intrinsic temporal asymmetry in entanglement distillation~\cite{Li2025}.
Read the full abstract

All authors Gang Lyu, Wenlong Sun, Yuanfeng Jin, Hua Nan

Group Theory

Simple groups with narrow prime spectrum: Extended list

Generalising a previous result, we determine all non-abelian finite simple groups whose order has largest prime divisor not exceeding $10^4$. The computer code for this and similar calculations is made available.

Probability · Cross-listed from q-fin.RM

On the Expected Maximum Deficit and the Optimal Allocation of Reserves

Let $L=(L_s)_{0\le s\le t}$ be a cumulative net-loss process and let $M_t=\sup_{0\le s\le t}L_s$. For a candidate reserve $u$ and a distortion function $g$, define $D_g^{(t)}(u)=\int_u^\infty g(P(M_t>v))d v$. This function measures the tail-weighted residual severity of the largest cumulative loss over the horizon. We derive three monetary risk measures: its value at zero reserve and two measures based on fixed and proportional deficit tolerances. Under a concave distortion, the zero-reserve and proportional-tolerance measures are coherent, while the fixed-tolerance measure is convex. Given a reserve budget distributed among several units, we analyze two allocation criteria: the sum of the units' distorted deficits, which depends only on their marginal distributions, and a distorted expectation of the largest residual unit deficit, which uses their joint distribution. We characterize the optimal allocations and corresponding near-optimal sets. A two-unit exponential benchmark shows that the optimum can be unique and unequal. We then apply both criteria to the Building, Contents and loss-of-Profits components of the public Danish large-fire data. Under the baseline predictive model, both yield interior allocations and localized 0.5%-optimal regions, while sensitivity analyses illustrate model uncertainty. We also provide Monte Carlo estimators, conditional counterparts and a review-date allocation formulation.
Read the full abstract

Probability

Analysis of a twisted Bose-Einstein Markov chain with applications to sampling Catalan structures

We analyze a twisted Bose-Einstein Markov chain on $[k]^n$ arising from the Diaconis-Zhong twisted Burnside process. We derive explicit formulas for the transition kernel and stationary distribution of both the original chain and its lumped process, and we identify this chain as a special case of Crane's cut-and-paste process. We establish bounds on the mixing time and determine the second-largest eigenvalue of the original chain and its lumped process. Complementing the fixed-$k$ cutoff theorem of Crane and Lalley, our bounds show that both chains mix in $\Theta(\log n)$ steps when $k$ grows as a fixed positive power of $n$. For the non-twisted Bose-Einstein Markov chain, this resolves a conjecture of Diaconis. As an application, we study the Burnside processes on parking functions and labeled Dyck paths, which give novel Markov chain Monte Carlo algorithms for sampling an increasing parking function and a Dyck path, respectively, approximately uniformly at random. We show that these chains are rapidly mixing, with mixing times of $\Theta(\log n)$.
Read the full abstract

Combinatorics

Evaluation of two determinants involving $q$-integers

The $q$-analogue of an integer $m$ is given by $[m]_q=(1-q^m)/(1-q)$. Let $a$ be an integer, and let $n$ be a positive odd integer. Via discrete Fourier transforms, we establish the following two identities: $$\det\left[\left[\left\lfloor\frac{aj-(a+1)k}n\right\rfloor\right]_q\right]_{1\leqslant j,k\leqslant n}=-\left(\frac{a(a+1)}n\right)q^{(1-3n)/2}$$ and $$\det\left[\left[\left\lceil\frac{(a+1)j-ak}n\right\rceil\right]_q\right]_{1\leqslant j,k\leqslant n}=\left(\frac{a(a+1)}n\right)q^{(n-1)/2},$$ where $(\frac{\cdot}n)$ denotes the Jacobi symbol.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Nonlinear stability of continuously self-similar naked singularities for the Einstein-scalar field equations I: main results

This is the first part of a series of papers proving the nonlinear stability of a one-parameter family of continuously self-similar $C^{1,\alpha}$ naked singularity solutions, with $0<\alpha\ll1$, to the spherically symmetric Einstein-scalar field equations. The stability holds for initial perturbations lying in a small open neighborhood of the data generating these naked singularity solutions, measured in a localized Hölder topology. These continuously self-similar naked singularity spacetimes were previously constructed by Christodoulou [D. Christodoulou, Examples of naked singularity formation in the gravitational collapse of a scalar field, Ann. of Math. 140 (1994), 607–653], who also proved their instability to black hole formation under sufficiently rough perturbations [D. Christodoulou, The instability of naked singularities in the gravitational collapse of a scalar field, Ann. of Math. 149 (1999), 183–217], thereby verifying weak cosmic censorship within a rough functional framework. In complete contrast, in this paper, we obtain the first nonlinear stability of these naked singularity spacetimes under general perturbations of the same regularity as the background. We rely on the linearized stability result established in the companion paper [J. Singh and W. Zheng, Nonlinear stability of continuously self-similar naked singularities for the Einstein–scalar field equations II: linearized stability]. Our result underscores the decisive role of the functional framework in formulating the Weak Cosmic Censorship conjecture.
Read the full abstract

Information Theory

Learning from Totally Unpaired Data via Minimum Conditional Entropy Coupling

Consider an "unsupervised classification" setting, where the goal is to learn a predictor of the categorical class variable $X$ using the categorical feature variables $Y_1,\ldots,Y_m$, but we can only train the predictor on $m+1$ totally unpaired datasets, where each dataset only consists of unordered samples of one of the variables $X,Y_{1},\ldots,Y_{m}$. Although this problem is highly underdetermined, we demonstrate that, under the assumption that a predictor with small cross entropy loss exists, we can find a good predictor by coupling the marginal distributions of $X,Y_1,\ldots,Y_m$ in a manner that minimizes the conditional entropy $H(X|Y_1,\ldots,Y_m)$. This problem, which we call minimum conditional entropy coupling (MCEC), is a generalization of the widely studied minimum entropy coupling problem (where $m=1$). Although the MCEC problem is NP-hard, we give an algorithm with a time complexity that is polynomial in $N$, which gives a coupling with conditional entropy within $O(\log \log N)$ from the optimum, where $N$ is the dimension of the output coupling. We also evaluate the performance of the MCEC predictor on synthetic and real-world datasets.
Read the full abstract

Symplectic Geometry

Derived Symplectic Reduction in Differential Geometry

In this article we prove a derived version of the Marsden-Weinstein-Meyer symplectic reduction theorem. We model the symplectic quotient as a dg-groupoid. We then construct the reduced symplectic form inside the Bott-Shulman complex of the groupoid. Finally, we show that the reduced form satisfies a derived analogue of the non-degeneracy condition.
Read the full abstract

Information Theory

Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization

The study of optimal preemption policies for status update systems has been a recurring topic in the age of information (AoI) literature, where threshold-based structures have been shown to be optimal under a generate-at-will update generation model under certain assumptions. In this work, we study the effectiveness of threshold-based policies for a system with random update arrivals. In this regard, we introduce an analytical framework for evaluating the AoI of multi-threshold preemption policies and present interesting characteristics of the structure of the optimal preemption policy. We show the effectiveness of these threshold-based policies over the traditional probabilistic preemption policies and single-threshold policies, where we observe that significant gains in terms of AoI can be obtained by utilizing both the age of the packet and the age of the system when designing these preemption policies.
Read the full abstract

Combinatorics

The Facial Common Neighbourhood Graph

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their adjacency. We then prove that for all other polyhedra, con($G$) is non-planar. We introduce a novel concept for polyhedra (and more generally, for plane graphs) $G$, namely the `facial common neighbourhood graph' facecon($G$). Its definition takes into account pairs of vertices with a common neighbour on the same face of $G$. It is a spanning subgraph of con($G$), that coincides with con($G$) for cubic polyhedra. It also generalises the reverse construction of the radial graph. As part of our investigation, we also prove a technical result of independent interest: if a maximal planar graph (triangulation of the sphere) has exactly two vertices of odd degree, then they are not adjacent. We also answer several questions in extremal graph theory. Fixing the number of vertices, we characterise the polyhedra $G$ such that con($G$) is planar and the number of edges in con($G$) is minimal/maximal. We address the same problem for facecon($G$), and prove that if it is maximal planar, then $G$ has no face of length greater than $6$. We notably characterise and explicitly construct all polyhedra $G$ of maximal face length $4$ such that facecon($G$) is maximal planar.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Non-minimal fluid Lagrangian couplings

Gravitational models with non-minimal couplings involving functions of the matter Lagrangian and curvature have become popular in recent decades. By coupling the matter Lagrangian directly to the gravitational Lagrangian, one hopes to construct theories that can explain dark energy or dark matter without introducing additional sources. When this matter Lagrangian describes a perfect fluid, some technicalities are involved in its variational formulation. We present a careful derivation of the gravitational field equations together with the complete set of fluid equations using two approaches: Schutz's velocity potential and Brown's Lagrange multipliers. We find that with non-minimal couplings, the energy-momentum conservation equations give rise to a non-vanishing contribution which acts in a different direction depending on the approach. This also leads to the emergence of different effective thermodynamic quantities such as the number density, chemical potential, free energy, and temperature. We demonstrate the non-equivalence of the Lagrangian formulations of Schutz and Brown for these types of models and provide a detailed interpretation of our results.
Read the full abstract

Number Theory

Extensions of the Furstenberg-Sárközy theorem via the arithmetic level-$d$ inequality

Green and Sawhney recently obtained a quasipolynomial bound in the Furstenberg–Sárközy theorem for square differences by proving an “arithmetic level-d” inequality, thereby yielding a greatly improved density increment scheme. We apply their method to treat general intersective polynomials $h\in\mathbb{Z}[x]$. In particular, let \[ D(h(\mathbb{N}),X):= \max{|A|:\ A\subseteq [1,X]\cap\mathbb{N} \text{and}\ (A-A)\cap h(\mathbb{N})\subseteq\{0\}}. \] We prove that for every $0<\mu<1/2$ there are constants $c_0, X_{\text{min}}>0$ depending on $h$ and $\mu$ such that for every $X>X_{\text{min}}$, \[D(h(\mathbb{N}), X)\leq Xe^{-c_0(\log X)^\mu}.\] This is the best quantitative upper bound presently known for sets lacking intersective polynomial differences, improving upon the work of Arala. In order to achieve the admissible exponent range $0<\mu<1/2$, we use sieve methods to develop novel exponential sum estimates in the style of Rice, and we use the “random sparsification” procedure of Green and Sawhney.
Read the full abstract

All authors Carlo Francisco E. Adajar, Rishika Agrawal, Mukul Rai Choudhuri, Chian Yeong Chuah, Steve Fan, Swaroop Hegde, Andrew Lott, Krishnamohan Nandakumar, Nagendar Reddy Ponagandla

Dynamical Systems · Cross-listed from cs.LG

Hypothesis-driven construction of mesoscopic dynamics

Traditional scientific modeling typically begins with fixed, instance-wise effective equations and then carries out equation-specific analysis and computation, a procedure that becomes exceptionally challenging in complex applications such as multiscale systems. We propose an alternative paradigm by learning mesoscopic dynamics within a mathematically constrained hypothesis class. Building upon a generalized Onsager principle, we introduce a unified framework encompassing both dissipative and conservative mesoscopic dynamics. We establish uniform and a priori theoretical guarantees, including global well-posedness, asymptotic stability, unique factorization identifiability, and discrete energy dissipation, applicable to all spatio-temporal evolution equations within this hypothesis class prior to all learning stages. Data from each problem instance is then used to guide the identification of members within our hypothesis class, giving rise to accurate, robust and interpretable dynamical models. We empirically validate this framework on both data from continuum PDE models as a check, and on data arising from microscopic chain models for which exact meso-scale models are unknown. The proposed approach not only acts as an effective dynamics learner, but also offers vital interpretable diagnostics of the underlying physics.
Read the full abstract

Dynamical Systems

The Wolf and the Cello: Modelling and design of multiple resonance suppressors in large string instruments

The wolf note is an acoustic instability that occurs in large bowed string instruments when a strong body resonance interacts with the vibrating string, producing amplitude modulation and loss of tonal control. Various wolf suppressors - tuned mass dampers attached to the string or to the instrument body - are used in practice to mitigate this effect. In this paper, we propose a mathematical model describing the coupled dynamics of a string and a two-dimensional body equipped with one or two wolf suppressors. Both string and body include elastic (second-order) and stiffness (fourth-order) contributions and can be excited either by plucking or bowing. Three performance indicators are introduced: The first one perceives the wolf-tone appearance, the second one quantifies the attenuation of the notes possibly caused by the wolf suppressor, and the third one measures the acoustic fidelity (in terms of spectrum) with respect to the original instrument. The proposed numerical tests give insights about optimal tuning and placement of one or two suppressors, achieving effective wolf-note suppression while preserving as much as possible the global tonal balance.
Read the full abstract

Spectral Theory

Discrete Mixed Quantization

In this paper, we develop a mixed quantization technique for graph vector bundles and apply it to several asymptotic spectral problems, including the Alon-Boppana bound, the Kesten-McKay law, asymptotic determinant, quantum ergodicity, zero divisor convergence, and Ramanujan vector bundles.
Read the full abstract

Information Theory

Fundamental Performance Limits of Non-Coherent ISAC: A Data-Aided Sensing Perspective

In this paper, we investigate a bistatic multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system over block-fading channels, focusing on the scenario where the sensing and communication receivers (Rxs) are co-located. Under the assumption of unknown channel state information (CSI) at the Rx, two schemes are considered: pilot sensing (PS) and data-aided sensing (DAS). The communication rate-sensing distortion functions for both schemes are characterized. For the DAS scheme, a closed-form asymptotic expression for the sensing distortion is derived by using random matrix theory (RMT). The asymptotic performance analysis explicitly quantifies the significant gains of the DAS scheme, revealing a strict $3$ dB effective SNR improvement in the low-SNR regime and a strictly faster performance scaling rate in the high-SNR limit compared to the PS scheme.
Read the full abstract

All authors Dongsheng Peng, Chengkai Zhao, Yihong Li, Zhiqing Wei, Jun Chen, Ping Chen

Optimization and Control · Cross-listed from eess.SY

Watts vs. Bytes: Turning Data Centers into Grid Assets via Storage Compute Co-Optimization

Data center interconnections increasingly face tighter peak-demand and ramp-rate limits while being expected to support grid operations. Satisfying these requirements calls for coordinated computing and energy controls, yet their joint operational and economic implications remain poorly understood. To tackle this problem, we formulate a robust day-ahead co-optimization of computing load scheduling, server dynamic voltage and frequency scaling (DVFS), and co-located battery energy storage system (BESS) dispatch. The resulting mixed-integer linear program hedges against uncertainty in fixed load and ancillary service deployment while enforcing interconnection limits on peak demand and ramp rate, ancillary service capacity commitments in reserve and flexible ramping, and workload execution constraints. Case studies using CAISO and PJM market data of a 100~MW data center with a 36~MWh/12~MW BESS show that workload scheduling, DVFS, and storage provide complementary flexibility. Under binding peak-load limits, increasing the schedulable workload share reduces mean daily operating cost by up to 20.7%, and the daily value of storage more than doubles relative to operation under less restrictive limits. Under normal conditions, optimal BESS sizing is driven more by capital cost and cycling allowance than by energy duration alone. An 8~MW aggregate ancillary service commitment increases operational cost by only 0.4%, whereas reserve-only requirements become infeasible at commitments as small as 4~MW. These findings show that coordinated computing and storage controls can support grid services economically under binding interconnection constraints while protecting workload delivery.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Non-Invertible Symmetries in Compactified Supergravities

We study the Kaluza–Klein descent of non-invertible higher-form symmetry defects from eleven-dimensional Supergravity to Type IIA Supergravity. Starting from the eleven-dimensional construction of non-invertible Supergravity defects, we show that the full defect, including its auxiliary topological sector, admits a pushforward along the M-theory circle in the zero-mode Supergravity regime. The seven-dimensional Chern–Simons-like auxiliary theory descends to a six-dimensional \(BF\)-type sector. We also show that the compactification of the eleven-dimensional Bianchi sector splits into an invertible \(H_{[3]}\)-sector and a twisted non-invertible \(\widetilde F_{[4]}\)-sector, controlled by \(d\widetilde F_{[4]}+H_{[3]}\wedge F_{[2]}=0\). The resulting Type IIA defect algebra contains both an invertible Picard subgroup and non-invertible \(BF\)-dressed defects, with charged probes identified through the standard M-theory/Type IIA brane dictionary.
Read the full abstract

Analysis of PDEs

Asymptotic profiles and large-time behavior for 3D micropolar fluid equations with possibly vanishing spin viscosity

We consider 3D micropolar flows with possible vanishing spin viscosity and investigate the decay of the energy for large times. We compute first the exact $L^2$-asymptotic profile, as $t\to+\infty$, for solutions to the linear 3D micropolar equations, up to the second order. For the nonlinear micropolar system, we first establish the existence of restricted Leray solutions. This new notion of solutions is required because it is not known whether the weak finite energy solutions verify a strong energy inequality. Next, we study the large-time behavior of restricted Leray solutions, and prove that they behave asymptotically in $L^2$ like their linear counterpart, up to the critical algebraic decay rate $O(t^{-5/2})$ for the energy. Applying a remarkable linear enstrophy identity, we show that the microrotation field exhibits faster decay in $L^2$ than the velocity field, allowing us to impose our hypothesis on the velocity field only and not on the angular velocity.
Read the full abstract

All authors Lorenzo Brandolese, Pablo Braz e Silva, Adriana Valentina Busuioc, Dragos Iftimie, Cilon F. Perusato

Information Theory

How Far Back in Time a Digital Twin Reflects the State of the Physical Object: Age of Staleness

The groundbreaking metric age of information (AoI) has been introduced to measure information freshness in communication networks. As transformational as it is, AoI metric falls short in some applications, such as remote monitoring, since it is a semantic-agnostic metric which does not consider the dynamics of the random process. There is a need to quantify the performance of a remote estimator via a metric that combines freshness and semantic aspects. To this end, in this paper, we introduce a novel metric coined age of staleness (AoS) that measures when the last time that the current estimation was correct. First, we analyze a simple scenario where an $n$-ary symmetric Markov source is observed by a monitor via a constant sampling rate, obtain a closed-form expression for the AoS, and show that it is a monotonically decreasing function of the sampling rate. Next, we consider multiple distinct Markov sources, and formulate an optimization problem, where the remote monitor allocates the total sampling rate to tracking the sources. Although the optimization problem is non-convex, its structure is suitable for obtaining a near-optimal solution using the polyblock algorithm, which leverages the monotonicity of the objective function. While the new AoS metric could be applicable in many scenarios, we believe it is particularly well-suited for a digital twin network (DTN) where multiple physical objects (POs) are monitored with a total sampling rate constraint to maintain a digital representation of them, namely, their digital twin (DT).
Read the full abstract

Dynamical Systems

A multi-objective optimization framework for sustainable transitions

Achieving a just and sustainable transition requires the pursuit of multiple social and environmental targets. Two primary barriers impede this process: (1) targets are often in conflict with each other, and (2) policies aimed at these targets are commonly planned in isolation, neglecting complex interdependencies in the system. To address these challenges, we propose a general modeling framework that evaluates the holistic impact of policies and decision-making on sustainability targets while capturing system interdependencies in a policy-target network. Inspired by Kauffman's NK fitness landscape, our framework takes the form of a multi-objective optimization model that employs a dynamic evolutionary algorithm in conjunction with network analysis. Our algorithm accounts for tradeoffs between conflicting targets by dynamically reallocating resources to the most impactful and efficient policies. One key finding indicates that increasing resources generally enhances performance, but marginal gains stagnate at a point of diminishing returns. Sensitivity analysis reveals that the system is primarily driven by three factors: budget constraint, network density (interconnectivity), and policy efficacy. This study serves as a foundational step towards developing a decision-support tool that assists policymakers in achieving optimal outcomes for problems with a large number of dynamically interacting targets.
Read the full abstract

All authors Cris R. Hasan, Luigi Cao Pinna, John Crawford, Stuart Kauffman, Roger Koppl, Jonathan Lee, Demival Vasques, Edward Weinberger

Analysis of PDEs

On the Role of the Viscosity Parameters in the Large Time Asymptotics of 2D Micropolar Flows

We investigate the role of the four viscosity parameters, in fluids where the particles possess a microstructure (micropolar flows) and are allowed to rotate in a two-dimensional setting. We first establish the existence of global finite energy solutions, satisfying the classical energy equality, for arbitrary initial data in $L^2$, in the case of a spin viscosity $\gamma\ge0$, and we construct the asymptotic profiles of the solution as $t\to+\infty$. We deduce the remarkable fact that the large time behavior only depends on the kinematic viscosity $\mu$, and not on the other parameters $\chi$ (vortex-viscosity), $\gamma$ (spin viscosity) and $\kappa$ (gyroviscosity) of the model. Our primary tool is a new enstrophy-like identity of independent interest, involving the difference between the fluid vorticity and the micro-angular velocity. Another consequence of our analysis is the identification of scenarios where the presence of micro-rotational effects significantly enhances dissipation, thereby slowing down the fluid motion at large times.
Read the full abstract

All authors Lorenzo Brandolese, Adriana Valentina Busuioc, Dragos Iftimie, Cilon F. Perusato

Probability

Deconfinement For $\mathrm{SO}(3)$ Lattice Yang-Mills at Strong Coupling

We make rigorous the physics prediction that lattice Yang-Mills theories with gauge groups which have trivial centers do not satisfy Wilson's criterion for quark confinement. Specifically we prove that $\mathrm{SO}(3)$ lattice Yang-Mills theory does not satisfy Wilson's criterion in a strong coupling regime.
Read the full abstract