Numerical Analysis
Graph-Based Meshfree Multi-scale Coarse Space Approximation for Two-Level Schwarz Methods
Yucheng Liu, Tak Shing Au Yeung, Eric T. Chung et al. (+1 more)
Efficient simulation of Darcy flow in highly heterogeneous porous media requires iterative solvers that remain robust under large permeability contrasts and mixed boundary conditions. Spectral coarse spaces in two-level overlapping Schwarz methods provide such robustness, but their practical use is often limited by an expensive setup phase dominated by many local generalized
eigenvalue solves. We propose a purely algebraic, coarse-space approximation that avoids these repeated local eigensolves by using a graph neural network operating on the system-
matrix graph. On the analysis side, we introduce a coefficient-weighted subspace-distance measure to quantify the discrepancy between the approximated and target local multiscale coarse spaces, and we derive a condition-number bound for the resulting preconditioned operator in terms of this distance. This bound yields a principled supervised-training objective and links learning error to solver performance. Numerical experiments on 2D and 3D high-contrast Darcy systems with varying mixed boundary conditions demonstrate that the proposed approach substantially reduces setup cost and improves end-to-end time-to-solution, while preserving robust convergence across the tested contrasts and boundary configurations.
Read the full abstract ▾
All authors Yucheng Liu, Tak Shing Au Yeung, Eric T. Chung, Simon See
Analysis of PDEs
A fractional attraction-repulsion chemotaxis system with generalized logistic source and nonlinear productions
Liyan Song, Qingchun Li and Chengyuan Qu
This paper studies a fractional attraction-repulsion system with generalized logistic source and nonlinear productions: \begin{equation*} \left\{ \begin{aligned} &u_t = -(-\Delta)^\alpha u - \chi_1 \nabla \cdot (u \nabla v) + \chi_2 \nabla \cdot (u \nabla w) + au - bu^\gamma, &x \in \mathbb{R}^N, \, t > 0, \\ &0 = \Delta v - \lambda_1 v + \mu_1 u^k, &x \in \mathbb{R}^N, \, t > 0, \\ &0 = \Delta w - \lambda_2 w + \mu_2 u^k, &x \in \mathbb{R}^N, \, t > 0. \end{aligned} \right. \end{equation*} We first establish the global boundedness of classical solutions with nonnegative bounded and uniformly continuous initial data in two different cases: $\gamma \geq k + 1$ and $\gamma < k + 1$, respectively. Next, we show the asymptotic behavior of the global solutions for both cases $\gamma = k + 1$ and $\gamma \neq k + 1$. Finally, we obtain the spreading speed of solutions. In particular, when $\gamma = k + 1$, the upper bound of the spreading speed increases monotonically with $k$. If the condition of balanced attraction-repulsion intensities is further specified, the spreading speed will be equal to $\frac{a}{N + 2\alpha}$.
Read the full abstract ▾
Analysis of PDEs
A Paley-Wiener type uniqueness result for the electromagnetic Schrödinger equation
Yilin Song, Ying Wang, Jiqiang Zheng et al. (+1 more)
In this paper, we establish a Paley-Wiener type uncertainty principle for Schrödinger equations with bounded electric and
magnetic potentials, \begin{align*} i\partial_tu+\Delta_Au+V(t,x)u=0,\,\,u(0,x)=u_0(x), \end{align*} where $\Delta_A=(\nabla-iA)^2$ denotes the
magnetic Schrödinger operator. Specifically, under suitable assumptions on $A$ and $V$, we show that if a solution $u$ exhibits linear exponential decay and support property in one spatial direction at times $t=0$ and $t=1$ respectively, then $u$ must vanish identically. This result extends the
theorem of Kenig-Ponce-Vega [Ann. Sci. Éc. Norm. Supér. (4) 47 (2014), 539-557] to the case $A\neq0$. We overcome the difficulty brought by the
magnetic potential which breaks the translation invariance in the leading term of
Hamiltonian $H=\Delta_A+V$. As a direct consequence, we also obtain a uniqueness result for a class of semi-linear Schrödinger equation with electromagnetic potentials.
Read the full abstract ▾
All authors Yilin Song, Ying Wang, Jiqiang Zheng, Ruihan Zhou
Geometric Topology
Real rational knots in the quadric of signature~$(3,2)$
Shane D'Mello and Priya Rani
We study the space of real rational curves of low degree in the quadric of signature $(3,2)$ and provides a classificaton of real rational
knots and nodal curves. Apart from the classification, we also study the relationship between the real rational
knots in the quadric and the real rational
knots in $\mathbb{RP}^{3}$. Furthermore, a construction for the representatives of all the real rational
knots of degree $\leq 5$ in the quadric is presented.
Read the full abstract ▾
Information Theory
CL-SEC: Cross-Layer Semantic Error Correction Empowered by Language Models
Yirun Wang, Yuyang Du, Soung Chang Liew et al. (+3 more)
Achieving reliable communication has long been a fundamental challenge in networked systems. Semantic Error Correction (SEC) leverages the semantic understanding capabilities of
language models (LMs) to perform application-layer error correction, complementing conventional channel decoding. While promising, existing SEC approaches rely solely on context captured by LMs at the application layer, ignoring the rich information available at the physical layer. To address this limitation, this paper introduces Cross-Layer SEC (CL-SEC), an LM-empowered error correction framework that integrates cross-layer information from both the physical and application layers to jointly correct corrupted words in text communication. Using a
Bayesian combination in product form tailored to this framework, CL-SEC achieves significantly improved performance over methods that process information in isolated layers. CL-SEC shows substantial gains across multiple error-correction metrics, including bit-error rate, word-error rate, and semantic fidelity scores. Importantly, unlike most semantic communication systems that focus solely on recovering the semantic meaning of transmitted messages, CL-SEC aims to reconstruct the original transmitted message verbatim, leveraging the semantic understanding capabilities of LMs for precise reconstruction.
Read the full abstract ▾
All authors Yirun Wang, Yuyang Du, Soung Chang Liew, Yuchen Pan, Feifan Zhang, Lihao Zhang
Classical Analysis and ODEs
Harald Bohr's splitting theorem
Viktor Andersson, Ole Fredrik Brevig and Athanasios Kouroupis
We present a new elementary proof of a
theorem due to Harald Bohr, which states that an unbounded, analytic, and almost periodic function in a half-plane can be written as the sum of two analytic functions: the first is unbounded and periodic, while the second is bounded and almost periodic. The proof is based on a well-known arithmetical property of translation numbers of almost periodic functions.
Read the full abstract ▾
Classical Analysis and ODEs
Twisted Multiparameter singular integrals – real variable methods and applications, I
Zunwei Fu, Ji Li, Chong-Wei Liang et al. (+2 more)
In this paper, we introduce a class of twisted multiparameter singular integrals on $\mathbb{R}^{2m}$, motivated by the Cauchy–Szegő projections and the solving operators for $\bar{\partial}_b$ on a broad family of quadratic surfaces of higher codimension in $\mathbb{C}^n$. These surfaces are represented as suitable quotients of products of Heisenberg groups, a framework illustrated by Stein (Notices Amer. Math. Soc., 1998). While classical multiparameter product and flag theories are well-developed, Nagel,
Ricci, and Stein observed a critical limitation: the class of product operators is not closed under passage to a quotient subgroup. To handle the
geometric reduction that models these quotient structures, we take the first step in developing an adapted real-variable theory. We achieve this by introducing twisted tube systems and tube maximal functions, establishing a reproducing formula, Littlewood–Paley theory, a Journé-type covering lemma, and atomic decompositions. As particular examples, we obtain twisted
Fourier multipliers – which emerge as novel, direction-sensitive, and anisotropic phase-shift converters with potential applications in signal and image processing.
Read the full abstract ▾
All authors Zunwei Fu, Ji Li, Chong-Wei Liang, Wei Wang, Qingyan Wu
Information Theory · Cross-listed from eess.SP
Repeater-Assisted MIMO Can Also Boost Frequency Diversity: A Semi-Analytic Study
Hiroki Iimori and Yuto Hama
Massive multiple-input multiple-output (
MIMO) has enabled substantial spatial multiplexing and array gains in real-world systems, while distributed
MIMO (D-
MIMO) improves macro-diversity over wide areas at the cost of deployment complexity. Repeater-assisted massive
MIMO (RA-
MIMO) is a lower-cost alternative that can recover key distributed-
MIMO advantages. This paper asks whether repeater assistance can also enhance frequency diversity. We study an uncoded discrete
Fourier transform-spread orthogonal frequency-division multiplexing (DFT-s-OFDM) uplink with one-tap single-carrier frequency-domain equalization (SC-FDE) based on minimum mean-square error (MMSE) and derive a receiver-matched semi-analytic bit-error rate (BER) expression by averaging over channel and interference realizations, without Gaussian approximation of residual despreading interference. The analysis clarifies how repeater delay reshapes frequency correlation, and waveform simulations confirm tight agreement with the derived expression together with improved high-signal-to-noise ratio (SNR) BER decay, highlighting delay as a practical tuning knob.
Read the full abstract ▾
Probability
The Skyline Process: Quantifying Sky Visibility in 3D Urban Environments
Junse Lee and François Baccelli
Non-terrestrial networks (NTNs) are considered a promising technology for seamless, universal communication in the 6G era. However, signals from NTN elements to ground users are often blocked by high-rise buildings in dense urban environments. To quantify this blocking effect, in this paper, we propose a novel analytical framework by modeling the location of buildings as a 3D skyline process based on
stochastic geometry and we derive closed-form expressions for the distribution of the blockage elevation angles. Furthermore, we extend our analysis to include spatially correlated blockage effects and analyze the spectral properties of the Skyline process using power spectral density (PSD) and autocorrelation function (ACF). Based on these theoretical findings, we present numerical results that provide insights into the design of LEO satellite networks by computing the mean number of visible satellites and the outage probability. We provide a decorrelation angle that serves as a useful threshold for obtaining the satellite diversity gain. These findings provide first analytical steps toward designing and user connection strategies to NTNs in urban environments.
Read the full abstract ▾
Optimization and Control
Eliciting Von Neumann-Morgenstern utility from discrete choices with response error
Bo Chen and Jia Liu
We develop a preference elicitation method for a Von Neumann-Morgenstern (VNM)-type decision-maker from pairwise comparison data in the presence of response errors. We apply the maximum likelihood estimation (MLE) method to jointly elicit the non-parametric systematic VNM utility function and the scale parameter of the response error, assuming a Gumbel distribution. We incorporate structural preference information known in advance about the decision-maker's risk attitude through linear constraints on the utility function, including monotonicity, concavity, and Lipschitz continuity. Under discretely distributed lotteries, the resulting MLE problem can be reformulated as a convex program. We derive finite-sample error bounds between the MLE and the true parameters, and establish quantitative convergence of the MLE-based VNM utility function to the true utility function in the sense of the Kolmogorov distance under some conditions on the lotteries. These conditions may have potential applications in the design of efficient lotteries for preference elicitation. We further show that the optimization problem maximizing the expected MLE-based VNM utility is robust against the response error and estimation error in a probabilistic sense. Numerical experiments in a portfolio optimization application illustrate and support the theoretical results.
Read the full abstract ▾
Optimization and Control
The dual IRLS scheme for (hyper-)graph $p$-Laplacians and $\ell^p$ regression with large exponents
Johannes Storn
We introduce an iterative scheme for discrete convex minimization problems of $p$-Laplace type such as variational graph $p$-Laplace problems and $\ell^p$ regression. In each iteration, the scheme solves only a weighted least-squares problem. We verify linear convergence for suitably regularized problems and derive convergence to any prescribed tolerance.
Read the full abstract ▾
Probability
Elephant Random Walks on Coverings of Dipole Graphs
Nobuaki Naganuma and Kaito Yura
In the present paper, we introduce and analyze elephant random walks (ERWs) on bipartite periodic
lattices arising as coverings of dipole graphs. We focus on
lattices whose admissible step directions in the two parts of the bipartition are negatives of each other and disjoint. On such graphs, we define an ERW in which each step is chosen by referring to the entire history of the walk. The ERW on the hexagonal
lattice is a prototypical example of our model. The definition and asymptotic analysis of such ERWs are not straightforward because both depend strongly on the underlying
geometric structure. Our analysis is based on a combination of the Pólya-type urn techniques and the martingale approach, two standard methods for analyzing ERWs. We find that the counting process of the ERW forms a Pólya-type urn with two-periodic generating
matrices. By analyzing for such urn models, we show the strong law of large numbers for the counting process. Combining the result for the counting process with the martingale approach, we derive non-standard strong laws of large numbers and central limit
theorems for the position process of the ERW in the diffusive and critical regimes, as well as almost sure and $L^2$ scaling limits in the superdiffusive regime.
Read the full abstract ▾
Representation Theory
Derived Weil Representation and Relative Langlands Duality
Haoshuo Fu
The Weil representation is a particularly significant linear representation of the metaplectic group, used in the study of theta correspondence. In this paper, I introduce a derived category version of the Weil representation in the local field case. For the dual pair $ (\mathrm{GL}_n,\mathrm{GL}_m) $, I give a coherent description of this category, in the philosophy of relative Langlands duality.
Read the full abstract ▾
Differential Geometry
Spectral asymmetry, supersymmetry and the equivariant Riemann-Roch defect
Gayana Jayasinghe, Alex R. Taylor and Xinran Yu
We investigate the relationship between two interpretations of equivariant Riemann-Roch defects of complex spaces with conic singularities; as (i) equivariant $\eta_{T}$ and $\xi_{T}$ invariants, and as (ii) supertraces over local
cohomology groups. This leads to a novel threefold partitioning of the $L^{2}$-spinor space on the link and a corresponding splitting of $\xi_{T}$. Two partitions correspond to cohomological contributions coming from $\bar\partial$-Neumann and $\bar\partial$-Dirichlet operators on the cone, while the third partition makes no contribution to the equivariant index defect, which we show is due to supersymmetric cancellations on the cone that we call lifted supersymmetry. We use this to define complex equivariant $\xi_T$ and $\eta_T$ invariants, which are equivalent to the usual invariants but are easier to compute. We highlight connections to related algebraic and analytic descriptions of Riemann-Roch defects in the literature, both at the level of numbers and their categorifications, and explore connections to existing notions of supersymmetric cancellations in physics and mathematics.
Read the full abstract ▾
Optimization and Control
Assortment Optimization under Logit-Based Multi-Purchase Choice Models
Taotao He, Zhongqi Wu and Yating Zhang
Problem definition: We study assortment optimization under logit-based multi-purchase choice models. Because customers frequently purchase multiple distinct products together in a single transaction, incorporating such behavior into assortment decisions can unlock additional revenue opportunities. However, doing so is computationally challenging because the offered assortment induces a combinatorial set of feasible bundles that compete nonlinearly for customer demand. Methodology/results: We develop an exact assortment optimization framework for general multi-purchase patterns. We first introduce a hypergraph representation of Logit-MP models that unifies several models in the literature, including BundleMVL-K and Multivariate-MNL, and can be estimated from transaction data using a sparsity-based procedure. Building on this representation, we develop strong mixed-integer programming formulations that leverage recent advances from multilinear optimization and a perspective reformulation. The resulting formulations provide tighter linear programming relaxations than the prevalent Big-M approach. We further characterize classes of multi-purchase patterns, represented by different hypergraph structures, under which the formulations reduce to linear programs. Computational experiments demonstrate substantial improvements in both solution quality and scalability. Managerial implications: Using real transaction data, we show that a sparse hypergraph captures the dominant multi-purchase patterns while generating higher revenues. We also show that our formulations extend to heterogeneous customer populations and remain computationally viable, making the framework practical for large-scale retail assortment planning.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
Asymptotic Optimism for Tensor Regression Models with Applications to Neural Network Compression
Haoming Shi, Eric C. Chi and Hengrui Luo
We study rank selection for low-rank tensor regression under random
covariates design. Under a Gaussian random-design model and some mild conditions, we derive population expressions for the expected training-testing discrepancy (optimism) for both CP and Tucker decomposition. We further demonstrate that the optimism is minimized at the true tensor rank for both CP and Tucker regression. This yields a prediction-oriented rank-selection rule that aligns with cross-validation and extends naturally to tensor-model averaging. We also discuss conditions under which under- or over-ranked models may appear preferable, thereby clarifying the scope of the method. Finally, we showcase its practical utility on a real-world image regression task and extend its application to tensor-based compression of neural network, highlighting its potential for model selection in deep learning.
Read the full abstract ▾
Algebraic Geometry
On Effective Iitaka Fibration Indices for Stable Minimal Models with Large Iitaka Volumes
Hexu Liu
Given a pair $(V,C)$ that admits a stable minimal model with fixed dimension, fixed coefficient set, and bounded relative volume, we study when the linear system $|m(K_V+C)|$ induces an Iitaka fibration, assuming the Iitaka volume of $K_V+C$ is sufficiently large.
Number Theory
Finiteness of Disjoint Covering Systems with Precisely One Repeated Modulus
Yu Hashimoto
We prove that for each fixed $m \ge 2$, there are only finitely many disjoint covering systems with minimum modulus at least $3$ in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly $m$ times.
Logic · Cross-listed from cs.LO
Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
Giorgi Japaridze
Computability logic (CoL) provides a semantic foundation in which formulas represent interactive computational problems and validity corresponds to uniform algorithmic solvability. Building on this foundation, clarithmetics – CoL-based axiomatic number theories – combine the full arithmetical strength of Peano arithmetic (PA) with explicit control over computational resources. In contrast to traditional bounded arithmetic and related complexity-oriented systems, they strengthen rather than weaken PA. This paper, after briefly surveying the relevant fragment of CoL, presents the systems CLA4-CLA7 and CLA11 of clarithmetic, and outlines their soundness and completeness with respect to natural classes of time, space, and so called amplitude complexities. We argue that, by weakening PA, traditional complexity-oriented systems of arithmetic throw out the baby with the bathwater, discarding large amounts of innocent and useful arithmetical information and losing intensional flexibility essential for natural specification and program extraction. Clarithmetics avoid this loss while supporting direct extraction of optimal or near-optimal
algorithms from proofs and providing strong intensional completeness properties absent from bounded arithmetic and related systems. A central message of the paper is that the argued advantages of clarithmetics deserve either acknowledgment or serious refutation from the weak-arithmetics community. To date, neither has occurred.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search
Zhijian Lai, Dong An, Jiang Hu et al. (+1 more)
Grover's
algorithm is a fundamental
quantum algorithm that achieves a quadratic speedup for unstructured search problems of size $N$. Recent studies have reformulated this task as a maximization problem on the
unitary manifold and solved it via linearly convergent Riemannian gradient ascent (RGA) methods, resulting in a complexity of $O(\sqrt{N/M}\log (1/\varepsilon))$, where $M$ denotes the number of target items and $\varepsilon$ denotes the success probability error. In this work, we adopt the Riemannian modified Newton (RMN) method to solve the
quantum search problem, under the assumption that the ratio $ M/N$ is known. We show that, in this setting, the Riemannian Newton direction is collinear with the Riemannian gradient in the sense that the Riemannian gradient is always an eigenvector of the corresponding Riemannian Hessian. This structure removes the overhead of Hessian inversion and allows the proposed RMN method to retain the local quadratic convergence in terms of the error $\varepsilon$. More precisely, we rigorously prove an overall complexity of $O(\sqrt{N/M}+\log\log(1/\varepsilon))$. Furthermore, our approach remains Grover-compatible, namely, it relies exclusively on the standard Grover
diffusion and oracle operators to ensure algorithmic implementability, and its parameter update process can be efficiently precomputed on classical computers.
Read the full abstract ▾
All authors Zhijian Lai, Dong An, Jiang Hu, Zaiwen Wen
Analysis of PDEs
Existence and uniqueness of traveling fronts for a free interface model of autoignition in reactive jets
Mingxin Ma, Peter V. Gordon, Robert Roussarie et al. (+2 more)
In this paper we consider a one-dimensional reaction-
diffusion model with piecewise continuous reaction term that describes propagation of autoignition fronts in reactive co-flow jets in a certain parametric regime. The model is reduced to a free boundary problem with two interfaces. It is shown that this problem admits permanent traveling front solution which is unique up to translations. The result is obtained using dynamical system approach employing Stable
Manifold Theorem and the Melnikov integral as the main tools.
Read the full abstract ▾
All authors Mingxin Ma, Peter V. Gordon, Robert Roussarie, Peipei Shang, Claude-Michel Brauner
History and Overview of Mathematics
Empirical mathematics in Australian Indigenous Smoke Telegraphy
Rowena Ball
Mathematics curriculums at most universities tend to perpetuate a belief that higher mathematics is historically and culturally European. First Nations and minority students may not see their identities and cultures reflected in the discipline, yet university mathematics educators are keen to diversify and broaden the appeal of their courses. This article presents an investigation on the mathematics of smoke telegraphy, as a contribution to inlaying cross-cultural mathematical heritage in the curriculum. Across Indigenous societies of Australia the technology and practice of smoke telegraphy was developed to a sophisticated level over millennia to fill a need for long-distance communications. Through an original bibliographic and archival analysis, we show that smoke signalling and telegraphy used empirical mathematics of
symmetries, frequency coding, and understanding of fluid dynamics. We juxtapose this applied mathematical knowledge, within context, against the timeline of Western understanding and development of these strands of mathematics.
Read the full abstract ▾
Number Theory
Exactness property of Breuil-Kisin functors and Bloch-Kato Selmer groups
Pavel Čoupek, Evangelia Gazaki and Adriano Marmora
Let $K$ be a $p$-adic field and $T$ a
lattice in a semistable representation of $\mathrm{Gal}(\overline{K}/K)$ with Hodge-Tate weights in $[0, r]$. Assuming $0\leq r<p-1$, we prove that for a semistable extension of $\mathbb{Z}_p$ by $T$, the corresponding sequence of strongly divisible modules is exact. Analogous statements are proved for Breuil-Kisin modules and for prismatic $F$-
crystals for all $r\geq 0$. In the crystalline case, we deduce that the integral Bloch-Kato Selmer group $H^1_f(K, T)$ is computed by $\mathrm{Ext}^1$ in the category of crystalline strongly divisible modules. Using further exactness results, we define a tensor product of strongly divisible modules, which commutes with the functors to Galois representations. As an application, we show that for abelian varieties $A_1, A_2$ over $K$ with good reduction, the cup product map $\delta_1\cup\delta_2:A_1(K)\otimes A_2(K)\rightarrow H^2(K, T_p(A_1)\otimes T_p(A_2))$ induced by the Kummer sequences of $A_1, A_2$ factors through an $\mathrm{Ext}^2$ group of strongly divisible modules. In the appendix we generalize further the main exactness results to coherent reflexive $F$-gauges.
Read the full abstract ▾
Statistics Theory
Statistical and Computational Limits for Cumulant Tensor Inference: A Regime in Which Efficient Detection Is Harder Than Efficient Estimation
Runshi Tang, Yuefeng Han and Anru R. Zhang
We study estimation and detection of high-order cumulant tensors from $n$ i.i.d. observations of a $p$-dimensional random vector, with performance measured in the tensor spectral norm. Under sub-Gaussianity, we show that the minimax rate for estimating the order-$d$ cumulant tensor is $\sqrt{p/n}\wedge 1$. In contrast to covariance estimation, the natural plug-in
estimator obtained by replacing population moments in the moment–cumulant formula with sample moments, which we call the sample cumulant tensor, is generally not rate-optimal for $d\ge 3$, and we construct an
estimator that attains the minimax rate. On the computational side, we study testing whether the $d$-th order cumulant tensor vanishes after whitening. We provide evidence, under a model-specific low-degree
conjecture, that detection is computationally hard when $n\ll p^{d/2}$. At the same time, we identify a regime in which an efficiently computable
estimator achieves error smaller than the separation at which
polynomial-time tests can reliably distinguish the null from the alternative under the same
conjecture. This reveals an unusual reverse detection–estimation gap: computationally efficient detection can be harder than computationally efficient estimation. The underlying reason is that the relevant loss, tensor spectral norm, is itself NP-hard to compute, creating a new form of computational–statistical gap.
Read the full abstract ▾
Numerical Analysis
A second-order energy-stable sequential regularization scheme for the Navier-Stokes equations
Zhaoyang Wang and Ping Lin
In this paper, we construct a second-order decoupled scheme for the Navier-Stokes equations based on the idea of the auxiliary variable and the sequential regularization method (SRM). The proposed scheme enjoys unconditional energy stability, which is generally unavailable for the existing SRM, while preserving its key advantage of avoiding artificial pressure boundary conditions and maintaining the original velocity boundary conditions. We establish a viscosity-independent low-order stability estimate and a higher-order stability estimate for the proposed scheme. Furthermore, we derive global-in-time second-order error estimates in two dimensions and corresponding local-in-time estimates in three dimensions, without imposing any time-step restrictions. A series of numerical experiments confirm the convergence and stability, and demonstrate improved accuracy and incompressibility control compared with the projection method and the conventional SRM. In particular, both high-Reynolds-number and three-dimensional numerical simulations further demonstrate the robustness and reliability of the proposed method for complex incompressible flows.
Read the full abstract ▾
Algebraic Geometry
Tropical singular intersection homology
Junta Kamiya
We introduce tropical singular intersection homologies (non-GM and GM) with the tropical coefficients on rational polyhedral spaces using their filtrations. We investigate their fundamental properties. In the non-GM case, we give a Poincaré duality and two bilinear pairings analogous to the cup and cap products under some assumptions. We compute the homologies in some cases.
Read the full abstract ▾
Analysis of PDEs
On a thermodynamically consistent diffuse interface model for incompressible two-phase flows with unmatched densities: Energy equality and Lyapunov stability
Harald Garcke, Maoyin Lv and Hao Wu
We consider the initial-boundary value problem of a thermodynamically consistent diffuse interface model for incompressible two-phase flows with unmatched densities in a bounded domain $\Omega\subset\mathbb{R}^3$. Our first aim is to study the energy equality for global weak solutions by establishing mixed $L_t^qL_x^r$-regularity conditions on the velocity field, its gradient, and its time derivative, under which the global weak solution satisfies the energy equality for all times. The proof is based on the propagation of regularity for weak solutions to the convective Cahn-Hilliard equation with a physically relevant Flory-Huggins-type potential, combined with global mollification and boundary cut-off techniques. Next, we prove the existence and uniqueness of global strong solutions in the general setting with non-constant gradient energy coefficient and non-degenerate mobility, provided that the initial velocity is sufficiently small and the initial phase-field variable is a sufficiently small perturbation of a local minimizer of the free energy. This yields Lyapunov stability for each steady state consisting of a zero velocity together with a local energy minimizer. The proof relies on the energy equality for (local) strong solutions and the Łojasiewicz-Simon approach.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Fractional Risk Analysis of Stochastic Systems with Jumps and Memory
Yimeng Sun, Zhuoyuan Wang, Xiaole Zhang et al. (+4 more)
Accurate risk assessment is essential for safety-critical autonomous and control systems under uncertainty. In many real-world settings,
stochastic dynamics exhibit asymmetric jumps and long-range
memory, making long-term risk probabilities difficult to estimate across varying system dynamics, initial conditions, and time horizons. Existing sampling-based methods are computationally expensive due to repeated long-horizon simulations to capture rare events, while existing partial differential equation (PDE)-based formulations are largely limited to Gaussian or symmetric jump dynamics and typically treat
memory effects in isolation. In this paper, we address these challenges by deriving a space- and time-fractional PDE that characterizes long-term safety and recovery probabilities for
stochastic systems with both asymmetric Levy jumps and
memory. This unified formulation captures nonlocal spatial effects and temporal
memory within a single framework and enables the joint evaluation of risk across initial states and horizons. We show that the proposed PDE accurately characterizes long-term risk and reveals behaviors that differ fundamentally from systems without jumps or
memory and from standard non-fractional PDEs. Building on this characterization, we further demonstrate how physics-informed learning can efficiently solve the fractional PDEs, enabling accurate risk prediction across diverse configurations and strong generalization to out-of-distribution dynamics.
Read the full abstract ▾
All authors Yimeng Sun, Zhuoyuan Wang, Xiaole Zhang, Heng Ping, Jintang Xue, Paul Bogdan, Yorie Nakahira
Combinatorics · Cross-listed from cs.DM
Computing fixed point free automorphisms of graphs
Aida Abiad, Gabriel Coutinho, Emanuel Juliano et al. (+2 more)
In 1981, Lubiw proved that the fixed point free
automorphism problem (FPFAut) is NP-complete: given a graph G, determine whether there exists an
automorphism that maps no vertex of G to itself. We revisit this problem and prove that FPFAut remains NP-complete when restricted to split, bipartite, k-subdivided, and H-free graphs, if H is not an induced subgraph of P_4. The class of P_4-free graphs receives the special name of cographs. We provide a
polynomial time
algorithm for three extensions of cographs: bounded modular-width graphs, tree-cographs and P_4-sparse graphs. Our approach uses the well known modular decomposition of graphs. As a consequence, we generalize a result of Abiad et. al. on the problem of computing 2-homogeneous equitable partitions.
Read the full abstract ▾
All authors Aida Abiad, Gabriel Coutinho, Emanuel Juliano, Vinicius F. dos Santos, Sjanne Zeijlemaker
Probability
Pathwise Convergence of a Modular Simulation Scheme for Hybrid SDEs with Memory
Oscar Peralta
This work introduces hybrid
stochastic differential equations with
memory (mH-SDEs), a new class of
stochastic systems where transition rates depend on the joint history of both Euclidean and discrete components. This extends existing hybrid
stochastic differential equation models that condition transitions only on the Euclidean process history, enabling richer dependencies such as age-based transitions and self-reinforcing dynamics. For mH-SDEs driven by Lévy processes, we develop the Modular-Poisson
algorithm, which employs path-dependent uniformization to generate discrete jumps while advancing the Euclidean
evolution between jumps using any established SDE solver as a micro-
algorithm. The main theoretical contribution establishes pathwise convergence with explicit rates, developing new techniques to control error accumulation across regime changes and bound the probability of process decoupling. The modular design allows practitioners to employ existing, well-studied SDE simulation methods while preserving theoretical convergence properties. This work provides the first rigorous convergence analysis for hybrid systems with joint history dependence under jump-
diffusion dynamics.
Read the full abstract ▾