Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 6 April

Probability

Existence of a classical solution to the integro-differential equation arising in the Cramér–Lundberg non-life insurance model with proportional investment

This paper establishes that the survival probability in the non-life Cramér–Lundberg insurance model with proportional investment is a classical $C^2$-solution of the associated integro-differential equation under minimal moment conditions: it suffices that the claim size distribution is continuous and possesses a finite moment of some positive order.
Read the full abstract

Optimization and Control

Constraint-Induced Redistribution of Social Influence in Nonlinear Opinion Dynamics

We study how intrinsic hard constraints on the decision dynamics of social agents shape collective decisions on multiple alternatives in a heterogeneous group. Such constraints may arise due to structural and behavioral limitations, such as adherence to belief systems in social networks or hardware limitations in autonomous networks. In this work, agent constraints are encoded as projections in a multi-alternative nonlinear opinion dynamics framework. We prove that projections induce an invariant subspace on which the constraints are always satisfied and study the dynamics of networked opinions on this subspace. We then show that heterogeneous pairwise alignments between individuals' constraint vectors generate an effective weighted social graph on the invariant subspace, even when agents exchange opinions over an unweighted communication graph in practice. With analysis and simulation studies, we illustrate how the effective constraint-induced weighted graph reshapes the centrality of agents in the decision process and the group's sensitivity to distributed inputs.
Read the full abstract

Probability

Convergence rate of $H$-property for step-graphons

A graphon is said to have the $H$-property if a random undirected graph $G_n$ on $n$ nodes sampled from it has a node-wise disjoint cycle cover almost surely as $n\to\infty$. It has been shown in the earlier work that the $H$-property obeys the zero-one law, i.e., the probability that the random graph has a cycle cover tends to either one or zero. In this paper, we sharpen the result by characterizing the convergence rate of the probability. Specifically, we show that there are two different types of rates, with one being exponential and the other being root $n$. We provide a rigorous proof and numerical validation.
Read the full abstract

Group Theory

Lattices determined by their commensurator

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated commensurated subgroups of $C$. We establish general rigidity results ensuring every finitely generated commensurated subgroup of $C$ is virtually contained in $\Gamma$. In more concrete situations, in fact we conclude that up to commensurability, $\Gamma$ is the only infinite finitely generated commensurated subgroup of $C$. For instance this last conclusion holds when $G$ is the automorphism group of a tree. This settles in particular the problem whether two non-commensurable cocompact tree lattices may have the same commensurator. Further applications include commensurators of cocompact lattices in other groups of automorphisms of trees, as well as commensurators of graph product of finite groups in automorphism groups of right-angled building.
Read the full abstract

Representation Theory

The Monoid Of Binary Relations On A Set Of Size Four Has Infinite Representation Type

The problem of determining the representation type of the full transformation monoid was resolved by Ponizovskii, Putcha, and Ringel. In this paper, we present a similar result for the monoid of binary relations, a partial result for the monoid of $\Lambda$-generalized correspondences, and a sufficient condition for a monoid to have infinite representation type.
Read the full abstract

Differential Geometry

Non-canonical variations of Riemannian submersions with totally geodesic fibers

Using variations of Riemannian metric that preserve a given Riemannian submersion, keep its fibers totally geodesic and the metric restricted to the fibers fixed, but change the horizontal distribution, we examine changes of sectional curvatures in horizontal and vertical directions. We obtain conditions, in terms of a 1-form defining a variation, to locally make all sectional curvatures positive on the product of a manifold with positive curvature and a circle, while preserving the Riemannian submersion with geodesic fibers defined by the projection from the product. We examine conditions for obtaining weak contact metric structures from K-contact structures. We demonstrate existence of fat Riemannian submersions with totally geodesic fibers and vertizontal (i.e., spanned by a horizontal and a vertical vector) curvatures non-constant along a fiber. For a Riemannian submersion defined by an isometric group action, with totally geodesic fibers of dimension higher than one, we find variations that preserve the isometric action, while changing the horizontal distribution and its curvatures.
Read the full abstract

Mathematical Physics

Near-Tsirelson Bell-CHSH Violations in Quantum Field Theory via Carleman and Hankel Operators

