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)

Tuesday 24 March

Analysis of PDEs

Orbit-Level Stretching in Cubic Fourier-Galerkin Navier-Stokes: Sharp Incidence, Spectral Decay, and a Continuation Criterion

I study orbit-level enstrophy stretching in a cubic Fourier-Galerkin truncation of the three-dimensional incompressible Navier-Stokes equations, reduced by the full octahedral symmetry group $O_h$. The nonlinear transfer compresses to an orbit-level matrix whose symmetric part $V_N$ governs net enstrophy growth. I reduce the stretching problem to an orbit–triad incidence estimate and close it by a face-normalized decomposition and a two-squares argument, establishing the sharp bound \begin{equation} c\,N^3\le\max_\alpha \sum_\beta \sqrt{\Gamma_{\alpha\beta}}\le C\,N^{3}. \end{equation} A weighted-incidence refinement then yields, in the isotropic unit-energy ensemble, \begin{equation} \mathbb{E}\,\rho(V_N)\le C\, N^{-3/2}\to 0, \qquad \mathbb{E}\,\nu_c^*(N)\le C\, N^{-7/2}\to 0, \end{equation} where $\nu_c^*(N)=\rho(V_N)/N^2$ is the orbit-level critical-threshold ratio. For Sobolev-class data with ${ \left\lVert u \right\rVert}_{H^s}\le M$ and $s>2$, a stronger deterministic bound ${{ \left\lVert V_N \right\rVert} }_\infty\le C_s M^3$ holds uniformly in $N$, with $\nu_c^*(N)\to 0$ for all $s>3/2$. A comparison with Tao's averaged Navier-Stokes construction shows that the orbit-level subcriticality is a structural property of the true nonlinearity that is violated by known blowup mechanisms. Monte Carlo experiments at $N=1,\ldots,8$ under both isotropic and Kolmogorov-spectrum ensembles confirm the decay, with $\rho(V_N)\sim N^{-2.6}$ far exceeding the proven upper bound. Tracking these bounds along the Galerkin evolution yields an orbit-level continuation criterion for the strong solution: global regularity holds if and only if $\int_0^T {{ \left\lVert V_N \right\rVert}}_\infty\,dt$ remains bounded uniformly in $N$.
Read the full abstract

Combinatorics · Cross-listed from quant-ph

Traveling Salesman Problem with a preprocessing method for classical and quantum optimization

The Traveling Salesman Problem is a fundamental combinatorial optimization problem widely studied in operations research. Despite its simple formulation, it remains computationally challenging due to the exponential growth of the search space and the large number of constraints required to eliminate subtours. This paper introduces a preprocessing strategy that significantly reduces the size of the optimization model by restricting the set of candidate arcs and retaining only the lowest-cost neighbors for each vertex. Computational experiments on TSPLIB benchmark instances demonstrate that the proposed approach substantially reduces the number of decision variables. The method is evaluated using both classical and quantum optimization techniques, showing improvements in computational time and reductions in optimality gaps. Overall, the results indicate that the proposed preprocessing enhances the scalability of the formulations and makes them more suitable for both classical solvers and emerging quantum optimization frameworks.
Read the full abstract

Algebraic Geometry

Cohomological descent for obstructions to local-global principle

We develop a formalism of cohomological descent encoding adelic points and obstructions to local-global principle on algebraic stacks. As an application, by constructing new obstructions using the formalism, we obtain some comparison results of obstructions on some classes of algebraic stacks.
Read the full abstract

Mathematical Physics

Dirac Operators, APS Boundary Conditions, and Spectral Flow on a Finite Warped Cylinder

We study the Dirac operator on a finite warped cylinder coupled to a background $U(1)$ gauge field. We identify the intrinsic endpoint operators defining the Atiyah-Patodi-Singer (APS) boundary condition and derive a determinant characterization of the modewise APS spectrum. In the constant-gauge, invertible setting, the endpoint reduced $\eta$ contributions cancel, so the APS index vanishes. For smooth gauge families, the APS projector becomes discontinuous when a boundary mode crosses zero. We therefore introduce a regularized APS-type family of self-adjoint endpoint conditions that remains continuous across such crossings. This regularized family admits a real-symplectic boundary formulation within the standard spectral-flow/Maslov framework: for nondegenerate regularization, the zero-mode set coincides with the boundary-zero set, and transverse boundary zeros give isolated regular crossings.
Read the full abstract

