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)

Thursday 14 May

Combinatorics

Boolean–Eulerian numbers

We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized blocks each arranged as an alternating permutation, shows that the exponential generating function of these trees is $1/(1-\tan z)$. The second, to nonplane decreasing 1-2 trees paired with a binary label on each non-root vertex, proves combinatorially that the count equals $2^{n-1}$ times the~$n$th Euler number. Refining by the number of right edges yields the Boolean–Eulerian polynomials, which are an explicit algebraic transform of the classical Eulerian polynomials. The Foata–Strehl orbit decomposition, recast in the decreasing-binary-tree model, gives a direct combinatorial proof of gamma-positivity, and the algebraic transform carries real-rootedness and interlacing of zeros from the Eulerian polynomials to the Boolean–Eulerian polynomials.
Read the full abstract

Optimization and Control · Cross-listed from stat.ML

Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning

We study contextual dynamic pricing in a semiparametric scalar-index valuation model where the latent value is $v_t=\mu_\ast(\mathsf c_t)+\xi_t$, with an unknown utility map $\mu_\ast$ and an unknown additive noise distribution. The key decision object is the one-dimensional oracle price map $u\mapsto p^\ast(u)$ induced by the scalar index $u=\mu_\ast(\mathsf c)$ and the noise tail. Under the $\beta$-Hölder smoothness of the tail function for $\beta\geq 2$ and a revenue-geometry condition that gives a unique, stable, interior maximizer, this oracle map is itself $(\beta-1)$-smooth. We exploit such structure through $\mathsf{ORBIT}$, a modular coarse-to-fine policy that takes a scalar pilot index as input, localizes a benchmark price in each active bin, and learns a local polynomial approximation of the oracle map inside a trust region via bandit convex optimization. For the baseline linear utility model $\mu_\ast(\mathsf c)=\mathsf c^\top\theta_\ast$, an adaptive elliptical exploration scheme constructs the required scalar pilot online without distributional assumptions on the contexts. The resulting policy achieves regret $\widetilde{O}\big(T^{\frac{2\beta-1}{4\beta-3}}+\sqrt{dT}\big)$. For fixed $d$, we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp. The same scalar-pilot interface also yields extensions to sparse high-dimensional linear utility and nonparametric Hölder utility.
Read the full abstract

All authors Yingying Fan, Yuxuan Han, Jinchi Lv, Xiaocong Xu, Zhengyuan Zhou

Numerical Analysis

A Model of a Buoyancy-Driven Heat Exchanger, with Implications for Optimal Design

In this paper, we introduce a model for a buoyancy-driven, air-to-air heat exchanger. This model, derived from first principles, features a conservative boundary condition at inflow based on the compressible Bernoulli equation, and a dissipative boundary condition at outflow based on pressure continuity. We solve for the steady-state behavior numerically and asymptotically, with excellent agreement between the two, and we study the tradeoff between the efficiency and air flow predicted by the model.
Read the full abstract

Numerical Analysis

Energy-based Transport for Amortized Bayesian Inference

We consider amortized Bayesian inference for nonlinear inverse problems using only samples from the joint distribution of parameters and observations, including problems with unknown functions in a Banach space. Classical methods such as Markov chain Monte Carlo solve a new inference problem for each observation, making repeated posterior inference computationally prohibitive, particularly in infinite dimensions. Amortized Bayesian inversion instead learns a reusable map that rapidly generates posterior samples for new observations. We learn an observation-dependent transport map that pushes a reference measure to an approximate posterior. Training minimizes the average energy distance between the posterior and the learned pushforward. Averaging over observations allows generalization across observation instances and efficient amortized inference. Furthermore, the formulation is likelihood-free, requiring only samples from the joint distribution and avoiding likelihood evaluation. In addition, the use of an energy-distance objective removes the need for invertibility of the transport map and for computation of Jacobian determinants, enabling flexible parameterizations in high- and infinite-dimensional settings. Moreover, when the posterior has a density with respect to a Gaussian prior measure, we construct transport maps as the identity plus a learnable map valued in the prior's Cameron–Martin space. This guarantees that the learned posterior remains absolutely continuous with respect to the prior. In infinite dimensions, the transport map is parameterized using neural operators, enabling use at different grid resolutions. We demonstrate the approach on a finite-dimensional problem and PDE-based porous-medium flow and seismic inverse problems. The learned transport captures multimodality and dominant posterior modes while enabling fast sampling.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

