Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 31 March

Combinatorics

A short proof of a perturbation inequality for the spectral radius

Let $G$ be a simple graph, and denote by $\lambda(G)$ its spectral radius. Sun and Das (2020) established that for any non-isolated vertex $v$ with degree $d(v)$, \[ \lambda(G)\leq \sqrt{\lambda(G-v)^2 + 2d(v) - 1}, \] which is a conjecture original posed by Guo, Wang, and Li (2019). Sun and Das's proof uses several tools from spectral graph theory. In this short note, we provide a concise and self-contained proof of this inequality using matrix analysis.
Read the full abstract

Optimization and Control

Convergence analysis of dynamical systems for optimization by an improved Lyapunov framework

We study the convergence analysis of continuous-time dynamical systems associated with optimization methods for strongly convex functions. Recent works have proposed systematic constructions of Lyapunov functions for such analysis, while also revealing limitations of the Lyapunov analysis. Aujol–Dossal–Rondepierre (2023) have proposed a technique to address this issue by reorganizing Lyapunov functions so as to evaluate a quantity $f(x(t)) - f_* - g(t)\|x(t)-x_*\|^2$ rather than $f(x(t)) - f_*$. By combining this technique with our computer-assisted framework to discover Lyapunov functions, we develop an improved method that reproduces an existing convergence rate or yields better rates than previous studies.
Read the full abstract

Analysis of PDEs

Blowing-up solutions to a critical 4D Neumann system in a competitive regime

We build blowing-up solutions to the critical elliptic system with Neumann boundary condition, \begin{equation*} \begin{cases} -\Delta u_1 + \lambda u_1 = u_1^{3} -\beta u_1u_2^2 & \text{in } \Omega, -\Delta u_2 + \lambda u_2 = u_2^{3} -\beta u_1^2u_2 & \text{in } \Omega, \frac{\partial u_1}{\partial\nu} = \frac{\partial u_2}{\partial\nu} = 0, & \text{on } \partial \Omega, \end{cases} \end{equation*} when $\lambda>0$ is sufficiently large in a competitive regime (i.e. $ \beta>0$) and in a domain $\Omega\subset\mathbb R^4$ with smooth protrusions.
Read the full abstract

Geometric Topology

Detecting non-admissibility of quandles via colorings

A quandle is an algebraic system whose axioms are motivated by Reidemeister moves in knot theory. A typical example is a conjugation quandle arising from a group. A quandle is said to be admissible if it is isomorphic to a conjugation quandle. Admissible quandles often yield knot invariants that coincide with those derived from the knot group, whereas nonadmissible quandles may produce genuinely new invariants. In this sense, it is important to construct non-admissible quandles. In this paper, we provide criteria for determining whether given quandles are admissible by colorings of (1, 1)-tangles. As an application, we construct numerous examples of non-admissible quandles by analyzing simple tangles obtained from the Hopf link and the trefoil knot.
Read the full abstract

Algebraic Topology

Nielsen coincidence theory for $(n,1)$-valued pairs

We generalise Nielsen theory to coincidences of pairs $(f,g)$ where $f:X\multimap Y$ is $n$-valued multimap and $g:X\to Y$ is a single-valued map, for $X$ and $Y$ closed oriented triangulable manifolds of equal dimension. We prove a Wecken theorem in this setting, and formulas for the Nielsen, Lefschetz and Reidemeister numbers in terms of the analogous invariants for single-valued maps. If $X$ and $Y$ are orientable infra-nilmanifolds, we derive explicit formulas in terms of the fundamental group morphisms of $f$ and $g$.
Read the full abstract

Differential Geometry

Moduli spaces of contact instantons on Sasakian 5-manifolds with transverse Calabi-Yau structures and orbifold K3 surfaces

