Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 18 March

Probability

Global Tensor Field Formulation of the Fokker-Planck Equation on Riemannian Manifolds

This paper presents a global, coordinate-free formulation of the Fokker-Planck equation on Riemannian manifolds. In the Stratonovich formulation, the infinitesimal generator is expressed intrinsically through Lie derivatives, and its adjoint is derived via the divergence theorem, yielding a concise geometric form of the Fokker-Planck equation. In the Ito formulation, a diffusion tensor field is introduced to generalize the Euclidean diffusion matrix, and a tensor-field-based analysis establishes an intrinsic double-divergence representation of the Fokker-Planck equation. The proposed framework provides a globally valid and geometrically consistent interpretation of diffusion and probability transport on Riemannian manifolds, supported by compact and intuitive proofs.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code Decoding

We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-output decoding entire component codes rather than individual parity checks, we mitigate the effects of trapping sets and cycles, resulting in improved convergence. Because our decoder preserves the message passing structure of standard belief propagation (BP), it is compatible with many BP enhancements. We demonstrate this with OSD postprocessing, quaternary BP, and RelayBP, each yielding further gains. Standalone SOGRAND outperforms the standard BP+OSD baseline by over two orders of magnitude in logical error rate. In combination with the Relay principle, SOGRAND outperforms RelayBP by over one order of magnitude, providing a way forward for scalable decoding of the emerging class of Tanner-code-based quantum codes.
Read the full abstract

All authors Lukas Rapp, Muriel Médard, Eugene Tang, Ken R. Duffy

Probability

Quantitative equidistribution of eigenvalues of Random Normal Matrices in the Wasserstein distance

The object of study in this paper is the expected $2$-Wasserstein distance between the empirical measures of several point processes and their respective limit. For this, the main tool developed is a smoothing procedure in Euclidean spaces using the heat equation with Neumann boundary conditions. It is applied to the spectrum of Random Normal Matrices with reasonable assumptions on the potential, as well as to Hyperuniform Point Processes such as the infinite Ginibre ensemble and the zero set of the planar Gaussian Analytic Function. In both of these cases, the technique obtains the optimal rate of convergence.
Read the full abstract

Statistics Theory

Minimax Optimal Estimation of Mean and Covariance Functions with Spectral Regularization

Estimation of the mean and covariance functions is a fundamental problem in functional data analysis, particularly for discretely observed functional data. In this work, we study a regularization-based framework for estimating the mean and the covariance functions within a reproducing kernel Hilbert space (RKHS) setting. Our approach utilizes a spectral regularization technique under Hölder-type source conditions, allowing for a broad class of regularization schemes and accommodating a wide range of smoothness assumptions on the target functions. In contrast to RKHS formulations that assume the target belongs to the underlying RKHS, our source-condition framework also accommodates misspecified targets. Convergence rates for the proposed estimators are derived, and we derive corresponding minimax lower bounds and identify regimes in which the upper bounds are optimal, or optimal up to logarithmic factors.
Read the full abstract

Analysis of PDEs

Low-regularity invariant measure for the complex-valued mKdV

In this paper we consider the twice-renormalized, complex-valued modified KdV (mKdV) on the one-dimensional torus introduced by Chapouto. Our main result is the construction of an invariant measure supported at low-regularity. This work complements the work of Kenig et al., which constructed invariant measures supported in higher-regularity spaces for the non-renormalized mKdV. Due to the low-regularity of the support of the measure, we are forced to work in Fourier-Lebesgue spaces. The fact that we consider the complex-valued mKdV makes the problem more complicated than the real-valued case, which was previously considered.
Read the full abstract

All authors Zachary Lee, Nataša Pavlović, Gigliola Staffilani, Nicola Visciglia

Optimization and Control

Adversarial Robustness for Matrix Control Barrier Functions in Sampled-Data Systems

This paper presents novel theoretical results to guarantee multi-agent set invariance using Matrix Control Barrier Functions in sampled-data systems. More specifically, the paper presents conditions under which heterogeneous control-affine agents applying zero-order-hold control inputs can compute control inputs to render safe sets defined by matrix inequalities forward invariant. It then introduces methods to guarantee set invariance while accounting for the presence of adversarial agents seeking to drive the system state to unsafe sets. Finally, the paper presents theoretical extensions of these set invariance results to systems having high relative degree with respect to the matrix-valued safe set function.
Read the full abstract

