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)

Thursday 19 February

Mathematical Physics · Cross-listed from hep-th

Non-BPS Monopoles and Dyons via Resurgent Transseries

Radially symmetric non-BPS 't Hooft-Polyakov monopoles and dyons are constructed as resurgent transseries: infinite sums of exponentially decaying terms, each multiplied by a factorially divergent fluctuation factor. All higher exponential terms are explicitly expressed in terms of the leading order solutions. In the BPS limit all fluctuation terms truncate.
Read the full abstract

Probability

Non-equilibrium functional inequalities for finite Markov chains

Functional inequalities such as the Poincaré and log-Sobolev inequalities quantify convergence to equilibrium in continuous-time Markov chains by linking generator properties to variance and entropy decay. However, many applications, including multiscale and non-reversible dynamics, require analysing probability measures that are not at equilibrium, where the classical theory tied to steady states no longer applies. We introduce generalised versions of these inequalities for arbitrary positive measures on a finite state space, retaining key structural properties of their classical counterparts. In particular, we prove continuity of the associated constants with respect to the reference measure and establish explicit positive lower bounds. As an application, we derive quantitative coarse-graining error estimates for non-reversible Markov chains, both with and without explicit scale separation, and propose a quantitative criterion for assessing the quality of coarse-graining maps.
Read the full abstract

Optimization and Control

Optimal control of stochastic Volterra integral equations with completely monotone kernels and stochastic differential equations on Hilbert spaces with unbounded control and diffusion operators

The dynamic programming approach is one of the most powerful ones in optimal control. However, when dealing with optimal control problems of stochastic Volterra integral equations (SVIEs) with completely monotone kernels, deep mathematical difficulties arise and it is still not understood. These very classical problems have applications in most fields and have now become even more popular due to their applications in mathematical finance under rough volatility. In this article, we consider a class of optimal control problems of SVIEs with completely monotone kernels. Via a recent Markovian lift \cite{FGW2024}, the problem can be reformulated as an optimal control problem of stochastic differential equations (SDEs) on suitable Hilbert spaces, which due to the roughness of the kernel, presents a generator of an analytic semigroup and unbounded control and diffusion operators. This analysis leads us to study a general class of optimal control problems of abstract SDEs on Hilbert spaces with unbounded control and diffusion operators. This class includes optimal control problems of SVIEs with completely monotone kernels, but it is also motivated by other models. We analyze the regularity of the associated Ornstein-Uhlenbeck transition semigroup. We prove that the semigroup exhibits a new smoothing property in control directions through a general observation operator $\Gamma$, which we call $\Gamma$-smoothing. This allows us to establish existence and uniqueness of mild solutions of the Hamilton-Jacobi-Bellman equation, establish a verification theorem, and construct optimal feedback controls. We apply these results to optimal control problems of SVIEs with completely monotone kernels. To the best of our knowledge these are the first results of this kind for this abstract class of infinite dimensional problems and for the optimal control of SVIEs with completely monotone kernels.
Read the full abstract

Analysis of PDEs

On putative self-similarity for incompressible 3D Euler

We consider hypothetical solutions of 3D Euler which blow up in finite time in a self-similar fashion. We prove that if the initial data has finite kinetic energy, then the similarity exponent $\gamma$ which governs the rate of zooming in must be at least $2/5$. If a smooth globally self-similar blowup profile exists, and this profile satisfies an outgoing property, we prove that $\gamma \geq 1/2$. For axisymmetric solutions, we establish the bound $\gamma\geq 1/2$ under the sole assumption that the velocity profile is $C^2$ smooth.
Read the full abstract

Combinatorics

Canonical labelling of random regular graphs

We prove that whenever $d=d(n)\to\infty$ and $n-d\to\infty$ as $n\to\infty$, then with high probability for any non-trivial initial colouring, the colour refinement algorithm distinguishes all vertices of the random regular graph $\mathcal{G}_{n,d}$. This, in particular, implies that with high probability $\mathcal{G}_{n,d}$ admits a canonical labelling computable in time $O(\min\{n^{\omega},nd^2+nd\log n\})$, where $\omega<2.372$ is the matrix multiplication exponent.
Read the full abstract