Dynamical Systems

On-the-Fly Lifting of Coarse Reaction-Coordinate Paths to Full-Dimensional Transition Path Ensembles

Effective dynamics on a low-dimensional collective-variable (CV) or latent space can be simulated far more cheaply than the underlying high-dimensional stochastic system, but exploiting such coarse predictions requires lifting: turning a coarse CV trajectory into dynamically consistent full-dimensional states and path ensembles, without relying on global sampling of invariant or conditional fiber measures. We present a local, on-the-fly lifting strategy based on guided full-system trajectories. First an effective model in CV space is used to obtain a coarse reference trajectory. Then, an ensemble of full-dimensional trajectories is generated from a guided version of the original dynamics, where the guidance steers the trajectory to track the CV reference path. Because guidance biases the path distribution, we correct it via pathwise Girsanov reweighting, yielding a correct-by-construction importance-sampling approximation of the conditional law of the uncontrolled dynamics. We further connect the approach to stochastic optimal control, clarifying how coarse models can inform variance-reducing guidance for rare-event quantities. Numerical experiments demonstrate that inexpensive coarse transition paths can be converted into realistic full-system transition pathways (including barrier crossings and detours) and can accelerate estimation of transition pathways and statistics while providing minimal bias through weighted ensembles.
Read the full abstract

All authors Christof Schütte, Alexander Sikorski, Jakob Kresse, Marcus Weber

Information Theory

Autoencoder-based Optimization of Multi-user Molecule Mixture Communication Systems

In this paper, we introduce an autoencoder (AE)-based scheme for end-to-end optimization of a multi-user molecule mixture communication system. In the proposed scheme, each transmitter leverages an encoder network that maps the user symbol to a molecule mixture. The mixtures then propagate through the channel to the receiver, which samples the channel using a non-linear, cross-reactive sensor array. A decoder network then estimates the symbol transmitted by each user based on the sensor observations. The proposed scheme achieves, for a given signal-to-noise ratio, lower symbol error rates than a baseline scheme from the literature in a single-user setting with full channel state information. We additionally demonstrate that the proposed AE-based scheme allows reliable communication when the channel is unknown or changing. Finally, we show that for multiple access the system can account for different user priorities. In summary, the proposed AE-based scheme enables end-to-end system optimization in complex scenarios unsuitable for analytical treatment and thereby brings molecular communication systems closer to real-world deployment.
Read the full abstract

All authors Bastian Heinlein, Nuria Zurita Jiménez, Kaikai Zhu, Sümeyye Carkit-Yilmaz, Robert Schober, Vahid Jamali, Maximilian Schäfer

Optimization and Control

Enclosing minima in nonsmooth optimization via trust regions of higher-order cutting-plane models

We propose a globally convergent trust-region bundle method for minimizing lower-$C^2$ functions using higher-order cutting-plane models. Under certain growth assumptions on the objective around its minimum, the method is able to compute infinitely many trust regions of decreasing size that contain the minimum. We show that these growth assumptions are satisfied for certain finite max-type functions with sharp or quadratic growth. Enclosing the minimum in this way can be used to initialize local superlinearly convergent methods, which we demonstrate in numerical experiments.
Read the full abstract

Information Theory

Ellipsoidal Manifold Optimization for Distributed Antenna Beamforming

This paper addresses the weighted sum-rate (WSR) maximization problem in a downlink distributed antenna system subject to per-cluster power constraints. This optimization scenario presents significant challenges due to the high dimensionality of beamforming variables in dense antenna deployments and the structural complexity of multiple independent power constraints. To overcome these difficulties, we generalize the low-dimensional subspace property–previously established for sum-power constraints–to the per-cluster power constraint case. We prove that all stationary-point beamformers reside in a reduced subspace spanned by the channel vectors of the corresponding antenna cluster. Leveraging this property, we reformulate the original high-dimensional constrained problem into an unconstrained optimization task over a product of ellipsoidal manifolds, thereby achieving significant dimensionality reduction. We systematically derive the necessary Riemannian geometric structures for this specific manifold, including the tangent space, Riemannian metric, orthogonal projection, retraction, and vector transport. Subsequently, we develop a tailored Riemannian conjugate gradient algorithm to solve the reformulated problem. Numerical simulations demonstrate that the proposed algorithm achieves the same local optima as standard benchmarks, such as the weighted minimum mean square error (WMMSE) method and conventional manifold optimization, but with substantially higher computational efficiency and scalability, particularly as the number of antenna clusters increases.
Read the full abstract