$\phi$-Balancing for Mixture-of-Experts Training

Mixture-of-Experts (MoE) models rely on balanced expert utilization to fully realize their scalability. However, existing load-balancing methods are largely heuristic and operate on noisy mini-batch assignment statistics, introducing bias relative to population-level objectives. We propose $\phi$-balancing, a principled framework that directly targets population-level expert balance by minimizing a strictly convex, symmetric, and differentiable potential of the expected routing distribution. Using convex duality, we derive an equivalent min-max formulation and obtain a simple online algorithm via mirror descent, yielding an efficient EMA-based routing adjustment with negligible overhead. Across large-scale pretraining and downstream fine-tuning, $\phi$-balancing consistently outperforms prior Switch-style and loss-free baselines, demonstrating more stable and effective expert utilization.
Read the full abstract

All authors Lizhang Chen, Jonathan Li, Qi Wang, Runlong Liao, Shuozhe Li, Chen Liang, Ni Lao, Qiang Liu

Probability

Noise Tradeoffs, Stationary Information Flow, and Structural Balance in Unit-Birth Networks

In 2019, Paulsson and collaborators conjectured that stochastic biochemical control networks have fundamental limits on how much intrinsic noise can be simultaneously suppressed across multiple components. Ripsman, Kell, and Hilfinger recently proposed a formal proof strategy for unit-birth models based on a stationary information-theoretic decomposition. Here, we provide a rigorous mathematical justification for this argument. We consider continuous-time Markov chains on $\Z^N_{\ge 0}$ in which each component is degraded linearly and produced in unit births at a state-dependent rate depending on the other components but not on itself. Noise in component $i$ is measured by the Fano factor $F_{X_i}$, the ratio of stationary variance to mean, with Poisson value $1$ as baseline. Our first contribution is to isolate explicit hypotheses on moments, mean birth rates, and total-rate growth under which the formal information-flow identities can be rigorously justified. Following the proof outline of Ripsman, Kell, and Hilfinger, we then prove the conjecture. Our second contribution is to make these hypotheses checkable: a uniform positive lower bound on the birth rates and at-most-linear total growth dominated by the weakest degradation rate suffices, via Foster–Lyapunov methods. Our third contribution is a structural strengthening. Under a signed monotonicity condition on the rate functions, satisfied by structurally balanced signed interaction networks, we prove that the stationary distribution is associated with respect to the corresponding signed partial order. This upgrades the global tradeoff to the termwise bound $F_{X_i}\ge 1$ for every $i$. Hence, within the signed-monotone subclass, sub-Poissonian noise requires a frustrated interaction topology.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Breakeven complexity: A new perspective on neural partial differential equation solvers

Neural surrogate solvers of partial differential equations (PDEs) promise dramatic speedups over numerical methods, especially in scenarios requiring many solves. However, current accuracy-based evaluations do not fully consider two central issues: (1) neural solvers incur substantial up-front costs for data generation, training, and tuning; and (2) classical solvers can also generate low-fidelity solutions at a sufficiently low simulation cost. To explicitly account for these realities and fully incorporate end-to-end costs, we propose an evaluation framework centered on breakeven complexity, a metric that counts the forward solves before a learned solver is cost-effective relative to an error-equivalent traditional solver. To evaluate this measure, we apply scaling laws to determine how much training budget to allocate to data generation and discuss how to achieve smooth error-matching in diverse settings. We evaluate the breakeven complexity of multiple neural PDE solvers on three PDEs on 2D periodic domains from APEBench and a novel benchmark of flows past multiple obstacles generated by the GPU-native PyFR code. Among other findings, our results suggest that neural PDE solvers become more effective as problems get harder in terms of cost, dimension, rollout, physics regime (e.g. higher Reynolds number), etc.
Read the full abstract

All authors Yijing Zhang, Nicholas Roberts, Tanya Marwah, Mikhail Khodak

Probability

Equivalence and Separation for Multivariate Matrix-Exponential and Phase-Type Distribution Classes

