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)

Saturday 9 May

Mathematical Physics

Quantum Relative Entropy and the Mean-Field Limit

We develop a quantum relative entropy method for the mean-field limit of quantum many-body systems. For closed systems governed by the von Neumann equation, we prove a quantitative stability estimate between the $N$-body density matrix and the tensorized solution of the Hartree equation. The argument is based on an entropy production identity, a cancellation mechanism for the centered two-body fluctuation, and a combinatorial estimate controlling the remaining mixed moments. As a consequence, we obtain propagation of chaos in trace norm for fixed marginals. We further combine the entropy estimate with known semiclassical Wasserstein bounds to derive a convergence estimate that is uniform in the Planck constant in an appropriate joint mean-field and semiclassical regime. Finally, we extend the method to finite-dimensional open quantum systems governed by Lindblad dynamics. In this setting, we establish an analogous relative entropy estimate for general bounded two-body interactions, where the mean-field potential is defined through partial trace. This shows that the entropy method does not rely on any special tensor-product decomposition of the interaction.
Read the full abstract

Information Theory

On Codes with Support-Constrained Parity Checks

We study linear codes that maximize minimum distance subject to arbitrary support constraints on the parity-check matrix. Such constraints arise naturally in the design of LDPC codes, locally repairable codes, and hardware-constrained systems where each parity check must involve only a limited number of code symbols. They are also essential in quantum error correction, where sparse stabilizers reduce measurement noise and respect the connectivity constraints of physical qubit architectures. We derive the optimal minimum distance possible given support constraints on the parity-check matrix and show it is achievable over sufficiently large fields. When this maximum distance coincides with the Singleton bound for unconstrained parity check matrices, the dual GM-MDS construction yields generalized Reed–Solomon codes obeying the mask. In the generator-matrix setting, the GM-MDS theorem guarantees that the optimal distance can always be achieved by a subcode of a generalized Reed–Solomon code while satisfying arbitrary support constraints. We show that this is not true for the parity-check setting. We exhibit a set of support constraints, derived from the vertex-edge incidence of $K_{6,6}$, for which the optimal minimum distance cannot be realized by any subcode of a generalized Reed–Solomon code over any field. We also analyze structured constraint families – regular, balanced, and cyclic masks – through numerical optimization, providing design guidance for practical code constructions.
Read the full abstract

Dynamical Systems

Invariant measure for double base expansions

Given a pair $Q=(q_0,q_1)\in(1,\infty)^2$ with $q_0+q_1\ge q_0q_1$, a sequence $(c_i)\in\set{0,1}^\infty$ is called a $Q$-expansion of $x$ if<br/>\begin{equation*}<br/>x=\sum_{i=1}^{\infty}\frac{c_i}{q_{c_1}\cdots q_{c_i}}.<br/>\end{equation*}<br/>We primarily study the dynamical properties of the greedy and lazy maps, which are the piecewise-linear maps on the interval $I_Q=[0,\,1/(q_1-1)]$ defined by the corresponding algorithms for $Q$-expansions. <br/>We show that the greedy and lazy maps each of which has a unique absolutely continuous invariant probability measure, equivalent to the Lebesgue measure on the intervals<br/>\begin{equation*}<br/>\left[0,\frac{q_0}{q_1}\right)\qtq{and}\left(\frac{q_1}{q_0(q_1-1)}-1,\frac{1}{q_1-1}\right],<br/>\end{equation*}<br/>respectively. <br/>Furthermore, the corresponding dynamical systems are exact on $I_Q$. <br/>As a dynamical consequence, under the stronger condition $q_0+q_1>q_0q_1$ the set of points having unique $Q$-expansions has Lebesgue measure zero, and almost every $x\in I_{Q}$ admits a continuum of $Q$-expansions.
Read the full abstract

Numerical Analysis

Decoupling scales via localized subspace iteration and temporal splitting for multiscale parabolic equations