We study Bell-Clauser-Horne-Shimony-Holt (Bell-CHSH) violations in the vacuum state of free spinor fields in $(1+1)$-dimensional Minkowski spacetime. We construct explicit smooth compactly supported test functions with spacelike separated supports whose Bell-CHSH correlators converge to Tsirelson's bound $2\sqrt2$. In the massless case, after passage to the time-zero slice and a natural symmetry reduction, the problem reduces to the quadratic form of the Carleman operator on $L^2([0,\infty))$. Near-maximal Bell violation is then governed by the spectral edge $\pi$, and explicit near-extremizers are obtained from compactly supported cutoffs of the generalized eigenfunction $x^{-1/2}$. This also explains the appearance of the constant $\pi$ in earlier wavelet-based formulations. In the massive case, the same reduction leads to a Hankel operator with kernel $mK_1(m(x+y))$, where $K_1$ denotes the modified Bessel function of the second kind of order $1$, and exponentially damped variants of the massless test functions again yield Bell-CHSH values converging to $2\sqrt2$. Therefore, we establish a direct link between Bell-CHSH violations for free $(1+1)$-dimensional spinor fields and the spectral theory of Carleman and Hankel operators on the half-line.
Read the full abstract

Analysis of PDEs

Blow-up rates and sets for a quasilinear diffusion equation with weighted source

Blow-up rates are established for general solutions to the quasilinear diffusion equation $$ \partial_tu=\Delta u^m+|x|^{\sigma}u^p, \quad (x,t)\in\mathbb{R}^N\times(0,T), $$ in the range of exponents $1<p<m$, $\sigma>0$. More precisely, if we consider a compactly supported solution $u(x,t)$ with blow-up time $T=T(u)\in(0,\infty)$, we derive the blow-up rate $$ C_1(T-t)^{-\alpha}\leq \|u(x,t)\|_{\infty}\leq C_2(T-t)^{-\alpha}, \quad t\in(0,T), $$ for some positive constants $C_1$, $C_2$, and the upper rate of expansion of the support $$ \sup\{|x|:u(x,t)>0\}\leq C_0(T-t)^{-\beta}, \quad t\in(0,T), $$ for some constant $C_0>0$, where $$ \alpha=\frac{\sigma+2}{L}, \quad \beta=\frac{m-p}{L}, \quad L=\sigma(m-1)+2(p-1). $$ We also analyze the blow-up sets of solutions $u$, showing, under a suitable condition, that either $B(u)=\mathbb{R}^N$ or blow-up takes place only as $|x|\to\infty$.
Read the full abstract

Analysis of PDEs · Cross-listed from quant-ph

Quantum Algorithms for Heterogeneous PDEs: The Neutron Diffusion Eigenvalue Problem

We develop a quantum algorithm to solve a type of linear reaction-diffusion equation, the neutron diffusion (generalized) k-eigenvalue problem that establishes nuclear criticality. The algorithm handles an equation with piecewise constant coefficients, describing a problem in a heterogeneous medium. We apply uniform finite elements and show that the quantum algorithm provides significant polynomial end-to-end speedup over classical uniform finite element methods in the cases tested, although nonuniform classical methods can perform much better than uniform ones. Our work leverages recent advances in quantum linear systems–fast inversion and quantum preconditioning–and uses Hamiltonian simulation as a subroutine. Our results suggest that quantum algorithms may provide speedups for heterogeneous PDEs, though the extent of this advantage over the fastest classical algorithm depends on the effectiveness of other classical approaches such as nonuniform or adaptive meshing for a given problem instance.
Read the full abstract

All authors Andrew M. Childs, Lincoln Johnston, Brian Kiedrowski, Mahathi Vempati, Jeffery Yu

Algebraic Geometry

Frobenius nonclassicality of generalized Fermat curves with respect to conics

The effective application of the Stöhr-Voloch theory for the linear system of plane curves of a fixed degree to bound the number of rational points of a family of plane curves defined over $\mathbb{F}_q$ requires the characterization of the $\mathbb{F}_q$-Frobenius nonclassical curves in the family. In this paper, we provide necessary and sufficient conditions for certain generalized Fermat curves $\mathcal{F}$ defined over $\mathbb{F}_q$ to be $\mathbb{F}_q$-Frobenius nonclassical with respect to the linear system of conics. In the Frobenius classical cases, we obtain nice bounds for the number $N_q(\mathcal{F})$ of rational points of $\mathcal{F}$ via Stöhr-Voloch theory, whereas in the Frobenius nonclassical cases, we derive explicit formulas for $N_q(\mathcal{F})$.
Read the full abstract

