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)

Wednesday 6 May

Classical Analysis and ODEs

On Turán's inequality: new general criteria, nonnegative representations and the class of generalized Chebyshev polynomials

Originally, Turán's inequality states that if $(P_n(x))_{n\in\mathbb{N}_0}$ is the sequence of Legendre polynomials, then $\Delta_n(x):=P_n^2(x)-P_{n+1}(x)P_{n-1}(x)\geq0$ for all $n\in\mathbb{N}$ and $x\in[-1,1]$. Gasper specified the parameters $\alpha,\beta>-1$ for which the Jacobi polynomials $(R_n^{(\alpha,\beta)}(x))_{n\in\mathbb{N}_0}$ satisfy Turán's inequality. Frequently, such results rely on the specific structure of the concrete orthogonal polynomials under consideration. Therefore, special focus has been put on general criteria (whose importance was particularly emphasized by Nevai). We provide two general criteria for Turán's inequality in terms of the three-term recurrence relation and also deal with sharper estimations of the Turán determinants $\Delta_n(x)$. They extend earlier results of Szwarc and Berg–Szwarc. Applying our criteria to the class of generalized Chebyshev polynomials $(T_n^{(\alpha,\beta)}(x))_{n\in\mathbb{N}_0}$, which are the quadratic transformations of the Jacobi polynomials, we find the companion to Gasper's above-mentioned result. At this stage, we also obtain nonnegative representations of $\Delta_n(x)$. Finally, we study $2$-sieved polynomials and discuss further examples.
Read the full abstract

Numerical Analysis

Explicit Two-Sided Eigenvalue Bounds for Schrödinger Operators with Singular Potentials via Finite Element Method

We present, to the best of our knowledge, the first numerical algorithm for explicit, computable two-sided eigenvalue bounds for Schrödinger operators H = -Delta + V on R^N, N = 2,3, in the presence of both an unbounded potential and an unbounded domain. "Explicit" here means that all constants and ingredients are derived in closed form from the mesh, the potential, and a small set of explicit inequalities (Payne-Weinberger, Hardy, and explicit bounded-domain Sobolev embeddings); the conversion to fully verified(IEEE-754-safe, interval-arithmetic) enclosures is a separate verification step and is left for future work. In particular, singular attractive potentials of Coulomb type, V(x) = -Z/|x|, which model the hydrogen atom and the H_2^+ molecular ion, are covered by the theory. The method combines domain truncation to a bounded domain D(R) containing {|x| <= R} with an extension of Liu's Composite Enriched Crouzeix-Raviart (CECR) finite element method to sign-indefinite potentials. Upper bounds come from the standard conforming Galerkin method; lower bounds come from the CECR construction, whose gap to the exact eigenvalue closes as the mesh is refined. Numerical experiments on the 2D single- and two-centred Coulomb potentials and on the 3D hydrogen atom and H_2^+ molecular ion illustrate the algorithm and confirm the predicted convergence.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Understanding In-Context Learning for Nonlinear Regression with Transformers: Attention as Featurizer

Pre-trained transformers are able to learn from examples provided as part of the prompt without any weight updates, a remarkable ability known as in-context learning (ICL). Despite its demonstrated efficacy across various domains, the theoretical understanding of ICL is still developing. Whereas most existing theory has focused on linear models, we study ICL in the nonlinear regression setting. Through the interaction mechanism in attention, we explicitly construct transformer networks to realize nonlinear features, such as polynomial or spline bases, which span a wide class of functions. Based on this construction, we establish a framework to analyze end-to-end in-context nonlinear regression with the constructed features. Our theory provides finite-sample generalization error bounds in terms of context length and training set size. We numerically validate the theory on synthetic regression tasks.
Read the full abstract

All authors Alexander Hsu, Zhaiming Shen, Wenjing Liao, Rongjie Lai

Statistics Theory

Concordance, symmetrization and non-exchangeability for bivariate copulas

We study the relationship between measures of non-exchangeability $\mu_p$ ($p\in[1,+\infty]$), in the sense of Durante et al. (2010), and classical dependence functionals for bivariate copulas. We show that the symmetrization $C\mapsto(C+C^t)/2$ preserves Spearman's $\rho$ while annihilating $\mu_p$, and that Blomqvist's $\beta$ carries no information about the degree of non-exchangeability. We also establish the sharp lower bound $\sigma(C)\ge 6\,\mu_1(C)$, where $\sigma$ is the Schweizer-Wolff dependence measure, showing that asymmetry implies dependence. Closed-form expressions for $\tau$, $\rho$, and the tail-dependence coefficients of the maximally non-exchangeable family $\{M_\theta\}$ are derived as illustrations.
Read the full abstract