Simulating diffusion in heterogeneous media presents a significant computational challenge, as resolving microscopic physical scales traditionally demands excessively fine computational grids. To overcome this barrier, we extend the Localized Subspace Iteration (LSI) framework to multiscale parabolic equations. The proposed method constructs optimal, low-dimensional trial spaces by iteratively approximating the dominant eigenspaces of local inverse operators via Localized Standard Subspace Iteration (LSSI) or Localized Krylov Subspace Iteration (LKSI). Because these LSI basis functions are inherently tailored to capture the slow-decaying, low-frequency modes of the parabolic solution, they naturally suppress error accumulation over long-term integration. To further improve computational efficiency, we decouple the basis construction into an offline phase and implement a contrast-independent, partially explicit temporal splitting scheme for online time-stepping. By explicitly advancing the dominant macroscopic modes while implicitly treating high-frequency microscopic corrections, this scheme guarantees stability without imposing restrictive time-step constraints. We establish rigorous a priori error estimates in both the energy and $L^2$ norms. Numerical experiments illustrate the accuracy and efficiency of the LSI framework, particularly highlighting the LKSI method's advantages in handling high-contrast, complex multiscale media.
Read the full abstract

All authors Eric T. Chung, Lijian Jiang, Mengnan Li, Yajun Wang

Probability

Moderate deviations for the Maki–Thompson rumour model

We consider the classical Maki–Thompson rumour model with $n$ initially ignorant individuals and one initial spreader. The final number of ignorants, divided by $n$, is known to satisfy the law of large numbers, the central limit theorem and the large deviation principle. We establish a moderate deviation principle for fluctuations of this proportion of order $b_n/\sqrt n$, where $b_n\to\infty$ and $b_n^2=o(\log n)$. The proof rests on the exact final-size distribution, sharp asymptotics for the associated automata numbers, and a uniform point probability expansion at the moderate deviation scale. Numerical comparisons of both tails illustrate the intermediate scale and the effect of early extinction on upper tail probabilities.
Read the full abstract

Probability

On the sum-of-digits measures and Cusick's conjecture via stopped random walks

Let $s(n)$ denote the number of ones in the binary expansion of a natural number $n\in\mathbb{N}$. For any $t\in\mathbb{N}$ and $d\in\mathbb{Z}$, let $\mu_t(d)$ denote the asymptotic density of the set of those natural numbers $n$ for which $s(n+t)-s(n)=d$. The $\mu_t$ are properly defined probability measures on $\Z$, and the Cusick conjecture states that $\mu_t(\mathbb{N})>\frac{1}{2}$ for any $t\in\mathbb{N}$. We investigate the properties of the family $\{\mu_t\}_{t\in\N}$ by reindexing the odd integers via a suitable partial order. This construction leads to a nonautonomous dynamics on pairs of probability measures on $\Z$, which represents the process of growing a tree. The associated stopped random walk allows a transparent structural description of those measures, including their support, symmetries, variance, and an asymptotic dichotomy between the central limit theorem and the almost sure convergence. Next, we focus on the median-preserving property of this process, and show that the Cusick conjecture is a special case of a more general claim about the asymmetric evolution of the associated binary trees, which we support numerically.
Read the full abstract

Information Theory · Cross-listed from cs.AI

Generalization Bounds of Emergent Communications for Agentic AI Networking

The evolution of 6G networking toward agentic AI networking (AgentNet) systems requires a shift from traditional data pipelines to task-aware, agentic AI-native communication solutions. Emergent communication, a novel communication paradigm in which autonomous agents learn their own signaling protocols through interaction, is increasingly viewed as a promising solution to address the challenges posed by existing rigid, predefined protocol-based networking architecture. However, most existing emergent communication frameworks fail to account for physical networking constraints, such as bandwidth and computational complexity, and often lack a rigorous information-theoretical foundation. To address these challenges, this paper introduces a novel emergent communication framework that facilitates collaborative task-solving among heterogeneous agents through an information-theoretic lens. We propose a novel joint loss function that unifies the optimization of decision-making functions and the learning of communication signaling. Our proposed solution is grounded on the multi-agent and multi-task distributed information bottleneck (DIB) theory, which allows the quantification of the fundamental trade-off between task-relevant information representation and computational complexity. We further provide theoretical generalization bounds of the emergent communication protocol during decentralized inference across unseen environmental states. Experimental validation on a real-world hardware prototype confirms that our proposed framework significantly improves generalization performance, compared to the state-of-the-art solutions.
Read the full abstract

All authors Yong Xiao, Jingxuan Chai, Guangming Shi, Ping Zhang

Information Theory

Fluid Antennas Assisted RIS-NOMA Communication Networks

