Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 7 April

Functional Analysis

Greedy sparsifications of sums of positive semidefinite matrices

We prove a deterministic analogue of Rudelson's sampling theorem for sums of positive semidefinite matrices. Let $A_1,\dots,A_m$ be positive semidefinite \(d\times d\) matrices, and let $\lambda_1,\dots,\lambda_m \ge 0$ satisfy \[ \sum_{i=1}^m \lambda_i = 1, \qquad \sum_{i=1}^m \lambda_i A_i = I_d, \qquad \|A_i\| \le M \quad\text{for all } i=1,\dots,m. \] We show that there exists a deterministic sequence of indices $i_1,i_2,\dots \in \{1,\dots,m\}$ such that for every integer $k \ge 1$, \[ \left\| \frac{1}{k}\sum_{r=1}^k A_{i_r} - I_d \right\| \le \begin{cases} \displaystyle \frac{2M\ln(2d)}{k}, & \text{if } k \le M\ln(2d),\\[2ex] \displaystyle 3\sqrt{\frac{M\ln(2d)}{k}}, & \text{if } k > M\ln(2d). \end{cases} \] In particular, if $0<\varepsilon\le 1$ and $N \ge 9M\ln(2d)\varepsilon^{-2}$, then one can choose indices $i_1,\dots,i_N \in \{1,\dots,m\}$ such that \[ \left\| \frac{1}{N}\sum_{r=1}^N A_{i_r} - I_d \right\| \le \varepsilon. \]
Read the full abstract

Complex Variables

Rarity of $\boldsymbol{\mathcal{C}^{1,1}}$ solutions to the complex Monge–Ampère equation on weakly pseudoconvex domains

We show that on any weakly pseudoconvex $B$-regular domain, the classical Dirichlet problem for the complex Monge–Ampère equation with $\mathcal{C}^\infty$-smooth data does not in general admit $\mathcal{C}^{1,1}$-smooth solutions. This working draft is a prelude to potential-theoretic solutions to some extension problems for mappings that were thought to rely on such $\mathcal{C}^{1,1}$-smooth solutions.
Read the full abstract

Combinatorics

On the quasisymmetric functions in superspace

Quasisymmetric functions in superspace were introduced as a natural extension of classical quasisymmetric functions involving both commuting and anticommuting variables. In this paper, we first provide a characterization of the algebra of quasisymmetric functions in superspace as an algebra of invariants under a quasisymmetrizing action of the symmetric group. Furthermore, we complete the superspace analogue of the classical hierarchy of combinatorial Hopf algebras by introducing the algebra of quasisymmetric functions in noncommuting variables in superspace. We endow this algebra with a Hopf superalgebra structure and thoroughly investigate its $Q$-basis and monomial basis, which are indexed by set supercompositions. By restricting to the minimal elements of the underlying poset, we construct the Hopf superalgebra of superpermutations, serving as the superspace analogue of the Malvenuto–Reutenauer algebra. We provide explicit product and coproduct formulas for these bases in terms of super-shuffles and global descents. Finally, via an abelianization morphism, we apply these noncommutative structures to derive a product formula for fundamental quasisymmetric functions in superspace.
Read the full abstract

Optimization and Control

The Chambolle-Pock method converges weakly with $0 < \theta \le 1/2$ and $\tau\sigma\|L\|^{2} < 4\theta(2-\theta)/(1 - 2\theta + 9\theta^{2} - 4\theta^{3})$

The Chambolle-Pock method, also known as the primal-dual hybrid gradient method, is a standard first-order algorithm for convex-concave saddle-point problems and composite convex optimization. We establish weak sequential convergence of its primal-dual iterates in real Hilbert spaces for every $0<\theta\leq 1/2$ whenever $\tau\sigma\|L\|^{2}<4\theta(2-\theta)/(1-2\theta+9\theta^{2}-4\theta^{3})$. This extends the weak-convergence theory to a previously unexplored range of extrapolation parameters.
Read the full abstract

Numerical Analysis

Low-rank-assisted inverse medium scattering: Lipschitz stability and ensemble Kalman filter