2605.05173 · 6 May · The authors have chosen to withdraw this manuscript because a potential flaw was identified in the main result. Further investigation and refinement are required to ensure the validity of the findings. The authors intend to update and resubmit the work once these issues are fully resolved

Information Theory

Private Contiguous-Block Retrieval

We introduce the Private Contiguous-Block Retrieval (PCBR) problem, where a user retrieves a block of $D$ messages with contiguous indices from $K$ replicated messages stored across $N$ non-colluding servers, while hiding the identity of the requested block from each server. This problem is motivated by storage and streaming systems where files are split into ordered segments. Unlike multi-message Private Information Retrieval (MPIR), where any $D$-subset may be requested, PCBR restricts the demand family to contiguous blocks. This relaxation raises a natural question: Can this structure be exploited to improve retrieval efficiency? We answer this question for balanced $\{0,1\}$-linear schemes. We establish an upper bound on the achievable retrieval rate for all problem parameters, derive a lower bound on the subpacketization level required by any scheme achieving the rate upper bound, and construct a rate-optimal scheme whose subpacketization level matches the lower bound for a broad range of problem parameters. Although the optimal PCBR rate coincides with the best-known MPIR rate converse bound, existing MPIR schemes can be suboptimal for PCBR and can require a much larger subpacketization level. In contrast, our scheme exploits the contiguous-block structure to achieve the optimal rate with reduced subpacketization.
Read the full abstract

Information Theory

Deterministic identification for Bernoulli channels and related channels with continuous input

For memoryless channels with continuous input alphabets, deterministic identification (DI) typically exhibits a linearithmic ($n\log n$) message growth. However, the exact DI capacity has long remained open due to a persistent gap between the best known achievability and converse bounds. This gap was recently closed for AWGN channels via a novel code construction optimising the "galaxy" codes. Here, we extend this approach to the Bernoulli channel and subsequently to any channel $W$ whose image contains a continuous curve of output probability distributions, and hence admits a reduction to the Bernoulli channel restricted to a subinterval of inputs. As a consequence, we prove that the converse bound is tight and establish $\dot{C}_{\text{DI}}(W) = \frac 12$ for this broad class of channels, thereby closing the long-standing capacity gap. A similar gap was also observed for the DI rate-reliability tradeoff. We analyse the tradeoff between rate and error of the proposed code and derive improved lower bounds on the reliability function, approaching the converse at leading order in the regime of small error exponents.
Read the full abstract

All authors Pau Colomer, Christian Deppe, Holger Boche, Andreas Winter

Information Theory

Private Structured-Subset Retrieval

We introduce the Private Structured-Subset Retrieval (PSSR) problem, where a user retrieves $D$ messages from a database of $K$ messages replicated across $N$ non-colluding servers, and the demand is restricted to a known structured family of $D$-subsets. This formulation generalizes Multi-message Private Information Retrieval (MPIR) and captures settings where the demand space is constrained by application-specific structure. Focusing on balanced ${\{0,1\}}$-linear schemes, a class that includes several best-known MPIR schemes, we derive converse bounds on the maximum retrieval rate and minimum subpacketization level required to achieve any given rate. We also develop an optimization-based framework to construct schemes for general structured demand families, providing flexibility in optimizing the retrieval rate or the subpacketization level. When specialized to the full demand family, this framework recovers known balanced $\{0,1\}$-linear MPIR constructions; for more restricted demand families, it can exploit the demand structure to increase the retrieval rate, reduce the subpacketization level, or both. We demonstrate this through a structured-demand example in which the proposed PSSR scheme simultaneously achieves a higher rate and requires a smaller subpacketization than the best-known MPIR scheme for the same parameters $N$, $K$, and $D$. Our parallel work on contiguous-demand families further illustrates the scope of this framework by yielding rate-optimal schemes with substantially smaller subpacketization and no field-size restrictions, improving upon MPIR-based schemes.
Read the full abstract

Information Theory

Age of Gossip in Ring Networks With Non-Poisson Updates