We study anti-self-dual contact instantons on 5-dimensional Sasakian manifolds with transverse Calabi-Yau structures. In this case, the leaf space is a Calabi-Yau orbifold, and the moduli space of irreducible anti-self-dual contact instantons is a hyperkahler manifold. Using the singularity data of the leaf spaces, we prove that the transverse Levi-Civita connection gives an irreducible anti-self-dual contact instanton in the case when the leaf space is one of the 95 orbifold $K3$ surfaces classified by Reid. Moreover, we compute explicitly the complex dimension of the corresponding moduli spaces in all 95 cases.
Read the full abstract

Group Theory

An answer regarding automorphisms of finite abelian groups

In this note we provide a negative answer to the question: “Is it true that for every positive rational number $r$ there exists a finite abelian group $G$ such that $|\mathrm{Aut}(G)|/|G| = r$?". We show that if $r = a/b$ is a rational number (with $a$ and $b$ coprime integers) so that $r = |\mathrm{Aut}(G)|/|G|$ for a finite abelian group $G$, then $b$ is squarefree. We also show that no odd prime can equal $ |\mathrm{Aut}(G)|/|G|$ for a finite abelian group $G$.
Read the full abstract

Number Theory

On new identities connecting Ramanujan-Göllnitz-Gordon continued fraction and Ramanujan's continued fraction of order four

By employing the classical tools from the theory of $q$-series and theta functions, new fascinating identities on different continued fractions can be achieved. In this article, we use the product expansion of Jacobi's theta function to establish identities that connect Ramanujan-Göllnitz-Gordon continued fraction with Ramanujan's continued fraction of order four. Also, we obtain Lambert series identities using Ramanujan's $_1 \psi_1$ summation formula.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Receding-Horizon Policy Gradient for Polytopic Controller Synthesis

We propose the Polytopic Receding-Horizon Policy Gradient (P-RHPG) algorithm for synthesizing Parallel Distributed Compensation (PDC) controllers via Tensor Product (TP) model transformation. Standard LMI-based PDC synthesis grows increasingly conservative as model fidelity improves; P-RHPG instead solves a finite-horizon integrated cost via backward-stage decomposition. The key result is that each stage subproblem is a strongly convex quadratic in the vertex gains, a consequence of the linear independence of the HOSVD weighting functions, guaranteeing a unique global minimizer and linear convergence of gradient descent from any initialization. With zero terminal cost, the optimal cost increases monotonically to a finite limit and the gain sequence remains bounded; terminal costs satisfying a mild Lyapunov condition yield non-increasing convergence. Experiments on an aeroelastic wing benchmark confirm convergence to a unique infinite-horizon optimum across all tested terminal cost choices and near-optimal performance relative to the pointwise Riccati lower bound.
Read the full abstract

Combinatorics

Graph Eigenvalues and Projection Constants

Let $\lambda_1(G)\ge \lambda_2(G)\ge \cdots \ge \lambda_n(G)$ denote the adjacency eigenvalues of a graph $G$ of order $n$. We prove that for every $k\geq 2$ and every graph $G$ on $n\geq k$ vertices, $$ \lambda_k(G)\le \frac{\lambda_{\mathbb{R}}(k-1)}{2(k-1)}\,n-1, $$ where $$ \lambda_{\mathbb{R}}(r)=\sup_{N\ge r}\frac1N \max_{Q\in \mathcal P_r(N)}\sum_{i,j=1}^N |q_{ij}| $$ and $\mathcal P_r(N)$ denotes the set of rank-$r$ orthogonal projections in $\mathbb{R}^{N\times N}$. In Banach space theory, $\lambda_{\mathbb{R}}(r)$ is well known as the maximal absolute projection constant, which has been shown to equal the quasimaximal absolute projection constant $\mu_{\mathbb{R}}(r)$. This yields a new conceptual connection: universal upper bounds on $\lambda_k(G)$ are controlled by the real maximal absolute projection constant $\lambda_{\mathbb{R}}(k-1)$. In dimensions where $\lambda_{\mathbb{R}}(k-1)$ is known explicitly, this gives explicit coefficients. In particular, for $k=3$ this recovers Tang's recent sharp bound $\lambda_3(G)\le n/3-1$. For $k=4$, using $\lambda_{\mathbb{R}}(3)=\frac{1+\sqrt5}{2}$ together with Linz's closed blowups of the icosahedral graph, we obtain the result $$ \lambda_4(G) \leq \frac{1+\sqrt5}{12}n-1. $$ The method allows us to transfer known upper bounds on $\lambda_{\mathbb{R}}(k-1)$ to match the best known upper bounds on $\lambda_k(G)$ for other values of $k$, such as $k=5$.
Read the full abstract