Optimization and Control

Forward-Backward Dynamic Programming for LQG Dynamic Games with Partial and Asymmetric Information

We formulate and study a class of two-player zero-sum stochastic dynamic games with partial and asymmetric information. Information asymmetry introduces fundamental challenges involving belief representation and theory of mind issues, where agents must impute belief states and estimates of other agents to inform their own strategy. To avoid an infinite regress of higher-order beliefs amongst agents and obtain computationally implementable results, we focus on a linear quadratic Gaussian (LQG) model and consider strategies with limited internal state dimension. We present a novel iterative forward-backward algorithm to jointly compute belief states and equilibrium strategies and value functions for a finite-horizon problem. We also present a value iteration-like algorithm to jointly compute stationary belief states and equilibrium strategies for an average-cost infinite-horizon problem. An open-source implementation of the algorithms is provided, and we demonstrate the effectiveness of the proposed algorithms in numerical experiments.
Read the full abstract

Numerical Analysis · Cross-listed from nlin.SI

Nonlinear Incompressible Shear Wave Models in Hyperelasticity and Viscoelasticity Frameworks, with Applications to Love Waves

General equations describing shear displacements in incompressible hyperelastic materials, holding for an arbitrary form of strain energy density function, are presented and applied to the description of nonlinear Love-type waves propagating on an interface between materials with different mechanical properties. The model is valid for a broad class of hyper-viscoelastic materials. For a cubic Yeoh model, shear wave equations contain cubic and quintic differential polynomial terms, including viscoelasticity contributions in terms of dispersion terms that include mixed derivatives $u_{xxt}$ of the material displacement. Full (2+1)-dimensional numerical simulations of waves propagating in the bulk of a two-layered solid are undertaken and analyzed with respect to the source position and mechanical properties of the layers. Interfacial nonlinear Love waves and free upper surface shear waves are tracked; it is demonstrated that in the fully nonlinear case, the variable wave speed of interface and surface waves generally satisfies the linear Love wave existence condition $c_1 < \abs{v} < c_2$, while tending to the larger material wave speed $c_1$ or $c_2$ for large times.
Read the full abstract

Combinatorics

Counting Strict Gridlock on Graphs

Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to study how coloring problems can be solved by groups of individuals on a graph, which has led to new insights into network structure, group dynamics, and individual human behavior. Despite this newfound utility, the exact nature of these distributed coloring problems is not well-understood, and established mathematical tools like the chromatic polynomial miss the unique challenges that arise in these social problem-solving situations with limited information. In this paper, we provide a new framework for understanding these distributed problems by defining a new kind of graph coloring with particular relevance to consensus formation on networks, in which all vertices are trying to agree on a common color. These strict gridlock colorings represent roadblocks to consensus where the group will not reach a uniform coloring using natural update processes. We describe a recurrence relation that provides an algorithm for counting these gridlocked colorings, which establishes a mathematical measure of how much a given graph hinders consensus in a group.
Read the full abstract

K-Theory and Homology

On the K-theory of matroids with Tutte coverings

The aim of this work is to explicitly compute the K-theory of the category of matroids with respect to the covering family of Tutte coverings. In particular, we show that this is equivalent to the K-theory spectrum of the category of graphic matroids on looped forests, with the covering family generated by isomorphisms. Further, we show that this yields an equivalence of $C_2$-spectra.
Read the full abstract

Functional Analysis

Duality for Delsarte's extremal problem on locally compact Abelian groups

The Delsarte extremal problem for positive definite functions, originally introduced by Delsarte in coding theory to bound the size of error-correcting codes, has since found applications in diverse areas such as sphere packing, Fuglede's spectral set conjecture, and $1$-avoiding sets. Recent developments have established the existence of extremizers in fairly general settings and identified precise linear programming dual formulations, together with strong duality results, in several important cases including finite groups and $\mathbb{R}^d$. In this paper, we consider a generalized Delsarte problem on locally compact Abelian groups, providing a natural framework for harmonic analysis. We extend both the normalization and the objective functional to encompass a wide range of previously studied cases, while avoiding restrictive topological assumptions common in the literature. Within this general setting, we derive the corresponding dual problem and prove a strong duality theorem, thereby unifying and extending earlier results. Naturally, our proof uses harmonic analysis, but the key is a functional analytic approach which distinguishes our proof from existing methods.
Read the full abstract

