Numerical Analysis
Two Dimensional Fourier Continuation for Domains with Corners
Oscar P. Bruno and Allen Yang
This paper presents a fast "two-dimensional
Fourier Continuation" (2D-FC) method for the construction of biperiodic extensions of smooth, non-periodic functions defined over general two-dimensional (2D) domains, including domains with corners. The
algorithm operates with an O(N log N) computational cost, for an N-point discretization grid, and it achieves a user-prescribed d-th order of accuracy. The methodology can be generalized to non-smooth domains of arbitrary dimensionality, but such extensions are not considered in the present work. The usefulness and performance of the 2D-FC method are demonstrated through applications to the Poisson problem posed on bounded 2D domains with corners. One illustrative application concerns a Poisson problem on a non-smooth drop-shaped domain with a highly oscillatory forcing term; employing a discretization containing approximately four million degrees of freedom, the method produces the Poisson solution with accuracies of the order of machine precision in computing times on the order of one second on a single core of a present-day computer.
Read the full abstract ▾
Analysis of PDEs
Large time behavior and transition from vanishing to spreading regimes for the generalized Burgers-Fisher-KPP equation
Razvan Gabriel Iagar and Ariel Sánchez
The large time behavior of solutions to the following generalized Burgers-Fisher-KPP equation $$ \partial_tu=u_{xx}+k(u^n)_x+u^p-u^q, \quad (x,t)\in\mathbb{R}\times(0,\infty), $$ with $n\geq2$, $p>q\geq1$ and $k\in\mathbb{R}$, is considered in this work. Denoting by $H(x,t)$, respectively $\widetilde{H}(x,t)$ the solutions having as initial condition the Heaviside, respectively the “anti-Heaviside" functions $$ H_0(x)=\begin{cases} 0, & \mbox{if } x<0 1, & \mbox{if } x\geq0. \end{cases}, \quad \widetilde{H}_0(x)=1-H_0(x), $$ critical velocities $\overline{c}$, respectively $\widetilde{c}=kn+2\sqrt{p-q}$, are identified such that $H(x,t)$, respectively $\widetilde{H}(x,t)$ approach the unique traveling wave solution of the equation with these critical velocities as $t\to\infty$. The critical velocity $\overline{c}$ is anomalous, that is, it cannot be made explicit by an algebraic expression. Assuming for simplicity $k>0$, a remarkable fact is that, while $\widetilde{H}(x,t)\to0$ as $t\to\infty$ uniformly on compact subsets of $\mathbb{R}$, the Heaviside solution $H$ might tend either to zero or to one as $t\to\infty$, depending on the sign of the critical velocity $\overline{c}$. This sign vary with respect to the exponents $n$, $p$, $q$ and the coefficient $k$ and, in fact, we prove that given $p$, $q$, $n$, there exists a critical coefficient $k^*(n,p,q)$ such that $\overline{c}>0$ if $k>k^*(n,p,q)$ and $\overline{c}<0$ if $k<k^*(n,p,q)$. The convergence to either zero or one reflects the sharp influence of the convection term, since in the absence of it (that is, $k=0$), $H(x,t)$ would always tend to zero as $t\to\infty$. The results include more general initial conditions than the Heaviside-type functions, and sharp estimates of the threshold coefficient $k^*(n,p,q)$ are also given.
Read the full abstract ▾
Differential Geometry
Stable 2-systole bounds in positive scalar curvature
Douglas Stryker
We prove that the stable 2-systole is uniformly bounded on the space of Riemannian metrics with scalar
curvature at least one for closed
spin 2-essential
manifolds, which includes $S^2 \times S^2$, $S^2 \times T^n$, and $\mathbb{C}\mathbb{P}^{2n+1}$.
Differential Geometry · Cross-listed from cs.RO
Dynamic Coupling and Indirect Control of Jointed Robots Rolling Atop A Moving Platform
Hamidreza Moradi and Scott David Kelly
An asymmetric two-link
robot supported atop a flat platform by wheels that roll and pivot freely, but do not slip laterally, will develop forward momentum if the joint between the links is actuated internally. In particular, oscillations in the joint angle will generate undulatory locomotion suggesting fishlike swimming. If two such
robots surmount a common platform that's free to translate with its own inertial dynamics, then the individual
robots' dynamics will be coupled so that the locomotion of either
robot is affected by that of the other. We develop a mathematical model for this system and present simulations demonstrating its behavior. We then consider a single
robot with an unactuated joint rolling atop a platform that moves under control, and show that actuation of the platform is sufficient to dictate the
robot's behavior. In particular, with the acceleration of the platform as an input, the
robot's heading can be made to track a chosen function of time. This is sufficient to guarantee that the
robot can be induced to orbit a fixed point on the platform or to locomote persistently in a desired direction.
Read the full abstract ▾
Combinatorics
Diameter-Ramsey triangles below the $135^\circ$
Yaping Mao
A finite Euclidean set is diameter-Ramsey if, for every number of colors, some finite same-diameter witness has the property that every coloring of the witness contains a monochromatic congruent copy of the set. Frankl, Pach, Reiher and Rödl asked whether any obtuse triangle is diameter-Ramsey. We prove the stronger statement that every non-degenerate triangle whose largest angle is strictly smaller than $135^\circ$ is diameter-Ramsey. Together with the
theorem of Corsten and Frankl that triangles with an angle larger than $135^\circ$ are not diameter-Ramsey, this gives the sharp classification for the two open angular ranges on either side of $135^\circ$. The proof uses a weighted $k$-subset configuration with non-negative coefficients; a finite binary-tree construction realizes the required two prescribed overlaps, and the ordinary hypergraph Ramsey
theorem then forces a monochromatic copy of the triangle.
Read the full abstract ▾
Representation Theory
On irreducible representations of conjugacy quandles
Mohamad Maassarani
For $G$ a finite group, one way to construct irreducible quandle representations over $\mathbb{C}$ of the conjugacy quandle $Conj(G)$ is by taking the product of an irreducible linear group representation of $G$ by what we call a quandle character of $Conj(G)$ (a quandle morphism into $\mathbb{C}^\times$ ). We show that these are all the irreducible quandle representations of $Conj(G)$ over $\mathbb{C}$ if and only if the Bogomolov multiplier $B_0(G)$ of $G$ is trivial. The Bogomolov multiplier is trivial for many classical groups, simple groups and with exceptions quasi-simple groups. We apply this to study the enveloping group of $Conj(G)$. If $G$ finite with trivial $B_0(G)$, we obtain that the enveloping group of $Conj(G)$ injects into $G\times \mathbb{Z}^{c_G}$ where $c_G$ is the number of the conjugacy classes of $G$. If moreover $G$ is perfect the injection is an isomorphism.
Read the full abstract ▾
Analysis of PDEs
Cumulative Euler flows
Helge Kristian Jenssen
We consider the compressible Euler system for ideal gas flow in the absence of any forces except the internal thermodynamic pressure. In this setting, and in dimensions higher 1, it is known that wave-focusing can drive Euler solutions to amplitude blowup in finite time from bounded initial data. In the known cases (self-similar, radial flows \cites{gud,hun_60,jt3,laz,mrrs1,jls}) the primary flow variables are standard functions at time of blowup. It is natural to ask if the Euler system admits even more singular behavior, and specifically whether accumulation of mass, i.e., the appearance of a Dirac delta in the density field, is possible. We consider the class of radial affine motions \cites{mcvittie,sed, kell,sid_2014} which are conveniently obtained via a Lagrangian formulation. This class does include examples of cumulative behavior, and we observe that there are two distinct mechanisms for accumulation, due to inertial effects or adverse pressure gradients, respectively. However, we show that all affine cumulative solutions necessarily exhibit unphysical behavior due to initially unbounded velocity and/or acceleration in the far-field. We also analyze the behavior of characteristics in cumulative flows and consider concrete examples, including a class of 1-dimensional, non-affine flows. Finally, we discuss the possibility of modifying the known examples to obtain physically acceptable gas flows displaying accumulation.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.RO
SNGR: Selective Non-Gaussian Refinement for Ambiguous SLAM Factor Graphs
Anushka Kulkarni and Sarthak Dubey
We present Selective Non-Gaussian Refinement (SNGR), a SLAM framework that augments iSAM2 with targeted nested sampling on windows where Gaussian approximations are likely to fail. We detect such regions using the condition number of joint marginal covariances and selectively refine them using the full nonlinear factor graph likelihood, with a gating mechanism to avoid degradation in
multimodal cases. Experiments on range-only SLAM with wrong data association show that SNGR achieves high-precision failure detection and consistent local likelihood improvements while reducing computational cost relative to exhaustive non-Gaussian inference. These results highlight both the promise and the limitations of selective refinement for approximate SLAM posteriors.
Read the full abstract ▾
Number Theory
A link between error terms when counting smooth and rough numbers
Andreas Weingartner
We establish a relationship between error terms appearing in estimates for the counting functions of smooth and rough numbers. We then apply this link to obtain an explicit upper bound for the error term in de Bruijn's approximation $\Lambda$ for the count of smooth numbers, from an explicit upper bound, due to Fan, for the error term in a variant of de Bruijn's estimate for the count of rough numbers.
Read the full abstract ▾
Numerical Analysis
A-priori error estimation for space-time Galerkin POD for linear evolution problems
Carmen Gräßle, Jan Heiland and Jannis Marquardt
In this paper, we propose an a-priori error estimate for the model order reduction (MOR) method of space-time proper orthogonal decomposition (space-time POD). The original space-time POD approach extends standard POD by reducing not only the space dimension but simultaneously the time dimension as well. The proposed a-priori error estimate is developed for a linear
parabolic partial differential equation and estimates the error between the numerical solution to a linear
parabolic partial differential equation (PDE) and its space-time POD reduced solution. Numerical examples illustrate the occurring errors and analyze them in comparison to the theoretical bounds.
Read the full abstract ▾
Numerical Analysis
A Replica Exchange Markov Chain Monte Carlo Method for Disconnected Implicit Manifolds via Tubular Relaxation
Xuyuan Wang and Donglin Han
Markov chain Monte Carlo (MCMC) methods provide powerful framework for sampling unknown probability measures across a wide range of scientific applications. In some settings, the target distribution is supported on a lower-dimensional submanifold of Euclidean space defined by nonlinear constraints, motivating the development of constrained
Hamiltonian Monte Carlo (CHMC) methods. Most existing CHMC
algorithms rely on the assumption that the implicit
manifold is connected, allowing local constrained integrators such as RATTLE to explore the posterior ergodically. In practice, this assumption is occasionally violated due to complex
geometric structures induced by nonlinear constraints of a model. We propose a replica exchange MCMC framework that couples a constrained chain evolving on the implicit
manifold with a relaxed auxiliary chain defined in a tubular neighborhood of the constraint. The relaxed chain enables transitions between disconnected components. We show that the resulting
algorithm enables sampling from a broader class of implicit
manifolds, including those with disconnected components. We prove that the proposed sampler satisfies detailed balance, irreducibility, ergodicity, and convergence. We also demonstrate its effectiveness on examples from molecular and biological dynamical systems.
Read the full abstract ▾
Symplectic Geometry
Invariants of Legendrian knots in thickened convex surfaces
Nancy Mae Eagles and Zijian Rong
We define a differential graded
algebra associated to Legendrian
knots in thickened convex surfaces $\Sigma\times \mathbb{R}$. The
algebra is defined in the same spirit as the Chekanov-Eliashberg DGA for Legendrians in $\mathbb{R}^3$, but makes use of the data of the dividing set $\Gamma$ of $\Sigma$. The
algebra is generated by countably many Reeb chords of the Legendrian $\Lambda$, and its differential counts certain immersed polygons in the projection $\pi:\Sigma\times \mathbb{R}\to \Sigma\times \{0\}$ with boundary on $\pi(\Lambda)\cup \Gamma$. We show that the differential squares to zero and that the stable tame isomorphism type of the DGA is invariant under Legendrian isotopy. Finally, we compute several examples and use the invariant to distinguish Legendrian
knots in thickened convex surfaces that cannot be distinguished by the classical invariants.
Read the full abstract ▾
Differential Geometry
Construction of normally biharmonic submanifolds
Ahmed Mohammed Cherif
We examine biharmonic submanifolds within warped product structures. For a submanifold $(M,g)\subset (N,h)$ and a positive smooth function $f:I\to\mathbb{R}^+$, we study the inclusion $\varphi:(I\times M,\widetilde{g})\to (I\times N,\overline{h})$, where $\widetilde{g}=dt^2+f^2g$ and $\overline{h}=dt^2+f^2h$. We relate the tension and bitension fields of $\varphi$ to the warping function and the geometry of $M$. We further characterize tangentially and normally biharmonic cases via differential conditions on $f$, and interpret these conditions in terms of the
Ricci curvature of $(M,g)$ and $(I\times M,\widetilde{g})$.
Read the full abstract ▾
Combinatorics
The $18\cdot 2^t+1$ Triangle-Maximal Series of Straight Lines
Roman Parpalak and Denis Utkin
Given $n$ lines in general position in the plane, how many bounded triangular faces can the arrangement have? We construct a straight-line affine arrangement of $19$ lines satisfying the conditions of the iterative construction by Bartholdi, Blanc, and Loisel, thereby obtaining an infinite series of straight-line arrangements attaining the maximum number of bounded triangles for every $n=18\cdot 2^t+1$. The conditions are verified by computer-assisted interval and combinatorial checks. A computational search over $n=21$, $23$, $27$ lines provides strong evidence against the existence of further base configurations compatible with the known iterative constructions, but reveals arrangements allowing a single iterative step that yield arrangements of $41$ and $45$ lines with $533$ and $645$ bounded triangles, respectively, each matching the upper bound.
Read the full abstract ▾
Logic
Interpolation above S4
Simon Santschi and Niels C. Vooijs
We complete Maksimova's classification of Craig and deductive interpolation in normal extensions of S4. In particular, we prove Craig interpolation for the six extensions of S4 for which the status of the property was still open. The proof strategy builds upon the ideas of Smoryński, but employs a novel approach using Fine's frame formulas for splitting clusters in transitive models.
Read the full abstract ▾
Dynamical Systems
The Specification Property on the Lelek Fan
Goran Erceg, James Kelly, Judy Kennedy et al. (+2 more)
Recent work of Piotr Oprocha and his collaborators has provided a number of delicate examples of dynamical systems separating specification, shadowing, and periodic-point density, primarily in symbolic or totally disconnected spaces. The goal of the present paper is to demonstrate that similar - and in some cases sharper - separations occur on the Lelek fan, a smooth one-dimensional continuum. Our constructions rely on Mahavier products of closed relations. By carefully choosing relations on the unit interval, we obtain Mahavier products that are homeomorphic to the Lelek fan whose associated shift maps display diverse dynamical behavior. This approach yields a unified framework for producing and analyzing examples on a familiar continuum.
Read the full abstract ▾
All authors Goran Erceg, James Kelly, Judy Kennedy, Christopher Mouron, Van Nall
Group Theory
Zero Cancellation and Equation Structure in Kiselman's Semigroup
Luka Andrenšek
We investigate equations in Kiselman's
semigroup $K_n$, generated by $a_1, \dots, a_n$. Let $f$ denote the zero element of $K_n$. We prove that if $y \in K_n$ lies in the subsemigroup generated by $a_2, \dots, a_n$, then $x y = f$ implies $x = f$. In contrast, the equation $x a_1 = f$ admits non-trivial solutions. We describe the solution set of this equation, show that its cardinality is $1 + |K_{n-1}|$, and study its algebraic structure. Moreover, we show that $|K_{2n+1}|$ is even, whereas $|K_{2n}|$ is odd.
Read the full abstract ▾
Information Theory
Null-Space Flow Matching for MIMO Channel Estimation in Latency-Constrained Systems
Junjie Zhao, Guangming Liang, Xiaonan Liu et al. (+1 more)
Accurate yet low-latency channel state information (CSI) acquisition is essential for multiple-input multiple-output (
MIMO) communication systems. While advanced deep generative models, such as score-based and
diffusion models, enable high-fidelity CSI reconstruction from limited pilot observations, they often suffer from high inference latency. To achieve accurate CSI estimation under stringent latency constraints, this paper proposes a null-space flow matching (FM) framework that leverages a range-null space decomposition to separate observation-informed and underdetermined channel components. Specifically, the pilot observations are used to regulate the observable range-space channel component, while an FM-based generative prior primarily resolves the ambiguous null-space degrees of freedom through iterative refinement. To further improve the robustness and efficiency of the proposed framework, we introduce a noise-aware adaptive correction strategy to suppress channel noise on the refinement trajectory, along with a power-law time schedule to better allocate the limited number of refinement steps. Experimental results demonstrate that our method achieves competitive normalized mean square error (NMSE) performance even under a strict latency budget of around 3 ms, while delivering a superior accuracy-latency tradeoff compared with both model-based and generative baselines.
Read the full abstract ▾
All authors Junjie Zhao, Guangming Liang, Xiaonan Liu, Dongzhu Liu
Geometric Topology
Casandra D. Monroe
We define branched bending deformations as deformations supported on a piecewise totally geodesic complex of $(n-1)$-dimensional faces meeting along $(n-2)$-dimensional branching loci. These are a generalization of bending deformations, as introduced by Johnson and Millson. We give a lower bound on the dimension of the (infinitesimal) deformation space supported on a branched bending complex, and in doing so generalize a result of Bart and Scannell. We give equations describing these deformations in the setting of deforming to higher
hyperbolic geometry and real projective geometry. As a special example of branched bending, we construct infinitesimal deformations supported on the link complement of the Borromean Rings (also known as the link $6^3_2$), recovering a special case of a
theorem due to Menasco and Reid.
Read the full abstract ▾
Statistics Theory
Minimax Robust Designs for M-Estimated Models
Rui Hu and Douglas P. Wiens
Experimental designs that are minimax in the presence of model misspecifications have been constructed so as to minimize the maximum, over classes of alternate response models, of the integrated mean squared error of the predicted values. The theory to date has focussed almost exclusively on Least Squares estimates. Here we extend this theory to designs tailored for M-estimation of parameters, thus obtaining additional robustness against outlying, or otherwise erroneous, responses. We show that, subject to a minor change in a tuning constant, designs optimal for Least Squares remain so asymptotically for M-estimation, under squared error loss. We argue that even this minor change should be ignored, and the tuning constant chosen in an ad hoc but sensible manner that does not depend on which M-estimate is being employed. A rather surprising additional result is that our designs and estimates, derived under an assumption of i.i.d. errors, are also robust, in a minimax sense, against broad classes of correlation structures. We also investigate designs under a more robust loss function, less influenced by outlying responses than squared error.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
A Physicist's Visit to Exotic Spheres
Tancredi Schettini Gherardini
This thesis discusses exotic 7-spheres, i.e.
manifolds that are homeomorphic but not diffeomorphic to the ordinary 7-sphere, using a set of analytical and computational tools from theoretical physics. The theory of fibre bundles and instantons, together with their relation to Yang-Mills theory, are reviewed, before presenting a generalisation of self-duality to twisted self-duality. The formalism required to derive and geometrically interpret some solutions to twisted-self-duality is relevant to the main subject of this thesis: investigating the geometry of the Gromoll-Meyer sphere. Through a Kaluza-Klein ansatz, motivated by bundle-theoretic arguments, an analytic expression for a family of Riemannian metrics on the Gromoll-Meyer sphere is derived. After a detailed study of its
geometric constituents, recast as quaternionic-valued objects, the metric with maximal isometry is identified. Its
curvature properties are also studied and the associated energy conditions are assessed. Then, an up-to-date and broader overview on the current work concerning exotic spheres and exotic
manifolds in general is offered, before focusing again on the Gromoll-Meyer sphere, but this time under the lens of differential
topology. Some explicit realisations of the homeomorphism between an exotic 7-sphere and an ordinary one are discussed, together with their possible interpretations in the context of general relativity. Finally, a numerical
algorithm for finding Riemannian Einstein metrics on arbitrary
manifolds is presented; it is based on machine learning, and highly generalisable in many directions. The current work on implementing its application to exotic spheres is also discussed. The thesis ends with an ample discussion of possible future directions.
Read the full abstract ▾
Optimization and Control
Model Predictive Control of Hybrid Dynamical Systems
Ricardo G. Sanfelice and Berk Altin
The problem of controlling hybrid dynamical systems using model predictive control (MPC) is formulated and sufficient conditions for asymptotic stability of a set are provided. Hybrid dynamical systems are modeled in terms of hybrid equations, involving a differential equation and a difference equation with inputs and constraints. The proposed hybrid MPC
algorithm uses a suitable prediction and control horizon construction inspired by hybrid time domains. Structural properties of the hybrid optimization problem, its feasible set, and its value function are provided. Checkable conditions to guarantee asymptotic stability of a set are provided. These conditions are given in terms of properties on the stage cost, terminal cost, and the existence of static state-feedback laws, related through a control Lyapunov function condition. Examples illustrate the results throughout the paper.
Read the full abstract ▾
Analysis of PDEs · Cross-listed from q-bio.QM
Local growth laws determine global shape of molluscan shells
Huan Liu and Kaushik Bhattacharya
Molluscan shells come in various shapes and sizes. Despite this diversity, each species produces a shell with a characteristic shape that is independent of environmental conditions. We seek to understand this robust complexity. We are guided by two principles in the spirit of D'Arcy Thompson. First, the growth is governed by the repeated and continuous application of a fixed growth law, even as the shell evolves in overall shape, without any complex biological machinery to monitor and control the growth. Second, the growth law depends solely on local geometry at the shell's growing edge. The first principle naturally leads to the mathematical statement that the shape of the shell is generated by the action of a Lie group on a protoconch. The second naturally leads to a particular representation of the Lie group. We use this representation to show that the shapes of nearly all known molluscan shells can be described by essentially three parameters: a scalar (scaling), a vector (orientation), and a curve (edge of the protoconch). We relate these parameters to the phylogenetic tree. In addition to the morphogenetic insight, our results potentially point to a new approach to engineering complex structures.
Read the full abstract ▾
Information Theory
MambaCSP: Hybrid-Attention State Space Models for Hardware-Efficient Channel State Prediction
Aladin Djuhera, Haris Gacanin and Holger Boche
Recent works have demonstrated that
attention-based
transformer and large
language model (LLM) architectures can achieve strong channel state prediction (CSP) performance by capturing long-range temporal dependencies across channel state information (CSI) sequences. However, these models suffer from quadratic scaling in sequence length, leading to substantial computational cost,
memory consumption, and inference latency, which limits their applicability in real-time and resource-constrained wireless deployments. In this paper, we investigate whether selective state space models (SSMs) can serve as a hardware-efficient alternative for CSI prediction. We propose MambaCSP, a hybrid-
attention SSM architecture that replaces LLM-based prediction backbones with a linear-time Mamba model. To overcome the local-only dependencies of pure SSMs, we introduce lightweight patch-mixer
attention layers that periodically inject cross-
token attentions, helping with long-context CSI prediction. Extensive MISO-OFDM simulations show that MambaCSP improves prediction accuracy over LLM-based approaches by 9-12%, while delivering up to 3.0x higher throughput, 2.6x lower VRAM usage, and 2.9x faster inference. Our results demonstrate that hybrid state space architectures provide a promising direction for scalable and hardware-efficient AI-native CSI prediction in future wireless networks.
Read the full abstract ▾
Quantum Algebra · Cross-listed from quant-ph
Subsystem-Resolved Spectral Theory for Quantum Many-Body Hamiltonians
MD Nahidul Hasan Sabit
We study spectral properties of
quantum many-body
Hamiltonians through a subsystem-based framework. Given a
Hamiltonian of the form $H = \sum_{X \subseteq \Lambda} \Phi(X)$ acting on a tensor product
Hilbert space, we associate to each subset $S \subseteq \Lambda$ a subsystem
Hamiltonian $H_S$ and its spectrum $\mathcal{S}(S) = \sigma(H_S)$. This produces a family of spectra indexed by subsystems, allowing spectral data to be organized according to interaction structure. We show that subsystem
Hamiltonians admit local approximations: $H_S$ can be approximated by operators supported on finite neighborhoods with an error bounded by $\|H_S - H_{S,r}\| \le |S| e^{-\mu r} \|\Phi\|_\mu$. As a consequence, subsystem spectra are stable under truncation in the sense that $d_H(\mathcal{S}(S), \sigma(H_{S,r})) \le |S| e^{-\mu r} \|\Phi\|_\mu.$ We then prove that for disjoint subsets $S_1, S_2 \subseteq \Lambda$, the subsystem spectrum is approximately additive: $d_H\big(\mathcal{S}(S_1 \cup S_2), \mathcal{S}(S_1) + \mathcal{S}(S_2)\big) \le (|S_1| + |S_2|) e^{-\mu D} \|\Phi\|_\mu,$ where $D = d(S_1, S_2)$. In the finite-range case, this relation becomes exact. The results show that spectral properties reflect the locality of interactions not only at the level of operators, but also at the level of spectra. The framework provides a way to study many-body systems in which interaction geometry directly shapes spectral behavior.
Read the full abstract ▾
Algebraic Geometry
Hodge theory for combinatorial projective bundles
Matt Larson and Ethan Partida
We prove the Hard Lefschetz
theorem and Hodge-Riemann relations for certain rings which resemble the
cohomology rings of projectivizations of globally generated vector bundles over toric varieties. This proves new cases of the standard
conjecture of Hodge type and gives Bloch-Gieseker-type results for tautological classes of matroids.
Read the full abstract ▾
Statistics Theory · Cross-listed from cs.LG
The Sample Complexity of Multicalibration
Natalie Collina, Jiuyao Lu, Georgy Noarov et al. (+1 more)
We study the minimax sample complexity of multicalibration in the batch setting. A learner observes $n$ i.i.d. samples from an unknown distribution and must output a (possibly randomized) predictor whose population multicalibration error, measured by Expected Calibration Error (ECE), is at most $\varepsilon$ with respect to a given family of groups. For every fixed $\kappa > 0$, in the regime $|G|\le \varepsilon^{-\kappa}$, we prove that $\widetilde{\Theta}(\varepsilon^{-3})$ samples are necessary and sufficient, up to polylogarithmic factors. The lower bound holds even for randomized predictors, and the upper bound is realized by a randomized predictor obtained via an online-to-batch reduction. This separates the sample complexity of multicalibration from that of marginal calibration, which scales as $\widetilde{\Theta}(\varepsilon^{-2})$, and shows that mean-ECE multicalibration is as difficult in the batch setting as it is in the online setting, in contrast to marginal calibration which is strictly more difficult in the online setting. In contrast we observe that for $\kappa = 0$, the sample complexity of multicalibration remains $\widetilde{\Theta}(\varepsilon^{-2})$ exhibiting a sharp threshold phenomenon. More generally, we establish matching upper and lower bounds, up to polylogarithmic factors, for a weighted $L_p$ multicalibration metric for all $1 \le p \le 2$, with optimal exponent $3/p$. We also extend the lower-bound template to a regular class of elicitable properties, and combine it with the online upper bounds of Hu et al. (2025) to obtain matching bounds for calibrating properties including expectiles and bounded-density
quantiles.
Read the full abstract ▾
All authors Natalie Collina, Jiuyao Lu, Georgy Noarov, Aaron Roth
Mathematical Physics · Cross-listed from quant-ph
Algorithmic Locality of Quantum Tensor Network Belief Propagation
Siddhant Midha, Yifan F. Zhang, Daniel Malz et al. (+2 more)
Belief propagation has recently emerged as a powerful framework for evaluating tensor networks in higher dimensions, combining computational efficiency with provable analytical guarantees. In this work, we develop the first end-to-end theory of tensor network belief propagation for a class of projected entangled pair states satisfying strong injectivity. We show that when the injectivity parameter exceeds a constant threshold, BP fixed points can be found efficiently, and a cluster-corrected BP
algorithm computes physical quantities to $1/\mathrm{poly}(N)$ error in $\mathrm{poly}(N)$ time for an $N$
qubit system. We further identify a striking phenomenon we term algorithmic locality: local perturbations of the tensor network affect the BP fixed point with an influence decaying rapidly with distance. Moreover, through the cluster expansion, this locality extends to observables, implying that local expectation values can be approximated from local data with controlled accuracy. We exhibit three regimes admitting strong injectivity: random Gaussian PEPS with large physical dimension, high-temperature Gibbs states of commuting two-body
Hamiltonians, and fixed-depth
quantum circuits subject to sufficiently strong depolarizing noise. Our bounds are worst-case sufficient conditions and do not identify sharp algorithmic transitions.
Read the full abstract ▾
All authors Siddhant Midha, Yifan F. Zhang, Daniel Malz, Dmitry A. Abanin, Sarang Gopalakrishnan
Information Theory · Cross-listed from cs.CV
Directional Confusions Reveal Divergent Inductive Biases Through Rate-Distortion Geometry in Human and Machine Vision
Leyla Roksan Caglar, Pedro A.M. Mediano and Baihan Lin
Humans and modern
vision models can reach similar classification accuracy while making systematically different kinds of mistakes – differing not in how often they err, but in who gets mistaken for whom and in which direction. We show that these directional confusions reveal distinct inductive biases that are invisible to accuracy alone. Using matched human and deep
vision model responses on a natural-image categorization task under 12 perturbation types, we quantify asymmetry in confusion
matrices and link it to the shape of the information-error trade-off. We characterize this trade-off geometry using three signatures extracted from the rate-distortion (RD) frontier: slope beta,
curvature kappa and efficiency (AUC). We find that humans exhibit broad but weak asymmetries, whereas deep
vision models show sparser, stronger directional collapses. Robustness training reduces global asymmetry but fails to recover the human-like breadth-strength profile of graded similarity. Mechanistic simulations further show that different asymmetry organizations shift the RD frontier in opposite directions, even when matched for performance. Together, these results position directional confusions and RD geometry as compact, interpretable signatures of inductive bias under distribution shift.
Read the full abstract ▾
Numerical Analysis
A structure-preserving semi-implicit finite volume scheme on vertex-staggered unstructured meshes
Elena Bernardelli, Elena Gaburro and Michael Dumbser
We present a structure-preserving semi-implicit finite volume method on vertex-based staggered meshes for the compatible discretization of first-order systems of time-dependent partial differential equations (PDEs). The method preserves divergence-free and curl-free vector fields exactly thanks to the compatible vertex-staggered discretization of the state variables on unstructured grids consisting of primal Delaunay triangles and their dual polygons. For the weakly compressible Euler equations, the scheme is asymptotic preserving, yielding a consistent discretization of the incompressible limit as the Mach number goes to zero. The scheme applies to a broad spectrum of PDEs, including the weakly compressible and incompressible Euler and Navier-Stokes equations, the incompressible magnetohydrodynamics (MHD) system, and the incompressible version of the first-order
hyperbolic Godunov-Peshkov-Romenski (GPR) model for continuum mechanics. The computational domain is covered by a primal triangular mesh and a dual tessellation made of
star polygons. Scalar quantities (pressure, density, viscous stress) are defined at nodes, with pressure updated implicitly in a continuous finite element fashion, yielding a symmetric and positive definite pressure system. Instead, vector fields (velocity, momentum,
magnetic and distortion fields) are stored at triangle barycenters and evolved explicitly using a compatible finite volume scheme. With the semi-implicit discretization, the CFL restriction is independent of the sound speed, allowing simulations at low Mach numbers. The compatible formulation ensures an exactly divergence-free velocity field in the incompressible limit, an exactly divergence-free
magnetic field for MHD, and an exactly curl-free inverse deformation gradient in solid mechanics. The scheme has been extended to second-order accuracy. The method is validated through a set of test cases.
Read the full abstract ▾