We resolve two questions left open by Bladt and Nielsen (2010) concerning multivariate families of matrix-exponential and phase-type distributions. First, in the matrix-exponential case, the projection-defined class MVME coincides with Kulkarni's algebraic class MME*. Our proof combines a multivariate state-space realization theorem with elementary augmentations that put the realization into Kulkarni's form. Thus every proper rational multivariate Laplace transform has a finite-dimensional Kulkarni-type representation once Markovian sign constraints are removed. Second, in the phase-type setting, the inclusion of MPH* in MVPH is strict from the trivariate case onward. The separation is obtained through a factorization condition for MPH* that appears not to have been previously identified in the PH literature. A Wishart trace distribution belongs to MVPH but fails this condition, hence providing the required example outside MPH*. The example also shows that projection-based multivariate phase-type laws may have density and support geometry that are absent from the usual univariate theory.
Read the full abstract

Probability

The non-central gamma sum and difference distributions: exact distribution and asymptotic expansions

Exact formulas are derived for the probability density functions of the sum and difference of two independent non-central gamma distributed random variables, with both series and integral representations of the density presented. These formulas are then applied to obtain asymptotic expansions for the probability density function, tail probabilities and quantile functions of these distributions. As a special case, we deduce asymptotic expansions for the probability density function of the product of correlated normal random variables with the coefficients given in closed-form. Numerical results are presented to assess the accuracy of our asymptotic approximations across a range of parameter constellations.
Read the full abstract

Numerical Analysis

Implicit Dynamical Tensor Train Approximation for Kinetic Equations with Stiff Fokker–Planck Collisions

Low-rank methods for kinetic equations have attracted increasing attention due to their effectiveness in reducing the high dimensionality of phase space. In our previous work [G. Wang & J. Hu, J. Comput. Phys. 558 (2026) 114884], we developed a dynamical low-rank method based on the projector-splitting integrator in tensor-train (TT) format, in which explicit time integration is employed in all substeps. As a result, the method is subject to severe stability constraints in the strongly collisional regimes. In this paper, we consider kinetic equations with the (nonlinear) Fokker–Planck collision operator and develop a dynamical low-rank method that employs implicit or implicit-explicit (IMEX) discretizations in appropriate substeps to overcome stiffness. In these implicit substeps, the resulting equations can be formulated as matrix or tensor Sylvester equations, for which we propose efficient direct solvers by exploiting their underlying structure. The overall computational cost of the proposed method scales linearly with respect to the number of grid points in a single velocity dimension, comparable to that of a fully explicit low-rank scheme. We demonstrate the accuracy and efficiency of the proposed method on several representative kinetic test problems.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Orthogonal Polynomials and the MacWilliams Transform for Permutation-Invariant Qudit Codes

We derive an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes. Such codes naturally live in symmetric power representations, where the relevant error sectors are determined by the irreducible decomposition of the conjugation action on the associated operator space. Using the multiplicity-free structure of this decomposition and the corresponding intertwiner algebra, we identify the intrinsic MacWilliams matrix with a finite Racah transform. The entries are given by a terminating hypergeometric series, and the rows of the matrix are Racah orthogonal polynomials with parameters determined explicitly by the block length and local dimension. Computing the spectrum of the degree-one twirl reveals that this spectrum lies on an affine quadratic lattice. Then we derive a tridiagonal multiplication rule from the representation theory of the adjoint sector. As consequences, we obtain closed-form orthogonality, detailed-balance, and involutivity identities for the transform. The resulting formula supplies an explicit MacWilliams matrix for computing linear programming bounds on permutation-invariant qudit codes.
Read the full abstract

General Mathematics · Cross-listed from q-bio.QM

A geometry-dependent, force balance-driven model of Staphylococcus epidermidis biofilm cell cluster detachment