Combinatorics

Multicolor $K_r$-Tilings with High Discrepancy

We study the minimum degree threshold $\delta_{r,q}$ guaranteeing the existence of $K_r$-tilings of high discrepancy in any $q$-edge-coloring. Balogh, Csaba, Pluhár and Treglown handled the 2-color case, proving that $\delta_{r,2} = \frac{r}{r+1}$ for all $r \geq 3$. Here we determine $\delta_{r,q}$ for all $q$ large enough, namely $q \geq \binom{r}{2}$. For example, we show that for $r \geq 4$, $\delta_{r,q} = \frac{r}{r+1}$ for $\binom{r}{2} \leq q \leq \binom{r+1}{2}$ and $\delta_{r,q} = \frac{r-1}{r}$ for $q \geq \binom{r+1}{2}+2$. Thus, $\delta_{r,q}$ has a phase transition at $q = \binom{r+1}{2}$, where it drops from $\frac{r}{r+1}$ and then stabilizes at the existence threshold $\frac{r-1}{r}$. We also show that $\delta_{r,q} \leq \frac{r}{r+1}$ for all $r,q$, supplementing and giving a new proof for the result of Balogh, Csaba, Pluhár and Treglown.
Read the full abstract

All authors Henry Chan, Daniel Cheng, Lior Gishboliner, Xiangyu Li

Optimization and Control

Adaptive Momentum via Minimal Dual Function for Accelerating Randomized Sparse Kaczmarz

Recently, the randomized sparse Kaczmarz method has been accelerated by designing heavy ball momentum adaptively via a minimal-error principle. In this paper, we develop a new adaptive momentum method based on the minimal dual function principle to go beyond the exact measurement restriction of the minimal-error principle. Moreover, by integrating the new adaptive momentum method with the quantile-based sampling, we introduce a general algorithmic framework, called quantile-based randomized sparse Kaczmarz with minimal dual function momentum, which provides a unified approach to exact, noisy, or corrupted linear systems. In addition, we utilize the discrepancy principle and monotone error as stopping rules for the proposed algorithm. Theoretically, we establish linear convergence in expectation of Bregman distance up to a finite horizon related to the contaminated level. At last, we provide numerical illustrations on simulated and real-world data to demonstrate the effectiveness of our proposed method.
Read the full abstract

All authors Lu Zhang, Jinchuan Zeng, Hongxia Wang, Hui Zhang

Numerical Analysis

A Unified Model for Thermo- and Multiple-Network Poroelasticity with a Global-in-Time Iterative Decoupling Scheme

This paper introduces a unified model for thermo-poroelasticity and multiple-network poroelasticity, reformulated into a total-pressure-based system. We first establish the well-posedness of the problem via a Galerkin-based argument and subsequently introduce a robust space-time finite element approximation. To efficiently solve the fully coupled system, we propose a global-in-time iterative algorithm that sequentially decouples the mechanics from the transport equations, while incorporating necessary stabilization terms. We explicitly analyze the convergence rate and provide a rigorous proof that the proposed scheme constitutes a contraction mapping under physically relevant conditions, thereby ensuring its unconditional convergence. Numerical experiments confirm the theoretical stability bounds and demonstrate optimal convergence rates in both space and time, yielding solutions free of non-physical pressure oscillations.
Read the full abstract

All authors Huipeng Gu, Mingchao Cai, Jingzhi Li, Yu Jiang