Combinatorics · Cross-listed from eess.SP

Sample entropy for graph signals: An approach to nonlinear dynamic analysis of data on networks

The recent extension of permutation entropy and its derivatives to graph signals has opened up new horizons for the analysis of complex, high-dimensional systems evolving on networks. However, these measures are all fundamentally rooted in Shannon entropy and symbol dynamics. In this paper, we explore, for the first time, whether and how a popular conditional-entropy based measure –Sample Entropy (SampEn)– can be effectively defined for graph signals and used to characterise the nonlinear dynamics of data on complex networks. We introduce sample entropy for graph signals (SampEnG), a unified framework that generalises classical sample entropy from uni- and bi-dimensional signals, including time series and images, by building on topology-aware embeddings using multi-hop neighbourhoods and computing finite scale of correlation sums in the continuous embedding state space. Experiments on synthetic and real-world datasets, including weather station, wireless sensor monitoring, and traffic systems, verify that SampEnG recovers known nonlinear dynamical features on paths and grids. In the traffic-flow analysis, SampEnG on a directed topology (encoding causal flow constraint) shows promise to detect phase transitions between free-flow and congestion, offering information that is complementary to existing Shannon-entropy based approaches. We expect SampEnG to open up new ways to analyse graph signals, generalising sample entropy and the concept of conditional entropy to extending nonlinear analysis to a wide variety of network data.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Learning Kalman Policy for Singular Unknown Covariances via Riemannian Regularization

Kalman filtering is a cornerstone of estimation theory, yet learning the optimal filter under unknown and potentially singular noise covariances remains a fundamental challenge. In this paper, we revisit this problem through the lens of control–estimation duality and data-driven policy optimization, formulating the learning of the steady-state Kalman gain as a stochastic policy optimization problem directly from measurement data. Our key contribution is a Riemannian regularization that reshapes the optimization landscape, restoring structural properties such as coercivity and gradient dominance. This geometric perspective enables the effective use of first-order methods under significantly relaxed conditions, including unknown and rank-deficient noise covariances. Building on this framework, we develop a computationally efficient algorithm with a data-driven gradient oracle, enabling scalable stochastic implementations. We further establish non-asymptotic convergence and error guarantees enabled by the Riemannian regularization, quantifying the impact of bias and variance in gradient estimates and demonstrating favorable scaling with problem dimension. Numerical results corroborate the effectiveness of the proposed approach and robustness to the choice of stepsize in challenging singular estimation regimes.
Read the full abstract

Number Theory

Asymptotic distribution of CM points on the reduction of the Drinfeld modular curve

We study a distribution problem over global function fields. More precisely, we describe the asymptotic distribution of rank $2$ CM Drinfeld modules among the irreducible components of the analytic reduction of the Drinfeld modular curve. Our approach relies on the properties of the building map and the spectral decomposition of the adjacency operator on a quotient of the Bruhat-Tits tree.
Read the full abstract

Numerical Analysis

Adaptive LSQR Preconditioning from One Small Sketch

We propose APLICUR, an adaptive preconditioning framework for large-scale linear least-squares (LLS) problems. Using a single small sketch computed once at initialization, APLICUR incrementally refines a CUR-based preconditioner throughout the Krylov solve, interleaving preconditioning with iteration. This enables early convergence without the need to construct a costly high-quality preconditioner upfront. With a modest sketch dimension (typically 5 - 250), largely independent of both the problem size and numerical rank, APLICUR achieves convergence guarantees that are likewise independent of the sketch size. The method is applicable to general matrices without structural assumptions (e.g. need not be heavily overdetermined) and is well suited to large, sparse, or numerically low-rank problems. We conduct extensive numerical studies to examine the behavior of the proposed framework and guide the effective algorithmic design choices. Across a range of test problems, \mainalg{} achieves competitive or improved time-to-accuracy performance compared with established randomized preconditioners, including Blendenpik and Nyström PCG, while maintaining low setup cost and robustness across problem regimes.
Read the full abstract

Statistics Theory

Robust mean estimation under star-shaped constraints with heavy-tailed noise