Biofilms, bacteria cells surrounded by a self-produced polymeric matrix, are common on medical devices and lead to many hospital infections. The biofilm lifecycle includes disassembly and dispersion, where bacteria clusters detach from the biofilm, circulate in the bloodstream, and potentially colonize secondary infection sites. Existing models often simplify detachment to a function of biofilm thickness or extracellular polymeric substance (EPS) density, without tracking properties of detached clusters that impact their biological fate, including cluster size and morphology. Addressing this gap, our detachment model accounts for drag and adhesion in tagged sections of the biofilm determined by the cluster geometry and local arrangement of bacteria and EPS. A stickiness parameter controls local EPS adhesion strength, which is modulated to disrupt (or compromise) EPS biomass. We specifically model the detachment of clusters from a Staphylococcus epidermidis biofilm grown for 24 hours. Experimental data for biofilm microstructural features are utilized to benchmark the simulated biofilm, which is then subjected to different EPS disruption levels. We examine parameters that influence detached biofilm cell cluster frequency, size, and shape, providing mechanistic insights into how compromised EPS influences detachment dynamics. This integrated modeling framework is a significant advance in the predictive capabilities for biofilm detachment processes.
Read the full abstract

All authors Yuehui Xu, Jasmine A.F. Kreig, Zhuoran Wang, Elizabeth J. Stewart, Rayanne A. Luke, Sarah D. Olson

Numerical Analysis

Proposal-Guided Greedy Surrogate Refinement for PDE-Driven High-Dimensional Rare-Event Estimation

Accurate surrogate construction for PDE-driven high-dimensional rare-event simulation is challenging when performance evaluations are expensive. Since a globally accurate surrogate may require many high-fidelity evaluations, adaptive importance sampling provides a natural localization tool: its evolving proposal distribution progressively identifies the failure-relevant region. Motivated by this observation, we propose a surrogate-assisted adaptive importance sampling framework that refines the surrogate locally along the evolving proposal, rather than over the entire input space. The surrogate combines an encoder with a neural network, providing a low-dimensional latent representation for both prediction and sample selection. At each adaptive iteration, candidates drawn from the current proposal are selected by a greedy latent-space rule balancing proximity to the estimated failure boundary and sample diversity. The selected samples are evaluated by the high-fidelity model and used to refine the surrogate, which then guides the subsequent cross-entropy-type adaptive proposal update. We establish one-step proposal stability bounds under local surrogate errors, together with surrogate-induced misclassification and finite-sample estimation error bounds. Numerical experiments on multimodal benchmarks and PDE-driven rare-event problems up to 100 dimensions show that the proposed method achieves accuracy comparable to true-model adaptive importance sampling while requiring substantially fewer high-fidelity evaluations.
Read the full abstract

Optimization and Control

Stochastic Compositional Optimization via Hybrid Momentum Frank–Wolfe

Stochastic compositional optimization minimizes $F(f(x), x)$ over a compact convex set when the inner map $f$ is available only through noisy samples. We propose Hybrid Momentum Stochastic Frank–Wolfe, a projection-free method for outer functions $F$ that are jointly convex and Lipschitz but not necessarily differentiable, such as maxima, CVaR, and norms. The method tracks the Jacobian and the value of $f$ with momentum, using a Taylor correction for the value, and passes the tracked linearization to a generalized linear minimization oracle. Under finite-variance noise, it attains an expected generalized Frank–Wolfe gap of order $K^{-1/4}$ for non-convex objectives and, when the linearized models minorize the objective, a last-iterate primal error of order $K^{-1/3}$. The analysis extends to heavy-tailed noise without clipping, with separate moment orders for values and Jacobians. With an exact oracle, the method reduces to the deterministic method of Vladarean et al. (2023).
Read the full abstract

Algebraic Geometry

The Tropical Moduli Space of Degree-3 Rational Maps

We study tropical rational functions on the tropical projective line with three zeros and three poles in the torus, counted with multiplicity, modulo target automorphisms. The principal divisor identifies their moduli space with unordered pairs of disjoint effective divisors of degree three. We classify its \(53\) cells and prove that it is six-dimensional with ten contractible connected components. Source–target automorphism groups are trivial or of order two, and reflection loci are defined by linear gap equations. Allowing common support and points at infinity gives a divisor-pair compactification. Over an algebraically closed non-Archimedean field with value group \(\mathbb{R}\), root–pole tropicalization is surjective from valuation-separated cubic rational functions modulo the target torus normalizer. Explicit counterexamples show that the valuation of the conjugacy invariant \(J^2/I^3\) does not descend to this tropical moduli space. Generic functions admit minimal six-unit shallow ReLU representations with three positive and three negative unit output weights.
Read the full abstract