This paper introduces a fluid antenna system (FAS) into reconfigurable intelligent surface (RIS) assisted non-orthogonal multiple access (NOMA) communication networks, where the non-orthogonal users are equipped with planar fluid antennas. Specifically, we formulate a sum rate maximization problem for FAS-RIS-NOMA networks, which jointly optimizes the fluid ports, the RIS deployment, and the phase shift matrix. To solve the resulting non-convex optimization problem involving highly coupled variables, an iterative algorithm based on alternating optimization is employed to decompose the original problem into three subproblems. Exhaustive search is employed for optimizing the fluid ports, particle swarm optimization is used for the RIS deployment, and semidefinite relaxation with successive convex approximation is adopted for optimizing the phase shift matrix. Finally, the simulation results show that: 1) compared with traditional antenna systems and orthogonal multiple access, the FAS-RIS-NOMA networks achieve higher system throughput under high signal-to-noise ratio conditions; and 2) by increasing the number of RIS elements and enlarging the FAS size, the sum rate of FAS-RIS-NOMA networks can be significantly enhanced.
Read the full abstract

All authors Xinwei Yue, He Geng, Jingjing Zhao, Xianli Gong, Aryan Kaushik, Arumugam Nallanathan

Category Theory · Cross-listed from cs.LO

Sheaves as a Means of Maintaining Consistency in Model-based Systems Engineering

We propose that the sheaf condition on a presheaf of design spaces provides a mathematical model for multi-view consistency in the architecture of cyber-physical systems (CPS). In model-based systems engineering, multiple engineering views – electrical, thermal, mechanical, and software – must be kept mutually consistent, yet current practice relies on informal procedures without a precise semantic account of global consistency. We construct an architectural site: a topological space whose points are pairwise interfaces between engineering domains and whose open sets represent engineering views. A design presheaf assigns to each view its local design space and to each inclusion the corresponding restriction map. We show that the sheaf condition on this presheaf is equivalent to compatibility on pairwise overlaps, yielding a local criterion for global multi-view consistency. The equivalence and a concrete three-view worked example are machine-verified in Lean 4 using Mathlib. The formalization establishes that the design presheaf is a sheaf, that the sheaf condition is equivalent to pairwise overlap compatibility, and that compatible local design families glue to unique global designs. Global consistency of an arbitrary number of views can be certified by checking only pairwise interface compatibility; compatible local designs determine a unique global design; derived properties computed by limit-preserving functors inherit the same consistency guarantee; and the entire verification chain admits machine-checkable proofs in Lean.
Read the full abstract

Group Theory

On finite groups containing an element whose Engel sink is small

For an element $g$ of a group $G$, a right Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[g ,x],x],\dots ,x]$ for all $x\in G$. A left Engel sink of $g$ is a subset of $G$ containing all sufficiently long commutators $[...[[x ,g ],g ],\dots ,g]$ for all $x\in G$. Using the classification of finite simple groups we prove that if a finite group $G$ has an element $g$ such that $G=[G,g]$, then the order of $G$ is bounded in terms of a right Engel sink of $g$, as well as in terms of a left Engel sink of $g$. Earlier Guralnick and Tracey proved this in the case where $g$ is an involution without using the classification.
Read the full abstract

Combinatorics

Intersecting families with covering number three II

A family $\mathcal{F}\subset \binom{[n]}{k}$ is called intersecting if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. The covering number of a family $\mathcal{F}$ is defined as the minimum size of $T\subset [n]$ such that $T\cap F\neq \emptyset$ for all $F\in \mathcal{F}$. In 1980, the first author proved that for sufficiently large $n$, any intersecting $k$-graph $\mathcal{F}$ with covering number at least three, satisfies $|\mathcal{F}|\leq \binom{n-1}{k-1}-\binom{n-k}{k-1}-\binom{n-k-1}{k-1}+\binom{n-2k}{k-1}+\binom{n-k-2}{k-3}+3$. There was very little progress during more than forty years but recently (cf. \cite{FW25}) with a completely different approach we proved the same result for the full range $n\geq 2k$ and $k\geq 7$. In this short paper we prove the same inequality for all the remaining cases.
Read the full abstract

Representation Theory

Young tableau descriptions for the polyhedral realizations of crystal bases in type $A_n$