We study the problem of robust mean estimation with adversarially contaminated data under star-shaped constraints in a heavy-tailed noise setting, where only a finite second moment $ \sigma ^2 $ is assumed. For a contamination level $ \varepsilon$ below some constant, we show that the minimax rate of the squared $ \ell_2 $ loss is $ \max( \delta ^{*2}, \varepsilon \sigma ^2) \wedge d^2 $ for a star-shaped set with diameter $ d $ (set $d = \infty$ if the set is unbounded), with $ \delta ^* $ determined via the local entropy $ \log M^\mathrm{ loc }(\delta ,c) $ as \begin{align*} \delta ^*:= \sup\bigg\{\delta \geq 0: N\frac{\delta ^2}{\sigma ^2}\leq \log M^\mathrm{ loc }(\delta ,c) \bigg\}, \end{align*} where $ c $ is a sufficiently large constant. Crucially, we require that the sample size satisfies $N \gtrsim \mathop{ \sup }\limits_{\delta \geq 0} \log M^\mathrm{ loc }(\delta ,c)$. We also show that the minimax rate is $ \max(\delta^{*2},\varepsilon ^2\sigma ^2) \wedge d^2 $ for known or sign-symmetric distributions, matching the rate achieved in the Gaussian case.
Read the full abstract

Combinatorics

Nested tree space: a geometric framework for co-phylogeny

Nested (or reconciled) phylogenetic trees model co-evolutionary systems in which one evolutionary history is embedded within another. We introduce a geometric framework for such systems by defining $\sigma$-space, a moduli space of fully nested ultrametric phylogenetic trees with a fixed leaf map. Generalizing the $\tau$-space of Gavryushkin and Drummond, $\sigma$-space is constructed as a cubical complex parametrised by nested ranked tree topologies and inter-event time coordinates of the combined host and parasite speciation events. We characterise admissible orderings via binary nesting sequences and organise them into a natural poset. We show that $\sigma$-space is contractible and satisfies Gromov's cube condition, and is therefore CAT(0). In particular, it admits unique geodesics and well-defined Fréchet means. We further describe its geometric structure, including boundary strata corresponding to cospeciation events, and relate it to products of ultrametric tree spaces via natural forgetful maps.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Hypothesis Testing for Penalized Estimating Equations with Cross-Fitted Covariance Calibration

We study hypothesis testing for penalized estimators in settings where the full marginal distribution of a multivariate response is difficult to specify, such as longitudinal data with correlated measurements or high-dimensional heteroscedastic regression. Assuming that the conditional mean model is correctly specified, we establish that the penalized estimating equations admit a $\sqrt{n}$-consistent solution, even when the working covariance structure is misspecified. Our inferential target is a low-dimensional subvector of parameters associated with the mean model. We show that the resulting test statistic converges to a $\chi^2$ distribution, and that its asymptotic power depends on the nuisance covariance function. To mitigate this dependence, we propose estimating the covariance function via cross-fitting, which provides a calibrated and robust procedure for inference.
Read the full abstract

Analysis of PDEs

Global boundary stabilization of 1d systems of scalar conservation laws

We study a system of several one-dimensional scalar conservation laws coupled through boundary feedback conditions that combine physical boundary constraints with static feedback control laws. Our first contribution establishes the well-posedness of the system in the space of $L^{\infty}$ entropy solutions. Our second contribution provides a set of sufficient dissipative conditions on the boundary coupling that ensure global exponential stability in $L^1$ and $L^\infty$ norms.
Read the full abstract

Algebraic Geometry

Coherent sheaves in logarithmic geometry

This paper introduces an abelian category of logarithmic coherent sheaves that arranges coherent sheaves across all expansions and root stacks of a simple normal crossing degeneration. Formally, logarithmic coherent sheaves are coherent sheaves in the full logarithmic étale topology. We develop a suite of tools that reduces the evaluation of the basic functors of homological algebra to the conventional calculation on a computable logarithmic alteration. A second paper will establish good properties of the associated logarithmic derived category. We thus offer a unified perspective on logarithmic moduli spaces of coherent sheaves: The logarithmic Quot spaces motivated by Maulik and Ranganathan's logarithmic Donaldson–Thomas theory, the logarithmic Picard group constructed by Molcho and Wise, and moduli spaces of logarithmic parabolic sheaves as developed by Borne, Talpo, and Vistoli. In establishing the connection with logarithmic Picard groups, we offer a new interpretation of chip firing as the combinatorial shadow to a logarithmic version of S-equivalence.
Read the full abstract

