Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 3 March

Combinatorics

Combinatorial relations among restricted and half Eulerian polynomials of types $A$, $B$, and $D$

In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a bijective proof of a new identity involving the Eulerian polynomials of type $A$ and type $B$, solving a recent open problem proposed by Zhang. Additionally, we derive an identity between the half Eulerian polynomials of type $B$ and type $D$. Using this identity, we further obtain another relation about the Eulerian polynomials of type $A$ and type $B$, as well as a recursive formula connecting the restricted Eulerian polynomials of type $D$ and Eulerian polynomials of types $A$ and $B$.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Discrete-modulation continuous-variable quantum key distribution with probabilistic amplitude shaping over a linear quantum channel

The practical implementation difficulties arising from the Gaussian modulation of the GG02 protocol lead us to investigate the possibilities offered by the combination of probabilistic amplitude shaping technique and quadrature amplitude modulation formats in the context of continuous variable quantum key distribution systems. Our interest comes from the fact that quadrature amplitude modulation and probabilistic shaping can be implemented with current technologies and are widely used in classical telecom equipment. In this treatment, we assume to work in the scenario of a linear quantum channel and we analyze maximum achievable secure key rates, maximum reachable distances and the resilience to noise of our discrete-modulation based protocol with respect to GG02, which is taken as a benchmark. In particular, we deal with the infinite key size regime, consider a homodyne detection scheme, and analyze what happens for different cardinalities of the input alphabet at different distances, in the case of collective attacks and in the reverse reconciliation picture. We find that our protocol, beyond being easily reproducible in the laboratory, provides a way to closely approach the theoretical performance offered by GG02 and, at the same time, preserves the ability to assure an unconditional security level.
Read the full abstract

All authors Emanuele Parente, Michele N. Notarnicola, Stefano Olivares, Enrico Forestieri, Luca Potì, Marco Secondini

Analysis of PDEs

The stabilizing effect of the microstructure on the 3D magneto-micropolar equations

This paper focuses on the global stability of the 3D magneto-micropolar equations with partial viscosity in the torus $\mathbb T^3$. We first establish the global stability and exponential decay for the 3D magneto-micropolar equations with zero kinematic viscosity. If the micro-rotation effect is neglected, this system reduces to the 3D inviscid and resistive MHD equations which stability problem is still a challenging open problem. Secondly, we obtain the global stability and algebraic decay to the 3D magneto-micropolar equations with zero kinematic viscosity and zero magnetic diffusion on perturbations near a background magnetic field. This system becomes the 3D ideal MHD equations by ignoring the microstructure, and it is well-known that the weighted spaces must be introduced to show the global well-posedness of the ideal MHD equations. Our results indicate that the microstructure has the effect of enhancing dissipation and contributes to stabilize the fluid. To the best of our knowledge, these are the first results on the stabilizing effect of the microstructure on electrically conducting fluids.
Read the full abstract

Logic

Deciding winning strategies in Yu-Gi-Oh! TCG is hard

Motivated by the results for Magic: The Gathering presented in [CBH20] and [Bid20], we study a (different) computability problem about winning strategies in Yu-Gi-Oh! Trading Card Game, a popular card game developed and published by Konami. We show that the problem of establishing whether, from a given game state, a given computable strategy is winning is undecidable. In particular, not only do we prove that the Halting Problem can be reduced to this problem, but also that this problem is actually $\Pi^1_1$-complete. We extend this last result to all strategies with a reduction on the set of countable well orders, a classic $\boldsymbol{\Pi}^1_1$-complete set. For these reductions, we present two legal decks (according to the current Forbidden & Limited List of Yu-Gi-Oh! Trading Card Game) that can be used by the player who goes first to perform them.
Read the full abstract

History and Overview of Mathematics

Vopěnka's Alternative Set Theory as a framework for feasible numbers

Vopěnka's Alternative Set Theory has been considered as a framework for modelling vague notions. This paper takes feasibility, pertaining to numbers as per some of Yessenin-Volpin's work, and tries to assess how this notion could be modelled in the Alternative Set Theory. The route explored in detail consists in an attempt to model Dummett's weakly infinite, weakly finite totalities, the coherence of which Dummett takes to be decisive of the coherence of Yessenin-Volpin's foundational conception in general. The outcome of the particular analysis turns out to be negative: the Alternative Set Theory could be taken as a model of some, but not quite all features of Yessenin-Volpin's feasible numbers. Given that only one particular approach is explored here, the outcome has limited bearing on the more general questions of coherence of ultrafinitist position, or indeed the possibilities of modelling feasible numbers.
Read the full abstract