Mathematical Physics

Information-theoretic structure for the Tsallis q-entropy in statistical physics

In this work, we derive information-theoretic properties for a modified Tsallis entropy, hereinafter referred to as q-entropy. We introduce the notions of joint q-entropy, conditional q-entropy, relative q-entropy, conditional mutual q-information, and establish several inequalities analogous to those of classical information theory. Within the context of Markov chains, these results are employed to prove a version of the second law of thermodynamics. Furthermore, we investigate the maximum entropy method in this setting. Finally, we prove a Tsallis version of the Shannon-McMillan-Breiman theorem and discuss the implications of these results in nonextensive statistical physics.
Read the full abstract

Information Theory · Cross-listed from cond-mat.stat-mech

A $q$-Caputo Fractional Generalization of Tsallis Entropy

In this work we build a $q$-Caputo fractional generalization of the Tsallis entropy functional $S_q$. The construction starts from the already known Jackson derivative representation of $S_q$ and replaces the Jackson derivative with a Caputo type $q$-fractional operator ${}^{C}D_q^{\alpha}$. The parameter $q$ keeps its standard role as the nonextensive index, while the fractional parameter $\alpha$ gives a nonlocal, memory like contribution in the entropy generating procedure. The resulting functional, denoted by $S_q^{\alpha}$, is written as a convergent series of logarithms in the probabilities and is defined for $0<\alpha<1$, $q>0$, and $p_i>0$. We show explicitly that the standard Tsallis entropy is recovered in the local limit $\alpha\to 1$. We then start rewriting $S_q^{\alpha}$ in trace form and analyze its main structural properties. Non-negativity is tested numerically in a binary and ternary probability distributions. These tests show positive values in the respective domains, but they are interpreted just as numerical evidence rather than as a global/formal proof. Concavity is studied through the second derivative of the trace form contribution yielding to a parameter dependent condition. A global statement requires control over the full probability domain. We also discuss Lesche stability and expansibility. Both properties depend on the behavior of the fully resumed functional near its boundary \(p\to 0^+\), because the entropy contains powers of \(\ln p_i\). Finally, we derive the composition rule for statistically independent subsystems. The logarithmic structure produces mixed moments, so the standard Tsallis pseudo-additive law is not directly inherited for \(0<\alpha<1\). As an illustration, we evaluate the proposed entropy in a two-state fractional relaxation process with memory.
Read the full abstract

Number Theory

Short Exponential Sums and Ternary Correlations of Multiplicative Functions

In this paper, we investigate the average behavior of ternary correlations for general $k$-divisor-bounded multiplicative functions, assuming certain second moment integral bounds for the associated $L$-functions. Our approach differs from previous methods based on spectral theory or Heath-Brown-type decompositions, and instead combines the circle method with weighted short exponential-sum bounds. The key input is short exponential-sum estimates obtained from integral moment bounds for $L$-functions.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

A Learning Method with Gap-Aware Generation for Heterogeneous DAG Scheduling

Efficient scheduling of directed acyclic graphs (DAGs) is a core problem in large-scale data-intensive computing systems, where query plans, data-processing workloads, and computation graphs consist of dependent tasks competing for limited heterogeneous resource pools. In practice, achieving high-performance execution requires schedulers to adapt across environments with varying resource pools and task types, while generating schedules under tight runtime budgets. We propose WeCAN, an end-to-end reinforcement learning framework for heterogeneous DAG scheduling that addresses task-pool compatibility coefficients and generation-induced optimality gaps. It adopts a two-stage single-pass design: a single forward pass produces task-pool scores and global parameters, followed by a generation map that constructs schedules without repeated network calls. Its weighted cross-attention encoder models task-pool interactions gated by compatibility coefficients, and is size-agnostic to environment fluctuations. Moreover, widely used list-scheduling maps can incur generation-induced optimality gaps from restricted reachability. We introduce an order-space analysis that characterizes the reachable set of generation maps via feasible schedule orders, explains the mechanism behind generation-induced gaps, and yields sufficient conditions for gap elimination. Guided by these conditions, we design a skip-extended realization with an analytically parameterized decreasing skip rule, which enlarges the reachable order set while preserving single-pass efficiency. Experiments on real-world TPC-H query DAGs, resource-intensive workload datasets, and ML-compiler computation graphs demonstrate improved makespan over strong baselines, with inference time comparable to classical heuristics and faster than multi-round neural schedulers.
Read the full abstract

