Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 11 May

Information Theory · Cross-listed from stat.ML

Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data

We study sparse recovery when observations come from mixed-quality sources: a small collection of high-quality measurements with small noise variance and a larger collection of lower-quality measurements with higher variance. For this heterogeneous-noise setting, we establish sample-size conditions for information-theoretic and algorithmic recovery. On the information-theoretic side, we show that it is sufficient for $(n_1, n_2)$ to satisfy a linear trade-off defining the Price of Quality: the number of low-quality samples needed to replace one high-quality sample. In the agnostic setting, where the decoder is completely agnostic to the quality of the data, it is uniformly bounded, and in particular one high-quality sample is never worth more than two low-quality samples for this sufficient condition to hold. In the informed setting, where the decoder is informed of per-sample variances, the price of quality can grow arbitrarily large. On the algorithmic side, we analyze the LASSO in the agnostic setting and show that the recovery threshold matches the homogeneous-noise case and only depends on the average noise level, revealing a striking robustness of computational recovery to data heterogeneity. Together, these results give the first conditions for sparse recovery with mixed-quality data and expose a fundamental difference between how the information-theoretic and algorithmic thresholds adapt to changes in data quality.
Read the full abstract

Optimization and Control

Handicap reduction for linear complementarity problems

Linear Complementarity Problems (LCPs) with sufficient matrices form an important subclass of LCPs, and it remains a significant open question whether problems in this class can be solved in polynomial time. Kojima, Megiddo, Noma, and Yoshise gave an Interior Point Algorithm (IPA) in 1991, that can solve LCPs with sufficient matrices in time bounded polynomially in the input size and the so-called handicap number $\hat\kappa(M)$ of the coefficient matrix $M$. However, this value can be exponentially large in the bit encoding length. In fact, no upper bounds were previously known on $\hat\kappa(M)$. Settling an open question raised in de Klerk and E.-Nagy (Math Programming, 2011), we give an exponential upper bound on $\hat\kappa(M)$ in the bit-complexity of $M$. This is based on a new characterization of sufficient matrices. The new characterization also leads to a simple new proof of Väliaho's theorem on the equivalence of sufficient and $\mathcal{P}^*$-matrices (Linear Algebra and its Applications, 1996). Noting that one can obtain an equivalent LCP by rescaling the rows and columns by a positive diagonal matrix, we define $\hat\kappa^\star(M)$ as the best possible handicap number achievable under such rescalings. Our second main result is an algorithm for LCPs with sufficient matrices, where the running time is polynomially bounded in the input size and in the optimized value $\hat\kappa^\star(M)$. This algorithm is based on the observation that the set of near-optimal row-rescalings forms a convex set. Our algorithm combines the Ellipsoid Method over the set of row rescalings, and an IPA with running time dependent on the handicap number of the matrix. If the IPA fails to solve the LCP in the desired running time, it provides a separation oracle to the Ellipsoid Method to find a better rescaling.
Read the full abstract

Mathematical Physics

A Simplicial Approach to Higher Geometric Quantization

This paper develops a unified framework for observables in n-plectic geometry, extending the L_infty-algebra of Hamiltonian (n-1)-forms to Hamiltonian forms of all degrees via a degree-shifting Grassmann variable u that encodes submanifold codimension. Interpreting k-form observables as k-dimensional topological defects yields a recursive gluing construction that assembles into a semi-simplicial set sOb_bullet(M), which we prove satisfies the Kan filling property, thereby providing an n-groupoid model for observables. From this semi-simplicial perspective we extract cohomological invariants and construct a recursive inner product leading to a categorified pre-n-Hilbert space. The hierarchical structure of polarizations yields a natural quantization scheme matching the 1-polarization classification of multisymplectic geometry. The resulting framework bridges higher algebraic structures with higher categorical geometry and establishes a systematic foundation for the geometric quantization of extended objects.
Read the full abstract

Mathematical Physics

Local topological order, Haag duality, and reflection positivity