All authors Hannah Dell, Xianyu Hu, Patrick Kennedy-Hunt, Kabeer Manali Rahul, Maximilian Schimpf

Dynamical Systems · Cross-listed from cs.LG

Energy-Based Dynamical Models for Neurocomputation, Learning, and Optimization

Recent advances at the intersection of control theory, neuroscience, and machine learning have revealed novel mechanisms by which dynamical systems perform computation. These advances encompass a wide range of conceptual, mathematical, and computational ideas, with applications for model learning and training, memory retrieval, data-driven control, and optimization. This tutorial focuses on neuro-inspired approaches to computation that aim to improve scalability, robustness, and energy efficiency across such tasks, bridging the gap between artificial and biological systems. Particular emphasis is placed on energy-based dynamical models that encode information through gradient flows and energy landscapes. We begin by reviewing classical formulations, such as continuous-time Hopfield networks and Boltzmann machines, and then extend the framework to modern developments. These include dense associative memory models for high-capacity storage, oscillator-based networks for large-scale optimization, and proximal-descent dynamics for composite and constrained reconstruction. The tutorial demonstrates how control-theoretic principles can guide the design of next-generation neurocomputing systems, steering the discussion beyond conventional feedforward and backpropagation-based approaches to artificial intelligence.
Read the full abstract

All authors Arthur N. Montanari, Francesco Bullo, Dmitry Krotov, Adilson E. Motter

Mathematical Physics · Cross-listed from quant-ph

Geometry of Free Fermion Commutants

Understanding the structure of operators that commute with $k$ identical replicas of unitary ensembles, also known as their $k$-commutants, is an important problem in quantum many-body physics with deep implications for the late-time behavior of physical quantities such as correlation functions and entanglement entropies under unitary evolution. In this work, we study the $k$-commutants of free-fermion unitary systems, which are heuristically known to contain $SO(k)$ and $SU(k)$ groups without and with particle number conservation respectively, with formal derivations of projectors onto these commutants appearing only very recently. We establish a complementary perspective by highlighting a larger $O(2k)$ replica symmetry (or $SU(2k)$ respectively) that the $k$-commutant transforms irreducibly under, which leads to a simple geometric understanding of the commutant in terms of coherent states parametrized by a Grassmannian manifold. We derive this structure by mapping the $k$-commutant to the ground state of effective ferromagnetic Heisenberg models, analogous to the ones that appear in the noisy circuit literature, which we solve exactly using standard representation theory methods. Further, we show that the Grassmannian manifold of the $k$-commutant is exactly the manifold of fermionic Gaussian states on $2k$ sites, which reveals a duality between real space and replica space in free-fermion systems. This geometric understanding also provides a compact projection formula onto the $k$-commutant, based on the resolution of identity for coherent states, which can prove advantageous in analytical calculations of averaged non-linear functionals of Gaussian states, as we demonstrate using some examples for the entanglement entropies. In all, this work provides a geometric perspective on the $k$-commutant of free-fermions that naturally connects to problems in quantum many-body physics.
Read the full abstract

Dynamical Systems

The aspect ratio of the Twin Dragon is $1/\phi$

We show that the geometric aspect ratio of the Twin Dragon equals $1/\varphi$, where $\varphi = (1+\sqrt{5})/2$ is the golden ratio. The result follows by solving the covariance fixed-point equation for the self-similar measure, which coincides with Lebesgue area since the similarity dimension is 2. The appearance of $\varphi$ is surprising: the Twin Dragon is defined purely via the Gaussian integer $1+i$, with no pentagonal or Fibonacci structure in its construction.
Read the full abstract

Differential Geometry

Topology of minimal surfaces in the sphere from capillarity

We present a general construction of embedded minimal and constant mean curvature surfaces in $\mathbb{S}^n$ and one-phase free boundaries joined by a smooth interpolation by capillary hypersurfaces. This framework recovers all known families and produces new minimal surfaces in the sphere with rich topological structures as sphere bundles over base spaces which include space-form products, projective planes over division algebras, Stiefel manifolds, complex quadrics, and twisted products and quotients of Lie subgroups of $SO(n)$. We show these bundles are non-trivial and study their homotopy types using topological obstructions, including characteristic classes and tools from $K$-theory and stable homotopy theory. Finally, we prove uniqueness results for the rotationally invariant capillary CMC problem.
Read the full abstract