All authors Ruisong Zhou, Haijun Zou, Li Zhou, Chumin Sun, Zaiwen Wen

Quantum Algebra

Shuffle algebra realizations for modular Yangians

We study the shuffle algebra realization of positive modular Yangians of classical type over an algebraically closed field of characteristic $p>3$. We show that, unlike in characteristic zero, the natural shuffle homomorphism has a nontrivial kernel. Its image is characterized by a $p$-wheel condition, while its kernel is precisely the ideal generated by the $p$-th powers of the Lyndon root vectors. This identifies the corresponding quotient with the small Yangian arising from a $\mathbb Z[\frac12]$-integral form. As part of the construction, we establish a PBW basis for the integral form and obtain the PBW theorem and $p$-center results for the Drinfeld presentation of modular Yangians.
Read the full abstract

Differential Geometry

Zero modes on product Riemannian manifolds

This paper is concerned with the zero mode equation $D_g\varphi=iA\cdot\varphi$ on product of closed spin manifolds $(M_1^{n_1}\times M_2^{n_2},g_1+g_2,\sigma)$ of dimensions $n_1\leq n_2$ respectively. Here $A$ is a real vector field on $M^n=M_1^{n_1}\times M_2^{n_2}$. Under non-increasing condition on $|\varphi|$ we prove that $$\parallel A\parallel_n^2\geq\frac{n_2}{4(n_2-1)}Y(M^n,[g]),$$ where $Y(M^n,[g])$ is the Yamabe constant of $(M^n,g)$. This estimate is sharp in even dimensions. We also obtain a similar estimate for non trivial solutions of the zero mode type equation $D_g\varphi=f\varphi$, where $f$ is a scalar function.
Read the full abstract

Algebraic Topology

Infinite families of very exotic spheres with free $S^1$- and $S^3$-actions

There are two kinds of exotic spheres: bp spheres, which bound parallelizable manifolds, and non-bp spheres, or very exotic spheres, which do not. In the 1960s, W.-C. Hsiang showed that in each dimension where bp spheres exist, there is at least one which admits infinitely many inequivalent smooth free $S^1$-actions, and in each dimension congruent to $3$ modulo $4$, there is at least one bp sphere which admits infinitely many inequivalent smooth free $S^3$-actions. On the other hand, for each fixed prime $p$, smooth free $S^1$- and $S^3$-actions have only been recorded to exist for finitely many very exotic spheres with nontrivial $p$-local Kervaire–Milnor invariant, all in dimension less than approximately $p^3$. In this paper, we use topological modular forms to detect smooth free $S^1$- and $S^3$-actions on infinite families of very exotic spheres with nontrivial $2$- and $3$-local Kervaire–Milnor invariants.
Read the full abstract

Analysis of PDEs

A Variational link between the Olech-Opial inequality, the Wirtinger inequality, and Emden-Fowler equations

We establish a structural connection between the classical Olech-Opial inequality and the Wirtinger inequality. Using an integral identity involving the mixed energy term $uu'$, we derive a nonlinear interpolation inequality linking these two results. The optimal constant is characterized by a variational problem whose extremals satisfy an Emden-Fowler equation. An explicit expression of the optimal constant is obtained in terms of the Beta function. This approach provides a natural bridge between mixed-energy integral inequalities, classical spectral estimates, and nonlinear boundary value problems.
Read the full abstract

Classical Analysis and ODEs

Maximal growth of the Stein-Wainger oscillatory integral

We determine the optimal growth of the Stein–Wainger oscillatory integral for every Denjoy–Carleman class defined by a positive log-convex sequence. Quasianalyticity is equivalent to boundedness in $\lambda$ for every fixed phase in the class. In the nonquasianalytic case, an explicit formula in the defining sequence gives the optimal order, attained by a single phase for all sufficiently large frequencies. This yields sharp bounds for Gevrey classes, their logarithmic refinements, and classes beyond every Gevrey class. For general smooth phases the growth is $o(\log\lambda)$, and every prescribed $h(\lambda)\to\infty$ with $h(\lambda)=o(\log\lambda)$ is attained asymptotically along a sequence by one smooth phase. These results answer a question of Wang and Zhang motivated by endpoint eigenfunction restriction.
Read the full abstract