All authors Elena E. Berdysheva, Bálint Farkas, Marcell Gaál, Mita D. Ramabulana, Szilárd Gy. Révész

Optimization and Control · Cross-listed from cs.CG

Turnpike with Uncertain Measurements: Triangle-Equality ILP with a Deterministic Recovery Guarantee

We study Turnpike with uncertain measurements: reconstructing a one-dimensional point set from an unlabeled multiset of pairwise distances under bounded noise and rounding. We give a combinatorial characterization of realizability via a multi-matching that labels interval indices by distinct distance values while satisfying all triangle equalities. This yields an ILP based on the triangle equality whose constraint structure depends only on the two-partition set $\mathcal{P}_y=\{(r,s,t): y_r+y_s=y_t\}$ and a natural LP relaxation with $\{0,1\}$-coefficient constraints. Integral solutions certify realizability and output an explicit assignment matrix, enabling an assignment-first, regression-second pipeline for downstream coordinate estimation. Under bounded noise followed by rounding, we prove a deterministic separation condition under which $\mathcal{P}_y$ is recovered exactly, so the ILP/LP receives the same combinatorial input as in the noiseless case. Experiments illustrate integrality behavior and degradation outside the provable regime.
Read the full abstract

Analysis of PDEs

Global-in-time existence and uniqueness of classical solutions to the unsteady initial-boundary value problem for the four-velocity planar Broadwell model in a rectangular domain

Since the pioneering work of James E. Broadwell, discrete velocity models (DVMs) have played a fundamental role in approximating the Boltzmann equation and in the analysis of non-equilibrium gas dynamics. Despite their apparent simplicity, many fundamental analytical questions remain open, in particular the global existence and uniqueness of classical solutions, even for the widely studied four-velocity Broadwell model. In this paper, we establish the global-in-time existence and uniqueness of classical solutions to the nonstationary four-velocity Broadwell system in a rectangular domain. The analysis is carried out in a class of continuous functions possessing, except possibly on a finite number of planes, continuous first-order partial derivatives. Our approach is based on fixed point arguments combined with suitable a priori estimates that provide uniform bounds on the solution and its first-order partial derivatives. These bounds ensure that the solution remains controlled for all time and can be extended globally. We prove the existence of a unique bounded continuous solution whose first-order partial derivatives are also bounded. These results provide a rigorous well-posedness framework for this prototypical discrete velocity model and contribute to a deeper understanding of the analytical properties of discrete velocity models, which serve as systematic approximations of the Boltzmann equation in the study of non-equilibrium gas dynamics.
Read the full abstract

Metric Geometry

Exact Banach-Mazur distances of certain $\ell_p$-sums and cones

We determine certain Banach-Mazur distances involving $\ell_p$-direct sums of finite-dimensional real normed spaces and related cone constructions of convex bodies. Using a recent characterization of the optimal Banach-Mazur position with respect to the Euclidean ball, we derive a closed formula for the distance from $X_1 \oplus_p \cdots \oplus_p X_k$ to Euclidean space in terms of the distances of the spaces $X_i$ to Euclidean space. For $p = 1$ we show that if $d_{BM}(X,\ell_1^n) \leq 3$, then $d_{BM}(X \oplus_1 \ell_1^m, \ell_1^{n+m}) = d_{BM}(X,\ell_1^n)$. Interpreting $\ell_1$-sums geometrically as double cones motivates a study of single cones over arbitrary convex bases, for which we establish an analogous result with the simplex replacing $\ell_1$. We further show that in dimension $3$ the distance between single cones with symmetric bases equals the distance between the bases, and that the same equality holds for double cones over planar symmetric bases in arbitrary dimension, under an additional assumption on the distance of the bases to $\ell_1^2$. As consequences, we obtain an explicit isometric embedding of the $2$-dimensional symmetric Banach-Mazur compactum into the $3$-dimensional (non-symmetric) compactum and lift a recent construction of arbitrarily large equilateral sets in the $2$-dimensional symmetric compactum to all higher dimensions.
Read the full abstract

Representation Theory

Classifying submodules over monoidal categories