In our previous article [arXiv:2307.12552], we introduced local topological order (LTO) axioms for abstract quantum spin systems which allow one to access topological order via a boundary algebra construction. Using the LTO axioms, we produced a canonical pure state on the quasi-local algebra, which gives a net of von Neumann algebras associated to a poset of cones in $\mathbb{R}^n$. In this article, motivated by [arXiv:2509.23734], we introduce an axiom for LTOs which ensures Haag duality for cone-like regions using Tomita-Takesaki theory. We prove this axiom is satisfied for all known topologically ordered commuting projector models. We thus get an independent proof of Haag duality for the Levin-Wen string net models originally proved in [arXiv:2509.23734]. We also give a reflection positivity axiom for LTOs, connecting to the recent article [arXiv:2510.20662]. We again prove this axiom is satisfied for all known topologically ordered commuting projector models about some $\mathbb{Z}/2$-reflection symmetry.
Read the full abstract

Group Theory

On asymptotic approximate groups in nilpotent groups

Let $G$ be a group and let $A\subseteq G$ be non-empty. We call $A$ an asymptotic $(r,l)$-approximate group if, for a fixed dilation factor $r$, the larger product sets $A^{hr}$ can, for all sufficiently large $h$, be covered by a bounded number of left translates of $A^h$, with the bound $l$ independent of $h$. We show that, in virtually nilpotent groups, finite sets whose powers contain a symmetric word ball of radius comparable to $h$ are asymptotic approximate groups. We also prove a nonabelian semilinear-set analogue for certain infinite sets in these groups.
Read the full abstract

Information Theory

Scalable Mamba-Based Message-Passing Neural Decoder for Error-Correcting Codes

Forward error correction is essential for reliable communication over noisy channels. Attention-based model-free neural decoders have shown strong performance for short codes, but their scalability to longer codes is limited by the quadratic memory and computational cost of attention. In this paper, we introduce the Mamba message-passing decoder (MMPD), an attention-free syndrome-based neural decoder for binary linear codes. MMPD retains the Tanner-graph structure of a message-passing decoder by performing local pairwise aggregation along variable-check edges. To enable efficient long-range information propagation, these local updates are combined with bidirectional Mamba state-space blocks. By avoiding dense attention matrices, MMPD scales more favorably for long codes in both memory and computation. Experiments on the (1056, 880) LDPC code show that MMPD achieves a 0.45 dB gain over the state-of-the-art CrossMPT decoder at a specified target bit error rate, while reducing memory consumption by a factor of 1.5. This reduction factor increases substantially for longer codes, demonstrating the applicability of MMPD to scalable neural decoding of practical long codes.
Read the full abstract

All authors Rostislav Gusev, Nikita Aleksandrov, Artem Solomkin, Dmitry Artemasov

Number Theory

$p$-adic Congruences of Generalized Euler Numbers and Relations to Even Zeta Values

Generalized Euler numbers have previously been studied mainly from a combinatorial viewpoint. The purpose of this paper is to explore them from $p$-adic and analytic perspectives. To this end, we introduce congruential Euler numbers, a new family extending generalized Euler numbers. We establish several $p$-adic congruences for these numbers, including an answer to a conjecture related to Lehmer numbers. Furthermore, using complex analytic methods, we derive expressions for even zeta values in terms of congruential Euler numbers. These results suggest that certain types of these numbers may possess connections with arithmetic or analytic structures beyond their purely combinatorial role as generalizations of Euler-type numbers.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework

In this work, we show that natural policy gradient, a core algorithm in reinforcement learning, admits an exact formulation as a smoothed and averaged form of policy iteration. Specifically, we introduce doubly smoothed policy iteration (DSPI), a Bellman-operator framework in which each policy is obtained by applying a regularized greedy step to a weighted average of past $Q$-functions. DSPI includes policy iteration, dual-averaged policy iteration, natural policy gradient, and more general policy dual averaging methods as special cases. Using only monotonicity and contraction of smoothed Bellman operators, we prove distribution-free global geometric convergence of DSPI. Consequently, standard natural policy gradient and policy dual averaging achieve an iteration complexity of $\mathcal{O}((1-\gamma)^{-1}\log((1-\gamma)^{-1}\epsilon^{-1}))$ for computing an $\epsilon$-optimal policy, without modifying the MDP, adding regularization beyond the mirror map inherent in the update, or using adaptive, trajectory-dependent stepsizes. For the unregularized greedy case, corresponding to dual-averaged policy iteration, we also prove finite termination. The same Bellman-operator framework further extends to discounted MDPs with linear function approximation and stochastic shortest path problems.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