Optimization and Control · Cross-listed from eess.SY

Bilevel MPC for Linear Systems: A Tractable Reduction and Continuous Connection to Hierarchical MPC

Model predictive control (MPC) has been widely used in many fields, often in hierarchical architectures that combine controllers and decision-making layers at different levels. However, when such architectures are cast as bilevel optimization problems, standard KKT-based reformulations often introduce nonconvex and potentially nonsmooth structures that are undesirable for real-time verifiable control. In this paper, we study a bilevel MPC architecture composed of (i) an upper layer that selects the reference sequence and (ii) a lower-level linear MPC that tracks such reference sequence. We propose a smooth single-level reduction that does not degrade performance under a verifiable block-matrix nonsingularity condition. In addition, when the problem is convex, its solution is unique and equivalent to a corresponding centralized MPC, enabling the inheritance of closed-loop properties. We further show that bilevel MPC is a natural extension of standard hierarchical MPC, and introduce an interpolation framework that continuously connects the two via move-blocking. This framework reveals optimal-value ordering among the resulting formulations and provides inexpensive a posteriori degradation certificates, thereby enabling a principled performance-computational efficiency trade-off.
Read the full abstract

Algebraic Geometry

Unexpected toric Richardson varieties

We prove that an open Richardson variety in the complete flag variety for $\mathrm{GL}_n$ is isomorphic to a torus if and only if the corresponding closed Richardson variety is toric. Such toric varieties can be classified in terms of the combinatorics of Bruhat intervals, and include many varieties of dimension larger than $n-1$. We give a combinatorial description of the corresponding polytopes, and compute several explicit examples.
Read the full abstract

Symplectic Geometry

Geometry and dynamics on Liouville domains in $T^*\mathbb T^2$

Parallel to the study of toric domains, symplectically convex, and dynamically convex domains in $(\mathbb R^4, \omega_{\rm std})$, we build an analogous framework and corresponding subclasses for Liouville domains in $(T^*\mathbb T^2,\omega_{\rm can})$. A key feature of this framework is the introduction of a new notion of convexity, based on systolic ratios. Via various machinery in quantitative symplectic geometry, including ECH capacities, shape invariant, dynamical zeta function, etc., we investigate the relations between subclasses of Liouville domains in $T^*\mathbb T^2$, obtain large-scale geometry of Liouville domains in $T^*\mathbb T^2$ with respect to coarse Banach-Mazur distance, provide a non-flat codisc bundle of torus even under the action of exact symplectomorphisms, and verify the agreement of normalized capacities for a wide class of Liouville domains in $T^*\mathbb T^2$.
Read the full abstract

Numerical Analysis

A Unified Weighted-Loss Physics-Informed Neural Network for Boundary Layer Problems in Singularly Perturbed PDEs

Singularly perturbed partial differential equations arise in many applications, including magnetohydrodynamic duct flows, chemical reaction transport systems, and Poisson Boltzmann electrostatics. These problems are characterized by sharp boundary layers and pronounced multiscale behavior, posing significant challenges for numerical methods. Existing approaches, particularly machine learning based methods, often rely on explicit asymptotic decompositions or specialized architectures, increasing implementation complexity and leading to optimization imbalance in stiff regimes. In this work, we propose a unified learning framework based on a weighted loss formulation within the standard physics informed neural network setting. The proposed method requires only prior knowledge of the boundary layer thickness, while the boundary layer locations are automatically identified during training. The resulting formulation avoids problem specific architectural modifications and remains applicable across different equation types. Numerical experiments on both scalar and coupled reaction diffusion and convection diffusion reaction systems, defined on regular and irregular domains, demonstrate robust performance for boundary layer thickness as small as $10^{-10}$ while maintaining high solution accuracy.
Read the full abstract

All authors Wei-Fan Hu, Shi-Xiang Zhong, Po-Wen Hsieh, Chung-Kai Chen, Te-Sheng Lin

Algebraic Topology · Cross-listed from cs.CG