Optimization and Control

Superlinear convergence in nonsmooth optimization via higher-order cutting-plane models

A cutting-plane model for a nonsmooth function is the maximum of several first-order expansions centered at different points. Using such a model in a bundle method leads to linear convergence (of serious steps) to a minimum. In smooth optimization, superlinear convergence can be achieved by using higher-order models. We show that the same is true for the nonsmooth case, i.e., we show that cutting-plane models involving higher-order expansions can be used to achieve superlinear convergence in nonsmooth optimization. We first formally define higher-order cutting-plane models for lower-$C^2$ functions and derive an error estimate. Afterwards, we construct a trust-region bundle method based on these models that achieves local superlinear convergence of serious steps, and overall superlinear convergence for certain finite max-type functions. Finally, we verify the superlinear convergence in numerical experiments.
Read the full abstract

Information Theory · Cross-listed from cs.CR

The Power of Power Codes: New Classes of Easy Instances for the Linear Equivalence Problem

Given two linear codes, the Linear Equivalence Problem (LEP) asks to find (if it exists) a linear isometry between them; as a special case, we have the Permutation Equivalence Problem (PEP), in which isometries must be permutations. LEP and PEP have recently gained renewed interest as the security foundations for several post-quantum schemes, including LESS. A recent paper has introduced the use of the Schur product to solve PEP, identifying many new easy-to-solve instances. In this paper, we extend this result to LEP. In particular, we generalize the approach and rely on the more general notion of power codes. Combining it with Frobenius automorphisms and Hermitian hulls, we identify many classes of easy LEP instances. To the best of our knowledge, this is the first work exploiting algebraic weaknesses for LEP. Finally we show an improved reduction to PEP whenever the coefficients of the monomial matrix are in a subgroup of the multiplicative group of the finite field.
Read the full abstract

All authors Michele Battagliola, Anna-Lena Horlemann, Abhinaba Mazumder, Rocco Mora, Paolo Santini, Michael Schaller, Violetta Weger

General Mathematics

Simplex Stratification and Phase Boundaries in the Partition Graph

We study the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts. We introduce the simplex stratification of $G_n$: for each vertex $\lambda$, let $\dim_{\mathrm{loc}}(\lambda)$ denote the largest dimension of a simplex of the clique complex $K_n = \mathrm{Cl}(G_n)$ containing $\lambda$. This defines a decomposition of $V(G_n)$ into layers $L_r(n)=\{\lambda\in V(G_n): \dim_{\mathrm{loc}}(\lambda)=r\}$. We formalize the graph-theoretic interfaces between consecutive layers, called phase boundaries, and study the associated interface graphs and boundary thresholds. Using the previously established star/top description of cliques through a fixed vertex, we show that $\dim_{\mathrm{loc}}(\lambda)$ is determined exactly by the maximal star and top capacities through $\lambda$. This yields explicit local criteria for membership in higher simplex layers and reformulates their first appearance in terms of local star/top capacity thresholds. We also present an exhaustive computational study for $n\le 30$, including exact-layer thresholds, boundary thresholds, selected layer profiles, and the behaviour of the boundary framework. The computations suggest a rigid threshold pattern related to staircase partitions and their one-cell extensions, while the corresponding global statements are left as conjectures and open problems.
Read the full abstract

Differential Geometry

Spinor inequality for magnetic fields on spin manifolds

This paper is concerned with the zero mode equation $D_g\varphi=iA\cdot\varphi$ on closed spin manifold $(M^n,g,\sigma)$ of positive scalar curvature. Here $A$ is a real one form on $M$. We proved that if $(\varphi, A)$ is a non trivial solution of the zero mode equation then $$\parallel dA\parallel_{n/2}>Y(M^n,[g])/(4v_n^{1/2}),$$ where $Y(M^n,[g])$ is the Yamabe constant of $(M^n,g)$ and $v_n=\left[\frac{n}{2}\right]$. In the case of the round sphere $(\mathbb{S}^n,g_{can},\sigma_{can})$ this result confirms that the inequality obtained in \cite{Frank} is not sharp.
Read the full abstract