By utilizing the combinatorial properties of various tableau models, we establish an explicit correspondence between the polyhedral realizations of the crystal bases $\mathcal B(\lambda)$ (resp. $\mathcal B(\infty)$) of type $A_n$ and the reverse semi-standard Young tableaux (resp. reverse marginally large tableaux), thereby providing a combinatorial description of the corresponding polyhedral realizations. Furthermore, a crystal structure on the set of Gelfand-Tsetlin patterns is obtained via the correspondence between the polyhedral realization of $\mathcal{B}(\lambda)$ and the reverse tableaux. As applications of our framework, we present concrete combinatorial realizations of the crystal embedding of $\mathcal B(\lambda)$ into $\mathcal B(\infty)$ and the set of Lusztig data.
Read the full abstract

Algebraic Geometry

Kodaira dimension of algebraic fiber spaces over threefolds : Part 1

We study the behavior of the Kodaira dimension of algebraic fiber spaces over threefolds. We prove some cases of the Iitaka Conjecture $C_{n,3}$, including certain situations where the base variety is a Calabi–Yau threefold.

Group Theory

Length parameters of finite groups and their Hall subgroups

Let $\pi$ be a set of primes containing $2$ and an odd prime $p$. It is proved that if a finite group $G$ has a Hall $\pi$-subgroup $H$, then the non-$p$-soluble length of $G$ is bounded above by the generalized Fitting height of $H$. The proof uses the fact, obtained in [4] using the classification of finite simple groups, that a finite simple group of order divisible by $p$ cannot have a nilpotent Hall $\{2,p\}$-subgroup. As a corollary, it is proved that if in addition $H$ is soluble, then the non-$p$-soluble length of $G$ is bounded above by $2l_2(H)+1$, where $l_2(H)$ is the $2$-length of $H$.
Read the full abstract

Information Theory · Cross-listed from cs.AR

FLARE: One-Shot PE-Level Fault Localization in Systolic Arrays via Algebraic Test Vectors

Systolic arrays are the dominant compute fabric for neural network inference. Prior work has addressed column-level fault detection efficiently with uniform test patterns, but row-level (PE-level) fault localization within a faulty column remains open without resorting to hardware redundancy. The fundamental obstacle is that uniform test inputs destroy per-row signatures: any test that activates every row equally cannot distinguish which row is the source of an observed deviation. In this paper, we propose a lightweight, purely algorithmic remedy based on coprime test vectors. By assigning pairwise coprime integers as test-input entries, a permanent weight-register fault produces a deviation whose divisibility signature uniquely identifies the faulty row. Under a general bounded error model, a single test pass localizes the faulty row with high probability. This error model covers a broader class of faults than what prior dataflow-aware testing work has primarily emphasized. When one round is insufficient, a second pass using a ratio computation achieves exact localization; for the special case of single-bit errors, odd coprime entries guarantee exact localization in one round. For INT16 arithmetic, a single test pass covers array sizes up to $256{\times}256$ with localization probability above $0.98$, at a test cost under $1\%$ of one inference GEMM tile.
Read the full abstract

Optimization and Control

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions

When minimizing the sum of a convex and a strongly convex function, or when finding the zero of the sum of a monotone operator and a strongly monotone operator, Chambolle and Pock (2010) and Davis and Yin (2015) proposed accelerated mechanisms that achieve an $\mathcal{O}(1/N^2)$ convergence rate for the squared distance to the solution, but the optimality of this rate was not established. In this work, we present Fast Douglas–Rachford Splitting (FDR), an accelerated method that improves the constants established in the prior works, and provide a complexity lower bound establishing that both the $\mathcal{O}(1/N^2)$ convergence rate and the leading-order constant of FDR's rate are optimal.
Read the full abstract

All authors Govind M. Chari, Uijeong Jang, Ernest K. Ryu, Behçet Aç{\i}kmeşe

Commutative Algebra

Cohen-Macaulayness of formal fibers and dimension of local cohomology modules

Let $(R, \mathfrak{m} )$ be a Noetherian local ring, $M$ a finitely generated $R$-module of dimension $d$. Set $\mathfrak{a}(M):=\mathfrak{a}_0(M)\cdots \mathfrak{a}_{d-1}(M)$, where $\mathfrak{a}_i(M):={\rm Ann}_RH^i_{\mathfrak{m}}(M)$ for $i\geq 0$. In this paper, we study the Cohen-Macaulayness of formal fibers of $R$ in the relation with the dimension ${\rm dim} (R/\mathfrak{a}(M)).$ We prove that ${\rm dim} (R/\mathfrak{a}(M))<d$ if and only if $R/\mathfrak{p}$ is unmixed and the generic formal fiber of $R/\mathfrak{p}$ is Cohen-Macaulay for all $\mathfrak{p}\in{\rm Supp}_R(M)$ with ${\rm dim} (R/\mathfrak{p})=d.$ In general, $R/\mathfrak{p}$ is unmixed and the generic formal fiber of $R/\mathfrak{p}$ is Cohen-Macaulay for all $\mathfrak{p}\in{\rm Supp}_R(M)$ with ${\rm dim} (R/\mathfrak{p})>{\rm dim} (R/\mathfrak{a}(M)).$ As applications, we explore the structure of local rings and the dimension, the closedness of non Cohen-Macaulay locus of finitely generated modules.
Read the full abstract