Analysis of PDEs

Direct Scattering of the Focusing Nonlinear Schrödinger Equation with Step-like Oscillatory Initial Data

In this manuscript we set up the direct and inverse scattering problems for step-like traveling-wave solutions of the nonlinear Schrödinger equation. Specifically, we consider initial data $u(x,0)$ satisfying $u(x,0)\to u_0^\ell(x)$ as $x\to-\infty$ and $u(x,0)\to u_0^r(x)$ as $x\to+\infty$, where $u_0^\ell(x)$ and $u_0^r(x)$ are elliptic traveling waves. Under suitable assumptions on the initial data we formulate the direct scattering problem and establish analytic properties of the scattering data. We then formulate the inverse problem as a Riemann–Hilbert problem and prove its solvability. Finally, we observe that this Riemann–Hilbert formulation is a special case of the one arising for full soliton-gas initial data.
Read the full abstract

All authors Tamara Grava, Robert Jenkins, Xiaofan Zhang, Zechuan Zhang

Algebraic Geometry

Anabelian perspectives in Galois-Teichmüller theory

By exploiting the arithmetic homotopy of the moduli spaces of curves, Galois-Teichmüller theory stands at the interface of braid-mapping class groups and of anabelian geometry. Starting from the classical braid-theoretic construction of the Grothendieck-Teichmüller group, we review how anabelian geometry – beginning with the foundational work of Nakamura – provides the arithmetic mechanisms underlying its definition. We then explain how the combinatorial anabelian geometry developed by Hoshi and Mochizuki recasts these constructions within a purely group-theoretic and algorithmic framework. In particular, we describe how the group GT emerges as an anabelian object and how, once freed from an auxiliary or artificially imposed containers, the anabelian algorithms yield a combinatorial reconstruction of the absolute Galois group of rational numbers. The perspective developed here highlights a conceptual shift from explicit braid-theoretic computations to functorial and algorithmic forms of anabelian reconstruction.
Read the full abstract

Optimization and Control

Optimal Routing across Constant Function Market Makers with Gas Fees

We study the optimal routing problem in decentralized exchanges built on Constant Function Market Makers when trades can be split across multiple heterogeneous pools and execution incurs fixed on-chain costs (gas fees). While prior routing formulations typically abstract from fixed activation costs, real on-chain execution presents non-negligible gas fees. They also become convex under concavity/convexity assumptions on the invariant functions. We propose a general optimization framework that allows differentiable invariant functions beyond global convexity and incorporates fixed gas fees through a mixed-integer model that induces activation thresholds. Subsequently, we introduce a relaxed formulation of this model, whereby we deduce necessary optimality conditions, obtaining an explicit Karush-Kuhn-Tucker system that links prices, fees, and activation. We further establish sufficient optimality conditions using tools from generalized convexity (pseudoconcavity/pseudoconvexity and quasilinearity), yielding a verifiable optimality characterization without requiring convex trade functions. Finally, we relate the relaxed solution to the original mixed-integer model by providing explicit approximation bounds that quantify the utility gap induced by relaxation. Our results extend the mathematical theory for routing by offering no-trade conditions in fragmented on-chain markets in the presence of gas fees.
Read the full abstract

Dynamical Systems

Countable periodic solutions of the Lorentz force equation under a time-dependent current

The resonant dynamics of a charged particle, governed by the Lorentz force equation in an electromagnetic field generated by a current-carrying wire with a small harmonic modulation, is considered in this study. When regarded as a Hamiltonian system with periodic perturbation, the resonance of periodic orbits in the unperturbed system is analyzed by the Melnikov method. The existence of exactly one harmonic radial periodic solution with period $T_1$ is confirmed, matching the period of the current. Moreover, it is established that any other radial periodic solution must be subharmonic with period $nT_1$ for some integer $n > 1$, with at most one such solution for each $n$. Dynamically, these surviving periodic orbits correspond to invariant cylinders that partition the phase space and globally confine the particle's radial motion.
Read the full abstract

Combinatorics