Functional Analysis

Uniformly Bounded Cochain Extensions and Uniform Poincaré Inequalities

In this paper, we construct a novel global bounded cochain extension operator for differential forms on Lipschitz domains. Building upon the classical universal extension of Hiptmair, Li, and Zou, our construction restores global commutativity with the exterior derivative in the natural $H\Lambda^k(\Omega)$ setting. The construction applies to domains and ambient extension sets of arbitrary topology, with strict commutation holding on the orthogonal complement of harmonic forms, as dictated by the underlying topological obstruction. This provides a missing analytical tool for the rigorous foundation of Cut Finite Element Methods (CutFEM). We also obtain continuous uniform Poincaré inequalities and lower bounds for the first Neumann eigenvalue on non-convex domains.
Read the full abstract

Algebraic Topology · Cross-listed from cs.LG

Stratifying Reinforcement Learning with Signal Temporal Logic

In this paper, we develop a stratification-based semantics for Signal Temporal Logic (STL) in which each atomic predicate is interpreted as a membership test in a stratified space. This perspective reveals a novel correspondence principle between stratification theory and STL, showing that most STL formulas can be viewed as inducing a stratification of space-time. The significance of this interpretation is twofold. First, it offers a fresh theoretical framework for analyzing the structure of the embedding space generated by deep reinforcement learning (DRL) and relates it to the geometry of the ambient decision space. Second, it provides a principled framework that both enables the reuse of existing high-dimensional analysis tools and motivates the creation of novel computational techniques. To ground the theory, we (1) illustrate the role of stratification theory in Minigrid games and (2) apply numerical techniques to the latent embeddings of a DRL agent playing such a game where the robustness of STL formulas is used as the reward. In the process, we propose computationally efficient signatures that, based on preliminary evidence, appear promising for uncovering the stratification structure of such embedding spaces.
Read the full abstract

Probability

Elephant random walk on the infinite dihedral group $\mathbb{Z}_2 * \mathbb{Z}_2$

Elephant random walks were studied recently in \cite{mukherjee2025elephant} on the groups $\mathbb{Z}^{*d_1} * \mathbb{Z}_2^{*d_2}$ whose Cayley graphs are infinite $d$-regular trees with $d = 2d_1 + d_2$. It was found that for $d \ge 3$, the elephant walk is ballistic with the same asymptotic speed $\frac{d - 2}{d}$ as the simple random walk and the memory parameter appears only in the rate of convergence to the limiting speed. In the $d = 2$ case, there are two such groups, both having the bi-infinite path as their Cayley graph. For $(d_1, d_2) = (1, 0)$, the walk is the usual elephant random walk on $\mathbb{Z}$, which exhibits anomalous diffusion. In this article, we study the other case, namely $(d_1, d_2) = (0, 2)$, which corresponds to the infinite dihedral group $D_\infty \cong \mathbb{Z}_2 * \mathbb{Z}_2$. Unlike the classical ERW on $\mathbb{Z}$, which is a time-inhomogeneous Markov chain, the ERW on $D_{\infty}$ is non-Markovian. We show that the first and second order behaviours of the signed location of the walker agree with those of the simple symmetric random walk on $\mathbb{Z}$, with the memory parameter essentially manifesting itself via a lower order correction term that can be written as an explicit functional of the elephant walk on $\mathbb{Z}$. Our result demonstrates that unlike the simple random walk, the elephant walk is sensitive to local algebraic relations. Indeed, although $D_{\infty}$ is virtually abelian, containing $\mathbb{Z}$ as a finite-index subgroup, the involutive nature of its generators effectively neutralises memory, thereby ruling out any potential superdiffusive behaviour, in contrast to the superdiffusion observed on its abelian cousin $\mathbb{Z}$.
Read the full abstract

Optimization and Control

PINNs in PDE Constrained Optimal Control Problems: Direct vs Indirect Methods