Information Theory

Joint Task Orchestration and Resource Optimization for SC3 Closed Loop in 6G Networks

In hazardous environments, sensors and actuators can be deployed to see and operate on behalf of humans, enabling safe and efficient task execution. Functioning as a neural center, the edge information hub (EIH), which integrates communication and computing capabilities, coordinates these sensors and actuators into sensing-communication-computing-control (SC3) closed loops to enable autonomous operations. From a system-level optimization perspective, this paper addresses the problem of joint sensor-actuator pairing and resource allocation across multiple SC3 closed loops. To tackle the resulting mixed-integer nonlinear programming problem, we develop a learning-optimization-integrated actor-critic (LOAC) framework. In this framework, a deep neural network-based actor generates pairing candidates, while an optimization-based critic subsequently allocates communication and computing resources. The actor is then iteratively refined through feedback from the critic. Simulation results demonstrate that the LOAC framework achieves near-optimal solutions with low computational complexity, offering significant performance gains in reducing control cost.
Read the full abstract

All authors Xinran Fang, Wei Feng, Yanmin Wang, Yunfei Chen, Baoquan Ren, Ning Ge, Shi Jin

Information Theory

A Law of Large Numbers with Convergence Rate based on Nonlinear Expectation Theory and Its Application to Communication Detection

In this paper, we establish a new law of large numbers with the rate of convergence for special partial sums in a probability space. The proof relies on nonlinear expectation theory, as the uncertainty of random variables in the special partial sums induces the sublinearity of the expectation. As an application, we apply the new theorem to analyze the feedback channel-based detection problem of non-i.i.d. input signals in communication systems. Specifically, we investigate the convergence rates of the upper probabilities of the detection errors within the sublinear expectation space.
Read the full abstract

Algebraic Geometry

Linear spaces in Hessian loci of cubic hypersurfaces

In this paper we will study the Hessian hypersurface associated with a smooth cubic. We prove that the existence of a Hessian locus, associated with a smooth cubic form f, of dimension bigger then the expected one, forces the cubic f to be of Thom-Sebastiani type. Moreover, we will analyze the existence of some projective linear spaces in such Hessian loci and their nature in terms of the Hessian matrix. From this, we show that the only smooth cubic threefold having the same Hessian variety as the one associated with a general cubic form f of Waring Rank 6 is f itself. Finally, we prove that the hessian associated with a smooth hypersurface of any degree and dimension is not a cone.
Read the full abstract

Statistics Theory

Gaussian mixtures and non-parametric likelihoods through the lens of statistical mechanics

In this work, we investigate Gaussian Mixture Models (abbrv GMM) and the related problem of non parametric maximum likelihood estimation (abbrv NPMLE) from the perspective of statistical mechanics. In particular, we establish stability guarantees for the NPMLE procedure that extend well beyond the state of the art. Crucially, we obtain guarantees on the Kullback-Leibler divergence between NPMLE estimators and the ground truth, a type of result which has been known to be challenging in the literature on this problem. In particular, we provide high probability upper bounds on the KL divergence between the NPMLE and the true density that are of the order of $\min\big\{\frac{(\log n)^{d+2}}{n} , \frac{\log n}{\sqrt n}\big\}$, which cover a wide range of scenarios for the comparative sizes of $n$ and $d$. We obtain similar guarantees for approximate solutions to the NPMLE problem, addressing realistic situations wherein optimization algorithms need to be stopped in finite time, allowing access only to approximations to the true NPMLE. A cornerstone of our approach is an analysis of the function class complexity of logarithms of gaussian mixture densities, which is able to handle their unboundedness, and could be of wider interest. Our methods lead to novel confidence-interval guarantees for entropy estimation in Gaussian mixtures, demonstrating their wider impact. We also establish correspondences between stability phenomena in the NPMLE problem and concepts such as chaos and multiple valleys in random energy landscapes of statistical mechanics models. While these correspondences are largely of a conceptual nature at this point, we believe that these connections, especially those with concentration phenomena and Langevin dynamics, may be developed into a toolbox for studying a wide variety of random optimization problems in statistics and machine learning.
Read the full abstract