Denoising data reduction algorithm for Topological Data Analysis

Persistent homology is a central tool in topological data analysis, but its application to large and noisy datasets is often limited by computational cost and the presence of spurious topological features. Noise not only increases data size but also obscures the underlying structure of the data. In this paper, we propose the Refined Characteristic Lattice Algorithm (RCLA), a grid-based method that integrates data reduction with threshold-based denoising in a single procedure. By incorporating a threshold parameter $k$, RCLA removes noise while preserving the essential structure of the data in a single pass. We further provide a theoretical guarantee by proving a stability theorem under a homogeneous Poisson noise model, which bounds the bottleneck distance between the persistence diagrams of the output and the underlying shape with high probability. In addition, we introduce an automatic parameter selection method based on nearest-neighbor statistics. Experimental results demonstrate that RCLA consistently outperforms existing methods, and its effectiveness is further validated on a 3D shape classification task.
Read the full abstract

All authors Seonmi Choi, Semin Oh, Jeong Rye Park, Seung Yeop Yang

Dynamical Systems

On distinguishing genuine from spurious chaos in planar singular and nonsmooth systems: A diagnostic approach

We present a rigorous reassessment of chaotic behavior in two-dimensional autonomous systems with singular or nonsmooth dynamics. For the Cummings-Dixon-Kaus (CDK) model, we show that blow-up regularization restores smoothness and renders the hypotheses of the Poincaré-Bendixson theorem applicable, thereby excluding chaotic attractors away from the singular set. We prove topological equivalence between the original and regularized flows on annular domains, ensuring that no spurious invariant sets are introduced by desingularization. In contrast, for a nonsmooth system with a $|x|$ term, we recompute the entire period-doubling cascade, obtain a seven-term sequence of bifurcation values converging to Feigenbaum's constant, and confirm robust chaos through positive Lyapunov exponents, broadband spectra, and fractal dimension estimates. As a main outcome, we propose a diagnostic protocol integrating regularization, numerical refinement, and invariant-set criteria. This protocol provides a reproducible standard for distinguishing genuine planar chaos from artifacts caused by singularities or discretization, and offers a benchmark for future studies of low-dimensional nonsmooth systems.
Read the full abstract

Probability · Cross-listed from cond-mat.stat-mech

Mean first passage times of higher-dimensional velocity jump processes

First passage phenomena arise across physics, biology, and finance when stochastic processes first reach a threshold, triggering downstream events. Examples include the irreversible exit from a domain, a biochemical reaction, a financial selloff. While typical formulations involve diffusive motion, many stochastic processes are better described as velocity jump processes, characterized by persistent motion interrupted by stochastic velocity changes. Despite their ubiquity, first-passage properties of velocity jump processes remain underdeveloped in higher dimensions, especially under directional bias. We present a general framework to estimate the mean first passage time (MFPT) and higher moments of the survival probability for fixed-speed velocity jump processes where possible reorientations range from strong alignment to full angular anisotropy. For low Knudsen numbers, when the mean free path is small compared to the distance to the target, we derive a universal form for the MFPT in which two bias functions encode broad classes of angular distributions, including von Mises-Fisher, wrapped Cauchy, and elliptical families. In the narrow capture limit of a vanishingly small target, directional persistence induces anomalous scaling, including regimes where the MFPT remains finite whereas standard diffusion would predict divergence. Finally, we obtain a Langevin representation that accurately reproduces first-passage statistics. Analytical predictions are confirmed by numerical simulations.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Stochastic Dimension Implicit Functional Projections for Global Integral Conservation in High-Dimensional PINNs