Analysis of PDEs

Regularity of superposition operators of mixed fractional order

We extend the De Giorgi–Nash–Moser theory to superposition operators of mixed fractional operators. In particular, we investigate several regularity properties for this class of operators. We establish the Caccioppoli-type inequality with tail for weak subsolutions, local boundedness of weak subsolutions, local Hölder continuity of weak solutions, the weak Harnack inequality for weak supersolutions, and the lower semicontinuity of weak supersolutions. Furthermore, we prove the expansion of positivity, a preliminary Harnack inequality, and the upper semicontinuity of weak subsolutions. Our results apply to both fixed-sign and sign-changing solutions involving mixed local–nonlocal superposition fractional operators. Notably, the results are new even in the classical linear case $p=2$, demonstrating the broader applicability of the techniques developed in this work.
Read the full abstract

All authors Souvik Bhowmick, Sekhar Ghosh, Vishvesh Kumar, R. Lakshmi

Number Theory

Improvements to Jacobian Arithmetic in Global Function Fields

We present two improvements to arithmetic in the Jacobian of global function fields based on the approach of Hess. The first reduces the number of expensive reduction steps by optimizing for typical inputs rather than worst-case behavior, assuming the function field contains a degree-one place. The second introduces a memory-time trade-off that speeds up computations by caching frequently used intermediate results. Our asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowledge, our publicly-available software implementation of Jacobian arithmetic is the first to support unique representatives of divisor classes.
Read the full abstract

Combinatorics

Extended Abstract: Canonical join complex and cubical coordinates for all framing lattices

This document is an extended abstract for two articles in preparation. Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams of (Reading, 2015) for the weak order on the symmetric group. Our model captures the natural bijection between join and meet canonical representations, as well as duality upon reflections of the framed graph. The proof is bijective, with an explicit reconstruction algorithm in two steps. A useful intermediate construction in our bijective proof is our new definition of cornered cliques. These enable us to define cubical coordinates on a framing lattice, generalizing bracket vectors for the Tamari lattice and providing an efficient comparison criterion.
Read the full abstract

Geometric Topology

On Pappus and Anosov Representations of the Modular Group

Let $X=SL_3(\R)/SO(3)$. Let $\cal DFR$ be the space of discrete faithful representations of the modular group into ${\rm Isom\/}(X)$ which map the order $2$ generator to an isometry with a unique fixed point. In this paper, we prove that $\cal DFR$ has a component $\cal B$, the so-called Barbot component, that is homeomorphic to $\R^2 \times [0,\infty)$. The boundary of $\cal B$ parametrizes the Pappus representations and the interior consists of Anosov representations.
Read the full abstract

2605.15317 · 14 May · This is an edited and improved subset of a very long paper of mine, arXiv:2412.18547. In this shorter paper I isolate one of the main results and give a self-contained proof. I also take the opportunity to fix a few glitches and add some helpful details. Computer assisted - Mathematica files downloadable from my website

Optimization and Control · Cross-listed from cs.LG

Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise

Stochastic optimization theory often assumes that gradient noise has uniformly bounded variance. However, this assumption can be inadequate even in simple settings; e.g., it does not hold for linear least squares regression. The Blum-Gladyshev ($\mathsf{BG}$-0) noise model instead allows the stochastic gradient variance to grow quadratically with the distance from the initialization and has recently been identified as the weakest known viable variance assumption. We study nonconvex stochastic optimization under $\mathsf{BG}$-0 noise and prove that normalized momentum converges with one stochastic gradient per iteration, reaching an $\varepsilon$-stationary point with the optimal $O(\varepsilon^{-6})$ complexity. We then show that, under mean-square smoothness, a variance-reduced normalized STORM method achieves the minimax optimal complexity of $O(\varepsilon^{-4})$. We further extend our analysis to the symmetric generalized smoothness framework, which captures objectives whose local curvature can scale with the gradient norm. To our knowledge, these are the first convergence guarantees for normalized methods in nonconvex stochastic optimization under $\mathsf{BG}$-0 noise without bounded domains.
Read the full abstract

Representation Theory