Analysis of PDEs

On the Existence of Boundary Layer Separation for Incompressible Fluid Flow in the Half-Space

We consider the Stokes system in the half-space with localized boundary data. We prove that a boundary layer separation point exists provided that a certain singular integral determined by the boundary data is negative. On the other hand, if this integral is strictly positive, then boundary layer separation does not occur. When boundary layer separation occurs, we also investigate the dynamics of the separation point and the sign of the pressure gradient. Furthermore, by a perturbation argument, we construct solutions to the Navier–Stokes equations in the half-space that exhibit the same qualitative behavior as in the Stokes case.
Read the full abstract

Friday 8 May

Information Theory · Cross-listed from cs.CL

Is MoE Routing a Huffman Code? Discovering the Frequency-Diversity Law in Chain-of-Thought

Mixture-of-Experts architectures have revolutionized scaling, yet the underlying logic of their routing remains a black box. In this paper, we uncover a fundamental governing principle: MoE routing is not merely selection, but a manifestation of Huffman Coding. We introduce the Frequency-Diversity Law, revealing that state-of-the-art models, such as Phi-3.5-MoE and Gemma-4-27B-A4B, spontaneously act as information-theoretic engines. These models allocate sparse expert resources for common tokens while invoking high-diversity expert committees for rare, complex tasks found in chain-of-thought trajectories. However, we identify a critical redundancy trap in Qwen3.5-35B-A3B: when effective sparsity (k/E_eff) is sufficiently low, load-balancing inadvertently imposes functional redundancy, masking the underlying Huffman efficiency signal. To bridge this gap, we propose Subset Difference Pruning, a surgical strategy to eliminate functional duplicates. We demonstrate that pruning does not degrade reasoning; instead, it unleashes the model's latent Huffman efficiency, forcing the logic to collapse into streamlined, high-density paths. Our findings suggest that the next generation of MoEs should move beyond forced load-balancing toward Minimum Description Length (MDL) optimality, assigning shorter expert-routing codes to high-frequency information and longer, more diverse codes to low-frequency information, thereby transforming routing from a heuristic into a principled compression engine.
Read the full abstract

Information Theory · Cross-listed from cs.CL

Limits of Reliability and Scaling in Language Models

Large language models (LLMs) are trained and evaluated as though perfect reliability is achievable for any task given sufficient scale. We show that this assumption is information-theoretically unjustified. Every generative task has a reliability ceiling that no model can exceed, determined by how much output uncertainty is resolvable from observable context. The gap decomposes into a resolvable component closable with additional context and a subjective component inherent to task ambiguity. Autoregressive generation further degrades this ceiling at a rate governed by the task's dependency kernel, which quantifies inter-token correlations in the output. From these two primitives, we derive a first-principles scaling law where LLM performance is bottlenecked by the scarcer resource: training data or model capacity. This law recovers the Chinchilla scaling law as a special case and provides a structural account of when scaling improves reliability. Beyond scaling, our framework unifies diverse practical phenomena, such as the benefits of retrieval-augmentation and the spectral mechanics of catastrophic forgetting. Our work formalizes the resource-complexity tradeoffs that govern model performance across domains, offering a unified theory of performance limits in generative language models.
Read the full abstract

Analysis of PDEs

On higher-order derivative ratios in turbulent flows

