Combinatorics
Equidistribution of mesh patterns of short length
Xinyu Su, Sergey Kitaev and Jiahao Zhang
We study the equidistribution of mesh patterns of length 2. We show that the number of equidistribution equivalence classes lies between 105 and 108, and
conjecture that it is exactly 105. As a consequence, we obtain an upper bound of 49 Wilf-classes, improving the previously known bound of 56 due to Hilmarsson et al., and reducing the problem to three remaining conjectural equivalences (with the actual number conjectured to be 46). Our approach combines bijective constructions, generating functions, recurrence relations, and structural
symmetries. We establish several new equidistribution results, including four previously unknown distribution classes, connect numerous patterns to known distributions in the literature, and resolve seven open pattern-avoidance enumeration problems posed by Hilmarsson et al. This work provides a near-complete classification of mesh patterns of length 2 and unifies several previously isolated results within a coherent framework.
Read the full abstract ▾
Analysis of PDEs
A conservation-consistent boundary condition for nonlinear models of soluble-surfactant-laden falling films
Sanghasri Mukhopadhyay, Séverine Millet, Bastien Di Pierro et al. (+1 more)
A conservation-consistent boundary condition is proposed for nonlinear models of soluble-surfactant-laden falling films, ensuring exact conservation of total surfactant mass. The formulation resolves an inconsistency in widely used reduced models, Pascal et al. (PRF, 2019), D'Alessio et al. (JFM, 2020), which exhibit a gradual drift of mass during nonlinear
evolution in a closed periodic domain. We show that this originates from an inconsistency in the surface transport reduction and derive a corrected boundary condition that removes this defect. As the discrepancy appears only at the nonlinear order, linear stability results remain unaffected, explaining why the issue has remained unnoticed.
Read the full abstract ▾
All authors Sanghasri Mukhopadhyay, Séverine Millet, Bastien Di Pierro, Asim Mukhopadhyay
Combinatorics
On extremal cross $t$-intersecting families with $t$-covering number conditions
Yu Zhu, Benjian Lv and Kaishun Wang
Let $n$, $k$ and $t$ be positive integers, and let $\mathcal{F}$ be a collection of $k$-subsets of $[n]=\{1,2,\dots,n\}$. The $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ is defined as the minimum size of a set $T$ such that $|F\cap T|\geq t$ for all $F\in \mathcal{F}$. For positive integers $k_1$ and $k_2$, let $\mathcal{F}_i$ be a collection of $k_i$-subsets of $[n]$ for $i\in \{1,2\}$. The families $\mathcal{F}_1$ and $\mathcal{F}_2$ are said to be cross $t$-intersecting if $|F_1\cap F_2|\geq t$ for all $F_1\in\mathcal{F}_1$ and $F_2\in \mathcal{F}_2$. When $\mathcal{F}_1=\mathcal{F}_2$, $\mathcal{F}_1$ is called a $t$-intersecting family. In this paper, we first characterize the extremal structures of cross $t$-intersecting families $\mathcal{F}_1$ and $\mathcal{F}_2$ that maximize $|\mathcal{F}_1||\mathcal{F}_2|$ under the condition that $\tau_t(\mathcal{F}_1)\geq t+1$ and $\tau_t(\mathcal{F}_2)\geq t+1$. We then describe the maximal $t$-intersecting families with $t$-covering number $t+1$.
Read the full abstract ▾
Mathematical Physics
Positive Criticality and Optimal Hardy Inequality for Fractional Laplacians
Philipp Hake, Matthias Keller and Felix Pogorzelski
We characterize positive critical Hardy weights for general
Laplacians on weighted graphs. We then apply this result to fractional
Laplacians on general graphs and use the characterization to identify an optimal Hardy weight under suitable assumptions. We finally illustrate our results with examples of graphs which arise as Cayley graphs of groups, satisfy
curvature assumptions or are fractal graphs.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cond-mat.mtrl-sci
Evaluation of External Magnetic Flux Density in Piezo-Flexomagnetic Nanobeams Using a Hybrid 1D-2D Finite Element Framework
Lala Samprit Ray and Bishweshwar Babu
Most theoretical models of piezo-flexomagnetic nanostructures forcibly impose
magnetic isolation at the structure-air interface, neglecting the external
magnetic domain entirely. This mathematical compromise limits the model's capability to account for stray-field behavior in non-contact applications. To overcome this gap, our study proposes a fully coupled hybrid finite element formulation combining a 1D Timoshenko beam model with a 2D magneto-static problem, encompassing both the beam body and the surrounding air domain. By continuously mapping 1D structural kinematics into the 2D space to define the mechanically induced
magnetic flux, and subsequently integrating the resulting 2D scalar potential back into 1D static generalized
magnetic loads, this framework enhances the capability of the simple 1D beam model. The results present the distribution of an external
magnetic flux in piezo-flexomagnetic structures and identify the material parameters driving this. Ultimately, the proposed computational method extends the boundary of a 1D beam model to an infinite-domain multiphysics environment.
Read the full abstract ▾
Probability
Tail exponents of the three-dimensional uniform spanning tree and Abelian sandpile
Xinyi Li, Runsheng Liu and Daisuke Shiraishi
We study the local geometry of the three-dimensional uniform spanning tree and its connection with the Abelian sandpile model. We obtain sharp tail exponents, up to subpolynomial errors, for the past of the origin in the three-dimensional UST and for the $0$-tree of the $0$-wired uniform spanning forest. As a principal application, we prove the corresponding three-dimensional Abelian sandpile avalanche exponents: the avalanche-cluster radius has tail exponent $1$, while both the avalanche-cluster size and the total number of topplings have tail exponent $1/3$. These results identify the leading power-law behaviour of three-dimensional sandpile avalanches and improve previously known bounds.
Read the full abstract ▾
Analysis of PDEs
Global well-posedness of the linearized R13 moment equations with Onsager boundary conditions
Shuang Hu, Bo Lin, Huini Liu et al. (+1 more)
This paper establishes the global well-posedness of the linearized regularized 13-moment (R13) equations for rarefied gas flows. We first derive an
entropy inequality for the system on bounded domains subject to Onsager boundary conditions. For the steady-state problem, well-posedness is proved via the Ladyzhenskaya-Babuska-Brezzi (LBB)
theorem, facilitated by novel boundary-related Korn-type inequalities. Furthermore, leveraging the Lumer-Phillips
theorem, we extend these results to guarantee the global well-posedness of the time-dependent R13 equations. Our theoretical framework uniformly accommodates the models for both Maxwell and general non-Maxwell molecules.
Read the full abstract ▾
All authors Shuang Hu, Bo Lin, Huini Liu, Zhenning Cai
Numerical Analysis · Cross-listed from eess.SP
Measurement Selection Strategies for Position Estimation in Indoor Environments
Neetu R. R, Shrihari Vasudevan and Ranjani H.G
Time-based indoor positioning techniques rely on multiple access points (APs) and measurements between the user equipment (UE) and the APs. In dense indoor environments, occlusion-induced non-line-of-sight (NLoS) propagation introduces significant delays in these measurements, thereby degrading position estimation accuracy. To address this challenge, this paper proposes measurement selection strategies to improve position estimation accuracy. A ray-tracing (RT) simulator is employed to characterize the propagation environment and derive AP neighborhood information, which is subsequently used to design and evaluate different measurement selection strategies. The approaches explored include AP neighborhood-based cardinality selection, intersection and union of measurements from AP neighborhoods, and fixed measurement selection. Experiments demonstrate the efficacy of the proposed measurement selection strategies in environments under significant NLoS conditions.
Read the full abstract ▾
Optimization and Control
Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
Wei Hu, Pengcheng Xie, Ya-Xiang Yuan et al. (+1 more)
We propose DisGrem, a fully decentralized second-order method for convex consensus optimization over networks. Each
agent solves a local Newton system with vanishing gradient-norm regularization and an
eigenvalue-shift stabilizer, communicating through a two-stage gossip-mixing mechanism. We introduce a reference-step framework that reduces the network-wide update to an inexact centralized regularized Newton step, replacing the static Hessian-heterogeneity assumptions of prior work with an increment-based dispersion analysis that imposes no irreducible accuracy floor. Under a bounded-iterates assumption, after a burn-in phase whose order is controlled by the scheduled consensus accuracy, the post-burn-in phase achieves an O(epsilon^{-1}) iteration complexity for driving the gradient norm below epsilon, matching the centralized regularized Newton rate without line search or stepsize tuning. For a logarithmic schedule with p >= 3, the total iteration complexity remains O(epsilon^{-1}). For a fixed connected network, this yields O(epsilon^{-1} log(1/epsilon)) neighbor communication rounds, with explicit spectral-gap dependence O((1-rho)^{-1} epsilon^{-1} log(1/epsilon)) as rho approaches 1. Under strong convexity and a relative tracking-accuracy condition, we further establish conditional local superlinear convergence of order 3/2. In our nine-problem
benchmark suite, the DisGrem family attains relF <= 10^{-6} on every test instance, while the tested baselines stagnate or diverge on at least one problem.
Read the full abstract ▾
All authors Wei Hu, Pengcheng Xie, Ya-Xiang Yuan, Li Zhang
Classical Analysis and ODEs
Some new estimates for generalized fractional integrals associated with operators on Morrey spaces
Hua Wang
Let $\mathcal{L}$ be the infinitesimal generator of an analytic
semigroup $\big\{e^{-t\mathcal L}:t>0\big\}$ on $L^2(\mathbb R^n)$ with Gaussian upper bounds, and suppose that $\mathcal{L}$ has a bounded holomorphic functional calculus on $L^2(\mathbb R^n)$. For given $0<\alpha<n$, let $\mathcal L^{-\alpha/2}$ be the generalized fractional integral associated with $\mathcal{L}$, which is given by \begin{equation*} \mathcal L^{-\alpha/2}(f)(x):=\frac{1}{\Gamma(\alpha/2)}\int_0^{+\infty}e^{-t\mathcal L}(f)(x)t^{\alpha/2-1}dt, \end{equation*} where $\Gamma(\cdot)$ is the usual gamma function. In the limiting Sobolev case $\lambda=n-\alpha p$ and $1\leq p<n/{\alpha}$, the author proves that the operator $\mathcal{L}^{-\alpha/2}$ is bounded from the Morrey space $M^{p,\lambda}(\mathbb R^n)$ into $\mathrm{BMO}_{\mathcal{L}}(\mathbb R^n)$, and is bounded from the vanishing Morrey space $VM^{p,\lambda}(\mathbb R^n)$ into $\mathrm{VMO}_{\mathcal{L}}(\mathbb R^n)$, where $\mathrm{BMO}_{\mathcal{L}}(\mathbb R^n)$ and $\mathrm{VMO}_{\mathcal{L}}(\mathbb R^n)$ are the spaces of bounded mean oscillation and vanishing mean oscillation associated with the operator $\mathcal{L}$, respectively. As a consequence, the author obtains that the operator $\mathcal{L}^{-\alpha/2}$ is bounded from $L^{p,\infty}(\mathbb R^n)$ into $\mathrm{BMO}_{\mathcal{L}}(\mathbb R^n)$ when $p=n/{\alpha}$ and $0<\alpha<n$. The proofs are based on pointwise kernel estimates of the operators $\mathcal L^{-\alpha/2}$ and $(I-e^{-t\mathcal L})\mathcal{L}^{-\alpha/2}$ for $0<\alpha<n$.
Read the full abstract ▾
Statistics Theory
Optimal Spectral Algorithms for Correlated Two-view Models in High Dimensions
Hang Du, Henry Hu and Saba Lepsveridze
We study high-dimensional inference in correlated two-view models, focusing on spectral methods for strong detection and weak recovery. We introduce a general framework, motivated by a TAP type heuristic from statistical physics, that provides a unified treatment of three canonical models: high-dimensional canonical correlation analysis, and the correlated spiked Wigner and Wishart models. Our main contribution is to construct explicit spectral
algorithms in all three settings, that achieve strong detection and weak recovery down to the corresponding thresholds, where we prove matching information-theoretic lower bounds. Furthermore, our spectral procedures operate without knowledge of the model parameters, relying solely on the observed data. This demonstrates the optimality of spectral methods in these models and the broad statistical applicability of the framework.
Read the full abstract ▾
Algebraic Geometry
Remarks on basepoint-freeness thresholds of polarized abelian surfaces
Atsushi Ito
We determine the basepoint-freeness threshold of a very general polarized abelian surface over the field of complex numbers. We also give the first example of a polarized abelian surface whose basepoint-freeness threshold is irrational.
Logic
A proof system for the positive fragment of GL
Yoshihito Tanaka
In this paper, we present a proof system $\mathsf{GL}_{+}^{\top\bot}$, which is based on a sequent system $\mathsf{K}_{+}^{\top\bot}$ given by Dunn, for the positive fragment of $\mathsf{GL}$. Positive modal formulas are modal formulas that contain neither negation symbols nor implication symbols. More precisely, they are modal formulas constructed from the connectives $\lor$, $\land$, $\Diamond$, $\Box$, $\bot$, $\top$, and propositional variables. The logic $\mathsf{GL}$ is the least normal modal logic that contains $\mathsf{K}$ and the Löb formula $\Box(\Box p\supset p)\supset\Box p$. Following Dunn, a sequent is an expression of the form $\phi\vdash\psi$, where $\phi$ and $\psi$ are positive modal formulas. We present a proof system $\mathsf{GL}_{+}^{\top\bot}$ for sequents with the property that a sequent $\phi\vdash\psi$ is provable in $\mathsf{GL}_{+}^{\top\bot}$, if and only if $\phi\supset\psi$ is provable in $\mathsf{GL}$.
Read the full abstract ▾
Optimization and Control
Generalized Differentiability and Second-Order Necessary Optimality Conditions for an Elliptic Optimal Control Problem with Exponential Nonlinearity and Discrete Measures
Vu Huu Nhu, Nguyen Hai Son, Phan Quang Sang et al. (+1 more)
This paper deals with generalized differentiability and second-order necessary optimality conditions for a box-constrained optimal control problem governed by an exponential semilinear
elliptic equation with discrete measures as sources, where the control belongs to the space of absolutely summable sequences. The presence of the exponential nonlinearity and discrete measures makes the analysis particularly challenging. In particular, the control-to-state operator may fail to be directionally differentiable. To address this issue, we first establish finite-dimensional directional differentiability of the control-to-state operator; that is, the operator is directionally differentiable along directions contained in finite-dimensional subspaces of the control space. We then introduce a notion of generalized derivative defined as the limit of the associated finite-dimensional directional derivatives as the dimension of these subspaces tends to infinity. Based on this concept, together with estimates for first- and second-order Taylor-type expansions of the exponential Nemytskii operator associated with the control-to-state mapping, we derive first- and second-order generalized differentiability of the reduced objective functional. This leads to first- and second-order necessary optimality conditions for the optimal control problem.
Read the full abstract ▾
All authors Vu Huu Nhu, Nguyen Hai Son, Phan Quang Sang, Tran Duy
Combinatorics
A Fourier-Free Density-Increment Proof of Roth's Theorem
Mark Lewko
We give an elementary,
Fourier-free proof of Roth's
theorem. The proof follows Roth's original density-increment strategy, but replaces the usual
Fourier-analytic step with a direct combinatorial argument involving averages over sub-progressions.
Analysis of PDEs
Rigorous Derivation of the Wave Kinetic Equation for full $\beta$-FPUT System
Katja Vassilev and Boyang Wu
The
Fermi–Pasta–Ulam–Tsingou (FPUT) system, describing the
evolution of $N$ coupled harmonic oscillators, has been the subject of much
attention since the 1950's when experiments which contradicted predictions of thermalization of the system. A full explanation of this behavior is still not fully known. Here, we rigorously derive the corresponding wave kinetic equation, which provides a precise
evolution of the statistics for the FPUT system and demonstrates thermalization in an appropriate regime. In particular, we justify the kinetic equation for the 4-wave $\beta$-FPUT system in the kinetic limit $N \to \infty$ and $\beta \to 0$ for weakly nonlinear scaling laws $\beta \sim N^{-\gamma}$, reaching times up to $T_{\mathrm{kin}}^{2/3}$, where $T_{\mathrm{kin}}$ represents the kinetic (thermalization) timescale. While we use a typical diagrammatic expansion to derive the kinetic equations, few works have dealt with nonlinearities with non-resonant terms, which are not part of the kinetic equation, which is the major novelty of this work. The only other such work \cite{DIP25} made use of a normal form method to push the non-resonant terms to higher order nonlinearities. Here, we directly incorporate the non-resonant terms into the diagrammatic expansion and demonstrate corresponding gains. This method can be adapted to other 4-wave non-resonant nonlinearities.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
A Two-Phase Adaptive Balanced Penalty Method for Controllable Pareto Front Learning under Split Feasibility Conditions
Nguyen Viet Hoang, Dung D. Le and Tran Ngoc Thang
We address the open problem of training hypernetworks for Controllable Pareto Front Learning (CPFL) under split feasibility conditions with rigorous theoretical guarantees. We reformulate the constrained Pareto problem as a Bi-Level Scalarized Split Problem (BSSP) and propose the Adaptive Balanced Penalty (ABP)
algorithm, whose three gradient components – optimality, set feasibility, and image feasibility – are blended through an adaptive indicator driven by a computable lower bound. Using a novel convex surrogate technique, we prove full-sequence convergence under standard convexity and Robbins-Monro step-size assumptions. The ABP penalty structure is then translated into a two-phase, feasibility-first training strategy for Hyper-MLP and HyperTrans architectures (ABP-HyperNet). To evaluate constrained CPFL, we introduce the Expected Feasible Hypervolume (EFHV), which jointly captures solution quality and constraint satisfaction. Experiments on five multi-objective
benchmarks validate the ABP solver against ground truth, while three multi-task learning
datasets demonstrate that ABP-HyperNet achieves up to 2.3x higher EFHV than unconstrained baselines by raising feasibility from 36-49% to 87-100%.
Read the full abstract ▾
Functional Analysis
A von Neumann-Jordan Constant of Non-Normable Metrics
Doan Huu Hieu and Nguyen Duy Cuong
The paper studies a generalized von Neumann-Jordan constant of non-normable metrics on vector spaces. To the best of our knowledge, all existing results of the von Neumann-Jordan constant and its generalizations have been established only in the normed setting. We identify reasonable conditions on non-normable metrics under which results known for norms remain valid. Several examples and counterexamples are provided to justify the established results. The computation for a class of non-normable metrics on product spaces is also investigated. In particular, we give precise formulas for the generalized von Neumann-Jordan constant of p-metrics under a metric-type Clarkson inequality. Comparisons with existing results are discussed throughout the paper whenever applicable.
Read the full abstract ▾
Information Theory
Domain-Adaptive Communication-Rate Optimization for Sim-to-Real Humanoid-Robot Wireless XR Teleoperation
Caolu Xu, Zhiyong Chen, Meixia Tao et al. (+3 more)
Wireless extended reality (XR) teleoperation provides
embodied interaction capability for collecting
humanoid robot demonstrations, but the large-scale adoption is restricted by the overhead of high-frequency motion transmission. This paper develops a system framework that integrates sampling, transmission, interpolation, and reconstruction and formulates a communication-rate optimization that aims to minimize the communication energy while maintaining the reconstruction accuracy of
robot motion trajectories through dimension-wise sampling-rate control. Since acquiring real-time feedback from physical
robots is limited by hardware costs, it is necessary to solve the problem through simulator interaction with offline real-domain data correction. To guide sim-to-real adaptation, we provide a PAC-Bayes generalization characterization that reveals the effects of latent density-ratio estimation, finite-sample deviation, and encoder bias. Building on this analysis, we propose a proximal policy optimization (PPO) method with density-ratio weighting and trust-region regularization. Experiments on public
humanoid teleoperation
dataset show that the proposed method improves the tradeoff between reconstruction error and communication energy consumption under sim-to-real distribution shift. We further analyze the effectiveness of the proposed
algorithm across various wireless channels and dynamic motion trajectories.
Read the full abstract ▾
All authors Caolu Xu, Zhiyong Chen, Meixia Tao, Li Song, Feng Yang, Wenjun Zhang
Dynamical Systems
Most Probable KAM Tori in Stochastic Hamiltonian Systems Driven by Multiplicative Noise
Xinze Zhang, Yong Li and Xue Yang
This paper investigates the effect of state-dependent multiplicative noise on the integrable structure of
Hamiltonian systems. Under a local high-dimensional Lamperti-type condition, we derive the Onsager–Machlup functional in the corresponding flattening coordinates. When the
diffusion vector fields are
Hamiltonian, the resulting action is minimized uniquely by the deterministic
Hamiltonian trajectory. Combining this characterization with a finitely differentiable KAM
theorem, we prove that, under suitable assumptions, the invariant
tori with Diophantine frequencies of an integrable
Hamiltonian system persist, in the sense of most probable paths, under a small deterministic perturbation and multiplicative noise. Furthermore, as the intensity of the multiplicative noise tends to zero, we establish a localized large deviation principle that characterizes the asymptotic probability of solution trajectories deviating from these invariant
tori.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
Factor Augmented High-Dimensional SGD
Shubo Li, Yuefeng Han and Xiufan Yu
Stochastic gradient descent (SGD) is a fundamental optimization
algorithm widely used in modern machine learning. In this paper, we propose Factor-Augmented SGD (FSGD), a new optimization method that leverages latent factor representations in high-dimensional learning tasks. Unlike standard two-stage dimension reduction approaches that rely on offline representation learning and full data storage, a key novelty of FSGD is that it operates purely on streaming data, making it scalable to large-scale and high-dimensional problems. Furthermore, we establish the first theoretical framework that explicitly incorporates latent factor estimation error into the analysis of SGD, and provide moment convergence in $\ell^s$ norm under decaying step sizes and mini-batch updates. Our results provide a new foundation for employing SGD reliably and scalably in high-dimensional machine learning systems.
Read the full abstract ▾
Analysis of PDEs
Stability for Critical Points of the Hardy–Littlewood–Sobolev Inequality and a Dual Stability Framework
Lu Chen, Guozhen Lu and Hanli Tang
Although quantitative stability for critical points of the Sobolev and fractional Sobolev inequalities has been extensively studied, the corresponding stability theory for critical points of the Hardy–Littlewood–Sobolev (HLS) inequality remains largely unexplored. A major difficulty is that the natural stability problem for HLS critical points involves a non-Hilbertian distance, so the classical orthogonal decomposition methods used in
Hilbert-space settings are no longer available. In this paper, we develop a weak-decomposition–strong-stability method tailored to the stability structure of HLS critical points and establish the corresponding stability inequality. Our approach also yields an explicit lower bound for the stability of Palais–Smale sequences of the HLS integral equation. To the best of our knowledge, this appears to be the first quantitative stability result for Palais–Smale sequences of a variational functional measured in a non-Hilbertian distance. We further introduce a duality framework connecting Struwe-type decompositions and stability inequalities for critical points of the Sobolev inequality with their HLS counterparts. As a consequence, we derive Struwe-type decomposition and stability results for critical points of the fractional Sobolev inequality for general functions, thereby removing the nonnegativity assumption imposed in [26].
Read the full abstract ▾
Combinatorics
Universal Cycles on Affine Lines
Ming-Hsuan Kang and Shin-Hsun Chou
A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine lines presents additional difficulties arising from parallelism. We prove that universal cycles exist for affine lines in $\mathrm{AG}(n,q)$ for all $n \ge 2$ and all
prime powers $q$. Our construction embeds the problem into $\mathrm{PG}(n,q)$, using points at infinity to encode directions, and proceeds via a decomposition into pairwise and triple configurations combined with a recursive lifting and gluing argument. We further interpret the construction in the Grassmannian $G_q(2,n+1)$, where affine lines correspond to the outer shell of $2$-subspaces, thereby extending known constructions for Grassmannians. A Python implementation is provided as supplementary material.
Read the full abstract ▾
Information Theory
Sequences with thirteen-valued cross correlations
Yuehui Cui and Jinquan Luo
In this paper, we completely determine the cross correlation distribution between an $m$-sequence $(s_t)$ of period $p^n-1$ and its $d$-decimated sequence $(s_{dt})$, where $d = \frac{p^n-1}{3} + p^i$, $p \equiv 1 \pmod{3}$, $\frac{1}{3}p^{-i}(p^n-1) \not\equiv 2 \pmod{3}$, and $0 \leq i < n$. It is shown that the cross correlation is $13$-valued. To the best of our knowledge, this is the first time that the cross correlation distribution of so many values has been determined.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
From Simple to Complex: Curriculum-Guided Physics-Informed Neural Networks via Gaussian Mixture Models
Jianan Yang, Yiran Wang, Shuai Li et al. (+3 more)
Physics-informed neural networks (PINNs) offer a mesh-free framework for solving partial differential equations (PDEs), yet training often suffers from gradient pathologies, spectral bias, and poor convergence, especially for problems with strong nonlinearity, sharp gradients, or multiscale features. We propose the Curriculum-Guided Gaussian Mixture Physics-Informed Neural Network (CGMPINN), which integrates Gaussian mixture modeling with dynamic curriculum learning. Specifically, a GMM is periodically fitted to the PDE residual distribution to quantify spatially varying learning difficulty. A smooth curriculum schedule progressively shifts training focus from easy to harder regions, while precision-based variance modulation suppresses unreliable clusters during early optimization. This dual curriculum is governed by a shared curriculum parameter and can be combined with self-adaptive loss balancing. We further establish theoretical guarantees, including sublinear convergence of the gradient norm for the induced time-varying loss, uniform equivalence between the curriculum-weighted and standard PDE losses, and a generalization bound with an explicit weighting-induced bias characterization. Experiments on six
benchmark PDEs spanning
elliptic,
parabolic,
hyperbolic, advection-dominated, and nonlinear reaction-
diffusion types show that CGMPINN consistently achieves the lowest relative $L_2$ and maximum absolute errors among all compared methods, reducing relative $L_2$ error by up to 97.8% over the standard PINN at comparable cost. Our code is publicly available at https://github.com/Mathematics-Yang/CGMPINN.
Read the full abstract ▾
All authors Jianan Yang, Yiran Wang, Shuai Li, Fujun Cao, Xuefei Yan, Junmin Liu
Commutative Algebra · Cross-listed from cs.MS
A C implementation of the Smith massager algorithm
Ziwen Wang, Stavros Birmpilis, George Labahn et al. (+1 more)
We describe a C implementation of the Las Vegas
algorithm of Birmpilis, Labahn and Storjohann from 2020 for computing the Smith normal form of a nonsingular integer
matrix. The
algorithm computes a Smith massager for the input
matrix using $O(n^{\omega}\, \B(\log n + \log \|A\|)\, (\log n)^2)$ bit operations, which is softly equivalent to the cost of multiplying two
matrices of the same dimension and entry size. We describe the key implementation techniques that bridge the gap between the theoretical
algorithm and practical performance, including BLAS-accelerated modular arithmetic via the Residue Number System and an adaptive batching scheme that collapses the theoretical $O(\log n)$ iterations to $O(1)$ in practice. Experiments on
matrices of dimension up to $n = 10007$ show that the implementation's running time scales proportionally to that of a single BLAS
matrix multiplication, with both exhibiting the same effective growth rate on a log-log plot.
Read the full abstract ▾
All authors Ziwen Wang, Stavros Birmpilis, George Labahn, Arne Storjohann
Information Theory · Cross-listed from quant-ph
Quantum Entanglement Halves the Oblivious Update Bandwidth
Sagar Dubey
We consider $(n,k)$ MDS-coded distributed storage over $\mathbb{F}_q$ with per-node storage $\alpha$ symbols. For the oblivious update problem, where a single message symbol changes and neither helpers nor the stale node know which, the classical lower bound is $\alpha k \log_2 q$ bits. We prove that when the $k$ contacted helpers share prior
quantum entanglement, the update bandwidth is $\lceil \alpha/2 \rceil \cdot k \log_2 q$ bits-equivalent, a factor approaching 2 reduction. For $\alpha = 2$, a $[[k, k-2]]_q$ CSS code achieves bandwidth $k \log_2 q$ with one qudit per helper. For general $\alpha$, a $[[\lceil \alpha/2 \rceil k, \lceil \alpha/2 \rceil k - \alpha]]_q$ CSS code achieves the bound with $\lceil \alpha/2 \rceil$ qudits per helper. The matching converse uses the superdense coding bound: the stale node holds all transmitted qudits and hence the entangled partners, so each helper's channel supports at most $D^2$ distinguishable signals for dimension $D$. The result holds for all $(n,k)$ pairs with sufficiently large
prime $q$.
Read the full abstract ▾
Numerical Analysis · Cross-listed from physics.flu-dyn
Multiresolution analysis on tessellation graphs for inertial particle dynamics
Keigo Matsuda, Thibault Maurel-Oujia and Kai Schneider
A multiresolution technique on tessellation graphs for particle dynamics is proposed. This allows to split spatial field data given on millions of discrete particle positions into scale-dependent contributions. The Delaunay tessellation is used to define the graph, and Voronoi
cell volumes are used to satisfy volume conservation. Our approach enables computation of the scale-dependent statistics of particle dynamics by leveraging a wavelet transformation of Lagrangian point particle data and is useful for characterizing particle clustering in turbulent flows. The technique is systematically verified by using synthetic data of randomly distributed particles in a two-dimensional plane. Then the applicability of the technique is demonstrated by extracting the scale-dependent particle velocity divergence of inertial particles in homogeneous isotropic
turbulence from direct numerical simulation data. The result is verified by comparing the energy spectrum of the divergence with that obtained by a
Fourier-based approach. Finally, the wavelet-based filtering to the particle velocity divergence is demonstrated to extract the effect of caustics in inertial particle clustering.
Read the full abstract ▾
Operator Algebras
Weyl's laws and Connes' Trace Theorem for operator-valued pseudo-differential operators
Edward McDonald, Xiao Xiong and Xinyu Zhang
We investigate the spectral asymptotic behavior of operator-valued classical pseudo-differential operators ($\Psi$DOs) for negative order with symbols taking values in a semifinite von Neumann algebran $\mathcal{M}$ equipped with a normal semifinite faithful trace. Within the framework of Connes' noncommutative geometry, we extend Connes' trace
theorem to this operator-valued (type II) setting. Our main results are as follows: (i) a symbolic characterization of complex powers for operator-valued
elliptic $\Psi$DOs, extending Seeley's classical construction; (ii) a trace formula for localized Riemann $\zeta$-functions that links the spectral residues of operator-valued
elliptic operators to their principal symbols, thereby providing an operator-valued extension of the Connes–Wodzicki residue; (iii) Weyl's law for right-compactly supported operator-valued classical $\Psi$DOs of arbitrary negative order, which yields a direct spectral proof of the noncommutative integral that bypasses the use of Dixmier traces; (iv) Weyl's law for operator-valued commutators of certain
Fourier multipliers with multiplication operators.
Read the full abstract ▾
Information Theory · Cross-listed from cs.CL
Diagnosing Multi-step Reasoning Failures in Black-box LLMs via Stepwise Confidence Attribution
Xiaoou Liu, Tiejin Chen, Dengjia Zhang et al. (+3 more)
Large
Language Models have achieved strong performance on
reasoning tasks with objective answers by generating step-by-step solutions, but diagnosing where a multi-step
reasoning trace might fail remains difficult. Confidence estimation offers a diagnostic signal, yet existing methods are restricted to final answers or require internal model access. In this paper, we introduce Stepwise Confidence Attribution (SCA), a framework for closed-source LLMs that assigns step-level confidence based only on generated
reasoning traces. SCA applies the Information Bottleneck principle: steps aligning with consensus structures across correct solutions receive high confidence, while deviations are flagged as potentially erroneous. We propose two complementary methods: (1) NIBS, a non-parametric IB approach measuring consistency without graph structures, and (2) GIBS, a graph-based IB model that learns subgraphs through a differentiable mask to capture logical variability. Extensive experiments on mathematical
reasoning and multi-hop question answering show that SCA reliably identifies low-confidence steps strongly correlated with
reasoning errors. Moreover, using step-level confidence to guide self-correction improves the correction success rate by up to 13.5% over answer-level feedback.
Read the full abstract ▾
All authors Xiaoou Liu, Tiejin Chen, Dengjia Zhang, Yaqing Wang, Lu Cheng, Hua Wei