A Spectral Framework for Closed-Form Relative Density Estimation

We propose a closed-form spectral framework for relative log-density estimation in linearly parameterized probabilistic models, including unnormalized and conditional models. This is achieved by representing the Kullback-Leibler (KL) divergence as an integral of weighted chi-squared divergences, converting KL estimation into a family of least-squares problems. We derive an explicit spectral formula based only on first- and second-order feature moments, yielding closed-form estimators of both divergences and log-density potentials for fixed features. The framework extends to a broad class of f-divergences and can be combined with kernelization or feature learning with neural networks. We prove convergence guarantees for the resulting estimators and empirically compare them on synthetic data with optimization-based variational formulations, including logistic and softmax regression for normalized conditional models.
Read the full abstract

Information Theory

Sparse Signal Recovery Using Log-Sum Regularization and Adaptive Smoothing

We study sparse signal recovery from noisy linear observations using nonconvex log-sum regularization. The log-sum penalty reduces the shrinkage bias of $\ell_1$ regularization and more closely approximates the $\ell_0$ regularization, but its nonconvexity can make reconstruction algorithms unstable. To mitigate this instability, we use an adaptive smoothing strategy that determines the smoothing parameter so that the scalar proximal operator remains continuous. Using this proximal operator, we formulate the approximate message passing (AMP) algorithm and derive the corresponding state evolution (SE) recursion. The fixed point of the SE recursion predicts the final mean squared error (MSE) and, in the noiseless limit, the exact-recovery phase transition. To further investigate finite-dimensional reconstruction behavior, we implement an alternating direction method of multipliers (ADMM) algorithm. In the noiseless setting, we find that the empirical success boundary of ADMM closely agrees with the SE-predicted phase transition. In the noisy setting, we observe that AMP closely follows the SE prediction, whereas ADMM qualitatively reproduces the SE-predicted dependence of the final MSE on the regularization parameter. A comparison with $\ell_1$ regularization shows that log-sum regularization is beneficial in low-density or high-measurement-rate regimes, whereas $\ell_1$ regularization remains preferable at higher densities and lower measurement rates.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

A covariant approach to the Dirac field in LRS space-times: the case of coplanar frames

We employ the polar decomposition of the Dirac field to describe it as an effective spinorial fluid. We then construct a $(1+1+2)$ covariant formalism for the Dirac field that avoids the introduction of tetrad fields and Clifford matrices. Within this framework, we analyze the conditions under which a self-gravitating Dirac field can be consistently embedded in Locally Rotationally Symmetric (LRS) space-times of types I, II, and III. In accordance with the LRS symmetry requirements, we extend a previous work by assuming that the velocity and spin vector fields of the Dirac field lie in the planes defined pointwise by the generators of the time-like and space-like congruences, which underlie the $(1+1+2)$ decomposition. We present some analytical and numerical solutions to illustrate the applicability of the proposed framework.
Read the full abstract

All authors Stefano Vignolo, Giuseppe De Maria, Sante Carloni, Luca Fabbri

Probability

Logarithmic scaling of selective sweep curves: from tents to houses