We study the classification of submodules of module categories over monoidal categories, extending ideas of Coulembier on the classification of tensor ideals in monoidal categories. We develop a framework that applies to module categories equipped with a twisted cylinder twist, a structure closely related to the twisted reflection equation and quantum symmetric pairs. Under mild assumptions, we establish an order-preserving bijection between submodules of a module category $\mathcal{M}$ and submodules of the path-algebra module $\mathcal{M}(1,-)$. We show that this correspondence is compatible with idempotent completion and analyze its behavior under decategorification to the split Grothendieck group, giving criteria for classification in terms of indecomposable objects. As an application, we study the disoriented skein category as a module category over the oriented skein category, describe its indecomposable objects, and obtain a complete classification of its submodules.
Read the full abstract

Information Theory · Cross-listed from cs.DS

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation

Bayesian methods lie at the heart of modern data science and provide a powerful scaffolding for estimation in data-constrained settings and principled quantification and propagation of uncertainty. Yet in many real-world use cases where these methods are deployed, there is a natural need to preserve the privacy of the individuals whose data is being scrutinized. While a number of works have attempted to approach the problem of differentially private Bayesian estimation through either reasoning about the inherent privacy of the posterior distribution or privatizing off-the-shelf Bayesian methods, these works generally do not come with rigorous utility guarantees beyond low-dimensional settings. In fact, even for the prototypical tasks of Gaussian mean estimation and linear regression, it was unknown how close one could get to the Bayes-optimal error with a private algorithm, even in the simplest case where the unknown parameter comes from a Gaussian prior. In this work, we give the first efficient algorithms for both of these problems that achieve mean-squared error $(1+o(1))\mathrm{OPT}$ and additionally show that both tasks exhibit an intriguing computational-statistical gap. For Bayesian mean estimation, we prove that the excess risk achieved by our method is optimal among all efficient algorithms within the low-degree framework, yet is provably worse than what is achievable by an exponential-time algorithm. For linear regression, we prove a qualitatively similar lower bound. Our algorithms draw upon the privacy-to-robustness framework of arXiv:2212.05015, but with the curious twist that to achieve private Bayes-optimal estimation, we need to design sum-of-squares-based robust estimators for inherently non-robust objects like the empirical mean and OLS estimator. Along the way we also add to the sum-of-squares toolkit a new kind of constraint based on short-flat decompositions.
Read the full abstract

All authors Sitan Chen, Jingqiu Ding, Mahbod Majid, Walter McKelvie

Combinatorics

Biregular bipartite multigraphs and matchings in tensor products of bipartite graphs

We answer a question of P. Higgins on permutations and involutions in binary arrays, arising in the study of regular finite semigroups. For a binary rectangular matrix M, we prove that if there is a permutation pi(x, y) = (f(x, y), g(x, y)) of its cells satisfying M(x, g(x,y)) = 1 for every cell, then there is an involution with the same property. The elementary proof places coins in the nonzero cells, reduces their support to a forest, and assigns consecutive integer weights to the coins incident to each row and column. We also prove a multiplicativity formula for bipartite expansion and a perfect matching theorem for tensor products of supports of matrices with prescribed margins. We study a stronger conjecture of F. Petrov on disjoint swaps in biregular bipartite multigraphs. We prove this conjecture for k = mn + eps, |eps| <= 2, and for n = 6, k = 6m + 3, and give a group-theoretic reformulation.
Read the full abstract

All authors Ilya I. Bogdanov, Fedor Petrov, Anton Sadovnichiy, Fedor Ushakov

Numerical Analysis

Christoffel Adaptive Sampling for Sparse Random Feature Expansions

Random Feature Models (RFMs) have become a powerful tool for approximating multivariate functions and solving partial differential equations efficiently. Sparse Random Feature Expansions (SRFE) improve traditional RFMs by incorporating sparsity, making it particularly effective in data-scarce settings. In this work, we integrate active learning with sparse random feature approximations to improve sampling efficiency. Specifically, we incorporate the Christoffel function to guide an adaptive sampling process, dynamically selecting informative sample points based on their contribution to the function space. This approach optimizes the distribution of sample points by leveraging the Christoffel function associated with an iteratively-chosen basis obtained by the sparse recovery solver. We conduct numerical experiments comparing adaptive and nonadaptive sampling strategies with the SRFE framework and examine their accuracy for various function approximation tasks. Overall, our results demonstrate the advantages of adaptive sampling in maintaining high accuracy while reducing sample complexity for SRFE, highlighting its potential for scientific computing tasks where data is expensive to acquire.
Read the full abstract