We consider a network consisting of $n$ nodes connected in a ring formation and a source that generates updates according to a renewal process and disseminates them to the ring network according to a Poisson process. The nodes in the network gossip with each other according to a push-based gossiping protocol, and disseminate version updates. Gossip between two neighbors happens at the arrivals of renewal processes with finite mean and variance. All renewal processes and Poisson processes in the network are independent but not identically distributed. We consider both uni-directional ring networks and bi-directional ring networks. We use version age of information to quantify the freshness of information at each node. Prior work has used the stochastic hybrid systems (SHS) approach or a first passage percolation (FPP) approach to analyze ring networks with edges following identical Poisson processes. In this work, we use a sample-path backtracking approach to characterize the probabilistic scaling of the version age of information of an arbitrary node in the gossip network, where each edge follows an independent but not identically distributed renewal process. We show that the version age of information of any node in the network is stochastically equivalent to $\sqrt{n}$ at any time instant after the node has received its first update from the source.
Read the full abstract

Combinatorics

Degree-sequence bounds for independent sets via multivariate local occupancy

We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspired by a conjecture of the first author and Kang and a recent bound on the multivariate partition function due to Lee and the third author. By applying a novel spectral analysis to the local occupancy linear program, our method successfully bypasses the convergence radius limitations of the cluster expansion and avoids induction. For graphs with bounded local maximum average degree, including triangle-free graphs, we prove a univariate bound extending prior work by a subset of the authors. In both cases our bounds require the fugacities to be upper bounded by $c/\Delta$ where $\Delta$ is the maximum degree of the graph and $c$ is an absolute constant depending on the setting.
Read the full abstract

All authors Ewan Davies, Juspreet Singh Sandhu, Jaehyeon Seo, Brian Tan

Classical Analysis and ODEs

On Characterizations of (Almost) Strictly Convex Functions

In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is subdifferentiable on its domain, then it is strictly convex if and only if its subdifferential is strictly monotone, equivalently, almost strictly monotone. Rockafellar-Wets' characterizations of almost strictly convex functions via almost differentiability of Fenchel conjugates and strict monotonicity of subdifferentials are extended from a finite-dimensional space to a Hilbert space. We also establish similar results for paramonotone operators.
Read the full abstract

Classical Analysis and ODEs

Almost Everywhere Convergence of Arithmetic Means of Walsh–Fourier Partial Sums Along Subsequences

Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f . $$ Gát proved in 2019 that $\sigma_N f \rightarrow f$ almost everywhere for every $f \in L^1$ under the growth condition $$ a(n+1) \geq\left(1+\frac{1}{n^\delta}\right) a(n), \quad 0<\delta<\frac{1}{2} . $$ We show that the same conclusion remains valid throughout the full range $0<\delta<1$.
Read the full abstract

Optimization and Control

On Controllability of a Class of N -dimensional Hyperbolic Equations with Internal Single-point Degeneracy

This paper explores the controllability of a class of N-dimensional hyperbolic equations featuring a single interior degenerate point. Firstly, we establish the well-posedness of the equation through the application of the Hardy inequality. Following this, we primarily utilize the Carleman estimate method to derive the observability inequality. By leveraging the equivalence between observability and controllability, we deduce the exact controllability of the equation. It is worth noting that our selected control region includes the degenerate null point. In the Carleman estimate, we adopt a unique approach to construct the weight function, effectively negating the influence of the degenerate region.
Read the full abstract

Analysis of PDEs

On a Partial Voigt Regularization of the 3D Magnetohydrodynamic Equations in Velocity-Vorticity Form

The Velocity-Vorticity (VV) formulation of the incompressible Navier-Stokes equations has become popular in recent years, especially in numerical studies, due to its structural advantages. Recently, with L. Rebholz, we introduced a Voigt regularization to the momentum equation in this formulation, establishing global well-posedness of the regularized system in 3D, along with convergence results and a blow-up criterion. In the present work, we extend these ideas to the 3D magnetohydrodynamics (MHD) equations. While it may seem that a “VV-type” split on the magnetic equation is required, we show that no such modification is necessary, and global well-posedness holds with a Voigt regularization only on the momentum equation, preserving the structure of both the vorticity and magnetic equations. We also prove that the regularized system converges to the original system, up to a possible blow-up time, and we establish a blow-up criterion for solutions to the original 3D MHD system.
Read the full abstract

Classical Analysis and ODEs

de la Vallée Poussin Means of Walsh-Fourier Expansions