In this work we study the theoretical Lipschitz stability and propose a low-rank-assisted numerical method for the inverse medium scattering beyond the Born region. The proposed low-rank structure is based on the disk prolate spheroidal wave functions, which are eigenfunctions of both the Born forward operator and a Sturm-Liouville differential operator. We obtain Lipschitz stability for unknowns in a low-rank space in the fully nonlinear case and characterize the explicit Lipschitz constant in the linearized region. We further propose an ensemble Kalman filter to iteratively update the unknown in the proposed low-rank space whose dimension is intrinsically determined by the wave number. Moreover the ensembles are sampled according to a novel trace class covariance operator motivated by the connection between the proposed low-rank space and the Sturm-Liouville differential operator. Finally numerical examples are provided to illustrate the feasibility of the proposed method.
Read the full abstract

Dynamical Systems

Paterson compactifications, inverse limits and shadowing for Deaconu-Renault systems

We develop a new metric and inverse-limit framework for Deaconu-Renault systems arising from local homeomorphisms between open subsets of locally compact zero-dimensional spaces. Our starting point is the Paterson-type compactification of infinite product spaces, which underlies several symbolic and groupoid models, including one-sided shifts over infinite alphabets and path spaces of graphs and higher-rank graphs. We construct an explicit compatible ultrametric on this compactification and give a concrete description of its generalized cylinder topology and convergence. Within this framework, we introduce an inverse-limit-type space naturally associated to a Deaconu-Renault system. In contrast with the classical compact theory, the correct inverse-limit object must incorporate not only infinite backward orbits but also finite configurations arising as limits of such orbits. This produces a canonical shift system extending the original dynamics. We then study shadowing in the ultrametric setting. For spaces admitting tame defining sequences, we characterize shadowing in terms of the defining partitions, extending the topological description of shadowing from compact zero-dimensional dynamics to the locally compact setting relevant for Deaconu-Renault systems. As a main application, we prove a transfer theorem showing, under a separation property expressed through uniformly contracting inverse branches, that shadowing for the inverse-limit Deaconu-Renault system is equivalent to shadowing for the compactified base system. This provides a noncompact inverse-limit shadowing theory for a broad class of partially defined local-homeomorphism dynamics.
Read the full abstract

Analysis of PDEs

Finite-time contact in fluid-elastic structure interaction: Navier-slip coupling condition