Optimization and Control · Cross-listed from q-bio.QM

RAFT-UP: Robust Alignment for Spatial Transcriptomics with Explicit Control of Spatial Distortion

Spatial transcriptomics (ST) profiles gene expression across a tissue section while preserving the spatial coordinates. Because current ST technologies typically profile two-dimensional tissue slices, integrating and aligning slices from different regions of the same three-dimensional tissue or from samples under different conditions enables analyses that reveal 3D organization and condition-associated spatial patterns. Two major challenges remain. First, interpretable and flexible control over spatial distortion is needed because rigid transformations can be overly restrictive, whereas highly deformable mappings may arbitrarily distort spatial proximity. Second, biologically plausible matching is also needed, especially when the slices overlap partially. Here, we introduce RAFT-UP, a tool for robust ST alignment that provides explicit control over spatial distance preservation through a fused supervised Gromov-Wasserstein (FsGW) optimal transport framework. FsGW combines expression and spatial information, incorporates spot-wise constraints to discourage biologically implausible matches, and enforces a pairwise distance-consistency constraint that prevents mapping two pairs of spots when their spatial distances differ beyond a specified tolerance. We demonstrate that RAFT-UP accurately aligns slices from different regions of the same tissue and slices from different samples. Benchmarking shows that RAFT-UP improves spatial distance preservation while achieving spot label matching accuracy comparable to state-of-the-art methods. Finally, we demonstrate RAFT-UP on two spatially constrained downstream applications, including spatiotemporal mapping of developing mouse midbrain and comparative cross-slice analysis of cell-cell communication. RAFT-UP is available as open-source software.
Read the full abstract

All authors Yaqi Wu, Jingfeng Wang, Xin Maizie Zhou, Yanxiang Zhao, Zixuan Cang

Combinatorics

Finite Cardinalities of Misère Quotients

We find that partisan misère quotients can have any finite cardinality other than 3, answering a question of Allen. This contrasts with impartial misère quotients, which must have even cardinality.

Number Theory

Why Eight Percent of Benford Sequences Never Converge

We study multi-digit correlations in Benford sequences b^n for integer bases 2 <= b <= 1000, measuring dependence via conditional mutual information (CMI). A resonance ratio derived from the continued fraction expansion of log_10(b) classifies bases into convergent and persistent regimes (Theorem 3.13): among 996 bases surveyed, 84 (8.4%) exhibit persistent correlations at sample depth N = 10,000, and extended computation to N = 200,000 confirms 53 (5.3%) as genuinely persistent. We prove that CMI deviation is bounded by the distribution error (Theorem 3.4); exhaustive computation across 2,988 test cases confirms that the effective scaling is quadratic, yielding a two-sided rate beta = 2 for bounded-type bases (conditional on a computationally verified Hessian positivity condition). The observed effective exponent across 774 convergent bases is beta_eff = 1.72 +/- 0.19, consistent with finite-sample corrections to the asymptotic rate. We conjecture that the persistence rate converges to 1/12, a prediction grounded in the Gauss-Kuzmin distribution of partial quotients. For persistent bases, the convergence threshold N_epsilon exceeds 10^6 at standard precision, rendering the asymptotic limit observationally irrelevant within our computational scope.
Read the full abstract

Numerical Analysis

Splitting-strategies for arbitrary-order fully mixed finite element discretizations of the Biot equations

We study the fully-mixed formulation of the Biot equations which is characterized by a symmetric coupling between flow and deformation while each subphysics has internally a saddle point structure. This enables the use of stable mixed finite elements for each subproblem without a strong compatibility condition across the two subphysics. To exploit this flexibility while preserving the conservation structure of both subproblems, we consider fully mixed finite element methods in which the symmetry of the elastic stress tensor is enforced weakly, often referred to as a five-field formulation. The resulting mixed formulation exhibits an overarching saddle-point structure whose stability is determined by suitable inf-sup conditions. Inf-sup stability is established for several families of discrete spaces of arbitrary order, leading to optimal a priori error estimates. Iterative splitting strategies following the classical fixed-stress split with additional tuning are specifically investigated for the fully mixed formulation with proof of convergence and rates depending on the coupling strength. Contrary to previous analyses on coupled problems with a symmetric structure, we theoretically prove the efficacy of negative stabilization, consistent with Schur-complement ideas. Numerical results based on analytical solutions and the classical 2D Mandel problem and a 3D footing problem are presented supporting the theory.
Read the full abstract

