General Topology
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 20 April
Let $G=(V,E)$ be a finite connected graph with vertex set $V$ and edge set $E$, and let $U(G)$ be the set of all ultrametric spaces $(V,d_l)$ generated by vertex labelings $l\colon V \to \mathbb R^+$. We prove that the inequality $$ |D(V)| \le |E| + 1 $$ holds for all $(V,d_l) \in U(G)$, where $D(V)$ is the distance set of $(V,d_l)$. The necessary and sufficient conditions under which the above inequality turns to an equality are found. Moreover, we prove that each connected graph with non-negative vertex labeling generates a pseudoultrametric space and find some sufficient conditions under which this space is ultrametric.
Information Theory
Feedforward Phase Noise Compensation for Intersymbol Interference Channels
A non-iterative phase noise compensation method based on the sum-product algorithm (SPA) is applied to the outputs of intersymbol interference (ISI) channels. The outputs are modeled as independent Gaussian random variables, and the receiver applies mismatched processing with von Mises statistics. The performance is compared with that of linear minimum-mean-square-error filtering. The SPA achieves higher information rates at similar complexity for three channel types: ISI-free, standard single-mode fiber, and multipath channels with orthogonal frequency-division multiplexing.
Read the full abstract
Mathematical Physics
Eigenvalue asymptotics of Müller minimizers for atoms and molecules
We study the spectral properties of minimizers of the Müller functional for atoms and molecules with $N$ electrons and total nuclear charge $Z$. We prove that under some suitable assumptions on $Z$ and $N$, the $k$-th eigenvalue of a Müller minimizer $\gamma_*$ behaves as $A_* k^{-8/3}$ when $k\to \infty$, with a constant $A_*>0$ determined explicitly by the density of $\gamma_*$. In particular, in the atomic case $V=Z|x|^{-1}$ our assumption holds if $Z$ is sufficiently large and $N\le Z- C_0 Z^{1/3}$. While our proof is inspired by Sobolev's work on the asymptotic behavior of the one-particle density matrix of Schrödinger ground states, the analysis in Müller theory requires several new ingredients concerning both the singular behavior of the integral kernel of the minimizers near the diagonal and the decay properties at infinity.
Read the full abstract
Mathematical Physics
Bounding relative entropy for non-unitary excitations in quantum field theory
We show how one can use the convexity of non-commutative $L^p$ norms to bound the relative entropy between a faithful state on a von Neumann algebra and an arbitrary excitation thereof. Our results hold for general von Neumann algebras, including the local algebras of type III that are ubiquitous in quantum field theory, and do not require knowledge of the relative modular operator. As an application of our results, we prove that for the chiral current on a light ray, the relative entropy between the vacuum and a dense set of single-particle states is uniformly bounded.
Read the full abstract
Algebraic Geometry
Universal compactified Jacobians: cohomological invariance and boundary combinatorics
Pagani and Tommasi have introduced a class of smoothable fine compactified Jacobians $\overline{\mathcal{J}}_{g,n}^d(\sigma)\rightarrow \overline{\mathcal{M}}_{g,n}$ over the moduli space of stable curves, depending nontrivially on the degree $d$ and the choice of a stability condition $\sigma$. A theorem of Migliorini-Shende-Viviani implies that the cohomology of $\overline{\mathcal{J}}_{g,n}^d(\sigma)$ is independent of $d$ and $\sigma$, a statement which is quite unexpected from the point of view of the boundary geometry of these spaces. We reprove this independence statement using a direct combinatorial argument, summing up contributions of individual strata. The Appendix includes a result by J. Feusi characterizing when $\mathcal{J}_{g,n}^d$ and $\mathcal{J}_{g,n}^{d'}$ are $S_n$-equivariantly isomorphic over $\mathcal{M}_{g,n}$, and a result by Q. Yin showing that $[\mathcal{J}^d_g]$ and $[\mathcal{J}^{d'}_g]$ are not always equal in $K_0(\text{Var}_{\mathbb{C}})$.
Read the full abstract
Representation Theory
Simple modules over truncated current Lie algebras of the Witt algebra
Let $\Bbbk$ be an algebraically closed field of characteristic $p>3$, and let $W$ denote the $p$-dimensional Witt algebra, the first example of a non-classical simple Lie algebra. For a non-negative integer $\ell$, consider the associated truncated current Lie algebra $W_\ell=W \otimes \Bbbk[t]/(t^{\ell+1})$. In this paper, we first study simple $W_\ell$-modules having $p$-character $\chi$ of height at most one, and provide a complete classification of such modules up to isomorphism. We then investigate a family of simple $W_\ell$-modules whose $p$-characters have height greater than one.
Read the full abstract
Differential Geometry
Hausdorff Dimension of Anosov Subgroups' Limit Sets with Special Self-Affine Complexity
Let $\Gamma\subset \mathsf{PGL}(d,\mathbb{R})$ be an irreducible projective Anosov subgroup and let $\Lambda^1(\Gamma)$ be its projective limit set. Viewing $\Lambda^1(\Gamma)$ as an analogue of a self-affine set, we investigate the Hausdorff dimension of $\Lambda^1(\Gamma)$ under specific assumptions regarding its affine complexity: 1. If $\Lambda^1(\Gamma)$ is of full Hausdorff dimension, then $d= 2$ and $\Gamma$ is a cocompact lattice. 2. If $d = 3$ and $\Gamma$ is the image of a closed surface group under an irreducible Anosov representation, then $\Lambda^1(\Gamma)$ never has Hausdorff dimension $1$ unless the representation is Hitchin. 3. If the limit set $\Lambda^1(\Gamma)$ exhibits a partial quasi-self-similarity (in the sense of Falconer~\cite{falconerselfsimilar1}) – which can be implied by the “regular distortion property” of $\Gamma$ – then the Hausdorff dimension of $\Lambda^1(\Gamma)$ equals the critical exponent of the first simple root. An application of this result is the computation of the Hausdorff dimension of the limit set for arbitrary $\Theta$-positive representations of convex cocompact Fuchsian groups.
Read the full abstract
Optimization and Control
Momentum Stability and Adaptive Control in Stochastic Reconfiguration
Variational Monte Carlo (VMC) combined with expressive neural network wavefunctions has become a powerful route to high-accuracy ground-state calculations, yet its practical success hinges on efficient and stable wavefunction optimization. While stochastic reconfiguration (SR) provides a geometry-aware preconditioner motivated by imaginary-time evolution, its Kaczmarz-inspired variant, subsampled projected-increment natural gradient descent (SPRING), achieves state-of-the-art empirical performance. However, the effectiveness of SPRING is highly sensitive to the choice of a momentum-like parameter $\mu$. The original sensitivity of $\mu$ and the instability observed at $\mu=1$, have remained unclear. In this work, we clarify the distinct mechanisms governing the regimes $\mu<1$ and $\mu=1$. We establish convergence guarantees for $0\le\mu<1$ under mild assumptions, and construct counterexamples showing that $\mu=1$ can induce divergence via uncontrolled growth along kernel-related directions when the step-size is not summable. Motivated by these theoretical insights and numerical observations, we further propose Principal Range Informed MomEntum SR (PRIME-SR), a tuning-free momentum-adaptive SR method based on effective spectral dimension and subspace overlap. PRIME-SR achieves performance comparable to optimally tuned SPRING while significantly improving robustness in VMC optimization.
Read the full abstract
Algebraic Geometry
On Nests and Large Components of Random Real Algebraic Curves
We develop a variant of the barrier method in order to address questions about topology of Kostlan random real algebraic plane curves. In particular we prove that the expected number of connected components of the curve of length at least $\displaystyle{O\left(\sqrt{d^{-1}\log \log d}\right)}$ grows to infinity with $d$, and likewise, the expected number of nests of the curve of depth at least $\displaystyle{O\left(\log\log d\right)}$ grows to infinity with $d$. In another direction, we adapt an $L^{\infty}$-norm bound result of Shifmann and Zelditch to subspaces and employ it to obtain a lower bound for the probability that a finite number of points remain all in different components of the complement of a large degree random curve.
Read the full abstract
Category Theory
Implementing the biset category of finite groups
We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software project CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Expressing this universal property offers an elegant categorical interpretation of the Schreier-Sims orbit algorithm. Indeed, the implementation relies on every aspect of the algorithm.
Read the full abstract
Information Theory
Polar Coded Quantization for Distributed Source Coding
Scalar quantization and probabilistic shaping are applied to the distributed source coding of Gaussian sources, with mean-square error distortion. A coding scheme with a modulo interval, dithering, and truncated Gaussian shaping is shown to achieve the corner points of the Berger-Tung region. The theory is illustrated by designing short-block-length multilevel 5G polar codes for Wyner-Ziv (WZ) polar coded quantization (PCQ). WZ-PCQ substantially reduces the total distortion compared to separate PCQ of the source blocks.
Read the full abstract
Combinatorics
Saturation of Markov Polynomials
Solutions to the Markov equation appear in many mathematical contexts. We aim to build on the understanding of them by proving a recent conjecture about Markov polynomials; solutions to a generalised version of the Markov equation. The proof we provide is a constructive argument based on the Markov snake graph, a combinatorial object related to Markov numbers, deepening the connection between the Markov equation and combinatorics.
Read the full abstract
Optimization and Control
An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees
We study a class of optimization problems on Riemannian manifolds, where the objective function consists of a smooth term and quasi-norm type penalties with exponent $p \in (0, 1]$. The essential difficulty lies in the fact that the objective function may not be locally Lipschitz continuous, which places this type of problems beyond the reach of existing Riemannian techniques. To overcome this obstacle, this paper constructs a general smoothing framework and establishes fundamental properties for developing efficient algorithms. In particular, we propose a smoothing Riemannian gradient algorithm equipped with a smoothing-aware AdaGrad-type stepsize rule. Its global convergence is demonstrated together with an iteration complexity of $O (\epsilon^{p - 4})$, which includes the best available iteration complexity of $O (\epsilon^{- 3})$ for Lipschitz problems with $p = 1$ as a special case. To the best of our knowledge, this is the first complexity result for non-Lipschitz optimization on Riemannian manifolds. Preliminary numerical experiments corroborate the practical efficiency of the proposed approach in real-world applications arsing from machine learning and data science.
Read the full abstract
Optimization and Control
Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging
Many works in convex optimization provide rates for achieving a small primal gap. However, this quantity is typically unavailable in practice. In this work, we show that solving a regularized surrogate with algorithms based on simple primal-dual averaging provides non-asymptotic convergence guarantees for a computable optimality certificate. We first analyze primal and dual methods based on one average, namely modified dual averaging and generalized conditional gradient, and establish $\tilde{O}(\varepsilon^{-1})$ certificate complexities. Motivated by asymmetries in the one-average case, we analyze a self-dual, two-average method that preserves symmetry while losing certificate guarantees. To recover certificate convergence, we propose a three-average method that achieves an accelerated $\tilde{O}(\varepsilon^{-1/2})$ certificate complexity. Furthermore, we prove primal-dual algorithm correspondences for the one, two, and three-average cases. In particular, the primal three-average accelerated method mirrors the well-known gradient extrapolation method in the dual. By interpreting our results through the lens of zero-sum matrix games and Fisher markets, we further connect primal-dual averaging methods to game theory and market dynamics.
Read the full abstract
Combinatorics · Cross-listed from cs.NI
Tabu Search for Tactical Wireless Network Design in Challenging Environments
Tactical wireless networks play a vital role in ensuring reliable connectivity in scenarios where conventional telecommunications infrastructure is unavailable or damaged, such as areas impacted by natural disasters. These networks are designed to operate efficiently in difficult and unpredictable environments by adapting to the unique characteristics of the terrain. This research addresses a real-world challenge from the communications industry: designing tactical wireless networks that meet the specific constraints defined by our industrial partner, with the goal of optimizing signal strength and coverage while minimizing interference. To this end, we propose two tabu search algorithms that incorporate several heuristic subroutines, enabling the efficient generation of high-quality network designs. Results from synthetic tests demonstrate that our approach produces networks rapidly and effectively, offering significant improvements over existing methods.
Read the full abstract
Algebraic Geometry
On Coble surfaces and their automorphisms
Given a complex Coble surface $X$ with irreducible boundary $C$, we consider a specific automorphism $T : X \to X$, initially defined by Pompilj. We show that there are two families of Coble surfaces satisfying the condition $T|_C = \mathbb{1}_C$. Every Coble surface $X$ in the first family in nodal, and moreover the stronger equality $T = \mathbb{1}_X$ holds. Meanwhile, the second family is ”small”, since it has codimension $3$ in the moduli space of Coble surfaces.
Read the full abstract
Analysis of PDEs
Global Well-Posedness of Classical Solutions to the Multi-Dimensional Degenerate Compressible Navier-Stokes Equations with Large Spherically Symmetric Initial Data
This paper is concerned with the global existence and uniqueness of classical solutions to the barotropic compressible Navier-Stokes equations with degenerate viscosity coefficients in three-dimensional bounded domains or in the whole space $\mathbb{R}^N$ $(N=2,3)$ with non-vacuum far-field density. Specifically, we assume that the shear viscosity coefficient $\mu(\rho)=\rho^\alpha$ and the bulk viscosity coefficient $\lambda(\rho)=(\alpha-1)\rho^\alpha$, which satisfy the BD entropy relation. For arbitrarily large spherically symmetric initial data, we establish the global existence and uniqueness of spherically symmetric classical solutions under the following conditions: for $N=2$, $\alpha \in (0.54369,1)$ and $\gamma \in (1,\infty)$; for $N=3$ (both bounded domains and the whole space), $\alpha \in (0.67661,1)$ and $\gamma \in (1,6\alpha-3)$. In the two-dimensional case $\mathbb{R}^2$, the restriction on $\alpha$ can be further relaxed to $\alpha \in (9-6\sqrt{2},1)$ provided that the initial data satisfy additional weighted integrability conditions. Moreover, we show that the solution will not exhibit vacuum in any finite time provided that no vacuum is present initially.
Read the full abstract
Operator Algebras
An introduction to separated graphs and their type semigroups
We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras associated with separated graphs. These constructions have in common that they have a dynamical behavior, being the groupoid $C^*$-algebras associated to certain topological groupoids, which are built from the combinatorial structure. An important invariant one may associate to these dynamical systems is the so-called type semigroup. We will find a formula to compute the type semigroup for a general self-similar action of a group on a row-finite graph $E$ without sources, following a recent paper by Kwaśniewski, Meyer and Prasad, and for any finite bipartite separated graph, following a paper by Exel and the author. In addition, we will review various results concerning the structure of the type semigroup for different dynamical systems.
Read the full abstract
Functional Analysis
Real-variable theory of function spaces with operator-valued $A_p$ weights in Banach spaces
While the theory of matrix-weighted function spaces is well established, the majority of previous results in the infinite-dimensional operator-valued setting deal with "no go" theorems, showing the impossibility of some prospective generalizations. However, we show that a complete real-variable theory of Besov and Triebel-Lizorkin spaces with operator-valued Muckenhoupt $A_p$ weights can still be developed, once correctly formulated. This covers operator-weighted extensions of results like the $\varphi$-transform characterization in terms of discrete sequence spaces, the boundedness of almost diagonal operators, and applications to the $T(1)$ theorem and trace/extension theorems. A key tool is a version of the reverse Hölder inequality, which is weak enough to follow from the operator-valued $A_p$ condition (unlike a variant that had to be imposed as an additional assumption in some previous works), yet strong enough to be used much like its classical counterpart. In contrast to the established scalar and matrix-weighted theories, our approach cannot build on operator-weighted $L^p$ results, as these fail in a very definite way. We also strengthen the existing "no go" statements in Hilbert spaces, showing (among other counterexamples) that every infinite-dimensional Banach space has an operator-valued $A_p$ weight $V$ for which the Hilbert transform is unbounded on $L^p(V)$. This is nontrivial, since the lack of Hilbert space structure also complicates the construction of $A_p$ weights. Building on results from Banach space theory, we achieve this unboundedness by combining two distinct methods in two different classes of spaces (so-called $K$-convex ones and those that are not UMD), whose union covers all Banach spaces.
Read the full abstract
Analysis of PDEs
Lagrangian Mean Curvature Equations on exterior domains
We introduce an extended exterior $(K,K^{\prime},\alpha_0)$–quasiconformal mapping method to study the asymptotic behavior at infinity of solutions to the supercritical phase Lagrangian mean curvature equation \[ \sum_{i=1}^{n} \arctan \lambda_i(D^2u) = \theta + f(x) \] on exterior domains in $\mathbb{R}^n$, where the constant $|\theta|\in((n-2)\pi/2,n\pi/2)$, $n\geq 2$, and $f=O(|x|^{-\beta})$ is a perturbation term with the sharp decay condition $\beta>2$ at infinity. Our work generalizes the classical exterior Bernstein-type theorem for the special Lagrangian equation ($f\equiv0$) established by Li–Li–Yuan [Adv. Math. (2020)]. Via Perron's method, we solve the corresponding Dirichlet problem outside a bounded, uniformly convex domain, prescribing asymptotic behavior at infinity. For $n \geq 3$, we establish existence and uniqueness of viscosity solutions in both the supercritical phase case with $f \not\equiv 0$ and the subcritical phase case with $f \equiv 0$. This extends earlier work by Li [Trans. Amer. Math. Soc. (2019)] on the exterior Dirichlet problem for the special Lagrangian equation ($f \equiv 0$) under weaker regularity assumptions on the interior boundary and boundary data.
Read the full abstract
Combinatorics
Finite combinatorics and computability theory
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions between problems related to the pigeonhole principle. We then study the latter using counting arguments and computability theory. In particular, we demonstrate that computability theoretic techniques can be used to refine and prove new results in finite combinatorics.
Read the full abstract
Numerical Analysis
Dual formulations of geometric curvature flows and their discretizations
We propose new formulations of geometric curvature flows – referred to as dual formulations – that are equivalent to the original formulations but provide a novel framework for constructing linearly implicit and energy-stable schemes for curvature-driven surface evolution, including mean curvature flow, surface diffusion, and solid-state dewetting on a substrate with a moving contact line. The dual formulations are derived by introducing, at the continuous level, an additional unknown in the form of a dual multiplier. This augmentation does not alter the continuous dynamics but makes the underlying energy-dissipation structure explicit and, in turn, enables a systematic design of linearly implicit discretizations that inherit energy stability. A key feature of this framework is that it accommodates a broad class of artificial tangential motions which can be used to maintain good mesh quality of the computed surfaces. As an illustration, we combine the framework with the minimal-deformation-rate (MDR) tangential motion, leading to what we call the dual-MDR scheme. The resulting method is linearly implicit and energy-stable, while retaining the MDR tangential motion to maintain good mesh quality. Extensive numerical experiments demonstrate the convergence of the proposed schemes, their structure-preserving properties, and advantages on representative benchmark problems.
Read the full abstract
Algebraic Geometry
On quantum functionals for higher-order tensors
Upper and lower quantum functionals, introduced by Christandl, Vrana and Zuiddam (STOC 2018, J. Amer. Math. Soc. 2023), are families of monotone functions of tensors indexed by a weighting on the set of subsets of the tensor legs. Inspired by quantum information theory, they were crafted as obstructions to asymptotic tensor transformations, relevant in algebraic complexity theory. For tensors of order three, and more generally for weightings on singletons for higher-order tensors, the upper and lower quantum functionals coincide and are spectral points in Strassen's asymptotic spectrum. Moreover, the singleton quantum functionals characterize the asymptotic slice rank, whereas general weightings provide upper bounds on asymptotic partition rank. It has been an open question whether the upper and lower quantum functionals also coincide for other cases, or more generally, how to construct further spectral points, especially for higher-order tensors. In this work, we show that upper and lower quantum functionals generally do not coincide, but that they anchor new spectral points. With this we mean that there exist new spectral points, which equal the quantum functionals on the set of tensors on which upper and lower coincide. The set is shown to include embedded three-tensors and W-like states and concerns all laminar weightings, significantly extending the singleton case. Moreover, it is shown that these spectral points provide obstructions to asymptotic restriction beyond the previously known spectral points.
Read the full abstract
Information Theory · Cross-listed from cs.CR
Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography
This paper investigates subcodes of lambda-Gabidulin codes, viewed as rank-metric analogues of generalized Reed–Solomon codes, and their applications to compact-ciphertext cryptosystems. We first analyze subspace and generalized subspace subcodes of lambda-Gabidulin codes and relate them to corresponding subcodes of classical Gabidulin codes through coordinate-wise scaling. This relation yields cardinality bounds and structural properties for these families. When the extension degree equals the code length, we further characterize Gabidulin subspace subcodes in terms of linearized polynomials, which gives an explicit description of their encoding and dimension. We also study the matrix images of these subcodes over the base field through their stabilizer and annihilator algebras, showing that subspace restrictions may preserve nontrivial algebraic invariants despite the loss of extension-field linearity. Motivated by these results, we propose a generator-matrix-based construction of random subcodes designed to avoid such invariants. This construction is then used to design McEliece-like and Niederreiter-like encryption schemes in the MinRank setting. Among the parameter sets considered in this work, the most compact ciphertexts are obtained from random subcodes of classical Gabidulin codes. At the 128-, 192-, and 256-bit security levels, the resulting $\mathsf{LGS}$-Niederreiter instances achieve the smallest ciphertext sizes among the compared schemes, while maintaining competitive public-key sizes.
Read the full abstract
Mathematical Physics
Sketch of a Gauge Model of Gravity with SU(2) Symmetry in Minkowski space
We propose a gauge model with the SU(2) symmetry, which describes a gravitational interaction of fundamental fermions (leptons and quarks) in the Minkowski space. In the Standard Model one uses a Dirac-Yang-Mills system of equations with U(2) gauge symmetry for electroweak interactions and with SU(3) gauge symmetry for QCD interactions. A key idea of the model is to use the Dirac-type equation (invented in 2002) instead of the standard Dirac equation. This Dirac-type equation has an additional SU(2) gauge symmetry. The Yang-Mills field, which corresponds to this SU(2) symmetry, we identify with the gravitational field of interacted fundamental fermions. Some elements of Clifford analysis are used in the model.
Read the full abstract
Geometric Topology
Involutive Floer Invariants for Closed Four-Manifolds
Inspired by the Ozsváth-Szabó mixed invariant in ordinary Heegaard Floer theory, we define a mixed invariant $\Phi_{X, \mathfrak{s}}^{I}$ for closed, spin four-manifolds $(X, \mathfrak{s})$ using the cobordism maps on involutive Heegaard Floer homology. The invariant is well-defined whenever $b_{2}^{+}(X) > 4$. We furthermore construct an involutive Seiberg-Witten invariant that is well-defined whenever $b_{2}^{+}(X) > 3$. We show that these involutive invariants obstruct the existence of disjoint pairs of embedded surfaces which both violate the adjunction inequality. As an application, we find that $K3\#(S^2 \times S^2)$ contains no such pair.
Read the full abstract
Spectral Theory
An asymptotic shape optimization problem for Riesz means of Laplacian eigenvalues
We review our recent results on the problem of optimizing Riesz means of Laplace eigenvalues among convex sets of given measure in the regime where the cut-off parameter in the definition of the Riesz means tends to infinity. We show that for a certain range of Riesz exponents, the optimizing sets converge to a ball. We also present some new results where we optimize over disjoint unions of convex sets.
Read the full abstract
Analysis of PDEs
DeepRitzSplit: A Variational Neural Operator Framework for Gradient Flows with Application to Dendritic Growth
Phase-field models are widely used to simulate microstructure evolution but their numerical solution remains computationally demanding. Neural operator surrogates provide a promising alternative, yet existing approaches are data-driven, requiring large datasets and exhibiting limited robustness when extrapolating to unseen configurations. We introduce DeepRitzSplit, an unsupervised neural operator framework for gradient-flow systems based on a variational formulation of energy-stable splitting schemes. It learns the time evolution semigroup associated with a convex-concave free-energy decomposition by minimizing the underlying variational problem at each time step. It is designed to inherit the dissipative structure of the underlying gradient flow without requiring trajectory datasets. We further introduce a Reaction-Diffusion Neural Operator (RDNO) architecture motivated by splitting schemes, with separate reaction and diffusion components to improve training efficiency and interpretability. We assess the approach on the Allen-Cahn equation and apply it to a phase-field model of anisotropic dendritic growth during solidification. In the Allen-Cahn benchmark, DeepRitzSplit shows better generalization than the supervised baseline on the out-of-distribution configurations tested, using 180 training configurations. In dendritic growth, the method captures the overall phase morphology and dendrite tip velocity well, while the tip radius is more sensitive to the training strategy. Refinement based on the residual of the splitting scheme markedly improves this second-order morphological quantity. The trained operators retain good predictive capabilities on configurations substantially different from the training set. These results demonstrate the potential of variationally trained neural operators as physically informed surrogates for accelerated microstructure simulations.
Read the full abstract
Statistics Theory
Gamma-Based Expansion for the First-Passage Time Distribution of Stochastic Logistic Models with Harvesting
The first passage time problem is considered for stochastic logistic growth model with constant harvesting and multiplicative environmental noise. Explicit expressions for the moments and cumulants of both upcrossing and downcrossing FPTs in the presence of constant thresholds are obtained through a power-series expansion of the Laplace transform. Then a closed-form representation of the FPT density is recovered via an orthogonal Laguerre–Gamma expansion . This representation is used to numerically evaluate FPT densities, with the truncation order controlling the trade-off between accuracy and stability. Numerical experiments based on Monte Carlo simulations confirm the high accuracy of the method in regimes of moderate dispersion and highlight its limitations when higher-order moments grow rapidly. Application to fisheries management models shows that the method remains effective even for large-scale population. Finally, the approximated density is satisfactory used to estimate some parameters of the model.
Read the full abstract
Information Theory
Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes
Bit-Flipping (BF) decoders are a family of decoders widely employed in post-quantum cryptographic schemes based on Quasi-Cyclic Moderate-Density Parity-Check (QC-MDPC) codes, such as BIKE. BF decoders suffer from trapping sets, corresponding to low-weight error patterns that likely lead to decoding failures. For QC-MDPC codes, the most relevant family of trapping sets is that of near-codewords, which are error patterns associated to low-weight syndromes. Indeed, recent works show that error patterns having a large overlap with near-codewords are the main culprits for decoding failures at very low Decoding Failure Rate (DFR) values. In this paper, we show that any BF decoder can be tweaked and made somehow aware of near-codewords, which means being able to recognize, and recover from, bad configurations due to near-codewords. We show that this modification results in minimal computational overhead. Through intensive numerical simulations, we evaluate the effectiveness of this approach on several BF decoders, considering both toy code parameters and BIKE parameters for NIST security category 1. Our results show drastic reductions in the DFR. We also find that, with this modification, a recently proposed BF variant called BF-Max outperforms the two decoders used by BIKE within the NIST competition.