We study de la Vallée Poussin means of Walsh–Fourier series associated with a nondecreasing window sequence. We establish a sharp criterion for almost everywhere convergence for integrable functions. We further show that, when this criterion fails, every Orlicz class below the logarithmic square-root scale contains a function whose de la Vallée Poussin means diverge everywhere.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Low-Cost Black-Box Detection of LLM Hallucinations via Dynamical System Prediction

Large Language Models (LLMs) frequently generate plausible but non-factual content, a phenomenon known as hallucination. While existing detection methods typically rely on computationally expensive sampling-based consistency checks or external knowledge retrieval, we propose a new method that treats the LLM as a black-box dynamical system. By projecting LLM responses into a high-dimensional manifold via an embedding model, we characterize the resulting vector sequences as observable realizations of the model's latent state-space dynamics. Leveraging Koopman operator theory, we fit the transition operators for both factual and hallucinated regimes and define a differential residual score based on their respective prediction errors. This approach enables low-cost hallucination detection in a single-sample pass, avoiding the need for secondary sampling or external grounding. Extensive testing across three data benchmarks demonstrates that our method achieves state-of-the-art performance with reduced resource overhead.
Read the full abstract

Information Theory · Cross-listed from quant-ph

A Factor-Graph Formulation of CSS Syndrome Decoding: Joint BP and Four-State BP

For CSS syndrome decoding, the two check matrices impose binary parity-check constraints on the two Pauli error components. The posterior can therefore be written as a binary factor graph with two Tanner graphs coupled by the local joint prior at each qubit. We call the sum-product algorithm on this factorization joint belief propagation (joint BP). Joint BP retains the local channel correlation between the two Pauli components. This note compares joint BP with the four-state Pauli-label factor graph used for four-state BP. The two algorithms are shown to have the same posterior weights, messages, and beliefs after relabeling the four local Pauli states and marginalizing the irrelevant binary component.
Read the full abstract

Rings and Algebras

Contact and 2-compatible Lie algebras

A $n$-dimensional Lie algebra $g=(V,\mu)$ is called $2$-compatible if it is isomorphic to a quadratic deformation of a Lie algebra $g_0=(V,\mu_0)$. By quadratic deformation we means a formal deformation $\mu_t=\mu_0+t\varphi_1+t^2\varphi_2$ where $\mu_t$ is a Lie algebra on $V \otimes K[[t]]$. It is equivalent to say that we have the following system $\sum_{i+j \leq 4} \varphi_i \circ \varphi_j= 0$. This notion naturally appears in the theory of classification of contact Lie algebras because any $(2p+1)$-dimensional contact Lie algebra is isomorphic to a quadratic deformation of the Heisenberg algebra $\mathcal{H}_{2p+1}$.
Read the full abstract

Numerical Analysis

BDF2-type integrator for Landau-Lifshitz-Gilbert equation in micromagnetics: a-priori error estimates

We consider the Landau-Lifshitz-Gilbert equation (LLG), which models time-dependent micromagnetic phenomena. We analyze a fully discrete scheme that combines first-order finite elements in space with a BDF2 method in time. The method requires the solution of only one linear system of equations per time step and does not enforce the pointwise unit-length constraint of the magnetization. While unconditional weak convergence has been analyzed in an earlier work, we now prove optimal-order convergence rates under sufficient regularity assumptions on the exact solution and the external field. In combination with our previous work, this establishes the first higher-order-in-time and linear integrator that converges both to weak and strong solutions of LLG. Numerical experiments confirm first-order convergence in space and second-order convergence in time.
Read the full abstract

K-Theory and Homology

Algebraic $K$-theory, cohomotopy $K$-groups, and Koszul duality

Let $A$ be an augmented differential graded algebra over a field $k$ of characteristic zero, and let $A^!=\mathbf{R}\mathrm{Hom}_A(k,k)$ be its Koszul dual algebra. Blumberg and Mandell showed that, under some finiteness conditions of $A$, the derived Koszul duality provides an equivalence between the $K$-theory $K(\mathrm{thick}_A(k))$ of the triangulated thick subcategory generated by $k$ and the $K$-theory $K(A^!)$ of the derived category of perfect $A^!$-modules. Combining this equivalence with the Jones-Goodwillie Chern character and the Jones-McCleary isomorphism, we obtain that the $K$-groups $K_n(\mathrm{thick}_A(k))$ are a concrete candidate for Loday's conjectural contravariant $K$-groups.
Read the full abstract