One of the classical results of mathematical population genetics states that the frequency of a beneficial mutant's offspring, on its way to fixation in a large population, looks like a logistic curve. A logarithmic scaling (both in height and time) of these selective sweep curves leads (in the case of strong selection) to a tent-like shape in the large population limit: First the logarithmic frequency of the mutant increases linearly from 0 to 1, then that of the former resident decreases from 1 to 0. For moderate selection the logarithmic frequencies develop (in the large population limit) a jump at the beginning/the end of the sweep, which takes the shape of the tent into that of a house. Our main result (proved for the Moran model) assesses the regularity of this convergence in the large population limit: It is uniform in the house's roof (phases of linear growth and decline) and "Skorokhod $M_1$" in the house's walls (closely around the jumps). Apart from interest in its own right, we anticipate that this result and the proof techniques will be instrumental for extending the description of clonal interference by Poissonian interacting trajectories (as it was done in Hermann et al. (2024) for strong selection) also to moderate selection.
Read the full abstract

All authors Florin Boenkost, Felix Hermann, András Tóbiás, Anton Wakolbinger

Probability

Stochastic curve shortening flow driven by a transport-type pure jump Lévy noise

We study the existence and uniqueness, the regularity, and the long-time behavior of strong solutions to stochastic curve shortening flow driven by a transport-type pure jump Lévy noise. To obtain the existence and uniqueness of strong solutions, we transform the equation into its equivalent Itô-type stochastic partial differential equation via a transport equation, and apply the monotone method with Lyapunov-type conditions. The obstacles to investigate the long-time behavior are the weak dissipativity and singularity inherent in the equation. To this end, we establish an improved regularity and prove that these solutions converge pathwise to zero at an exponential rate.
Read the full abstract

All authors Xiaotian Ge, Shijie Shang, Weina Wu, Jianliang Zhai

Combinatorics

Hidden Structure of Jack Littlewood-Richardson Coefficients

We argue that Jack Littlewood-Richardson coefficients $g_{\mu\nu}^{\lambda}(\alpha)$ are specialisations of certain novel polynomials. For the triple of partitions $(\mu,\nu,\lambda)=(21,21,321)$, we prove the corresponding polynomial is invariant under $S_6 \times \mathbb{Z}_2$, which is identified as the automorphism group of the Johnson graph $J(6,3)$. We conjecture that these polynomials exhibit a factorization property on certain hyperplanes, which is a consequence of compatibility relations between polynomials associated to adjacent triples in the Young graph. As a consequence of this, we conjecture that the difference of adjacent Jack Littlewood-Richardson coefficients is divisible by the shared hook length.
Read the full abstract

Optimization and Control

Novel neighborhood structures for incomplete round robin sports tournaments

The incomplete round robin sports tournament format, where each team plays the same number of games but faces only a subset of the other teams, is becoming increasingly popular in both youth and professional competitions. In contrast to conventional round robin tournaments, however, neighborhood structures for scheduling incomplete round robin tournaments have largely remained unexplored. We fill this gap by proposing two novel neighborhood structures and describe them in graph theory terms. One of them introduces a single new game followed by a minimal repair chain, while the other introduces possibly many new games but only affects a single round. The latter is shown to fully connect the solution space. We embed the neighborhoods in an adaptive late acceptance hill climbing algorithm and show that the proposed algorithm obtains high quality and new best solutions for several sets of instances from the literature, thereby empirically confirming the effectiveness of the proposed neighborhoods.
Read the full abstract

Optimization and Control

Curvature-Dependent Lower Bounds for Frank-Wolfe

The Frank-Wolfe algorithm achieves a convergence rate of $\mathcal{O}(1/T)$ for smooth convex optimization over compact convex domains, accelerating to $\mathcal{O}(1/T^2)$ when both the objective and the feasible set are strongly convex. This acceleration extends beyond strong convexity: Kerdreux et al. (2021a) proved rates of $\mathcal{O}(T^{-p/(p-1)})$ over $p$-uniformly convex feasible sets, a class that interpolates between strongly convex sets and more general curved domains such as $\ell_p$ balls. In this work, we establish a matching $\Omega(T^{-p/(p-1)})$ lower bound for every $p\ge 3$ under exact line search or short steps, and extend the lower bound to objectives satisfying a Hölderian error bound. The proofs analyze the dynamics of Frank-Wolfe iterates on simple instances and hence are not limited to the high-dimensional setting, unlike information-theoretic lower bounds.
Read the full abstract

Information Theory