Information Theory

Cache-Aided Asymmetric MIMO Communications: Achievable DoF Analysis

Integrating coded caching (CC) into multiple-input multiple-output (MIMO) communications significantly enhances the achievable degrees of freedom (DoF). This paper investigates a practical cache-aided asymmetric MIMO configuration with cache ratio $\gamma$, where a server with $L$ transmit antennas communicates with $K$ users. The users are partitioned into $J$ groups, and each user in group $j$ has $G_j$ receive antennas. We propose four content-aware MIMO-CC strategies: \emph{min-$G$} enforces symmetry using the smallest antenna count among users; Grouping maximizes intra-subset spatial multiplexing gain at the expense of some global caching gain; Super-grouping aggregates users into optimized \emph{min-$G$}-based super-sets with identical effective receive multiplexing gains before applying Grouping across them; and Phantom redistributes spatial resources assuming "phantom" antennas at the users to bridge the performance gains of \emph{min-$G$} and Grouping. We develop these asymmetric strategies under three reference symmetric CC placement-delivery policies with guaranteed linear decodability: a finite-search DoF-optimized policy attaining the best single-shot achievable DoF lower bound, and two closed-form policies, namely combinatorial and linear cyclic low-complexity constructions, with the cyclic policy attaining DoF performance close to the others in many operating regimes. Analytical and numerical results demonstrate significant DoF improvements across various system configurations, and that policy-strategy combinations offer flexible trade-offs between DoF and subpacketization complexity.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Iterative Decoding of Stabilizer Codes under Radiation-Induced Correlated Noise

Fault-tolerant quantum computation demands extremely low logical error rates, yet superconducting qubit arrays are subject to radiation-induced correlated noise arising from cosmic-ray muon-generated quasiparticles. The quasiparticle density is unknown and time-varying, resulting in a mismatch between the true noise statistics and the priors assumed by standard decoders, and consequently, degraded logical performance. We formalize joint noise sensing and decoding using syndrome measurements by modeling the QP density as a latent variable, which governs correlation in physical errors and syndrome measurements. Starting from a variational expectation–maximization approach, we derive an iterative algorithm that alternates between QP density estimation and syndrome-based decoding under the updated noise model. Simulations of surface-code and bivariate bicycle quantum memory under radiation-induced correlated noise demonstrate a measurable reduction in logical error probability relative to baseline decoding with a uniform prior. Beyond improved decoding performance, the inferred QP density provides diagnostic information relevant to device characterization, shielding, and chip design. These results indicate that integrating physical noise estimation into decoding can mitigate correlated noise effects and relax effective error-rate requirements for fault-tolerant quantum computation.
Read the full abstract

All authors Anuj K. Nayak, Paul G. Baity, Peter J. Love, Nicholas Jeon, Byung-Jun Yoon, Adolfy Hoisie, Lav R. Varshney

Commutative Algebra

Dualities in Multiparameter Persistence

In the theory of persistent homology, a well known duality relates the barcodes of the absolute homology and relative cohomology of a one-parameter simplicial filtration. Motivated by the problem of computing free presentations of the (co)homology of multiparameter Rips filtrations, we give a multiparameter generalization of this duality. Considering two duality functors on multiparameter persistence modules, the pointwise dual $(-)^*$ and the global dual $(-)^\dagger$, we show that $H_q(C)^* \cong H^{N+q}(C^\dagger)$ for chain complexes $C$ of free $N$-parameter persistence modules with acyclic colimit. We give an elementary and accessible proof based on a long exact sequence argument, and also give an alternate proof that casts the result as a special case of multigraded Grothendieck local duality. As a corollary, we recover a simple correspondence between minimal free resolutions of a persistence module $M$ and those of its pointwise dual $M^*$, a result previously obtained by Miller, 2000. These results form the foundation of a state-of-the-art algorithm for computing free resolutions of the homology of Vietoris–Rips bifiltrations, described in a forthcoming paper.
Read the full abstract