Optimization and Control · Cross-listed from econ.GN

Automation, Income Incidence, and Capital Accumulation in Incomplete Markets

This paper studies how automation changes the stationary distribution of income, consumption, and wealth in an incomplete-market economy. An automating sector trades off productivity gains and labor-cost savings against adoption costs. Households differ by skill and wealth, save in a capital/equity claim, and face uninsurable skill risk. Competitive factor prices and aggregate capital clear jointly with household Hamilton–Jacobi–Bellman equations and the stationary Kolmogorov forward equation. Automation affects consumption through labor-income incidence, precautionary saving, skill mobility, ownership of automation rents, and the stationary capital stock. In an adverse-incidence scenario with high exposure, adverse reskilling, capital obsolescence, and concentrated ownership, decentralized automation lowers stationary consumption and capital relative to the no-automation allocation. With stronger productivity and complementarity, lower obsolescence, and broader ownership, automation raises output, consumption, and capital. Reversing the assumed skill-mobility response also raises consumption, output, and capital substantially at a fixed automation intensity. A proxy diagnostic combining U.S. evidence on AI adoption, investment, labor-income pass-through, equity ownership, and marginal propensities to consume places the current economy near the boundary between the two scenarios. The model provides a quantitative framework for separating automation's aggregate gains from its distributional incidence.
Read the full abstract

2605.05127 · 6 May · Previously circulated as "The Demand Externality for Automation". Keywords: Artificial intelligence; automation; heterogeneous agents; incomplete markets; stationary equilibrium; capital accumulation; income incidence; ownership. JEL classifications: C63; D31; E21; E24; E27; E60; H21; J23; J24; O33

Combinatorics

On immanants of Cayley tables

Let $G$ be a finite abelian group of order $n$ and let $\mathcal M_G=(x_{a+b})_{a,b\in G}$ be the Cayley table of $G$. Let $\text{imm}_\lambda(\mathcal M_G)$ be the immanant of $\mathcal M_G$ with respect to a partition $\lambda$ and $\mathcal I_\lambda(G)$ be the number of formally different monomials occurring in $\text{imm}_\lambda(\mathcal M_G)$ (in particular, we denote by $\mathcal P(G)$ (resp. $\mathcal D(G)$) for the corresponding quantity for $\text{per}(\mathcal M_G)$ (resp. $\text{det}(\mathcal M_G)$) for simplicity). The study of $\mathcal P(G)$ and $\mathcal D(G)$ lies at the intersection of algebraic combinatorics and additive combinatorics. In this paper, we prove the following results. (1) If $|G|$ is a prime power, then $$\mathcal P(G)=\mathcal D(G).$$ (2) If $|G|$ is odd, then $$\mathcal I_{(n-1,1)}(G)= \mathcal I_{(2,1^{n-2})}(G)=0,$$ and if $|G|\equiv 2\pmod 4$, then $$\mathcal I_{(n-1,1)}(G)=\mathcal P(G)\quad \text{and}\quad \mathcal I_{(2,1^{n-2})}(G)=\mathcal D(G).$$ (3) If $|G|$ is odd and $|G|\ge 7$, then $$ \text{imm}_{(4,1^{n-4})}(\mathcal M_G)=\text{imm}_{(2,2,2,1^{n-6})}(\mathcal M_G).$$
Read the full abstract

Mathematical Physics

Time-Dependent Dynamical Dimensional Transmutation in the $SU(2)$ Gross-Neveu Model with Time-Dependent Interaction Strength