A computational study of higher-order derivative ratios on a time interval leading to the enstrophy peak is presented in the case of the 3D Taylor-Green vortex, a benchmark problem in the simulation of turbulent flows. The main finding is that the power law relating the ratios at time $t$ to $T^*-t$ where $T^*$ is the peak enstrophy time is of a form that allows the machinery of dynamic interpolation-sparseness to produce a lower bound on the radius of spatial analyticity sufficient to overcome an upper bound on the scale of sparseness of the super-level sets in view. As a consequence, the mechanism of turbulent dissipation engages via the harmonic measure maximum principle, furnishing a rigorous explanation for the subsequent slump of the enstrophy. This indicates that the higher-order derivative ratios – which could be viewed as higher-order analogs of the classical Taylor and Kraichnan scales in turbulence phenomenology – may be reasonable identifiers of the peak of the energy dissipation rate.
Read the full abstract

General Mathematics

Khayyam's Choices of Conics

In the late eleventh century, Omar Khayyam gave a systematic classification of, and solutions to, cubic equations by means of intersecting conic sections. His work is often retold in modern Cartesian language, where each cubic is reduced to equations of certain curves whose intersection determines solutions in the Cartesian plane. In this paper, we retain the first part of the standard modern treatment of Khayyam: translating his verbal algebra into modern symbolic algebra. But instead of interpreting the resulting equations as curves in a Cartesian plane, we interpret them as Khayyam himself did, as relations between positive geometrical magnitudes represented by conics in the Apollonian sense. On this basis, and using a purpose-designed colour scheme, we reconstruct, in a compact treatment, his solutions to all the cubic equations treated by Khayyam. The reconstruction brings to light a hidden feature of the treatise and draws a sharp line between the geometrization of algebra as practised by Khayyam, on the one hand, and the geometrization of algebra developed by Fermat and Descartes, on the other.
Read the full abstract

Functional Analysis

Recent progress of Littlewood-paley Theory with chirp function

Littlewood–Paley theory is a fundamental tool for frequency localization, square-function control, and multiplier analysis, yet a systematic counterpart in the fractional Fourier transform (FrFT) setting has remained incomplete. We develop a unified FrFT Littlewood–Paley framework based on the observation that, for a fixed $\alpha\notin\pi\mathbb Z$, a broad class of FrFT-side operators are exact chirp conjugates of their classical Fourier counterparts through $$ M_{\alpha}f(x)=e^{i\pi |x|^2\cot\alpha}f(x). $$ Within this unified framework we present: the FrFT multiplier identity; Littlewood–Paley square-function estimates and the converse theorem; sharp dyadic interval decompositions; Marcinkiewicz and Mihlin–H"ormander multiplier results; maximal, rough square-function, and almost-orthogonality estimates; twisted dyadic martingale geometry; inhomogeneous Sobolev, Besov, and Triebel–Lizorkin descriptions; Calderón reproducing formulae; pullback spaces and FrFT Riesz–Bessel operators; BMO, Carleson, sharp-maximal, and Hardy-space; twisted product estimates, multilinear bounds, and a Kato–Ponce theorem; fractional order-shifting in Lipschitz spaces; and the classical limit and singular boundary laws for the fractional parameter. The recurring theme is that a large class of FrFT operators are exact chirp conjugates of their classical counterparts, so most estimates are inherited with the same constants after one time identification of the rescaled symbols.
Read the full abstract

Functional Analysis

Structure-Preserving Reconstruction of Convex Lipschitz Functionals on Hilbert Spaces from Finite Samples

Convex functionals are ubiquitous in applied analysis, appearing as value functions, risk measures, super-hedging prices, and loss functionals in machine learning. In many applications, however, the functional is only observed through finitely many exact pointwise evaluations. We ask whether a convex functional on a separable Hilbert space $H$ can be reconstructed, up to arbitrary uniform accuracy, by an explicit formula which preserves convexity and Lipschitz regularity and is finitely computable. We answer this affirmatively. For every compact convex $C\subseteq H$, every $L$-Lipschitz convex functional $\rho:C\to\mathbb{R}$, and every $\varepsilon>0$, we construct an explicit finite-sample reconstruction which is convex, $L$-Lipschitz, and uniformly $\varepsilon$-accurate on $C$. The construction uses only finitely many linear measurements $\langle b,\cdot\rangle_H$, with $b$ lying in a finite-dimensional subspace of $H$, and is exactly implementable by a $\operatorname{ReLU}$-MLP. Building on this, we introduce convex neural functionals (CNFs), a structured trainable architecture class containing our reconstruction, whose every admissible parameter configuration is automatically convex and Lipschitz, providing a principled foundation for learning convex functionals from finite data.
Read the full abstract

Statistics Theory · Cross-listed from econ.EM