Group Theory

Geometric approach to the modular isomorphism problem: groups of order 64

We introduce a procedure based on computational algebraic geometry to determine whether two algebras are isomorphic. We then apply it to show that if $R$ is a commutative unital ring in which $2$ is not invertible, $G$ is a group of order dividing $64$ and $H$ some group, then an isomorphism of unital algebras $RG \cong RH$ implies an isomorphism of groups $G \cong H$.
Read the full abstract

Logic

Constructive proofs for the standard translation of many-sorted to unsorted predicate logic

It is well known that many-sorted logic can be reduced to unsorted first-order logic by adding predicates for each sort, relativizing quantifiers to these predicates, and adding appropriate axioms governing their behavior. Existing constructive proofs for the correctness of this translation break down when the many-sorted language includes equality and the unsorted target calculus includes the usual rules/axioms for equality. We give an elementary proof in the form of an effective procedure that closes this gap. As an application, we give a fully syntactic justification of van Dalen's translation of second-order logic into unsorted first-order logic. We also give a new proof for a claim made by Herbrand in his 1930 dissertation that, in the equality-free case, a sentence is derivable in many-sorted logic iff it is derivable in unsorted logic. Our proof avoids the heavy machinery of later proofs by Schmidt and Wang.
Read the full abstract

Optimization and Control

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron

Sparsity is a fundamental modeling principle in statistics, signal processing, and data science. However, optimization with sparsity constraints is notoriously difficult. We introduce a new convex relaxation framework for {sparse quadratically constrained quadratic programs} (QCQPs), a class that subsumes sparse regression, sparse principal component analysis (PCA), and related problems. Our approach is based on a novel convex cone, the spartrahedron, which exactly characterizes sparsity at the matrix level. This leads to a semidefinite programming (SDP) relaxation that is tight whenever its solution is rank-one, providing a simple certificate of global optimality. We establish theoretical guarantees, including approximation bounds and exactness regions for sparse PCA and sparse ridge regression, as well as a general stability result under perturbations. Numerical experiments on sparse PCA, sparse regression, RIP constant estimation, and sparse canonical correlation analysis (CCA) demonstrate the practical success of our methods.
Read the full abstract

Mathematical Physics · Cross-listed from nlin.SI

Soliton solutions to the coupled Sasa-Satsuma-mKdV equation

We consider the soliton solutions of a recently proposed coupled Sasa-Satsuma-mKdV equation using the Kadomtsev-Petviashvili reduction method. The system consists of a complex-valued component coupled with a real-valued one. Under zero or nonzero boundary conditions, we derive four distinct classes of soliton solutions: bright-bright, dark-dark, bright-dark, and dark-bright. These solutions are derived from the vector Hirota equation, for which the bright, dark, and bright-dark soliton solutions are provided in the Appendix. We perform asymptotic analysis of soliton collisions for each class of solutions, in which inelastic collisions are observed between bright-bright solitons. In the dark-dark case, we identify soliton profiles similar to the Sasa-Satsuma equation, including double-hole, Mexican hat, and anti-Mexican hat solutions; this study further explores the collisions between these structures and hyperbolic tangent shaped kink solitons. Regarding the bright-dark case, beyond the expected soliton-kink interactions, we report and analyze a notable collision occurring between kink solitons.
Read the full abstract

Statistics Theory

Highly Adaptive Empirical Risk Minimization with Principal Components

The Highly Adaptive Lasso (HAL) delivers unprecedented guarantees in nonparametric minimum loss estimation under minimal smoothness assumptions, such as dimension-free minimax optimal rates. However, the practical use of HAL has been severely limited by its exponentially growing computationally prohibitive indicator basis expansion in moderate to high dimensions. Existing screening strategies drastically reduce this dimension but lack any theoretical justification. We introduce the Principal Component Highly Adaptive (PC-HA) family of estimators, which for the first time provide a principled and theoretically valid dimension reduction. We establish formal results on the score equations solved by these PC-HA estimators, allowing to transfer plug-in efficiency and pointwise asymptotic normality results from HAL to these PC-HA estimators, under comparable complexity control.
Read the full abstract

All authors Carlos García Meixide, Mingxun Wang, Alejandro Schuler, Mark J. van der Laan