In this work we study driven $SU(2)$ Gross-Neveu (GN) model whose time-dependent interaction strength is constrained by quantum integrability within the recently developed generalized Bethe ansatz framework. Integrability requires the coupling strengths to evolve according to the same equation as the renormalization-group (RG) flow of the corresponding static theory, where time `$t$' of the time-dependent model is identified with the logarithm of the cutoff `$\ln \Lambda$' of the static model. We reformulate the exact quantum Knizhnik-Zamolodchikov (qKZ) solution in terms of a Yang-Yang functional, whose saddle-point equations determine the long-time dynamics of the system. In the scaling regime, this analysis reveals the emergence of a characteristic time scale $t_0$. In the case of coupling strength decreasing with time, we show that in the adiabatic regime, which corresponds to $t\sim t_0$ for drive rate $\alpha_0=1$, the system exhibits a dynamically generated time-dependent mass gap, which at time $t=t_0+\Delta t$ is given by $m(t)=m_0 e^{-\pi\alpha_0\Delta t}$, where $m_0=\Lambda e^{-\pi \alpha_0 t_0}$, which possesses the same functional dependence as the non-perturbatively generated mass scale of the static GN model. We thereby establish a time-dependent analogue of dynamical dimensional transmutation and identify the adiabatic regime of the driven system with the scaling regime of the static theory. In the case of very large time scales $t\gg t_0$ for drive rate $\alpha_0$ or for very fast drive rates $\alpha$ such that $\alpha t \gg \alpha_0t_0$, for any $t<L$, we argue that the system is asymptotically free and approaches the $SU(2)_1$ WZNW model, which corresponds to the UV fixed point of the $SU(2)$ GN model.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Minimizing the Expected Cost of Synchronization in Lossless Power Networks

The reliable operation of large-scale electric power networks is increasingly challenging, particularly with the integration of stochastic renewable generation. In this work, we address the problem of minimizing network transients by optimally modifying the underlying network. We formulate the problem in terms of graph Laplacian matrices and show that, under certain assumptions, the problem is convex. We derive a linear matrix inequality whose feasibility guarantees the existence and uniqueness of phase cohesive steady-state angles; this condition can be directly incorporated as a convex constraint in the optimization framework and we provide several geometric interpretations of the optimization problem. The proposed method is validated on the IEEE 30-bus test system, where results demonstrate that our approach effectively identifies critical links on the network. Dynamic simulations show a significant reduction in network transients and overall improvements across several performance metrics. We explore the sparsity-optimality trade-off using a reweighted $\ell_1$ heuristic.
Read the full abstract

Classical Analysis and ODEs

Energy-minimizing measures supported near fractal 1-sets

Energy techniques can be used to study the structure of fractal sets; the existence of a measure with finite Riesz energy supported on a set gives information about its dimension, distribution, and density. In this paper, we study energy-minimizing measures supported near fractal $1$-sets. Using physical analogy and a variant of the fast multipole method, we show a strong equidistribution result for these measures. We impose only mild geometric constraints on our sets, assuming only a generational structure of the approximations. This allows us to consider sets which do not exhibit self-similarity or other algebraic constraints. As a corollary, we demonstrate a fundamental limitation in the use of energy techniques for studying Favard length.
Read the full abstract

Number Theory

Theta functions and transformations of bilateral basic hypergeometric series

We establish new transformation formulas involving theta functions and certain bilateral basic hypergeometric series. From these formulas, we construct companion $q$-series for a class of $q$-series such that the asymptotic expansion of their quotient admits a simple closed form. This allows us to prove several conjectures of McIntosh on asymptotic transformations of $q$-series. Moreover, our results extend some identities of Ramanujan and McIntosh.
Read the full abstract

Number Theory

The top cohomology of principal congruence subgroups of special linear groups over Euclidean number rings

For $R$ a Euclidean number ring, and let $\Gamma_n(p)$ be the level-$p$ principal congruence subgroup of $\text{SL}_n(R)$. Borel–Serre showed that the cohomology of $\Gamma_n(p)$ vanishes above a degree $\nu$ that is quadratic in $n$. Let $K$ be the fraction field of $R$, and $\mathcal{T}_n(K)$ the Tits building of $\text{SL}_n(K)$. For $R=\mathbb{Z}$, Lee–Szczarba asked when $\text{H}^\nu(\Gamma_n(p))$ is isomorphic to $\widetilde{\text{H}}_{n-2}(\mathcal{T}_n(K)/\Gamma_n(p))$, which was answered by Miller–Patzt–Putman. We study a generalized version of Lee–Szczarba's question. We prove that for a prime $p$ in a Euclidean number ring $R$ with fraction field $K$, that a natural map $\text{H}^\nu(\Gamma_n(p)) \to \widetilde{\text{H}}_{n-2}(\mathcal{T}_n(K)/\Gamma_n(p))$ is always surjective, and give a sufficent set of conditions on $p \in R$ that guarantee when this map is an isomorphism.
Read the full abstract

Optimization and Control

CHAP: A Hybrid GPU-CPU Heuristic for MIP