Complex Weyl correspondence and harmonic representation of $SU(p,q)$

We study the harmonic representation of $SU(p,q)$ in connection to the complex Weyl correspondence on the Fock space. In particular, we give explicit formulas for the complex Weyl symbols of the harmonic representation operators. Similar results are also obtained for the extended harmonic representation of the semi-direct product of the $(2p+2q+1)$-dimensional Heisenberg group by $SU(p,q)$.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Universal Approximation of Nonlinear Operators and Their Derivatives

We show that Universal Approximation (UA) of nonlinear operators and their derivatives via Operator Learning (OL) architectures fails in ${C^k_F}$ (Fréchet) compact-open topologies and in Fréchet–Sobolev norms (i.e. under operator norms). We solve this obstruction by restoring UA in natural weaker topologies: $C^k_B$ (Bastiani) compact-open topologies and (novel) weighted Bastiani–Sobolev spaces for general finite input measures. In full Banach-space generality, these are the first complete generalizations of the corresponding influential classical results in [Hornik, 1991] to infinite-dimensional spaces and OL. Based on our UATs, we formulate Bastiani–Sobolev training in DIOL. These results launch Derivative-Informed Operator Learning (DIOL) (i.e. learning nonlinear operators and their derivatives) on general Banach spaces. We parameterize nonlinear operators via Encoder-Decoder Architectures, classical OL architectures available in general Banach spaces; these include DeepONets, Deep-H-ONets, and PCA-Nets, which our UATs cover. A key mathematical result is that our new weighted Bastiani–Sobolev spaces generalize classical Gaussian (Malliavin) Sobolev spaces on Banach spaces. Open frontiers where DIOL and our UATs find applications are: high-order accuracy in OL; fast constrained optimization in Banach spaces (e.g. optimal control of PDEs, inverse problems) via Learn-Then-Optimize; numerical methods for infinite-dimensional PDEs (e.g. HJB PDEs on Banach spaces from infinite-dimensional optimal control via Optimize-Then-Learn, such as optimal control of PDEs, SPDEs, path-dependent systems, partially observed systems, mean-field control).
Read the full abstract

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

Stochastic Safety Limits and Scale-Dependent Power Fluctuations in Nuclear Reactors: A Critical Scaling Approach

Applying boundary functionals of random risk processes to various physical problems makes it possible to determine many important characteristics of these problems. For example, a special case of boundary functionals is the time to first reach a level, which is widely and successfully applied to a variety of problems. We consider the application of boundary functionals to solving nuclear safety problems. In situations such as reactor startup, as well as for certain types of reactors, neutron behavior changes. Neutron clustering begins to play an important role, and the distributions characterizing neutron behavior change. The normal Gaussian distribution is replaced by stable limiting, distributions to which the sums of random variables converge. Boundary functionals allow us to accurately calculate the statistics of random events, determine the behavior of reactor power peaks, the probabilities of catastrophic power surges, and other quantities important for reactor safety, providing a mathematical bridge between the abstract theory of directed percolation and engineering calculations of protection parameters. This article examines the first-passage time to reach a certain level.
Read the full abstract

Statistics Theory

Intrinsic-dimension empirical Bernstein inequalities for bounded self-adjoint operators

Operator-valued concentration inequalities are foundational to the analysis of modern high-dimensional statistics and randomized algorithms. However, standard oracle bounds are frequently limited in practice: they require explicit a priori knowledge of the true variance, and often explicitly scale with the ambient dimension, rendering them vacuous for infinite-dimensional or heavily structured operators. Motivated by these challenges, we establish the first empirical Bennett and Bernstein inequalities for sums of independent, bounded, self-adjoint Hilbert-Schmidt operators. Our fully data-driven bounds replace the unknown variance with an empirical estimate and rely strictly on the intrinsic dimension rather than the ambient dimension. This structural shift yields computable, dimension-free guarantees with a sharper first-order asymptotic radius for non-isotropic random matrices and seamlessly extends to infinite-dimensional Hilbert spaces. We demonstrate that our empirical bounds achieve asymptotic sharpness with the best known oracle rates. Finally, as an independent byproduct, we derive novel empirical concentration guarantees for the intrinsic dimension itself.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