$[k]$-Roman domination on cylindrical grids $C_m \Box P_n$

Roman domination and its higher-order extensions have attracted considerable attention due to their natural interpretation in terms of defensive resource allocation on networks. The recently introduced $[k]$-Roman domination framework unifies classical Roman, double, triple, and higher-strength protection schemes by allowing each fortified vertex to provide up to $k$ levels of support. In this paper, we investigate the $[k]$-Roman domination number $\gamma_{[k]R}(G)$ on cylindrical grids $C_m \Box P_n$. We relate $[k]$-Roman domination to efficient domination and establish exact values for regular graphs admitting an efficient dominating set; as a consequence, we obtain explicit values for broad families of toroidal grids and determine exactly when the cylindrical graphs $C_m\Box P_n$ admit an efficient dominating set. Building on these structural insights, we derive several upper bounds for $\gamma_{[k]R}(C_m \Box P_n)$ for small fixed values of $m$, accompanied by explicit labeling patterns that attain these bounds. All obtained bounds are systematically compared, revealing parameter ranges in which different constructions dominate depending on the value of $k$ and the length of the path. In addition, we present exact packing numbers for selected cylindrical graphs, which complement the domination results and enable further refinements via local weight reductions. Our results extend and unify known domination-type parameters on grid-like structures and highlight new regularities that emerge as the reinforcement strength increases.
Read the full abstract

Commutative Algebra

Cohen-Macaulay squarefree powers of edge ideals of very well-covered graphs

Let $G$ be a graph with edge ideal $I(G)$. For $q\ge 1$, the $q$th squarefree power $I(G)^{[q]}$ is the Stanley-Reisner ideal of the $q$-matching-free complex $\mathsf{MF}^q(G)$, whose faces are the vertex sets containing no $q$ pairwise disjoint edges. We determine exactly which squarefree powers of the edge ideal of a very well-covered graph are Cohen-Macaulay: if $G$ has $2n$ vertices, then $R/I(G)^{[q]}$ is Cohen-Macaulay if and only if $q=n$, or $q=1$ and $G$ is Cohen-Macaulay, or $G=W(H)$ is a whisker graph and $q \le \left\lfloor \frac{\operatorname{girth}(H)}{2} \right\rfloor$. The answer is independent of the field. The proof rests on a rigidity theorem: among very well-covered graphs, only whisker graphs have a sequentially Cohen-Macaulay squarefree power strictly between the first and the last. For whisker graphs we show that $\mathsf{MF}^q(W(H))$ is vertex decomposable for $q \le \left\lceil \frac{\operatorname{girth}(H)}{2} \right\rceil$, and we express the depth and the regularity of every squarefree power through the homology of explicit auxiliary complexes. As a consequence we prove a conjecture of Das, Roy and Saha on the depth of squarefree powers of whisker cycles. Finally, for every graph with a perfect matching, we compute the top homology of $\mathsf{MF}^q(G)$ and determine when the regularity of $R/I(G)^{[q]}$ attains its maximal possible value.
Read the full abstract

2603.02824 · 3 Mar · Substantially revised and expanded version, with a new title. We establish a complete classification of Cohen-Macaulay squarefree powers of edge ideals of very well-covered graphs, prove new rigidity and vertex-decomposability results, resolve a conjecture of Das, Roy and Saha, and obtain new results on depth, regularity, and top homology

Optimization and Control

Extremum Seeking with Double Integrators in the Presence of Local Extrema

We study the problem of global extremum seeking in the presence of local extrema. We investigate two different perturbation-based methods: 1) a well-known classical extremum seeking scheme for steady-state output optimization, and 2) a source seeking scheme for a two-dimensional point mass. In each of these two scenarios, the closed-loop system involves a damped double integrator subject to an oscillatory force. An averaging analysis reveals that the respective averaged system is again a damped double integrator, but now subject to a potential force. The potential force is given by the gradient of a locally averaged objective function. Such a function is less prone to have undesired local extrema and is therefore better suited for global optimization. We provide sufficient conditions for semi-global practical uniform asymptotic stability of the closed-loop systems. The sufficient conditions only involve assumptions on the averaged objective function but not the original one.
Read the full abstract

Functional Analysis

Doubly twisted near-isometries: Classification and a Wold-type decomposition