All authors Subhroshekhar Ghosh, Adityanand Guntuboyina, Satyaki Mukherjee, Hoang-Son Tran

K-Theory and Homology

Toeplitz Operators on Contact Manifolds and Equivariant K-homology

We present an equivariant generalization of Boutet de Monvel's index theorem for Toeplitz operators on contact manifolds. We prove that the Dirac operator and the Szegö projection determine the same class in equivariant $K$-homology, generalizing a theorem of Baum-Douglas-Taylor. We do not assume that the contact manifold is the boundary of a strictly pseudoconvex domain. The proof proceeds by a deformation linking the principal symbols of the classical and Heisenberg pseudodifferential calculi. At the level of symbols, the projection defining the Dirac class deforms to the principal Heisenberg symbol of the Szegö projection. This deformation implies equality of the corresponding classes in K-homology. This, in turn, gives an equivariant generalization of Boutet de Monvel's index formula for Toeplitz operators.
Read the full abstract

Combinatorics

Total coloring of (sub)cubic Halin graphs

Total coloring of a graph is a coloring of its vertices and edges such that adjacent or incident elements receive distinct colors. Total coloring conjecture (stipulating that the total chromatic number of a graph $G$ is at most $\Delta(G)+2$) is known to be true for subcubic graphs – five colors are always enough. However, deciding whether a total coloring with only four colors exists remains a difficult problem, even in the class of bipartite cubic graphs. We solve the problem completely for cubic and subcubic Halin graphs, proving that there are only finitely many such graphs requiring five colors.
Read the full abstract

Complex Variables

Computation of genus 2 Kleinian hyperelliptic functions via Richelot isogenies

In this work we propose an algorithm that numerically evaluates Kleinian hyperelliptic functions associated with a complex curve of genus 2. This algorithm is based upon constructing a sequence of curves with Richelot isogenous Jacobians and a recurrent procedures that reduces the calculation to a degenerate curve. As a part of mentioned algorithm we propose a method of choosing a Richelot isogenous curve (among 15 possibilities) that guarantees convergence of the equations of the curves and associated Kleinian functions of weight 2 under iterations.
Read the full abstract

Numerical Analysis

Arbitrary order stationarity preserving stabilized finite elements for multidimensional nonlinear hyperbolic problems. Application to the Euler equations with gravity

We develop arbitrarily high-order, stationarity-preserving stabilized finite element methods for multidimensional nonlinear hyperbolic balance laws on Cartesian grids. We aim at approximating all the steady states of the problem at hand, including non-trivial genuinely multidimensional equilibria, with a level of accuracy higher than the nominal one of the underlying scheme. We formalize more precisely the meaning of stationarity preservation, providing some technical conditions for its realizability. We then recast the multidimensional global-flux quadrature of Barsukow et al. (Num. Meth. PDEs, 2025) as a local preprocessing of the physical fluxes that maps continuous polynomial vector fields to a local space with Raviart–Thomas-type structure. Both the Galerkin and SUPG formulations are recast in this setting. The resulting methods extend the stationarity-preserving finite-volume approach of Barsukow et al. (J. Comput. Phys., 2026) to high-order continuous finite elements and Barsukow et al. (Num. Meth. PDEs, 2025) to nonlinear balance laws. We analyze key properties of the proposed schemes, including local conservation and nodal superconvergence of the discrete steady kernel, and we discuss their relation to low-Mach-compliant discretizations. We apply the framework to the compressible Euler equations with gravity. A simple source-term reformulation yields machine-precision preservation of isothermal hydrostatic equilibria. Extensive numerical benchmarks, including moving equilibrium, near-equilibrium, and instability-dominated regimes, demonstrate clear improvements in robustness and accuracy over standard SUPG and reference finite-volume methods.
Read the full abstract

Commutative Algebra

Orlov's functors in Macaulay2

Given a commutative and graded Gorenstein ring $R$ with associated projective variety $X$, a theorem of Orlov gives fully faithful embeddings from the graded singularity category of $R$ to the derived category of $X$, or vice versa, depending on the degree of the canonical bundle of $X$. We describe algorithms for computing these embeddings that can be implemented in Macaulay2.
Read the full abstract

All authors Michael K. Brown, Souvik Dey, Geoffrey Fatin, Guanyu Li, Mahrud Sayrafi, Tim Tribone