We study physics-informed neural networks (PINNs) as numerical tools for the optimal control of semilinear partial differential equations. We first recall the classical direct and indirect viewpoints for optimal control of PDEs, and then present two PINN formulations: a direct formulation based on minimizing the objective under the state constraint, and an indirect formulation based on the first-order optimality system. For a class of semilinear parabolic equations, we derive the state equation, the adjoint equation, and the stationarity condition in a form consistent with continuous-time Pontryagin-type optimality conditions. We then specialize the framework to an Allen-Cahn control problem and compare three numerical approaches: (i) a discretize-then-optimize adjoint method, (ii) a direct PINN, and (iii) an indirect PINN. Numerical results show that the PINN parameterization has an implicit regularizing effect, in the sense that it tends to produce smoother control profiles. They also indicate that the indirect PINN more faithfully preserves the PDE contraint and optimality structure and yields a more accurate neural approximation than the direct PINN.
Read the full abstract

All authors Zhen Zhang, Shanqing Liu, Alessandro Alla, Jerome Darbon, George Em Karniadakis

Category Theory

Categorical Perspectives on Chemical Reaction Networks

We show that the Schur-complement reduction of a chemical reaction network (CRN) from Hirono et al. is the categorical complement of the stoichiometric arrow in the arrow category $[\mathbf{A}_2,\mathbf{Vect}]$. This identifies the ambient category in which topological reduction of chemical reaction networks is functorial and explains the reduced stoichiometric matrix as a universal diagrammatic construction. We further define a reconstruction functor from a restricted subcategory of $[\mathbf{A}_2, \mathbf{Vect}]$ back to CRNs and prove an adjunction with the stoichiometric functor.
Read the full abstract

Geometric Topology

Morse functions with regular level sets consisting of $2$-dimensional spheres, $2$-dimensional tori, or Klein Bottles

In this paper, we study Morse functions with regular level sets consisting of spheres, tori, or Klein Bottles on $3$-dimensional closed manifolds. We characterize $3$-dimensional manifolds represented by connected sums each of whose summands is the product $S^1 \times S^2$ of the circle $S^1$ and the sphere $S^2$, lens spaces, or non-orientable closed and connected manifolds of genus $1$ by a certain subclass of such Morse functions. This is a kind of extensions of the orientable case, by Saeki, in 2006. This is a variant of its extension by the author for $3$-dimensional orientable manifolds represented by connected sums each of whose summands is the product $S^1 \times S^2$, lens spaces, or torus bundles over $S^1$ by a certain class of Morse-Bott functions. We also classify Morse functions with given regular level sets consisting of $S^2$, $S^1 \times S^1$, or Klein Bottles in a certain sense, generalizing some previous work by the author.
Read the full abstract

Numerical Analysis · Cross-listed from cond-mat.other

Weak Solutions to the Bloch Equations with Distant Dipolar Field

The distant dipolar field (DDF) is a long-range, nonlocal contribution to liquid-state spin dynamics that arises from intermolecular dipolar couplings and can generate multiple-quantum coherences and novel MRI contrast. Its sign-changing kernel makes Bloch-DDF dynamics strongly geometry dependent, and FFT-based dipolar convolutions naturally assume periodic or padded Cartesian domains rather than bounded samples with reflective diffusion boundaries. We study the Bloch equations with the DDF on bounded domains under homogeneous Neumann diffusion conditions. We derive a finite-element weak formulation that supports spatially varying diffusion and relaxation parameters and uses a short-distance regularization of the secular DDF kernel with length a>0. For fixed a we prove boundedness of the DDF operator, establish an L2 energy balance in which precession is neutral while diffusion and transverse relaxation are dissipative, and obtain local well-posedness with continuous dependence on the data, with global existence under energy-neutral transport. For the Galerkin semi-discretization we show a discrete energy identity mirroring the continuum estimate. For computation, we evaluate the DDF in real space with a matrix-free near/far scheme and advance in time using a second-order IMEX splitting method that treats diffusion and relaxation implicitly and precession explicitly. The explicit stage applies a Rodrigues rotation at DDF quadrature points followed by an L2 projection, enabling stable multi-cycle lab-frame simulations. We validate against three closed-form benchmarks and quantify curved-boundary effects by comparing mapped finite elements with a voxel-mask finite-difference baseline on spherical Neumann eigenmode decay. These results provide an analyzable and reproducible route for Bloch-DDF dynamics on bounded domains with complex geometry.
Read the full abstract