We introduce and study doubly twisted near-isometries. A doubly twisted near-isometry is a tuple of near-isometries satisfying certain relations determined by a prescribed family of unitaries, thereby generalizing the notion of doubly commuting near-isometries. We establish necessary and sufficient conditions for a tuple of near-isometries to admit a Wold-type decomposition and prove that the existence of such a decomposition automatically ensures its uniqueness by providing an explicit description of the summands. Furthermore, we show that every doubly twisted near-isometry admits a Wold-type decomposition. We also characterize unitary equivalence within the class of doubly twisted near-isometries and construct an analytic model for them. Several examples are included to highlight the distinctions between our results and the corresponding results in the setting of doubly twisted isometries.
Read the full abstract

Optimization and Control

Optimal Consumption and Portfolio Choice with No-Borrowing Constraint in the Kim-Omberg Model: The Complete Market Case

In this paper, we study an intertemporal utility maximization problem in which an investor chooses consumption and portfolio strategies in the presence of a stochastic factor and a no-borrowing constraint. In the spirit of the Kim-Omberg model, the stochastic factor represents the expected excess return of the risky asset. It is perfectly negatively correlated with shocks to the risky asset, and follows an Ornstein-Uhlenbeck process, thereby capturing the mean reversion of expected excess returns-a feature well supported by empirical evidence in financial markets. The investor seeks to maximize expected utility from consumption, subject to the constraint that wealth remains nonnegative at all times. To address the dynamic no-borrowing constraint, we use Lagrange duality to transform the primal problem into a singular control problem in the dual space. We then characterize the solution to the dual singular control problem via an auxiliary two-dimensional optimal stopping problem featuring stochastic volatility, and subsequently retrieve the primal value function as well as the optimal portfolio and consumption plans. Finally, a numerical study is conducted to derive economic and financial implications.
Read the full abstract

Optimization and Control

Global convergence of $W^{1,\infty}$-steepest descent for PDE constrained shape optimisation with semilinear elliptic equations in function space

We prove global convergence in function space for the steepest descent method in shape optimisation with semilinear elliptic partial differential equations. Steepest descent is realized in the Lipschitz topology. In addition, we prove a conditional convergence result for the resulting shapes in two space dimensions.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Lattice-based Deep Neural Networks: Regularity and Tailored Regularization

This survey article is concerned with the application of lattice rules to Deep Neural Networks (DNNs), lattice rules being a family of quasi-Monte Carlo methods. They have demonstrated effectiveness in various contexts for high-dimensional integration and function approximation. They are extremely easy to implement thanks to their very simple formulation – all that is required is a good integer generating vector of length matching the dimensionality of the problem. In recent years there has been a burst of research activities on the application and theory of DNNs. We review our recent article on using lattice rules as training points for DNNs with a smooth activation function, where we obtained explicit regularity bounds of the DNNs. By imposing restrictions on the network parameters to match the regularity features of the target function, we prove that DNNs with tailored lattice training points can achieve good theoretical generalization error bounds, with implied constants independent of the input dimension. We also demonstrate numerically that DNNs trained with our tailored regularization perform significantly better than with standard $\ell_2$ regularization.
Read the full abstract

All authors Alexander Keller, Frances Y. Kuo, Dirk Nuyens, Ian H. Sloan

Combinatorics

A classification of rotary embeddings of multicycles

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and $\lambda\geqslant 2$. When $n$ is odd, there is a unique isomorphism class; when $n$ is even, the embeddings form a family $\mathcal{M}_n^{(\lambda)}(i,j)$ parameterized by integer pairs $(i,j)$ satisfying explicit congruence conditions.
Read the full abstract

2603.02808 · 3 Mar · We have decided to withdraw this preprint because we discovered that the main results have already been covered in a previous work by K. Hu et al. Although our study was conducted independently and the methods differ to some extent, the core findings overlap significantly, and we do not believe the methodological novelty is sufficient to warrant a separate publication

Mathematical Physics · Cross-listed from cond-mat.mtrl-sci

HERB: a unified framework for the evaluation of Hydrogen Embrittlement mechanisms driven by the Rice-Beltz concept