We consider a fluid-structure interaction problem involving a viscous, incompressible fluid flow, modeled by the 2D Navier-Stokes equations, through a thin deformable elastic tube, displacement of which is not known a priori. The elastodynamics problem is given by 1D plate equations. The fluid and the structure are nonlinearly coupled via the kinematic and dynamic coupling conditions at the fluid-structure interface. The fluid flow is driven by dynamic pressure data imposed at the inlet and outlet of the tube. We impose the Navier-slip boundary condition at the deformable fluid-structure interface and at the bottom rigid boundary of the fluid domain. Hence, beyond the usual geometric nonlinearities arising from nonlinear coupling in FSI with no-slip, the analysis is more challenging due to the possibility of tangential jumps of the fluid and structural velocities at the moving interface. We first discuss the existence of weak solutions and then establish a `hidden' spatial regularity result for the structure displacement. Our main result proves the existence of a finite time for weak solutions at which the compliant upper boundary meets the lower boundary (i.e., the tube collapses), provided that there is a sufficient pressure drop across the channel. This resolves the ”no-collision” paradox identified by Grandmont and Hillairet in the no-slip setting in [Arch. Ration. Mech. Anal., 220(3): 1283-1333, (2016)], the counterpart to the present work. To the best of our knowledge, this is the first work that rigorously establishes finite-time contact in a fluid-elastic structure interaction system, thereby validating the model to correctly capture near-contact dynamics.
Read the full abstract

Combinatorics

Helly Theorems for Generalized Turán Problems

Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Turán number $\mathrm{ex}(n,T,\mathcal{F})$ is the maximum number of copies of $T$ in an $n$-vertex $\mathcal{F}$-free graph. We prove a general theorem which states that for any tree $T$, any family $\mathcal{F}$, and any integer $k$, either $\mathrm{ex}(n,T,\mathcal{F})$ is at least $\Omega(n^{k+1})$ or at most $O(\mathrm{ex}(n,\mathcal{F})^{k})$, from which we derive a number of consequences. Our proofs rely on new variants of the classical Helly Theorem for trees which may be of independent interest. As far as we are aware, this is the first known application of Helly theorems for Turán type problems.
Read the full abstract

Optimization and Control

Convergence of Riemannian Stochastic Gradient Descents: Varying Batch Sizes And Nonstandard Batch Forming

We establish convergence theorems for Riemannian stochastic gradient descents in which the underlying probability spaces vary from iteration to iteration. As applications, we deduce convergence results for Riemannian stochastic gradient descents with varying batch sizes and unbiased batch forming schemes.
Read the full abstract

Differential Geometry

On the Chern-Ricci form of a twisted almost Kähler structure

Let $(M,g,J,\omega)$ be an almost Kähler manifold. For any smooth function $f$ on $M$, one can associate an automorphism $\psi\in \mbox{Aut}(TM)$ for which the Kähler form is invariant. Using $\psi$, one can “twist" the metric $g$ and almost complex structure $J$ to obtain a new almost Kähler structure $(g^\psi,J^\psi,\omega)$ on $M$. Let $\widetilde{D}$ denote the Chern connection of $(g^\psi,J^\psi,\omega)$ and let $K^{-1}$ denote the anti-canonical bundle of $(TM,J^\psi)$. In the current paper, we give an explicit formula for the local connection 1-form $\alpha$ associated to the pair $(K^{-1},\widetilde{D})$. The Chern-Ricci form of $(g^\psi,J^\psi,\omega)$ is then $\rho_{\widetilde{D}}=-d\alpha$. We note that under certain conditions the aforementioned formula assumes a simpler form when applied to the calculation of $\alpha$. We illustrate this with some examples.
Read the full abstract

Analysis of PDEs

On the Jordan-Moore-Gibson-Thompson equation of nonlinear acoustics

The JMGT equation was put forward by Pedro Jordan~\cite{jordan2008nonlinear,jordan2014second}, also referring to earlier work by Moore and Gibson~\cite{moore1960propagation}, as well as Thompson~\cite{thompson} to amend the infinite speed of sound paradox of classical models of nonlinear acoustics such as the Westervelt and Kuznetsov's equation. Additionally to its physical significance (and of course related to it), it has given rise to a substantial body of mathematical literature – possibly even more than the above mentioned classical models. In this paper, we aim to provide a systematic (though inevitably incomplete) overview %and indicate some potential open questions. thereby focusing on well-posedness analysis of initial value and time periodic problems, memory and fractional attenuation as well as singular limits and – with one example each – control and inverse problems.
Read the full abstract

Optimization and Control

Adaptive Control with Sparse Identification of Nonlinear Dynamics

This paper develops a sparsity-promoting integral concurrent learning (SP-ICL) adaptation law for a linearly parametrized uncertain nonlinear control-affine systems. The unknown parameters are learned using ICL with sparsity-promoting $\ell_1$ regularization. The use of $\ell_1$ regularization for sparsity promotion is common in system identification and machine learning; however, unlike existing approaches, this paper develops an online parameter update law that integrates the regularization penalty with ICL via sliding modes. We show via non-smooth Lyapunov analysis that the trajectories of the closed-loop system are ultimately bounded under the SP-ICL update law. Simulations verify the effectiveness of the sparsity penalty in the SP-ICL update law on recovering sparse dynamics during trajectory tracking.
Read the full abstract

All authors Trivikram Satharasi, Tochukwu E. Ogri, Muzaffar Qureshi, Kyle Volle, Rushikesh Kamalapurkar

Algebraic Geometry

Factorizations of Moduli Morphisms and Universal Maps to Deligne-Mumford Stacks

Let $\mathcal{X}$ be an algebraic stack admitting a moduli space $\mathcal{X}_{\mathrm{mod}}$. We study the factorizations of the moduli space morphism $\mathcal{X}\rightarrow\mathcal{X}_{\mathrm{mod}}$ to construct intermediate stacks that simplify the stacky structure of $\mathcal{X}$ while retaining more structural information than $\mathcal{X}_{\mathrm{mod}}$. Under mild assumptions, we prove the existence of a universal morphism from $\mathcal{X}$ to stacks satisfying well-behaved `modular properties' (such as being Deligne-Mumford, having finite inertia, or being uniformizable), and show that this universal map is itself an adequate moduli space morphism. We achieve this by proving that ascending chains of adequate moduli space morphisms from a Noetherian stack stabilize if they are cohomologically affine or with target Deligne-Mumford stacks. Finally, we demonstrate that stabilization completely fails for general adequate moduli space morphisms. We construct a simple Noetherian, Deligne-Mumford stack admitting an infinite, non-stabilizing chain of adequate moduli space morphisms, whose limit is a non-algebraic fpqc stack.
Read the full abstract