All authors Mikhail Isaev, Tamás Makai, Brendan McKay, Pawel Pralat, Jane Tan, Maksim Zhukovskii

Statistics Theory

Optimal Unconstrained Self-Distillation in Ridge Regression: Strict Improvements, Precise Asymptotics, and One-Shot Tuning

Self-distillation (SD) is the process of retraining a student on a mixture of ground-truth labels and the teacher's own predictions using the same architecture and training data. Although SD has been empirically shown to often improve generalization, its formal guarantees remain limited. We study SD for ridge regression in unconstrained setting in which the mixing weight $\xi$ may be outside the unit interval. Conditioned on the training data and without any distributional assumptions, we prove that for any squared prediction risk (including out-of-distribution), the optimally mixed student strictly improves upon the ridge teacher for every regularization level $\lambda > 0$ at which the teacher ridge risk $R(\lambda)$ is nonstationary (i.e., $R'(\lambda) \neq 0$). We obtain a closed-form expression for the optimal mixing weight $\xi^\star(\lambda)$ for any value of $\lambda$ and show that it obeys the sign rule: $\operatorname{sign}(\xi^\star(\lambda))=-\operatorname{sign}(R'(\lambda))$. In particular, $\xi^\star(\lambda)$ can be negative, which is the case in over-regularized regimes. To quantify the risk improvement due to SD, we derive exact deterministic equivalents for the optimal SD risk in the proportional asymptotics regime (where the sample and feature sizes $n$ and $p$ both diverge but their aspect ratio $p/n$ converges) under general anisotropic covariance and deterministic signals. Our asymptotic analysis extends standard second-order ridge deterministic equivalents to their fourth-order analogs using block linearization, which may be of independent interest. From a practical standpoint, we propose a consistent one-shot tuning method to estimate $\xi^\star$ without grid search, sample splitting, or refitting. Experiments on real-world datasets and pretrained neural network features support our theory and the one-shot tuning method.
Read the full abstract

Dynamical Systems

On the Linearization of Flat Multi-Input Systems via Prolongations

We examine when differentially flat nonlinear control systems with more than two inputs can be rendered static feedback linearizable by a minimal number of prolongations of suitably chosen inputs after applying a static input transformation. We derive sufficient conditions that guarantee such prolongations yield a static feedback linearizable system. For $(x,u)$-flat two-input systems, prior work established precise links between the relative degrees, the highest derivative orders occurring in the flat parameterization, and the minimal dimension of a linearizing dynamic extension, leading to necessary and sufficient criteria for flatness of systems that become static feedback linearizable after at most two prolongations of such suitably chosen inputs. Building on the structure of the time derivatives of a flat output, this work extends this analysis to systems with three inputs.
Read the full abstract

Mathematical Physics

Prefactorization algebras for the conformal Laplacian: Central charge and Hilbert Fock space

Let $d \geq 2$. We consider the symmetric monoidal category of oriented Riemannian $d$-manifolds with conformal open embeddings. The prefactorization algebra associated with the conformal Laplacian defines a symmetric monoidal functor from this category to real vector spaces. For Euclidean domains $U\subset\mathbb{R}^d$, the value of this functor is identified, via the Green function, with the symmetric algebra on the topological dual of the space of harmonic functions. For $d \geq 3$ this identification is natural under all conformal transformations, while in dimension two, its failure of naturality is governed by a harmonic cocycle, which gives rise to the Virasoro central charge. For the unit disk, the resulting vector space carries an algebra structure over the operad of conformal disk embeddings and admits a canonical dense embedding into the Hilbert Fock space. In dimension two, this statement holds after restricting to a codimension-one subspace, as suggested by logarithmic CFT.
Read the full abstract

Optimization and Control

Adaptive Decentralized Composite Optimization via Three-Operator Splitting

The paper studies decentralized optimization over networks, where agents minimize a sum of locally smooth (strongly) convex losses and plus a nonsmooth convex extended value term. We propose decentralized methods wherein agents adaptively adjust their stepsize via local backtracking procedures coupled with lightweight min-consensus protocols. Our design stems from a three-operator splitting factorization applied to an equivalent reformulation of the problem. The reformulation is endowed with a new BCV preconditioning metric (Bertsekas-O'Connor-Vandenberghe), which enables efficient decentralized implementation and local stepsize adjustments. We establish robust convergence guarantees. Under mere convexity, the proposed methods converge with a sublinear rate. Under strong convexity of the sum-function, and assuming the nonsmooth component is partly smooth, we further prove linear convergence. Numerical experiments corroborate the theory and highlight the effectiveness of the proposed adaptive stepsize strategy.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

genriesz: A Python Package for Automatic Debiased Machine Learning with Generalized Riesz Regression

Efficient estimation of causal and structural parameters can be automated using the Riesz representation theorem and debiased machine learning (DML). We present genriesz, an open-source Python package that implements automatic DML and generalized Riesz regression, a unified framework for estimating Riesz representers by minimizing empirical Bregman divergences. This framework includes covariate balancing, nearest-neighbor matching, calibrated estimation, and density ratio estimation as special cases. A key design principle of the package is automatic regressor balancing (ARB): given a Bregman generator $g$ and a representer model class, genriesz} automatically constructs a compatible link function so that the generalized Riesz regression estimator satisfies balancing (moment-matching) optimality conditions in a user-chosen basis. The package provides a modulr interface for specifying (i) the target linear functional via a black-box evaluation oracle, (ii) the representer model via basis functions (polynomial, RKHS approximations, random forest leaf encodings, neural embeddings, and a nearest-neighbor catchment basis), and (iii) the Bregman generator, with optional user-supplied derivatives. It returns regression adjustment (RA), Riesz weighting (RW), augmented Riesz weighting (ARW), and TMLE-style estimators with cross-fitting, confidence intervals, and $p$-values. We highlight representative workflows for estimation problems such as the average treatment effect (ATE), ATE on treated (ATT), and average marginal effect estimation. The Python package is available at https://github.com/MasaKat0/genriesz and on PyPI.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Scattering in Instanton Backgrounds

In this letter we evaluate one-loop all-plus gluon amplitudes of $\mathrm{SU}(N_c)$ gauge theory with $N_f$ fundamental fermions in the presence of a flavour instanton background. Fermion zero modes are regulated with a chiral mass term. This computation is performed by cancelling a twistorial 't Hooft anomaly via the Green-Schwarz mechanism. We find that the trace-ordered amplitude has the form of a Parke-Taylor factor multiplied by the Fourier transform of the instanton density evaluated on the total momentum of the gluons. A background flavour instanton modifies the leading soft gluon and photon theorem, generating a level equal to twice the instanton charge in the soft Kac-Moody symmetry. We discuss the implications of our results for amplitudes in the presence of dynamical instantons.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Variational inference via radial transport

In variational inference (VI), the practitioner approximates a high-dimensional distribution $\pi$ with a simple surrogate one, often a (product) Gaussian distribution. However, in many cases of practical interest, Gaussian distributions might not capture the correct radial profile of $\pi$, resulting in poor coverage. In this work, we approach the VI problem from the perspective of optimizing over these radial profiles. Our algorithm radVI is a cheap, effective add-on to many existing VI schemes, such as Gaussian (mean-field) VI and Laplace approximation. We provide theoretical convergence guarantees for our algorithm, owing to recent developments in optimization over the Wasserstein space–the space of probability distributions endowed with the Wasserstein distance–and new regularity properties of radial transport maps in the style of Caffarelli (2000).
Read the full abstract

All authors Luca Ghafourpour, Sinho Chewi, Alessio Figalli, Aram-Alexandre Pooladian

Analysis of PDEs

An $L^p$-$L^{p'}$ Carleman inequality for $p=\frac{2n}{n+2}$

In this note, by refining the proof of the Carleman inequality obtained by Dos Santos, Kenig, and Salo in 2013, we establish a new $L^p$-$L^{p'}$ Carleman inequality.

Numerical Analysis

Computing the action of a matrix exponential on an interval via the $\star$-product approach

We present a new method for computing the action of the matrix exponential on a vector, \( e^{At}v \). The proposed approach efficiently evaluates the solution for all \( t \) within a prescribed bounded interval by expanding it into an orthogonal polynomial series. This method is derived from a new representation of the matrix exponential in the so-called \(\star\)-algebra, an algebra of bivariate distributions. The resulting formulation leads to a linear system equivalent to a matrix equation of Stein type, which can be solved by either direct or Krylov subspace methods. Numerical experiments demonstrate the accuracy and efficiency of the proposed approach in comparison to state-of-the-art techniques.
Read the full abstract

Numerical Analysis

High Order semi-implicit Rosenbrock type and Multistep methods for evolutionary partial differential equations with higher order derivatives

The aim of this work is to apply a semi-implicit (SI) strategy within a Rosenbrock-type and IMEX linear multistep (LM) framework to a sequence of 1D time-dependent partial differential equations (PDEs) with high order spatial derivatives. This strategy provides great flexibility to treat these equations, and allows the construction of simple lienarly implicit schemes without any Newton iteration. Furthermore, the SI schemes so designed do not require the severe time-step restrictions typically encountered when using explicit methods for stability, i.e., $\Delta t = \mathcal{O}(\Delta x^k)$ for the $k$-th order PDEs with $k\ge 2$. For space discrertization, this strategy is combined with finite difference schemes. We provide example of methods up to order $p = 4$, and we illustrate the effectiveness of the schemes with appllications to dissipative, dispersive, and biharmonic-type equations. Numerical experiments show that the proposed schemes are stable and achieve the expected orders of accuracy.
Read the full abstract

Dynamical Systems

Scattering in the Positive Energy Isosceles Three-Body Problem

In the three-body problem with positive energy, solutions which avoid triple collision have the property that the size of the triangle formed by the bodies tends to infinity as $t\rightarrow \pm\infty$. Furthermore, the triangles have well-defined asymptotic shapes $s_\pm$. The scattering problems asks which asymptotic shape $s_+$ can occur for a given choice of $s_-$. Previous work shows that this can be viewed as the problem of finding heteroclinic orbits connecting equilibrium points on a boundary manifold “at infinity” and some results were obtained for solutions which avoid collisions. The goal of this paper is to study the scattering effect of binary and near-triple collisions in a simple setting – the isosceles three-body problem. The details depend on the mass parameters but in many cases, a fixed isosceles initial shape $s_-$ scatters to essentially all possible isosceles shapes $s_+$.
Read the full abstract

Differential Geometry

A Lower Bound for the First Non-zero Basic Eigenvalue on a Singular Riemannian Foliation

In the paper, we provide a lower bound of the first non-zero basic eigenvalue on a closed singular Riemannian manifold $(M^n,\mathcal{F})$ having basic mean curvature that depends on the given lower bound of the Ricci curvature $Ric(M)\geq (n-1)K$ and the diameter of the leaf space $d_{M/\mathcal{F}}$. For foliations given by points, the results cover estimates of the first non-zero eigenvalues lower bounds, which are Zhong-Yang estimate, Yang estimate and Shi-Yang estimate. We also show a rigidity result that corresponds to the case of $Ric(M)\geq 0$. This is a generalization of Hang-Wang rigidity, which is the equality case of Zhong-Yang estimate.
Read the full abstract

Probability

An Allen-Cahn equation with jump-diffusion noise for biological damage and repair processes

This paper analyzes a stochastic Allen–Cahn equation for the dynamics of biomolecular damage and repair. The system is driven by two distinct noise processes: a multiplicative cylindrical Wiener process, modeling continuous background stochastic fluctuations, and a jump-type noise, modeling the abrupt, localized damage induced by external shocks. The drift of the equation is singular and covers the typical logarithmic Flory-Huggins potential required in phase-separation dynamics. We prove well-posedness of the model in a strong probabilistic sense, and analyze its long-time behavior in terms of existence and uniqueness of invariant measures, ergodicity, and mixing properties. Eventually, we present an Euler–Maruyama scheme to simulate the model and illustrate how it captures fundamental biological phenomena, such as damage clustering, stress-induced topology perturbations, and damage dynamics.
Read the full abstract

All authors Andrea Di Primio, Marvin Fritz, Luca Scarpa, Margherita Zanella

Numerical Analysis

Functional Analysis and Parallel Domain Decomposition for the TV-Stokes Model

The TV-Stokes model is a two-step variational method for image denoising that combines the estimation of a divergence-free tangent field with total variation regularization in the first step and then uses that to reconstruct the image in the second step. Although effective in practice, its mathematical structure and potential for parallelization have remained unexplored. In this work, we establish a rigorous functional-analytic foundation for the TV-Stokes model. We formulate both steps in appropriate infinite-dimensional function spaces, derive their dual formulations, and analyze the compatibility and mathematical consistency of the coupled system. In particular, we identify analytical inconsistencies in the original formulation and demonstrate how an alternative model resolves them. We also examine the orthogonal projection onto the divergence-free subspace, proving its existence in a continuous setting and establishing consistency with its discrete counterpart. Building on this theoretical framework, we develop the first domain decomposition method for TV-Stokes by applying overlapping Schwarz-type iterations to the duals of both steps. Although the divergence-free constraint gives rise to a global projection operator in the continuous model, we show that it becomes locally computable in the discrete setting. This insight enables a fully parallelizable algorithm suitable for large-scale image processing in memory-constrained environments. Numerical experiments demonstrate the correctness of the domain decomposition approach and its usability in parallel image reconstruction.
Read the full abstract

All authors Andreas Langer, Marc Runft, Talal Rahman, Xue-Cheng Tai, Bin Wu

Mathematical Physics · Cross-listed from quant-ph

Phase transitions in quasi-Hermitian quantum models at exceptional points of order four

Quantum phase transition is interpreted as an evolution, at the end of which a parameter-dependent Hamiltonian $H(g)$ loses its observability. In the language of mathematics, such a quantum catastrophe occurs at an exceptional point of order $N$ (EPN). Although the Hamiltonian $H(g)$ itself becomes unphysical in the limit of $g \to g^{EPN}$, it is shown that it can play the role of an unperturbed operator in a perturbation-approximation analysis of the vicinity of the EPN singularity. Such an analysis is elementary at $N\leq 3$ and numerical at $N\geq 5$, so we pick up $N=4$. We demonstrate that the specific EP4 degeneracy becomes accessible via a unitary evolution process realizable inside a parametric domain ${\cal D}_{\rm physical}$, the boundaries of which are determined non-numerically. Possible relevance of such a mathematical result in the context of non-Hermitian photonics is emphasized.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Linear Convergence in Games with Delayed Feedback via Extra Prediction

Feedback delays are inevitable in real-world multi-agent learning. They are known to severely degrade performance, and the convergence rate under delayed feedback is still unclear, even for bilinear games. This paper derives the rate of linear convergence of Weighted Optimistic Gradient Descent-Ascent (WOGDA), which predicts future rewards with extra optimism, in unconstrained bilinear games. To analyze the algorithm, we interpret it as an approximation of the Extra Proximal Point (EPP), which is updated based on farther future rewards than the classical Proximal Point (PP). Our theorems show that standard optimism (predicting the next-step reward) achieves linear convergence to the equilibrium at a rate $\exp(-\Theta(t/m^{5}))$ after $t$ iterations for delay $m$. Moreover, employing extra optimism (predicting farther future reward) tolerates a larger step size and significantly accelerates the rate to $\exp(-\Theta(t/(m^{2}\log m)))$. Our experiments also show accelerated convergence driven by the extra optimism and are qualitatively consistent with our theorems. In summary, this paper validates that extra optimism is a promising countermeasure against performance degradation caused by feedback delays.
Read the full abstract

Functional Analysis

On the three space property for $C(K)$-spaces

Assuming $\mathfrak p=\mathfrak c$, we show that for every Eberlein compact space $L$ of weight $\mathfrak c$ there exists a short exact sequence $0\to c_0\to X\to C(L)\to 0$, where the Banach space $X$ is not isomorphic to a $C(K)$-space.

Statistics Theory

Support Recovery and $\ell_2$-Error Bound for Sparse Regression with Quadratic Measurements via Weakly-Convex-Concave Regularization

The recovery of unknown signals from quadratic measurements finds extensive applications in fields such as phase retrieval, power system state estimation, and unlabeled distance geometry. This paper investigates the finite sample properties of weakly convex–concave regularized estimators in high-dimensional quadratic measurements models. By employing a weakly convex–concave penalized least squares approach, we establish support recovery and $\ell_2$-error bounds for the local minimizer. To solve the corresponding optimization problem, we adopt two proximal gradient strategies, where the proximal step is computed either in closed form or via a weighted $\ell_1$ approximation, depending on the regularization function. Numerical examples demonstrate the efficacy of the proposed method.
Read the full abstract

All authors Jun Fan, Jingyu Yang, Xinyu Zhang, Liqun Wang

Combinatorics

Uniform Set Systems with Uniform Witnesses

Frankl–Pach and Erdős conjectured that any $(d+1)$-uniform set family $\mathcal{F}\subseteq \binom{[n]}{d+1}$ with VC-dimension at most $d$ has size at most $\binom{n-1}{d}$ when $n$ is sufficiently large. Ahlswede and Khachatrian showed that the conjecture is false by giving a counterexample of size $\binom{n-1}{d}+\binom{n-4}{d-2}$. For a set family $\mathcal{F}\subseteq \binom{[n]}{d+1}$, the condition that its VC-dimension is at most $d$ can be reformulated as follows: for any $F\in\mathcal{F}$, there exists a set $B_F\subseteq F$ such that $F\cap F'\neq B_F$ for all $F'\in\mathcal{F}$. In this direction, the first author, Xu, Yip, and Zhang conjectured that the bound $\binom{n-1}{d}$ holds if we further assume that $|B_F|=s$ for every $F\in \mathcal{F}$ and for some fixed $0\leq s\leq d$. The case $s=0$ is exactly the Erdős–Ko–Rado theorem, and the cases $s\in \{1,d\}$ were proved in the paper by the first author, Xu, Yip, and Zhang. In this short note, we show that the conjecture holds when $s\leq d/2$, and the maximal constructions are stars. Moreover, we construct non-star set families of size $\binom{n-1}{d}$ satisfying the condition for $d/2<s\leq d-1$, which suggests that the problem is substantially different in these cases.
Read the full abstract

Analysis of PDEs

Construction of two-bubble blow-up solutions for the mass-critical gKdV equations

For the mass-critical generalized Korteweg-de Vries equation, $$ \partial_{t}u+\partial_{x}\left( \partial_{x}^{2}u+u^{5}\right)=0,\quad (t,x)\in [0,\infty)\times \mathbb{R}.$$ We prove the existence of a global solution that blows up in infinite time and approaches the sum of two decoupled bubbles with opposite signs. The proof is inspired by the techniques developed for the two-dimensional mass-critical NLS equation in a similar context by Martel-Raphaël [37]. The main difficulty originates from the fact that the unstable directions related to scaling are excited by the nonlinear interactions. To overcome this difficulty, a refined approximate solution that involves some non-localized profiles is needed. In particular, a sharp understanding for the interactions between solitons and such profiles is also required.
Read the full abstract

Algebraic Geometry

Dimension of fixed loci of diagonalizable groups via algebraic cobordism

We determine all restrictions on the dimension of the fixed locus of a diagonalizable group acting on a smooth projective variety that arise from the Chern numbers of the ambient variety. We reduce the problem to finding lower bounds for actions of p-groups, which we achieve by analyzing the equivariant cobordism ring with the help of the concentration theorem. To do so, we construct enough explicit examples of actions that realize the expected lower bound. We then prove that this family is maximal in the equivariant cobordism ring, in an appropriate sense.
Read the full abstract

Optimization and Control

A variational mean field game of controls with free final time and pairwise interactions

This article considers a mean field game model inspired by crowd motion models in which agents aim at reaching a given target set and wish to minimize a cost consisting of an individual running cost, an individual cost depending on the arrival time at the target set, and an interaction running cost, which takes the form of pairwise interactions with other agents through both positions and velocities. We subsume this game under a more general class of games on abstract Polish spaces with pairwise interactions, and prove that the latter games have a variational structure (in the sense that their equilibria can be characterized as critical points of some potential functional) and admit equilibria. We also discuss two a priori distinct notions of equilibria, providing a sufficient condition under which both notions coincide. The results for the games in abstract Polish spaces are applied to our mean field game model, and a numerical illustration concludes the paper.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CD

Design of low-energy transfers in cislunar space using sequences of lobe dynamics

Dynamical structures in the circular restricted three-body problem (CR3BP) are fundamental for designing low-energy transfers, as they aid in analyzing phase space transport and designing desirable trajectories. One of these dynamical structures, lobe dynamics, can be exploited to achieve local chaotic transport around celestial bodies. This study proposes and fully validates a systematic method for designing low-energy transfers by combining multiple sequences of lobe dynamics, building upon the authors' prior preliminary framework. A graph-based framework is developed to explore possible transfer paths between departure and arrival orbits, reducing the complexity of the combinatorial optimization problem for fuel-efficient transfer design. Using this graph, low-energy transfer trajectories are constructed by connecting chaotic orbits within lobes. The resulting optimal trajectory in the Earth–Moon CR3BP is then converted into an optimal transfer in the bicircular restricted four-body problem via multiple shooting. This transfer is compared with existing optimal solutions to demonstrate the effectiveness of the proposed method.
Read the full abstract

All authors Naoki Hiraiwa, Mai Bando, Yuzuru Sato, Shinji Hokamoto

Probability

Banach fixed point and flow approach for rough analysis

In this paper, we show that the main algebraic assumption required to perform a fixed point argument for rough differential equations implies the algebraic assumption for the Bailleul flow approach. This assumption requires that the rough path associated with the equation is given by a Hopf algebra whose coproduct admits a cocycle and has a tree-like basis. We show that the Hopf algebra of multi-indices does not satisfy the cocycle condition. This is a rigorous result on the impossibility, observed in practice, of performing a fixed point argument for multi-indices rough paths and multi-indices in Regularity Structures.
Read the full abstract

All authors Yvain Bruned, Yingtong Hou, Paul Laubie, Zhicheng Zhu

Geometric Topology

A $y$-ification of Khovanov homology

Motivated by the $y$-ification of HOMFLY–PT homology by Gorsky and Hogancamp, and the $\mathfrak{sl}_2$-action of Gorsky, Hogancamp, and Mellit, we construct $y$-ifications of Khovanov homology and its equivariant versions within Bar-Natan's framework for tangles, and define an action of the element $e$ in $\mathfrak{sl}_2$ on these $y$-ifications. We then prove that our construction is compatible with the previous ones under Rasmussen's spectral sequence from HOMFLY–PT homology to Khovanov homology. Our construction is elementary and well suited to diagrammatic manipulations and algorithmic implementations. As a result, we verify directly that these additional structures distinguish pairs of knots with identical Khovanov homology and HOMFLY–PT homology, in particular the Conway knot and the Kinoshita–Terasaka knot.
Read the full abstract