The multiscale picture of hydrogen embrittlement (HE) mechanisms has been under controversy for a long time. Here I report a thermomechanically-consistent HERB framework driven by the Rice-Beltz concept meanwhile incorporating the hydrogen transport near the crack-tip and void growth within the plastic zone. Triggered solely by dislocation emission from the crack tip, the HERB theory unifies multiple HE mechanisms, such as HEDE, HELP, NVC and HESIV within a single framework. Specifically, a generalized model for predicting the hydrogen-informed dislocation emission is established by incorporating the Rice-Beltz model with the transition state theory. Accounting for the dynamic variation of the trapping energy of spherical inclusions, hydrogen transport is modeled in the dislocation free zone in front of the crack tip. Semi-analytical expressions of the density of geometrically necessary dislocations are obtained by incorporating the Hutchinson-Rice-Rosengren solution with the conventional theory of mechanism-based strain gradient plasticity model. By exploring the feasibility of stochastic analysis, the present theory demonstrates that the hydrogen-informed void dynamics is dominated by the dislocation density between the limits of Lifshitz-Allen-Cahn and Lifshitz-Slyozov-Wagner laws, even though individual events remain unpredictable. These insights fundamentally reshape hydrogen/dislocation interactions across multiple scales, including the core width, short-range and long-range levels.
Read the full abstract

Dynamical Systems

Contraction theory: Hausdorff–Riemann Measures as Set-Based Lyapunov Functions

We offer a measure-theoretic extension of the concept and theory of $k$-contraction, including their generalization on fractional dimensions $d$. The respective contraction property is defined through the exponential decay of the $d$-dimensional volume of compact sets transported by a nonlinear flow. For autonomous systems on positively invariant compact sets, we derive comprehensive, i.e., necessary and sufficient, conditions for $d$-contractivity in two complementary forms. The first is expressed in terms of the finite-time Lyapunov characteristic exponents and is akin in spirit to the first Lyapunov method. The second one is consonant with the second Lyapunov method and relies on existence of a Riemannian metric ensuring exponential decay of the metric-induced $d$-dimensional Hausdorff measure. To acquire monotone measure-theoretic-based Lyapunov functions, we introduce a family of Hausdorff-Riemann measures, which are elliptic, metric-dependent $d$-measures that strictly decrease along the trajectories and thus may serve as Lyapunov functions. These measures enable an anytime characterization of the rate of contraction and provide constructive tools for stability analysis and feedback design. To illustrate the applicability of the approach, we derive tractable criteria for orbital stability of periodic solutions of autonomous ODE's and employ several prototypical particular examples, including a rigid body with dissipation and constant torque, the Rössler system, and the Langford system.
Read the full abstract

Probability

An Euler scheme for McKean SDEs with Besov drift: convergence rate and implementation

We study a one-dimensional McKean-Vlasov stochastic differential equation (SDE) with a drift equal to a product of a distribution depending on the state of the process and a non-linear function depending pointwise on the law density of the solution. Building on recent well-posedness results, we propose the first implementable numerical scheme for this class of SDEs. Our approach combines mollification of the distributional drift with the Euler-Maruyama scheme and a PDE-based approximation of the law via the associated Fokker-Planck equation. We prove strong convergence of the scheme and derive an explicit rate, showing how to balance the smoothing parameter with the time discretisation. Numerical experiments confirm the applicability of our scheme and demonstrate the significant influence of the McKean interaction term on the law of the solution.
Read the full abstract

General Topology

Reeb spaces of smooth functions associated to globally similar graphs of smooth functions

Previously, we have investigated a natural smooth map onto the region surrounded by the graphs of two smooth real-valued functions in the plane converging to a same value or diverges to $+\infty$ or $-\infty$ simultaneously, at each infinity, and topological properties and combinatorial ones of its composition with the canonical projection. Here, we consider smooth functions with congruent or globally similar graphs instead. Here, the Reeb space of a smooth function on a manifold with no boundary is fundamental and important. This is the naturally topologized quotient space of the manifold, consisting of all connected components (contours) of the function and is a graph under a certain nice situation. Related studies also related to the present study were started due to interest of the author in theory of Reeb spaces of non-proper functions. For proper functions, in 2020s related studies have developed mainly due to Gelbukh and Saeki.
Read the full abstract

Combinatorics