Enforcing prescribed global integral constraints in mesh-free neural PDE solvers is challenging in high-dimensional domains. Existing projection methods for spatial integrals are often tied to fixed grids or uniform quadrature, which can conflict with randomly sampled physics-informed neural networks (PINNs) and scale poorly with dimension. High-order differential operators also increase reverse-mode automatic differentiation memory costs. We propose Stochastic Dimension Implicit Functional Projection (SDIFP), a quadrature-level framework for enforcing prescribed first and second spatial moments. SDIFP replaces tensor-product nodal projection by a global affine correction of the neural-network output, with two scalar coefficients determined from a weighted quadrature rule. Under positive target variance and nonzero empirical raw variance, this correction is the nearest-point projection, in the weighted quadrature norm, onto the empirical two-moment constraint set. Thus, the prescribed moments are exact for the selected quadrature rule, while continuum errors are quadrature errors of the corrected field. For decomposable high-dimensional linear operators, SDIFP combines affine moment correction with stochastic operator-subset sampling. With independent residual and derivative sampling and conditionally unbiased coefficient-gradient estimation, the resulting estimator is unbiased for the specified quadrature-based residual objective; the shared-subset fast mode is biased in general. SDIFP avoids tensor-product quadrature for moment enforcement, separates forward quadrature evaluation from the reverse-mode graph, and retains pointwise inference efficiency once the affine coefficients are fixed or precomputed.
Read the full abstract

Optimization and Control

Pointwise and dynamic programming control synthesis for finite-level open quantum memory systems

This paper is concerned with finite-level quantum memory systems for retaining initial dynamic variables in the presence of external quantum noise. The system variables have an algebraic structure, similar to that of the Pauli matrices, and their Heisenberg picture evolution is governed by a quasilinear quantum stochastic differential equation. The latter involves a Hamiltonian whose parameters depend affinely on a classical control signal in the form of a deterministic function of time. The memory performance is quantified by a mean-square deviation of quantum system variables of interest from their initial conditions. We relate this functional to a matrix-valued state of an auxiliary classical control-affine dynamical system. This leads to a pointwise control design where the control signal minimises the time-derivative of the mean-square deviation with an additional quadratic penalty on the control. In an alternative finite-horizon setting with a terminal-integral cost functional, we apply dynamic programming and obtain a quadratically nonlinear Hamilton-Jacobi-Bellman equation, for which a solution is outlined in the form of a recursively computed asymptotic expansion.
Read the full abstract

Information Theory · Cross-listed from cs.PF

Closed-Loop Integrated Sensing, Communication, and Control for Efficient Drone Flight

Low-altitude wireless networks (LAWN) require drones to follow specific trajectories controlled by ground base stations (GBSs). However, given complex low-altitude channel conditions and limited spectrum and power resources, sensing errors and wireless link unreliability cannot be ignored, leading to trajectory deviations that threaten flight safety. To address this issue, this paper proposes an integrated sensing-communication-control (ISCC) closed-loop trajectory tracking approach, aiming to reveal the coupling mechanisms among communication, sensing, and control during drone flight. In detail, we incorporate sensing errors in trajectory state estimation, packet losses in control command transmission, and finite blocklength transmission effects into the closed-loop dynamics. First, through theoretical analysis, we identify the dominant role of the time-frequency resources allocated to control in ensuring system stability and derive a lower bound on the resources required to guarantee stable operation. Second, to minimize tracking error, we formulate a time-frequency resource allocation optimization problem for the sensing, communication, and control components, subject to constraints on communication rate and closed-loop stability. Accordingly, a solution algorithm based on successive convex approximation is proposed. Third, simulation results indicate that once stability is ensured, system performance is primarily determined by sensing accuracy, with the trajectory tracking error exhibiting an approximately linear dependence on the position error bound. Finally, it is shown that the proposed ISCC scheme avoids trajectory divergence under FBL transmission compared with ISCC designs ignoring control packet loss, and could achieve decimeter-level average tracking accuracy, reducing the error to only 17.37% of that observed in the baseline global navigation satellite system scheme.
Read the full abstract

All authors Jingli Li, Yiyan Ma, Bo Ai, Wei Chen, Weijie Yuan, Qingqing Cheng, Tongyang Xu, Guoyu Ma, Mi Yang, Yunlong Lu, Wenwei Yue, Christos Masouros, Zhangdui Zhong