We present CHAP (Coordinating Heuristics Across Platforms) a GPU-CPU-hybrid primal heuristic framework for mixed-integer programming. CHAP adopts a portfolio approach where it coordinates a set of primal heuristics, including Local Search, Fix-and-Propagate, and Feasibility Pump, via a shared solution pool. The solution pool is used to exchange feasible incumbent solutions, LP solutions, along with promising infeasible solution candidates, enabling a more comprehensive exploration of the solution space. On the GPU side, we implement a native tabu search featuring a novel best-shift algorithm built on sort, scan, and reduce primitives, along with specialized kernel designs. We additionally leverage cuPDLPx as an approximate LP solver. On the CPU side, we employ various Fix-and-Propagate strategies, guided by information from the solution pool, complemented by a CPU-based tabu search and a Feasibility Pump. All components operate collaboratively, iteratively repairing and improving candidate solutions maintained in the pool. We evaluate our framework on the 50-instances benchmark from the 2026 Land-Doig MIP Competition under competition constraints, including a five-minute time limit. In these settings, CHAP finds solutions to 47 instances outperforming both Gurobi (44) in default mode and NVIDIA cuOpt (43) in heuristics-only mode. The results demonstrate that coordinated cross-platform portfolios offer a promising direction for the integration of GPU heuristics into modern high-performance MIP solvers. The code will be made available on GitHub.
Read the full abstract

All authors Gennesaret Kharistio Tjusila, Alexander Hoen, Nils-Christian Kempke, Gioni Mexi, Timo Berthold, Ambros Gleixner, Thorsten Koch, Sebastian Pokutta

Analysis of PDEs · Cross-listed from cs.LG

Provable imitation learning for control of instability in partially-observed Vlasov–Poisson equations

We consider the stabilization of Vlasov–Poisson plasma dynamics, a central control problem in nuclear fusion. Our focus is the gap between what an ideal controller would use and what experiments can actually observe: while optimal policy may rely on the full phase-space state, practical feedback is typically limited to sparse macroscopic diagnostics. We therefore study imitation learning methods that distill a fully observed expert policy into controllers operating only on macroscopic measurements. We show the stability guarantees of the learned policy, where the error floor depends on the minimal behavior cloning loss achievable under the observation constraints. We further characterize this minimal loss in terms of a notion of entropy that quantifies the complexity of the initial distribution. Our results demonstrates the theoretical feasibility of learning stabilizing feedback policies for kinetic plasma dynamics from macroscopic observations, and exhibits the adaptivity of the learning approach to low-complexity structures. Through extensive numerical experiments, we validate our theory and show that the learned policies can stabilize the system using only macroscopic observations, within a significantly longer time horizon than non-adaptive baseline controllers.
Read the full abstract

Dynamical Systems

On the minimal generating weighted IFS of self-similar measure

We concern the structure of generating weighted IFSs of a self-similar measure on the real line. We provide various sufficient conditions for the existence of a minimal generating weighted IFS of a self-similar measure on the real line. Under the homogeneity, we show that `most' self-similar measures on the real line have a minimal generating weighted IFS, without separation conditions. The ingredients of our proofs are based on results of exponential polynomials (factorization theory and the distribution of zeros), logarithmic commensurability (with a dynamical system argument), and results on the structure of generating IFSs of a self-similar sets.
Read the full abstract

Statistics Theory

High-Dimensional Statistics: Reflections on Progress and Open Problems

Over the past two decades, the field of high-dimensional statistics has experienced substantial progress, driven largely by technological advances that have dramatically reduced the cost and effort for data collection and storage across a broad range of domains, including biology, medicine, astronomy, and the social and environmental sciences. Modern datasets are increasingly complex, often exhibiting rich dependency, heterogeneity, and other features that challenge traditional statistical methods. In response, high-dimensional statistics has evolved to address more sophisticated estimation and inference problems. This evolution has, in turn, fostered deep connections with and contributions to a wide range of research areas, including optimization, concentration of measure, random matrix theory, information theory, and theoretical computer science. Given the rapid pace of recent developments in high-dimensional statistics, our goal is to synthesize representative advances, highlight common themes and open problems, and point to important works that offer entry points into the field.
Read the full abstract

All authors Arian Maleki, Subhabrata Sen, Sivaraman Balakrishnan, Verena Zuber, Chao Gao, Rishabh Dudeja, Christos Thrampoulidis, Anru Zhang, Weijie Su, Jason M. Klusowski, Po-Ling Loh, Ali Shojaie