Packing arithmetic progressions

Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$ denote the minimum length of an interval containing pairwise disjoint shifted copies of all members of the family $\mathcal{F}$. We study this parameter in the following two cases: for a fixed positive integer $n$, (1) each progression in $\mathcal{F}$ has the form $A_d=D_d\cap\{1,2,\ldots,n\}$, and (2) all progressions $A_d$ of $\mathcal{F}$ have the same size $n$, that is, $A_d=D_d\cap \{1,2,\ldots, nd\}$. We in particular derive the following asymptotic estimates. In case (1), when $k=n$, we get $m(\mathcal{F})=\Theta(n^{3/2}/\ln n)$. In case (2), when $k=n$, we get $m(\mathcal{F})=\Theta(n^3/\ln n)$, while if $k>k_0(n)$, then $m(\mathcal{F}) < 3kn$. In both cases we additionally determine $m(\mathcal{F})$ asymptotically or settle its order of magnitude for all $k<n$.
Read the full abstract

All authors Noga Alon, Michał Dębski, Jarosław Grytczuk, Jakub Przybyło

Optimization and Control

A non-autonomous center-stable set theorem for saddle avoidance in optimization

Optimization algorithms are unlikely to converge to strict saddle points. Proofs to that effect rely on the Center-Stable Manifold Theorem (CSMT), casting algorithms as dynamical systems: $x_{k+1} = g_k(x_k)$. In its standard form, the CSMT is limited to autonomous systems (the maps $g_k$ are all the same). To study algorithms such as gradient descent with non-constant step-size schedules, we need a non-autonomous CSMT. There are a few, but they are unable to handle, for example, vanishing step sizes. To cover such scenarios, we establish a new Center-Stable Set Theorem (CSST) for non-autonomous systems. We use it to prove saddle avoidance for gradient descent (Euclidean and Riemannian) and for the proximal point method, without assuming Lipschitz gradients or isolated saddles, and allowing vanishing step sizes.
Read the full abstract

Probability

Asymptotic Log-Harnack Inequality for Degenerate SPDEs with Reflection

By constructing a suitable coupling by change of measures, the asymptotic log- Harnack inequality is established for a class of degenerate SPDEs with reflection. This inequality implies the asymptotic heat kernel estimate, the uniqueness of the invariant probability measure, the asymptotic gradient estimate (hence, asymptotically strong Feller property), and the asymptotic irreducibility. As application, the main result is illustrated by d-dimensional degenerate stochastic Navie-Stokes equations with reflection, where the dissipative operator is the Dirichlet Laplacian with a power \theta \geq 1 \vee \frac{d+2}{4}, which includes the Laplacian when d \geq 2.
Read the full abstract

Combinatorics

Autocatalytic Cores in Reaction Networks with Explicit Catalysis

Autocatalytic cores are minimal units in reaction networks (RNs) responsible for the emergence of autocatalysis. In the absence of explicit catalysis, i.e., when an entity appears both as reactant and product in the same reaction, they are known to be encoded by square submatrices of the stoichiometric matrix whose columns can be reordered as an irreducible child-selection (CS) matrix with negative diagonal and nonnegative off-diagonal (Metzler matrix). In the bipartite Koenig graph representing the RN, these CS matrices can be identified by fluffles, i.e., strong blocks with an identical number of entity and reaction vertices that have out- and in-degree 1, respectively. Here, we adapt the concepts derived for autocatalytic cores to RNs with explicitly catalyzed reactions, which emerge as digons, i.e., elementary circuits in the Koenig graph of length 2. In this setting, we confirm that an inspection of the stoichiometric matrix alone is inconclusive concerning the presence and number of autocatalytic cores, requiring a more delicate algebraic analysis. Nevertheless, this generalization preserves both the graph and the matrix representation as fluffles and irreducible Metzler CS matrices, respectively, although the diagonal is no longer necessarily strictly negative. We introduce the notion of hard autocatalytic cores, i.e. those that do not yield other autocatalytic cores upon inclusion of all reverse reactions. Finally, we consider the case of unit stoichiometries and show that each autocatalytic core can be constructed as the superposition of at most 2 elementary circuits. In particular, autocatalytic cores involving explicitly catalyzed reactions always contain a spanning subgraph consisting of a single elementary circuit together with a simple entity-to-reaction chord. Moreover, we identify the essentially unique example for which at least two circuits are required.
Read the full abstract

All authors Richard Golnik, Thomas Gatter, Peter F. Stadler, Nicola Vassena

Differential Geometry

A proof for the Riemannian positive mass theorem up to dimension 19