Dynamical Systems · Cross-listed from eess.SY

A Continuous-Time and State-Space Relaxation of the Linear Threshold Model with Nonlinear Opinion Dynamics

The Linear Threshold Model (LTM) is widely used to study the propagation of collective behaviors as complex contagions. However, its dependence on discrete states and timesteps restricts its ability to capture the multiple time-scales inherent in decision-making, as well as the effects of subthreshold signaling. To address these limitations, we introduce a continuous-time and state-space relaxation of the LTM based on the Nonlinear Opinion Dynamics (NOD) framework. By replacing the discontinuous step-function thresholds of the LTM with the smooth bifurcations of the NOD model, we map discrete cascade processes to the continuous flow of a dynamical system. We prove that, under appropriate parameter choices, activation in the discrete LTM guarantees activation in the continuous NOD relaxation for any given seed set. We establish computable conditions for equivalence: by sufficiently bounding the social coupling parameter, the continuous NOD cascades exactly recover the cascades of the discrete LTM. We then illustrate how this NOD relaxation provides a richer analytical framework than the LTM, allowing for the exploration of cascades driven by strictly subthreshold inputs and the role of temporally distributed signals.
Read the full abstract

All authors Ian Xul Belaustegui, Himani Sinhmar, Ling-Wei Kong, Andrew Michael Hein, Naomi Ehrich Leonard

Analysis of PDEs

Optimal stability threshold in lower regularity spaces for the Vlasov-Poisson-Fokker-Planck equations

In this paper, we study the optimal stability threshold for the Vlasov-Poisson equation with weak Fokker-Planck collision. We prove that if the initial perturbation is of size $\nu^{\frac{1}{2}}$ in the critical weighted space $H_x^{\log}L^2_{v}(\langle v\rangle^m)$, then the solution remains the same size in the same space. Moreover, a space-time type Landau damping holds, namely, $\|E\|_{L^2_tL^2_x}\lesssim \nu^{\frac{1}{2}}$; and a point-wise type Landau damping holds, namely, $\|E(t)\|_{L^2}\lesssim \nu^{1/2}\langle t\rangle^{-N}$ for any $N>0$ for $t\geq \nu^{-1}$. We also prove that there exists an initial perturbation in $H^{1}_xL^2_v(\langle v\rangle^m)$ with size $\nu^{\frac12-\frac32\epsilon_0}$ for any ${\epsilon_0>0}$, such that the enhanced dissipation fails to hold in the following sense: there is $0<T\ll \nu^{-\frac13}$ such that \begin{align*} \|\langle v\rangle^m f_{\neq}(T)\|_{L^2_xL^2_v}\gtrsim \frac{1}{\nu^{\delta_1}}\|\langle v\rangle^m f_{\neq}(0)\|_{ H^1_xL^2_v} \end{align*} with some $\delta_1>0$. The paper solves the open problem raised in [Bedrossian; arXiv: 2211.13707] about the sharp stability threshold in lower regularity spaces.
Read the full abstract

Symplectic Geometry

A Floer Theoretic Approach to Energy Eigenstates on one Dimensional Configuration Spaces

In this article we consider two classical problems in Quantum Mechanics, namely the 'particle on a ring' and the 'particle in a box' from the viewpoint of symplectic topology. Interpreting the solutions of the corresponding time independent Schrödinger equation as orbits in a suitably chosen time dependent Hamiltonian system allows us to investigate them using Floer theory. More precisely we extend the definition of Rabinowitz Floer homology to non-autonomous Hamiltonians on $\mathbb{R}^{2n}$ with its standard symplectic structure and show that compactness of the moduli space of J-holomorphic curves still holds. With this homology we are then able to prove existence results for energy $E$ eigenstates on the 'ring' or in the 'box' for a big range of exterior potentials.
Read the full abstract

Optimization and Control

QOCO-GPU: A Quadratic Objective Conic Optimizer with GPU Acceleration