A general proof of integer Rényi QNEC

We prove the Rényi quantum null energy condition for every integer Rényi order $n\geq2$. In local Poincaré-invariant quantum field theory, this states that the sandwiched Rényi divergence (SRD) of an excited state relative to the vacuum is convex along a future-directed null deformation. We assume that the deformation is realized by the canonical translations of a half-sided modular inclusion and that the divergence is finite for the initial, undeformed algebra. The proof establishes convexity of the SRD along the induced positive contraction semigroup on Haagerup $L^n(M)$, for every non-zero positive initial element. We also establish a Rényi ant formula at every even integer order and, under an additional regularity assumption, at odd integer orders. The Rényi ant formula identifies the negative first null derivative of SRD with a multiple of the infimum of the canonical null-translation energy over vector purifications of an escort state constructed from the excited state and the vacuum.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Quantum Meets Statistical-Physical Secrecy: A Novel Hybrid Key Distribution Architecture

This letter proposes a novel hybrid key distribution architecture that jointly exploits quantum key distribution (QKD) and Kirchhoff-law-Johnson-noise (KLJN) statistical-physical key exchange. In the proposed system, an optical BB84-type QKD link operates in coordination with a parallel wired KLJN link, which is used for secure basis handling and, in selected protocols, additional raw key generation. Three novel KLJN-assisted QKD protocols are introduced to eliminate public basis disclosure messages and bit sifting, extract basis-derived key bits, or generate raw key bits under ideal KLJN assumptions. Analytical expressions for the normalized key rate and absolute throughput are derived by accounting for optical channel penalties, KLJN bandwidth constraints, and synchronization bottlenecks. Numerical results show that the proposed hybrid architecture can improve key generation efficiency and throughput in short-haul infrastructures, including metropolitan area networks (MANs) and data center interconnects.
Read the full abstract

General Mathematics

Fourier representations of fractional B Splines via generalized Stirling type polynomials

In this paper, we investigate fractional B splines and their connections with Fourier analysis, and establish connections with generalized Stirling-type numbers and distribution theory. Employing a generating function approach inspired by recent results of Simsek [24], we derive a novel Fourier type expansion for fractional B splines that involves generalized Stirling type numbers. Our main contribution is the derivation of a Fourier-type expansion of fractional B splines in terms of generalized Stirling-type numbers. This representation allows us to express fractional B splines as infinite linear combinations of derivatives of the Dirac delta in the distributional sense. Furthermore, we establish an explicit shifted distributional representation and obtain shifted distributional representations that characterize the action of fractional B-splines on test functions. In addition, we introduce a new class of fractional spline polynomials and derive their generating function in terms of the Mittag Leffler function. These results provide a unified framework that connects spline theory, fractional calculus, and combinatorial structures.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Translation symmetry-enforced long-range entanglement in mixed states

We show by a counting argument that even though translation symmetry admits symmetric short-range entangled (SRE) eigenstates, there are not enough such SRE eigenstates to span the zero momentum sector. This means that the fixed point strong-to-weak spontaneous symmetry breaking state of translation symmetry is long-range entangled: it cannot be written as a mixture of SRE states. This is a subtle form of long-range entanglement in mixed states that cannot be detected by long-range connected correlation functions.
Read the full abstract

Category Theory · Cross-listed from cond-mat.str-el

Non-Invertible Symmetries on Tensor-Product Hilbert Spaces and Quantum Cellular Automata

We investigate realizations of (1+1)-dimensional fusion category symmetries on tensor-product Hilbert spaces, allowing for mixing with quantum cellular automata (QCAs). It was argued recently that any such realizable symmetry must be weakly integral. We develop a systematic analysis of QCA-refined realizations of fusion categories and prove two statements. First, we show that, under certain physical assumptions on defects, any QCA-refined realization has QCA and symmetry-operator indices determined by the categorical data, up to the freedom of redefining the symmetry operators. Second, we construct a lattice model that provides a QCA-refined realization for any weakly integral fusion category symmetry on a tensor product Hilbert space. We also compute indices of the QCAs in our lattice model and show agreement with the first result. As an application of the general construction, we give an explicit QCA-refined realization of general Tambara-Yamagami categorical symmetries.
Read the full abstract