Numerical Analysis · Cross-listed from cond-mat.dis-nn

DYNAMITE: A high-performance framework for solving Dynamical Mean-Field Equations

Understanding the dynamics of systems evolving in complex and rugged energy landscapes is central across physics, economics, biology, and computer science. Disordered mean-field models provide a powerful framework, as exact Dynamical Mean-Field Equations (DMFE) can be derived. However, solving the DMFE – a set of coupled integral-differential equations for two-time functions – remains a major numerical challenge. So far, large-time solutions of DMFE rely either on analytical approaches, such as the Cugliandolo–Kurchan ansatz based on assumptions like weak ergodicity breaking (which is known to fail in some cases), or on numerical integrations that reliably reach times $O(10^3)$ and extend further only via poorly controlled approximations. Consequently, no general method currently exists to solve DMFE at very long times, limiting the study of slow dynamics in complex landscapes. We present Dynamite (DYNAmical Mean-fIeld Time Evolution solver), a high-performance framework for solving DMFE up to unprecedented times $t=O(10^7)$. It combines non-uniform interpolation, adaptive time stepping, and numerical `renormalization' of memory, enabling accurate evaluation of history integrals. Its asymptotic runtime is linear, with sublinear memory scaling. Stability and precision are ensured via an adaptive Runge–Kutta scheme and periodic sparsification of the past. Dynamite achieves orders-of-magnitude speedups over uniform-grid methods while maintaining accuracy and reproducibility on CPU and GPU architectures. Benchmarks on glassy mean-field models, including the mixed spherical $p$-spin system, demonstrate access to aging and relaxation regimes previously out of reach. The framework provides a reproducible and extensible foundation for studying long-memory dynamical systems.
Read the full abstract

All authors Johannes Lang, Vincenzo Citro, Luca Leuzzi, Federico Ricci-Tersenghi

Combinatorics

A Formal Refutation of the Hypergeometric Parametric Extension for Reciprocal Binomial Sums

Recent work by Pain [1] proposed a systematic approach to evaluating binomial sums involving reciprocals of binomial coefficients via Beta integrals. In particular, a parametric extension (Proposition 6.1) was introduced and claimed to admit a closed-form representation in terms of a terminating 2F1 hypergeometric function. Through a combination of internal logical consistency checks, integral derivation analysis, and exact symbolic computation, we definitively prove that this parametric identity is false.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Asymptotic-Preserving Neural Networks for Viscoelastic Parameter Identification in Multiscale Blood Flow Modeling

Mathematical models and numerical simulations offer a non-invasive way to explore cardiovascular phenomena, providing access to quantities that cannot be measured directly. In this study, we start with a one-dimensional multiscale blood flow model that describes the viscoelastic properties of arterial walls, and we focus on improving its practical applicability by addressing a major challenge: determining, in a reliable way, the viscoelastic parameters that control how arteries deform under pulsatile pressure. To achieve this, we employ Asymptotic-Preserving Neural Networks that embed the governing physical principles of the multiscale viscoelastic blood flow model within the learning procedure. This framework allows us to infer the viscoelastic parameters while simultaneously reconstructing the time-dependent evolution of the state variables of blood vessels. With this approach, pressure waveforms are estimated from readily accessible patient-specific data, i.e., cross-sectional area and velocity measurements from Doppler ultrasound, in vascular segments where direct pressure measurements are not available. Different numerical simulations, conducted in both synthetic and patient-specific scenarios, show the effectiveness of the proposed methodology.
Read the full abstract

Analysis of PDEs · Cross-listed from gr-qc

A note on the instability of the Kerr Cauchy horizon under linearised gravitational perturbations

This note slightly strengthens the result of arXiv:2201.12295 on the linear instability of the Kerr Cauchy horizon. This strengthened result is used in the proof arXiv:2604.04877 of the non-linear instability of the Kerr Cauchy horizon.

Probability · Cross-listed from stat.ML

Generalization error bounds for two-layer neural networks with Lipschitz loss function

We derive generalization error bounds for the training of two-layer neural networks without assuming boundedness of the loss function, using Wasserstein distance estimates on the discrepancy between a probability distribution and its associated empirical measure, together with moment bounds for the associated stochastic gradient method. In the case of independent test data, we obtain a dimension-free rate of order $O(n^{-1/2} )$ on the $n$-sample generalization error, whereas without independence assumption, we derive a bound of order $O(n^{-1 / ( d_{\rm in}+d_{\rm out} )} )$, where $d_{\rm in}$, $d_{\rm out}$ denote input and output dimensions. Our bounds and their coefficients can be explicitly computed prior to the training of the model, and are confirmed by numerical simulations.
Read the full abstract

Algebraic Topology · Cross-listed from cs.LG

Unsupervised Topological Characterization of Slug, Churn and Annular Flow in Small-Diameter Vertical Pipes Using Euler Characteristic Surfaces

Regime transitions in vertical gas-liquid flow are read from mechanistic models or assigned by eye, and for churn flow neither route has produced a settled criterion. We ask how much an unsupervised topological description of flow video can establish about them. The description is the Euler characteristic surface, a count of the connected gas and liquid regions in each frame across morphological scales. Kernels derived from it are combined by unsupervised multiple kernel learning, and the trials are divided into contiguous groups along gas velocity. For 37 air-water trials in 2-in. tubing at one liquid rate, with three viewing stations averaged, four groups are separated at 4.33, 7.51 and 11.70 m/s. Each division falls at or within one trial of a change in the visual evaluation of the same videos; cuts placed at random would match as closely in 12% of cases. The divisions move between viewing stations and under resampling, a kernel built on gas velocity divides any sampled range into roughly equal parts and cannot locate a transition, and the data do not support a revised transition criterion. On independent images from an annulus, churn shows about three times the across-scale variance of slug. Within the band the published criteria assign to churn, the two upper cuts fall at graded changes in the rankings, consistent with a progression within churn; if confirmed by further data, they would subdivide the churn region.
Read the full abstract

All authors Brady Koenig, Sushovan Majhi, Atish Mitra, Abigail Stein, Burt Todd

Representation Theory

The Galois Alperin weight conjecture for finite category algebras

Let $p$ be a prime, $k$ an algebraic closure of $\mathbb{F}_p$ and $\Gamma$ the Galois group ${\rm Gal}(k/\mathbb{F}_p)$. Let $\mathcal{C}$ be a finite category and $\mathcal{O}_{\mathcal{C}}$ the $p$-orbit category of $\mathcal{C}$ defined by Linckelmann. We formulate a version of the Galois Alperin weight conjecture (GAWC) for finite category algebras stating that there exists a $\Gamma\times {\rm Aut}(\mathcal{C})$-equivariant bijection between the set of isomorphism classes of simple $k\mathcal{C}$-modules and that of the weights of $k\mathcal{O}_{\mathcal{C}}$. We reduce the GAWC for finite categories to finite groups. For $\mathcal{C}$ an EI-category, we give a partition of weights of $k\mathcal{O}_{\mathcal{C}}$ with respect to blocks of $k\mathcal{C}$ and then formulate a blockwise Galois Alperin weight conjecture (BGAWC) for $\mathcal{C}$. Similarly, we reduce the BGAWC for finite EI-categories to finite groups.
Read the full abstract

Combinatorics

On supertoken graphs

We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some bounds and exact values on the independence number, clique number, and chromatic number of these graphs. Finally, we construct a new infinite family of graphs, which we call the $p$-augmented 2-token graphs of cycles, and study their properties, including the spectral radius or largest adjacency eigenvalue.
Read the full abstract

Optimization and Control

Distributionally Robust Regret Optimal LQR with Common Stage-Law Ambiguity

We study what is, to our knowledge, the first tractable multistage ex-ante distributionally robust regret optimization (DRRO) formulation for stochastic control. We consider finite-horizon LQR with common stage-law ambiguity, where disturbances are independent across time but drawn from the same unknown stage law whose mean and covariance lie in a Gelbrich ball around nominal moments. Unlike the benign single-stage quadratic setting, the nominal controller is generally not regret-optimal: reuse of the stage law makes past disturbances informative for future decisions. Despite the general hardness of DRRO, we show that, over affine disturbance-feedback policies, the multistage DRRO-LQR problem admits an exact semidefinite programming reformulation. An optimal controller in this class is the nominal LQR controller plus a strictly causal empirical-mean correction. We also characterize worst-case moment pairs and show that, for the DRRO-optimal policy, they are not unique. Portfolio liquidation experiments show that DRRO substantially reduces worst-case regret relative to DRO and the nominal controller, with comparatively modest increases in worst-case cost, and exhibits a learning effect: its correction matrices empirically approach the corresponding coefficients of the oracle controller that knows the true disturbance law in hindsight.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Sufficient conditions for proper posteriors in fully-Bayesian Functional PCA

In a fully-Bayesian Functional Principal Components Analysis (FPCA) the principal components are treated as unknown infinite-dimensional parameters. By projecting the functional principal components on a rich orthonormal spline basis, we show that orthonormality of the principal components is equivalent to orthonormality of the spline coefficients. A penalty on the integral of the second derivative of the functional principal components can be induced on the spline coefficients, where each function has its own smoothing parameter. Finally, each smoothing parameter is treated as an inverse variance component in the associated mixed effects model. In this work, we demonstrate that no additional conditions are required to ensure that the corresponding smoothing prior, and thus the posterior distribution, is proper. This allows the choice of less informative priors, such that smoothing is driven by the data.
Read the full abstract

Logic

Analytically generated sharply o-minimal structures

We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially effective parameterization theorem using real complex cells for real sets definable in such structures. Following Binyamini–Novikov, this allows us to establish a polynomially effective version of the Yomdin–Gromov lemma on C^r-smooth parameterizations of definable sets, which implies Wilkie's conjecture on polylogarithmic bounds for the amount of algebraic points of bounded height and degree in the transcendental part of a definable set. In addition, we obtain a polynomially effective preparation theorem for definable functions, similar to the subanalytic preparation theorems of Parusinski and of Lion–Rolin.
Read the full abstract

Differential Geometry

Finite index constant mean curvature hypersurfaces in low dimensions

We prove that every complete finite index immersed CMC hypersurface is either minimal or compact, provided that the ambient six-dimensional manifold is a Riemannian product of a closed manifold with non-negative sectional curvature and a Euclidean factor. This answers affirmatively a question posed by do Carmo, for this class of ambient spaces, and extends known lower dimensional results. As a consequence, we complete the classification of two-sided, complete weakly stable CMC hypersurfaces immersed in the space forms of positive curvature in dimension six. More generally, we study the class of Riemannian manifolds with bounded curvature and obtain several partial results. In particular, we show that a complete, finite index CMC hypersurface immersed in the hyperbolic six-space with mean curvature vector of length greater than seven is necessarily compact.
Read the full abstract

Complex Variables

When a meromorphic function that omits three values is of bounded type

Suppose that a function $F$ is meromorphic in the domain $\mathbb H(-m) = \{ z : \mathrm{Im}\, z > -m(\mathrm{Re}\, z) \}$, where $m$ is an even, positive, and continuous function that does not increase on $\mathbb R_{\ge 0}$, and suppose that $F$ omits there three distinct values. Then $F$ is of bounded type in the upper half-plane (i.e., is represented there as a quotient of two bounded analytic functions), provided that the logarithmic integral of the function $m$ is convergent. On the other hand, if the logarithmic integral of $m$ diverges, there exists a function $F$ meromorphic in $\mathbb H(-m)$, that omits there three distinct values, and which is of unbounded type in the upper half-plane. This result is motivated by a century old question originating with Rolf Nevanlinna.
Read the full abstract

2604.06136 · 7 Apr · 19 pages, made several minor improvements in the presentation, added a reference to the recent preprint by Yixin He and Teng Zhang answering the question mentioned in the abstract, and a brief discussion of their construction

Numerical Analysis

QAFE$^2$: Quantum accelerated multiscale finite element analysis

The computational cost of concurrent multiscale finite element methods is dominated by the repeated solution of microscopic representative volume element (RVE) problems at macroscopic quadrature points. In this work, we introduce a quantum-classical framework for multiscale finite element analysis (QAFE$^2$) that leverages quantum parallelism to fundamentally alter the scaling of RVE-based homogenisation. At the single-RVE level, the proposed quantum solver attains polylogarithmic complexity with respect to the microscopic discretisation size, yielding an exponential asymptotic speedup over the best available classical solvers. More importantly, QAFE$^2$ exploits quantum superposition and entanglement to evaluate, in a single quantum execution, the entire ensemble of RVE problems associated with all macroscopic quadrature points. This capability is a form of intrinsic quantum concurrency with no classical analogue. Numerical experiments on one- and two-dimensional model problems with known analytical solutions confirm the accuracy of the proposed formulation and verify the theoretical computational scaling and parallel performance.
Read the full abstract

Information Theory

Multilevel Coset Codes on Lattices

This work introduces coset Bombe codes, a novel class of multilevel coset codes that generalize polar codes to dense lattice structures. By leveraging multilevel coding with non-binary codes designed for the lattice modulations and making use of Voronoi shaping, Bombe codes integrate the geometric strengths of dense lattices such as $D_4$ with the capacity-approaching properties of polar codes. Experimental results in additive white Gaussian noise (AWGN) channels demonstrate that coset Bombe codes significantly outperform both BICM and MLC state-of-the-art schemes on 16-QAM. The proposed scheme simulated on AWGN achieves up to 0.8 dB of gain and reduces block size latency by half while maintaining superior bit and block error rate (BER/BLER) performance on codewords of 256 and 1024 bits.
Read the full abstract

All authors Leopold Bertholet, Chloe Makdad, Stephen Mackes, Daniel Chew, Matthew Robinson

Probability

REM universality for linear random energy

We consider a sequence of random Hamiltonians $H_n(h,\sigma)=\sum^n_{i=1}h_i(\sigma_i-m)$, and study the asymptotic ($n\to \infty$) distribution of the energy levels $(H_n(h,\sigma))_{\sigma\in \{-1,1\}^n}$, where $h_1,h_2,\cdots$ are i.i.d. random variables. We show that, when $e^{O(n)}$ configurations are sampled at random, the corresponding collection of energy levels converges in distribution to a Poisson point process with exponential intensity measure. This establishes the Random Energy Model (REM) universality for the present model. Our results strengthen earlier works on local REM universality by characterizing the distribution of $O(1)-$order fluctuations of $H_n$. In addition, we improve upon the REM universality by dilution studied by Ben Arous, Gayrard, Kuptsov by allowing an exponentially large number $e^{O(n)}$ of sampled configurations, instead of $e^{o(\sqrt{n})}$. Finally, we derive the asymptotic distribution of the Gibbs weight.
Read the full abstract

Classical Analysis and ODEs

Projections of sets with optimal oracles onto $k$-planes

We prove a Kaufman-type exceptional set estimate for sets in $\mathbb{R}^n$ that have optimal oracles, a class of sets that strictly contains the analytic sets and sets with equal Hausdorff and packing dimension. As a consequence, we generalize the conditions under which Marstrand's projection theorem for $k$-planes is known to hold. Our proofs use effective methods, especially Kolmogorov complexity, and along the way, we introduce several new tools for studying the information content of elements of the Grassmannian.
Read the full abstract