We present a GPU-accelerated backend for QOCO, a C-based solver for quadratic objective second-order cone programs (SOCPs) based on a primal-dual interior point method. Our backend uses NVIDIA's cuDSS library to perform a direct sparse LDL factorization of the KKT system at each iteration. We also develop custom CUDA kernels for cone operations and show that parallelizing these operations is essential for achieving peak performance. Additionally, we refactor QOCO to introduce a modular backend abstraction that decouples solver logic from the underlying linear algebra implementations, allowing the existing CPU and new GPU backend to share a unified codebase. This GPU backend is accessible through a direct Python interface and through CVXPY, allowing for easy use. Numerical experiments on a range of large-scale quadratic programs and SOCPs with tens to hundreds of millions of nonzero elements in the KKT matrix, demonstrate speedups of up to 50-70 times over the CPU implementation.
Read the full abstract

Complex Variables

The Lee–Yang Edge Exponent via Logarithmic Averaging

Let $F$ be the thermodynamic free energy of a ferromagnetic Ising model,analytic on $\mathbb{C}^{*}\setminus\mathcal{Z}_{\beta}$. The Lee–Yang edge at $z_c\in\partial\mathcal{Z}_\beta$ is characterised by $F(z)=F(z_c)+B(z-z_c)^{\sigma+1}+o(|z-z_c|^{\sigma+1})$ with $\sigma\in(-1,0)$ and $B\neq 0$. We prove three results: Theorem A (Jensen slope): defining the Jensen average $\widetilde{N}(x)=\frac{1}{2\pi}\int_0^{2\pi}\log|\widetilde{F}(e^{x+i\theta})|\,d\theta$ of $\widetilde{F}=F-F(z_c)$, the edge exponent satisfies $\widetilde{N}'(0^+)=\sigma+1$. The proof is a direct application of Jensen's formula. Theorem B (Monodromy): the monodromy of $F$ around $z_c$ multiplies the singular part by $e^{2\pi i(\sigma+1)}$, a primitive $q$-th root of unity when $\sigma+1=p/q$. Theorem C (Kac monodromy): for any 2D CFT at an RG fixed point with relevant operator $\phi$ of weight $h_\phi<0$ satisfying the Lee–Yang property, the RG scaling equation forces $\sigma=h_\phi/(1-h_\phi)$ and monodromy order $q=\mathrm{denom}(1/(1-h_\phi))$. We also prove that the edge expansion follows from the density asymptotics $\rho(\theta)\sim A|\theta-\theta_c|^\sigma$ via a Mellin-transform calculation, making all three theorems unconditional for the $d=2$ Ising model.
Read the full abstract

Dynamical Systems

Bi-shadowing of Quasi-semi-hyperbolic Pseudo-orbit

In this paper, we introduce the concept of quasi-semi hyperbolic pseudo-orbits and prove that quasi-semi hyperbolicity implies quasi hyperbolicity provided the error magnitude are sufficiently small. We also have successively demonstrated that both finite quasi-hyperbolic pseudo-orbits and infinite quasi-semi hyperbolic pseudo-orbits possess the bi-shadowing property, and thus we establish the periodicity.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Cell-induced densification and tether formation in fibrous extracellular matrices with biomimetic physics-informed neural networks

Nonconvex multi-well energies in cell-induced phase transitions give rise to fine-scale microstructures, low-regularity transition layers and sharp interfaces, all of which pose numerical challenges for physics-informed learning. Here we introduce biomimetic physics-informed neural networks (Bio-PINNs), which implement a near-to-far curriculum by progressively revealing the computational domain away from the cell boundary and combining this schedule with a deformation-uncertainty proxy that concentrates collocation points near evolving transition layers and tether-forming regions. Across single-cell and multicellular benchmarks, Bio-PINNs recover the densified phase more reliably near cell boundaries and in intercellular gaps, while capturing tether morphology more faithfully than representative ungated and residual-driven adaptive baselines.
Read the full abstract