Nonparametric Empirical Bayes Confidence Intervals

Empirical Bayes methods can improve inference on unobservable individual effects by borrowing strength across units. This paper proposes nonparametric empirical Bayes confidence intervals (NP-EBCIs) for unobservable individual effects in a normal means model. The oracle intervals are constructed from posterior quantiles under a point-identified, fully nonparametric prior; feasible intervals replace these quantiles with nonparametric estimates. The NP-EBCIs are asymptotically exact in the sense that both their conditional and marginal coverage probabilities converge to the nominal level. The flexibility of this nonparametric construction has an unavoidable statistical cost. We demonstrate that posterior quantiles, unlike posterior means, inherit the severe ill-posedness of nonparametric deconvolution: the minimax optimal estimation rate is logarithmic. This logarithmic rate is minimax optimal for errors in the conditional coverage probability, and the resulting errors in the marginal coverage probability also vanish at the same logarithmic rate. Despite these slow asymptotic rates, simulations show that the NP-EBCIs remain close to nominal coverage when the prior is non-Gaussian, and deliver substantial length reductions relative to intervals that treat each unit in isolation.
Read the full abstract

Optimization and Control · Cross-listed from stat.ML

Sliced Inner Product Gromov-Wasserstein Distances

The Gromov-Wasserstein (GW) problem provides a framework for aligning heterogeneous datasets by matching their intrinsic geometry, but its statistical and computational scaling remains an issue for high-dimensional problems. Slicing techniques offer an appealing route to scalability, but, unlike Wasserstein distances, GW problems do not generally admit closed-form solutions in one-dimension. We resolve this problem for the GW problem with inner product cost (IGW), propose a sliced IGW distance that enjoys a natural rotational invariance property, and comprehensively study its structural and computational properties. Numerical experiments validating our theory are presented, followed by applications to heterogeneous clustering of text data and language model representation comparison.
Read the full abstract

Number Theory

A Complete Answer to Erdős Problem 690

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erdős asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes. Cambie proved that unimodality holds for \(1\le k\le3\) and verified non-unimodality for \(4\le k\le20\). We prove that \(p\mapsto d_k(p)\) is not unimodal for every \(k\ge4\), completing the classification. An exact first-difference criterion reduces the problem to comparing a symmetric-polynomial ratio with prime gaps. Explicit estimates for prime-counting functions, certified finite computations, one certified large prime gap, one certified twin prime, and a uniform Chinese-remainder construction then produce, for every \(k\ge4\), a strict descent followed by a later strict ascent.
Read the full abstract

Numerical Analysis

On a PDE-based material parameter identification problem with contact constraints

We consider the identification of a scalar coefficient in a PDE-based parameter estimation problem with contact constraints. The considered problem can be used as an idealized model of a membrane under forces, constrained by a barrier or indenter. More generally, it serves as a benchmark for the analysis of more complex contact problems and the development of corresponding reconstruction algorithms. In this paper, we discuss both the forward and inverse parameter estimation problems, as well as uniqueness and non-uniqueness issues caused by the contact constraints. Furthermore, we consider the design and implementation of reconstruction approaches which we test on numerical examples, illustrating both uniqueness and non-uniqueness as well as parameter identifyability.
Read the full abstract

Combinatorics

Total Conformal Rigidity in Graphs

We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum of the $k$ largest, over all normalized non-negative weight assignments. A graph that is $k$-conformally rigid for every $k$ is called totally conformally rigid. Our main result is a complete characterization: a graph is totally conformally rigid if and only if it is edge-rigid, meaning every canonical spectral embedding onto a Laplacian eigenspace is edge-isometric. We further show this is equivalent to all edges of the graph being pairwise Laplacian-cospectral, that is, the removal of any single edge yields a graph with the same Laplacian characteristic polynomial. Using semidefinite programming duality, we establish this equivalence and derive a polynomial-time algorithm for deciding edge-rigidity using only integer arithmetic. We provide a combinatorial characterization of edge-rigidity in terms of Laplacian walks and connect it to the walk-regularity of signed line graphs. We show that a graph is edge-rigid if and only if it is either $1$-walk-regular or $1$-walk-biregular, and we finally show an equivalence based on monotone gauges and gauge duality. As an application, we derive two non-trivial combinatorial consequences of total conformal rigidity, relating it to the number of spanning trees and the Kirchhoff index of the graph.
Read the full abstract