Weight distributions of cosets of weight 2 of the generalized doubly extended Reed-Solomon codes

We consider the weight distributions of the cosets of weight 2 of the generalized $[q+1,q+2-d,d]_q$ doubly extended Reed-Solomon codes (GDRS) of minimum distance $d\ge5$, over the finite field $\mathbb{F}_q$ with $q$ elements. For a GDRS code, we say that Case S occurs if the weight distribution for all cosets of weight 2 is the same or otherwise, Case NS occurs. For Case S, the weight distribution is known; however, any sufficient condition for the occurrence of Case S remained an open problem. We prove that if $q-1$ and $d-2$ are coprime then Case S holds, i.e. the problem is solved. Furthermore, we note that in Case S, the GDRS code is 2-regular. Also, we introduce two new open equivalent combinatorial problems for finite fields $\mathbb{F}_q$ (Problem $A_{q,\mu}^\times$) and for rings $\mathbb{Z}_\mathfrak{R}$ of integers modulo $\mathfrak{R}$ (Problem $A_{\mathfrak{R},\mu}^+$), where $\mu$ is a parameter. In particular, Problem $A_{\mathfrak{R},\mu}^+$ is as follows: for each element $\lambda$ of $\mathbb{Z}_\mathfrak{R}$, determine the number of all possible $\mu$-tuples $\{\lambda_1,\lambda_2,\ldots,\lambda_{\mu}\}$, each of which consists of $\mu$ distinct elements $\lambda_j$ of $\mathbb{Z}_\mathfrak{R}$ such that their sum in $\mathbb{Z}_\mathfrak{R}$ is equal to $\lambda$. Open Problems $A_{q,\mu}^\times$ and $A_{\mathfrak{R},\mu}^+$ are interesting in their own right and, moreover, we proved that their solutions allow us to obtain the weight distributions for Case NS, taking $\mu=d-2$ and $\mathfrak{R}=q-1$. To solve Problem $A_{\mathfrak{R},\mu}^+$, we found a universal method, connected with the values of $\mathfrak{R}$ and $\mu$, using orbits of elements in $\mathbb{Z}_\mathfrak{R}$ and then we solved the problem for many pairs $\mathfrak{R},\mu$, obtaining the needed weight distributions for the corresponding pairs $q=\mathfrak{R}+1,d=\mu+2$.
Read the full abstract

Classical Analysis and ODEs

On the rational solutions of generalized Abel equations