In this paper, we prove the Riemannian positive mass theorem up to dimension $19$, building on a combination of torical symmetrization and the singularity blow-up technique developed in [HSY26], together with the generic regularity theory for area-minimizing hypersurfaces established in [CMS23, CMSW25]. Similar ideas are also employed to investigate the Geroch conjecture up to dimension $12$.
Read the full abstract

All authors Yuchen Bi, Tianze Hao, Shihang He, Yuguang Shi, Jintian Zhu

Numerical Analysis

Local Relaxation Fast Poisson Methods on Hierarchical Meshes

The local relaxation algorithm is promising for fast solution of Poisson's equations, which computes the electric field distribution in a stepwise manner via local curl-free updates while strictly enforcing Gauss's law. We propose a novel hierarchical local relaxation (HLR) method for speeding up the convergence of curl-free iterations. The local algorithm reformulates the Poisson's equation into the electric-field form and sweeps each cell to minimize the associate electric energy, avoiding the solution of linear systems. The updates with hierarchical meshes significantly accelerate the slow convergence of low-frequency components of the residual in the local curl-free update process. Convergence analysis is performed to obtain the convergence of the hierarchical relaxation approaches. Numerical results show that the HLR methods have the nice properties in accuracy and efficiency and the hierarchical construction leads to an overall computational complexity of $\mathcal{O}(N\log N)$ with respect to the number of grid points. Particularly, the applications in solving the Poisson–Boltzmann and Poisson–Nernst–Planck equations demonstrate the attractive performance for problems which frequently solve the Poisson's equations.
Read the full abstract

Differential Geometry

Quaternionic complex manifolds and fixed-point sets of $S^{1}$-actions

In this paper, we study fixed-point sets of $S^{1}$-actions and compatible complex structures on quaternionic manifolds. We obtain an equation involving the first Chern classes of the fixed-point set and of a quaternionically flat manifold with compatible complex structure of closed type. In addition, if the first Chern class of the fixed-point set is not trivial, then the quaternionic manifold does not admit hypercomplex structures containing given compatible complex structure on any open set containing the fixed-point set. Moreover, we determine the connected components of the fixed-point set arising from quaternionic $S^{1}$-actions on the quaternionic projective space. We apply these results to Pontecorvo's example $\mathrm{SO}^{\ast}(2n+2)/\mathrm{SO}^{\ast}(2n) \times \mathrm{SO}^{\ast}(2)$.
Read the full abstract

Information Theory

Shatter Throughput Ceilings: Leveraging Reflection Surfaces to Enhance Transmissions for Vehicular Fast Data Exchange

Rapid emergence of smart mobility necessitates high-volume bursty data transmission over a single link between a target vehicle and its designated edge computing-enabled Base Station (BS) or Roadside Unit (RSU), which must be completed within a short time period when the vehicle traverses the coverage area. However, in bandwidth-limited scenarios, conventional communication systems face a fundamental throughput ceiling at each single vehicle. This limitation persists even when all time-frequency resources are allocated to a single vehicle, as the underlying channel lacks sufficient spatial diversity to support higher data rates. To break this throughput ceiling, in this paper, we propose a novel reflection-enhanced transmission framework by strategically employing dedicated specular reflecting surfaces along roadways to proactively augment the transmission environments. This setup concentrates dispersed signals from multiple directions toward a target vehicle, analogous to the light-focusing effect of a concave magnifying lens, thereby enhancing the spatial diversity and achievable rank of an individual channel. This allows a BS to allocate more transmission layers to one single user, consequently significantly raising the throughput ceiling for individual vehicles. Moreover, we also introduce dynamic virtualization methods for reflecting panel patch groups, compatible with existing communication systems, to flexibly manage interference with other coexisting users. Furthermore, collaborative rotation among multiple reflecting panels is introduced to enhance signal concentration. Finally, the schematic effectiveness is rigorously validated through 3GPP-compliant system-level simulations, demonstrating significant throughput boosts.
Read the full abstract

All authors Qianyao Ren, Qingxiao Huang, Yiqin Deng, Xianhao Chen, Phone Lin, Yuguang Fang

Algebraic Geometry

Algebraic integrable connections with bounded irregularity

We study the boundedness of families of algebraic flat connections with bounded irregularity. As an application, we study the boundedness of families of holonomic $D$-modules with dominated characteristic cycles.