We study the nonconstant rational solutions of generalized Abel equations \[ x'=\sum_{i=1}^s A_i(t)x^{n_i},\qquad s\geq3,\qquad 1\leq n_1<\cdots<n_s, \] with polynomial coefficients over $\mathbb{R}$ or $\mathbb{C}$. Using the Newton diagram at infinity and the associated edge polynomials, we obtain, under simplicity and nonresonance conditions on the edge polynomials, the global upper bound $n_s-1$ for the number of nonconstant rational solutions. Over $\mathbb{R}$, the same approach yields the additional bound $\min\{n_s-1,2s\}$. We construct a family of equations showing that both bounds are sharp for every $s\geq3$. When $n_1=1$, the real bound improves to $\min\{n_s-1,2(s-1)\}$. We then specialize to the three-term case with $1<n_1<n_2<n_3$, where we obtain a finer classification of the rational solutions. Under an additional antipodal separation condition, we obtain the real bound $\min\{n_3-1,5\}$, and show that the absolute constant $5$ is sharp.
Read the full abstract

Differential Geometry

Distance between minimal surfaces and flows

We will show that the distance between two minimal hypersurfaces is a Lipschitz continuous supersolution, in the viscosity sense, of a natural elliptic partial differential equation. This not only recovers several well-known properties of minimal hypersurfaces, but also encodes substantially richer information. Moreover, if the reference hypersurface is allowed to evolve by mean curvature flow, one obtains comparably strong estimates for a corresponding parabolic PDE, leading in particular to local Harnack inequalities for the distance. There is even a fully parabolic extension in which both hypersurfaces evolve. The problem of tracking the distance between two evolving hypersurfaces arises naturally in a wide range of settings.
Read the full abstract

Algebraic Topology

Surgery on manifold operads

We study cobordisms of a class of topological operads called “manifold operads”. These operads are generalizations of the Fulton-MacPherson operad: an operad built from configurations of points in Euclidean space. Cobordism of manifold operads, along with the associated theory of surgery, depends crucially on delicate combinatorial results for trees associated to operadic bimodules. As an application of surgery, we produce infinitely many manifold operads which are left or right “bimodule cobordant” to, but not homotopy equivalent to the Fulton-MacPherson operad.
Read the full abstract

Optimization and Control

A Riemannian quasi-Newton algorithm for optimization with Euclidean bounds

We propose a Riemannian limited-memory BFGS method for optimization problems with Euclidean bounds. The method combines a limited-memory quasi-Newton update in the tangent space with a Riemannian adaptation of the generalized Cauchy point strategy from classical L-BFGS-B, enabling efficient handling of Euclidean bounds while exploiting the geometric structure of the optimization domain. This setting is important in several applications, including covariance matrix estimation with bounded variance, neuroimaging, EEG signal classification, and other signal processing or computer-vision tasks that couple manifold variables with constrained Euclidean parameters. We provide a generic algorithmic framework and an implementation of the algorithm in the Manopt.jl library. Numerical experiments on benchmark problems indicate only minor reduction in performance on Euclidean problems compared to the classical L-BFGS-B method, while outperforming interior-point methods. Furthermore, the algorithm was tested on two mixed manifold and bounded Euclidean problems: amplitude-limited blind source separation with Gaussianity penalization and bounded-variance maximum likelihood common principal components analysis. The proposed method outperforms existing methods by several orders of magnitude.
Read the full abstract

Analysis of PDEs

Positive Solutions for Sublinear Equations with Compact Positivity-Improving Resolvent

We establish a Brézis-Oswald-type spectral principle for semilinear equations \[ -Lu=f(x,u), \] where $L$ is the generator of a positive $C_0$-semigroup on $L^p$ with compact positivity-improving resolvent. Neither symmetry, variational structure, nor regularizing properties such as ultracontractivity or smoothing are assumed. Let $a_0$ and $a_\infty$ denote the asymptotic slopes of the nonlinearity at zero and at infinity, and let $\lambda_1(a)$ denote the generalized principal eigenvalue associated with the perturbed operator $-L-a$. We prove that \[ \lambda_1(a_0)<0<\lambda_1(a_\infty) \] implies that the equation admits a strictly positive solution. The proof develops a potential-theoretic sub- and supersolution framework based on the order induced by supermedian functions and combines a Deny-type compactness theorem, a Kato-type inequality, and a Doob transform. The construction also yields an order-preserving selection of solutions and allows the lower control on the nonlinearity to be relaxed. If $y\mapsto f(x,y)/y$ is strictly decreasing and $a_0$ is bounded, the spectral condition is necessary as well, and the strictly positive solution is unique.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ML

Affine Tracing: A New Paradigm for Probabilistic Linear Solvers

Probabilistic linear solvers (PLSs) return probability distributions that quantify uncertainty due to limited computation in the solution of linear systems. The literature has traditionally distinguished between Bayesian PLSs, which condition a prior on information obtained from projections of the linear system, and probabilistic iterative methods (PIMs), which lift classical iterative solvers to probability space. In this work we show this dichotomy to be false: Bayesian PLSs are a special case of non-stationary affine PIMs. In addition, we prove that any realistic affine PIM is calibrated. These results motivate a focus on (non-stationary) affine PIMs, but their practical adoption has been limited by the significant manual effort required to implement them. To address this, we introduce affine tracing, an algorithmic framework that automatically constructs a PIM from a standard implementation of an affine iterative method by passing symbolic tracers through the computation to build an affine computational graph. We show how this graph can be transformed to compute posterior covariances, and how equality saturation can be used to perform algebraic simplifications required for computation under specific prior choices. We demonstrate the framework by automatically generating a probabilistic multigrid solver and evaluate its performance in the context of Gaussian process approximation.
Read the full abstract

Numerical Analysis

Data-driven moving-window Bayesian inference for transient CO2-temperature network models of buildings

In this work, we proposes a CO2-temperature network model that links multi-zone mass transport and thermal dynamics through shared latent drivers, airflow and occupancy. The thermal component is formulated as a resistance-capacitance (RC) network augmented with airflow-driven convective exchange, while the CO2 component is governed by inter-zonal convective transport. To calibrate the model and track time-varying operating conditions based on sparse sensing, we introduce a moving-window Bayesian inference procedure that jointly estimates thermal parameters, airflow and occupancy trajectories. The estimation also provides room-specific sensor noise levels, yielding posterior predictive forecasts with credible intervals. The framework is assessed using a controlled synthetic benchmark, and a scaled physical validation experiment using CO2 and temperature sensing. In both settings, the posterior accurately reconstructs trajectories within windows and delivers low forecast errors. When inference windows overlap abrupt regime transitions, the widened uncertainty bands and increased inferred noise levels provide an interpretable diagnostic of model-data mismatch, followed by rapid recovery once the new regime is observed. Overall, coupling CO2-informed airflow with thermal dynamics yields a robust approach for conductive and advective temperature prediction, supporting practical monitoring and energy-performance assessment under limited sensing.
Read the full abstract

All authors Zhijian Wang, Stein K.F. Stoter, Clemens V. Verhoosel, Idoia Cortes Garcia

Differential Geometry

Infinitesimal Rigidity of Cyclic Surfaces and Alternating Surfaces

We study the infinitesimal rigidity of equivariant minimal maps from the universal cover of a smooth oriented surface (possibly non-compact) into a Riemannian symmetric space, focusing on representations arising from cyclic harmonic bundles. By developing a unified Lie-theoretic framework that connects cyclic surfaces and cyclic harmonic bundles over Riemann surfaces, we prove the infinitesimal rigidity for irreducible cyclic surfaces under admissible smooth variations, including both compactly supported deformations and $L^p$-integrable variations on non-compact surfaces. As a geometric application, we introduce $n$-alternating surfaces in $\mathbb H^{p,q}$ and establish their correspondence with a special class of cyclic surfaces. This yields an infinitesimal rigidity theorem that conceptually unifies and extends known rigidity results for maximal space-like surfaces, alternating holomorphic curves, and $A$-surfaces in certain $\mathbb H^{p,q}$.
Read the full abstract

Dynamical Systems

Hausdorff Dimension of a Class of Self-Affine Sets

In this paper, exact Hausdorff dimension formulas for a class of self-affine attractors generated by affine Iterated Function Systems are derived. We consider systems containing an affine map whose $n$-th iterate is a similarity contraction, alongside standard similarities whose linear parts commute with the symmetric operator $A^\top A$, where $A$ is the linear part of the affine map. We prove that the attractor of such a system exists uniquely, and, under the Open Set Condition, we compute its exact Hausdorff dimension. We extend this framework to systems where all map compositions of some fixed length are similarities, and to systems where overlaps are exact homothetic copies of the attractor. We unify these approaches to establish dimension formulas for hybrid systems that combine multiple eventually contractive affine maps with universally aligned similarities. Finally, we conclude with a topological classification of these systems in the plane. For a two-map system comprising an affine map whose second iterate is a similarity with contraction ratio $c$, alongside an $f$-aligned similarity with ratio $r$, we prove that the precise parameter balance $c + r = 1$ acts as a strict topological bottleneck uniquely guaranteeing both the open set condition and the connectedness of the attractor.
Read the full abstract

Algebraic Geometry

Two-dimensional Virasoro algebras

We classify central extensions of the dg Lie algebra of derived global sections of the tangent sheaf on the punctured, formal 2-disk. We then prove a local and universal form of the Grothendieck–Rieman–Roch theorem for families of two-dimensional complex varieties.

Mathematical Physics · Cross-listed from physics.app-ph

Analytic Continuation Between Real- and Imaginary-Time Quantum Dynamics and the Fundamental Instability of Inverse Reconstruction

We develop a unified spectral-semigroup framework that connects real-time and imaginary-time quantum dynamics through analytic continuation. Within this formulation, evolution is expressed as an exponential reweighting of spectral components generated by a single operator $\mathcal{G}$, placing unitary and dissipative dynamics on equal footing within a common spectral structure. The mapping naturally induces a nonlocal fractional operator in time, giving rise to a contractive semigroup governed by a square-root spectral deformation and identifying imaginary-time evolution as an effective fractional low-pass filter. While exponential attenuation suppresses high-frequency components, the inverse transformation remains systematically controllable within a well-defined spectral window. In this regime, stable reconstruction of low-energy and coarse-grained dynamical features is achieved, establishing a predictive relation between imaginary-time evolution and recoverable information. This leads to a quantitative description of a bandwidth-resolved asymmetry between forward propagation and inverse recovery. Across systems with continuous and discrete spectra, few-level coherence, and non-Hermitian generators, we demonstrate that spectral structure governs reconstruction fidelity in a unified manner. In particular, non-Hermitian and open-system settings reveal that irreversibility emerges as a geometry- and scale-dependent feature of the spectrum, tied to both damping and eigenstate non-orthogonality. These results recast analytic continuation as a structured, scale-dependent filtering process with quantifiable and systematically accessible reconstruction limits, providing a unified perspective on the interplay between dynamics, spectral geometry, and information recovery.
Read the full abstract

Combinatorics

Algorithms for Computing Set Tolerances: Theory, Computational Analysis and Applications

The regular set tolerance is an important term in sensitivity analysis. For combinatorial sum problems, e.g., the Traveling Salesman Problem, Shortest Path Problem and Minimum Spanning Tree Problem, it determines how much the sum of the costs of the elements of a set can be increased while ensuring that all current optimal solutions remain optimal. The regular set lower tolerance determines how much the sum of the costs of the elements of a set can be decreased while ensuring that the objective value of the optimal solution is not changed. We investigate general methods for computing regular (upper and lower) set tolerances in combinatorial sum problems. For the upper tolerance, we present a linear programming approach, and for the lower tolerances, three linear programming approaches, where the last two are novel and lead to recursive procedures for computation of the lower tolerances of all subsets of the given ground set. We give new upper bounds for set lower tolerances. For both upper and lower tolerances, we give an exact formula for sets of cardinality 2 and 3. Furthermore, we computationally compare and analyze the three different lower tolerance LPs. Finally, we consider the computation of tolerances for the Minimum Spanning Tree Problem, give a formula for single tolerances, a lower bound for regular set upper tolerances and an exact formula for regular set lower tolerances.
Read the full abstract

Classical Analysis and ODEs

On the existence of optimizers for nonlinear time-frequency concentration problems: the Born-Jordan distribution

We study the $L^p$ concentration problem for the Born-Jordan distribution in dimension $d>1$, thus extending the one-dimensional analysis in [Stra-Svela-Trapasso, J. Math. Pures Appl. (2026)]. We show that the existence of concentration optimizers depends on the exponent $p$ with a critical threshold at $p_*(d)= \frac{2d}{d-2}$ for $d\geq2$ (with the understanding that $p_*(2)=\infty$). In particular, for subcritical exponents $1\leq p<p_*(d)$ we prove that the supremum is finite and is attained, whereas for supercritical exponents $p>p_*(d)$ we show that the functional is unbounded. We also provide the complete solution in the (significantly more) challenging critical regime in dimension $d=2$. For the critical case in dimension $d=2$ and the supercritical case in dimension $d>2$ we also show that $L^2$ functions whose Born-Jordan distribution does not belong to $L^p$ are generic in the Baire sense. For the critical exponent in dimension $d>2$, for which Wang has recently shown that the supremum is finite, we prove that the functional is not sequentially weakly upper semicontinuous, showing that the still open question of attainment is nontrivial.
Read the full abstract