Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 17 April
We consider the three-dimensional incompressible MHD system. Any weak solution satisfying a strong energy inequality is $L^2$-asymptotically stable around a Landau solution. Under an additional integrability assumption on the initial perturbation, we also obtain an explicit algebraic decay rate for the $L^2$-norm of the velocity and magnetic perturbations.
Combinatorics
The general position number of digraphs
The general position number for graphs ask for largest vertex subsets $S$ such that no three vertices are contained on a common shortest path. We examine this problem in the setting of directed graphs. We provide bounds for the general position number of digraphs, show that the problem is NP-complete for oriented graphs, investigate the problem for some important families of digraphs such as circulant digraphs, Kautz digraphs and permutation digraphs, and study the general position numbers obtained from all orientations of an undirected graph.
Read the full abstract
Probability · Cross-listed from cond-mat.stat-mech
Using the slowest observable in one-dimensional Markov processes to construct quasi-exactly-solvable generators with two explicit levels
The construction of Quasi-Exactly-Solvable quantum Hamiltonians where only the first two eigenstates $\Phi_0(x)$ and $\Phi_1(x)$ of energies $E_0$ and $E_1$ are explicit is revisited from the point of view of one-dimensional Markov processes satisfying detailed-balance, whose generators are related to quantum Hamiltonians via similarity transformations. Here, the lowest energy vanishes $E_0=0$ and is associated with the conservation of probability and with the steady state $P_*(x)$, while $E_1>0$ is the rate that governs the exponential relaxation towards the steady-state, and is associated with the slowest observable $L_1(x)$ that corresponds to the ratio $ \frac{\Phi_1(x) }{\Phi_0(x)}$ of the two quantum eigenstates. Our main conclusion is that the Markov perspective leads to interesting re-interpretations and that the construction of quasi-exactly-solvable models with $N=2$ explicit levels is more intuitive and technically simpler when one takes the slowest observable $L_1(x)$ as the central object from which all the other properties can be reconstructed. This general approach is then applied to Fokker-Planck generators in continuous space and to Markov jump generators on the lattice.
Read the full abstract
Logic
Long Strong Chains of Subsets of $\omega_1$
We force the existence of a chain of length $\omega_3$ in $[\omega_1]^{\omega_1}$ increasing modulo finite. The construction involves symmetric systems of models of two types as side conditions, introduced by the second author. This improves previous results of Koszmider and Veličković-Venturi.
Read the full abstract
Metric Geometry
Perturbations of measures and sets having curves in d directions
We show that whenever a separable subset $S$ of a complete metric space $X$ admits a $d$-dimensional weak tangent field, the set $S$ is close to being $d$-dimensional in the following sense. Whenever $\mu$ is a Borel finite measure on $X$ supported on $S$, then a typical $1$-Lispchitz map (in the sense of Baire category) into a Euclidean space maps $\mu$-almost all of $S$ into a set of Hausdorff dimension at most $d$. When taking $d=0$, this implies that any $1$-purely unrectifiable set is typically carried into a Hausdorff $0$-dimensional set up to a $\mu$-null set. We show that the result is sharp in Euclidean spaces and, more generally, in strictly convex Banach spaces of finite dimension.
Read the full abstract
Analysis of PDEs
A quantitative averaging lemma for spatially dependent vector fields
We prove a quantitative averaging lemma for spatially dependent vector fields. Our proof is based on an iteration of the regularizing operator and some elementary considerations about the local inversion theorem.
Operator Algebras
Classification of representations of higher-rank graph C*-algebras
We develop new techniques for the construction and classification of representations of row-finite and locally convex higher-rank graph C*-algebras O. This class includes Cuntz–Krieger algebras associated to row-finite directed graphs. Our approach relies on the representation theory of a certain non-self-adjoint algebra and a lifting process of representations. We introduce a novel dimension vector for representations of O yielding a countable partition of the spectrum. Given a Cuntz–Krieger algebra and a finite dimension vector, we construct a smooth manifold parametrising the corresponding spectral component. Our techniques are both explicit and functorial.
Read the full abstract
Differential Geometry
Bergman–Einstein Rigidity for Hartogs Domains over Bounded Homogeneous Domains
We prove a rigidity theorem for the Bergman metric on Hartogs domains over bounded homogeneous domains. Let $\Omega\subset \mathbb C^n$ be a bounded homogeneous domain, let $K_\Omega$ denote its Bergman kernel, and consider $$ \Omega_{m,s}:=\{(z,\zeta)\in \Omega\times \mathbb C^m:\ \|\zeta\|^2<K_\Omega(z,\bar z)^{-s}\}, \qquad m\ge 1,\quad s>-C_\Omega. $$ For $s\neq 0$, we prove that the following conditions are equivalent: the Bergman metric of $\Omega_{m,s}$ is Kähler–Einstein; $\Omega_{m,s}$ is homogeneous; $\Omega_{m,s}$ is biholomorphic to $\mathbb B^{n+m}$; and $\Omega\cong\mathbb B^n$ with $s=\frac1{n+1}$. This gives a positive answer to Yau's question within this class and may be viewed as a Cheng-type rigidity phenomenon beyond the smoothly bounded strictly pseudoconvex setting. The proof combines the explicit formula for the Bergman kernel of $\Omega_{m,s}$ with the structural invariants of the bounded homogeneous base.
Read the full abstract
Numerical Analysis
$hp$-Version robust interior penalty discontinuous Galerkin methods for the $p$-Laplacian on simplicial and on essentially arbitrarily-shaped element meshes
We consider the discretization of the $p$-Laplacian equation with an interior penalty discontinuous Galerkin method. We prove novel trace-type inverse estimates, leading to unconditional stability of the method. Further, $hp$-version a priori norm and quasi-norm error estimates are established, subordinate to available polynomial approximation results. The analysis is extended to discontinuous Galerkin methods, based on meshes with essentially arbitrarily-shaped, curved polygonal/polyhedral elements. This extension requires the proof of new $hp$-version weighted inverse estimates on essentially arbitrarily-shaped elements. Numerical experiments are also presented, highlighting the relevance of the theoretical findings.
Read the full abstract
Analysis of PDEs
Well-posedness of the compressible boundary layer equations with data in the Gevrey class
This paper is devoted to the study of the compressible boundary layer equations in the Gevrey-2 solution space. Compared to the classical Prandtl equation, the additional complexity arises from the strong interaction between viscous layer and thermal layer. By introducing new auxiliary functions and observing the cancellation mechanism to overcome the loss of derivatives, we show the local existence and uniqueness of the solution in the Gevrey-2 space in the tangential variable and Sobolev regularity in the normal variable by using a direct energy method.
Read the full abstract
Probability
On Continuous Data Assimilation for a class of 2D and 3D stochastic non-Newtonian fluids of differential type
Continuous data assimilation (CDA) techniques, most notably the nudging approach proposed by Azouani, Olson, and Titi (AOT), have been shown to be very successful in deterministic frameworks for achieving long-time synchronization between an approximate state and true state. In this note, we develop and study a CDA scheme for a class of stochastic non-Newtonian fluids, namely third-grade fluids, subject to either additive or multiplicative Gaussian stochastic forcing in both two- and three-dimensional settings. We establish sufficient criteria on the nudging gain and the observational mesh size that guarantee convergence of the assimilated state toward the underlying stochastic solution. Convergence is proved in the mean-square sense, and, in the case of additive noise, we further obtain almost sure (pathwise) convergence.
Read the full abstract
Analysis of PDEs
$C^{\infty}$ regularity of the Alt-Phillips Functional for negative powers
In this paper, we study the regularity of the free boundary for minimizers of the Alt-Phillips functional with negative powers \[\mathcal{E}_{\gamma}(u)=\int_{\Omega}\frac{1}{2}|\nabla u|^2+\frac{1}{\gamma}u^{-\gamma}\chi_{\{u>0\}}dx,\quad\gamma\in(0,2).\] We proved that the free boundaries are $C^{\infty}$ at regular points. A key technical tool is the linearized operator for the PDE satisfied by the partial derivatives of a solution to the Alt-Phillips Euler-Lagrange equation in the negative power case. For this operator we establish a comparison principle, which may have further applications to the Alt-Phillips problem with negative powers.
Read the full abstract
Optimization and Control
Efficient Receding Horizon Control for Stabilizing 2D Navier–Stokes Flows with Finitely Many Localized Actuators and POD Acceleration
This paper develops and analyzes a computationally efficient receding horizon control (RHC) strategy for steering two-dimensional Navier–Stokes flows to prescribed reference trajectories. The control is represented by a finite linear combination of localized actuators supported within a prescribed control subdomain. At the continuous PDE level, we establish local exponential stabilization in the $L^2$-norm and suboptimality of the actuator-based RHC scheme for weak solutions. Direct implementation requires the repeated solution of high-dimensional finite-horizon optimal control problems. To reduce this computational cost, we combine RHC with model order reduction based on proper orthogonal decomposition (POD). A common POD space constructed from state snapshots reduces the state and adjoint equations and accelerates the online optimization, while the resulting controls are applied to the full-order discretized dynamics. Numerical experiments for two flow configurations of increasing complexity examine the influence of actuator layouts, prediction horizons, viscosity, and POD dimension. The numerical results demonstrate substantial reductions in computational cost while maintaining closed-loop stabilization in the tested configurations.
Read the full abstract
Number Theory
Uniform estimates for Delannoy numbers and dimension-free estimates for discrete maximal functions over cross-polytopes
We prove a uniform upper and lower bound for Delannoy numbers. This is achieved by using the representation of Delannoy numbers as the number of lattice points in high-dimensional cross-polytopes (also known as hyper-octahedrons or $\ell^1$ balls) and proving a uniform (dimension-free) count for these lattice points. Using this count, we establish dimension-free estimates for discrete maximal functions over cross-polytopes. By proving a comparison principle with the continuous setting, we obtain a dimension-free estimate on all $\ell^p(\mathbb{Z}^d)$ spaces for radii $R>C d^{3/2}.$ We also treat the full maximal function on $\ell^2(\mathbb{Z}^d)$ for small radii $R\le d^{1-\varepsilon}$ and the dyadic maximal function for any radii.
Read the full abstract
Logic
Quotient codings and the descriptive complexity of algebraic and analytic structures
We study the descriptive complexity of algebraic and analytic properties by presenting structures as quotients of fixed generators. For separable Banach-type structures, admissible kernels form Polish spaces and quotient norms are continuous in the Wijsman topology. For countable algebraic structures, congruence spaces are compact and atomic predicates are clopen. In the unital $C^*$-algebra coding, commutativity, MF-ness, stable finiteness and existence of a tracial state are $\Pi^0_1$-complete. AF-ness, nuclearity, simplicity, property~(SP), approximate divisibility, fixed real- and stable-rank bounds, and fixed nuclear-dimension and decomposition-rank bounds are $\Pi^0_2$-complete. Finiteness of each of these four ranks is $\Sigma^0_3$-complete. Finite dimensionality and existence of a non-zero finite-dimensional representation are $\Sigma^0_2$-complete. Residual finite dimensionality is $\Pi^0_3$-complete, already among AF algebras, while quasidiagonality is $\Pi^0_3$. For countable abelian groups, slenderness is $\Pi^0_3$-complete even within the torsion-free locus. We also obtain a $\Sigma^0_3$ upper bound for uniformly open multiplication in Banach algebras. An internal $K_0$ presentation has $F_\sigma$ membership coordinates and is $\Sigma^0_3$-measurable. We establish Borel tensor-ideal assignments, continuity for a fixed nuclear tensor factor, and a $G_\delta$ bound for absorption of a strongly self-absorbing algebra. Finally, separability of the dual is $\Pi^1_1$-complete in the full unital $C^*$-quotient coding, already among commutative AF quotients; superatomicity of countable Boolean algebras is also $\Pi^1_1$-complete.
Read the full abstract
General Mathematics
Integers representable as a difference of two rational fourth powers
In Section 6.6 of the book Number Theory, Volume I: Tools and Diophantine Equations, Graduate Texts in Mathematics, Volume 239, Springer (2007), Cohen investigated the solubility of the equation $n=x^4+y^4$ in the rational numbers $x,y$ for all positive integers $n \leq 10000$. Motivated by this, we investigate the equation $n=x^4-y^4$ and obtain the complete list of positive integers $n\leq 10000$ that can be represented in this form for some nonzero rational numbers $x$ and $y$.
Read the full abstract
Combinatorics
Odd Edge Colorings of Graphs with Odd Order
An odd subgraph of a graph is a subgraph in which every vertex has odd degree. A graph $G$ is said to be {\em odd $k$-edge-colorable} if there exists an edge-coloring $E(G) \rightarrow \{1,2, \ldots, k\}$ such that each non-empty color class induces an odd subgraph of $G$. The odd chromatic index of $G$, denoted by $\chi'_o(G)$, is the minimum $k$ for which $G$ is odd $k$-edge-colorable. In this paper, we prove that every $4$-connected simple graph of odd order is odd 3-edge-colorable, and show that the $4$-connectedness assumption is necessary. We also prove that for a connected Eulerian graph $G$ of odd order, there exists an edge $e$ such that $G-e$ is odd $2$-edge-colorable.
Read the full abstract
Dynamical Systems
Amorphic complexity and entropy for symbolic model sets
We show a continuity result for the Weyl pseudometric on subshifts which are generated by model sets. This fact is then used for multiple constructions of subshifts that exhibit different behavior regarding entropy, amorphic complexity and their maximal equicontinuous factor.
Combinatorics
On the Turán number of double stars
The Turán number of a graph $F$, $ex(n,F)$, is the maximum number of edges in a graph on $n$ vertices which does not contain $F$ as a subgraph. Let $S_{a,b}$ denote a double star with a central edge $uv$, $a$ leaves connected to $u$ and $b$ leaves connected to $v$. The function $ex(n,S_{a,b})$ has been studied for $a=1,2$, their extremal graphs are disjoint copies of $K_{a+b+1}$ and either a small clique or a near $b$-regular graph. In this paper, we further study $ex(n,S_{3,b})$ and determine the extremal graphs, which have more structures than those of $a=1,2$.
Read the full abstract
Group Theory
Entropy on Homogeneous Spaces and Classification Results for Subgroups with the Pair Rapid Decay Property
We study pair rapid decay for homogeneous spaces \(G/H\) and its applications to random walks and subgroup structure. The entropy framework for groups with rapid decay is extended to homogeneous spaces, proving that the asymptotic Shannon entropy on \(G/H\) agrees with a spectral-radius quantity \(c(G,H;\mu)\) for measures with finite entropy and suitable finite moment, and that the lower and upper asymptotic Rényi entropy rates converge to the Shannon entropy as \(\alpha\downarrow1\). For finitely supported measures, we also obtain a spectral-radius formula for the asymptotic Rényi entropy rates \(h_\alpha(X,\mu)\), \(\alpha\in(1,2]\), and hence continuity at \(\alpha=1\). We further introduce the notion of subexponential Lorentz control for pairs \((G,H)\) and study the associated classification problems for finitely generated subgroups \(H\le G\) for which \((G,H)\) has pair rapid decay or belongs to \(\mathbf{SLC}_{\mathrm{subexp}}\). We obtain a complete criterion in the strongly relatively hyperbolic case and explicit classifications in several hyperbolic settings. We also show that for \(G=\mathrm{SL}_n(\mathbb Z)\), \(n\ge3\), the conditions \((G,H)\in \mathbf{SLC}_{\mathrm{subexp}}\), pair rapid decay, and finite index of \(H\) in \(G\) are equivalent.
Read the full abstract
Differential Geometry
A mean curvature flow approach to Hamilton's pinching theorem
Numerical Analysis
Efficient Solution of Generalized Sylvester Equations via Preconditioned Alternating Anderson Acceleration
This paper considers the numerical solution of generalized Sylvester matrix equations, which arise in many scientific and engineering applications but remain challenging to solve efficiently, particularly when the coefficient matrices are general and the spectral radius of the associated operator is large but not greater than $1$. We propose a new iterative method, termed preconditioned-alternating Anderson acceleration (P-aAA), which combines a matrix-oriented variant of Anderson acceleration (AA) with a novel preconditioning strategy. The method alternates between preconditioned fixed-point iterations and Anderson acceleration updates, thereby reducing both computational cost and iteration count. A key contribution is the development of an efficient preconditioning operator based on a first-order Neumann series approximation, which avoids expensive operator inversions while enhancing convergence. We theoretically prove that the proposed preconditioning operator accelerates the convergence rate without increasing the overall computational complexity. Extensive numerical experiments further demonstrate that the proposed approach consistently outperforms existing state-of-the-art methods for both medium- and large-scale problems, achieving substantial reductions in computation time and iteration number.
Read the full abstract
Optimization and Control · Cross-listed from cs.NE
Frenetic Cat-inspired Particle Optimization: a Markov state-switching hybrid swarm optimizer with application to cardiac digital twinning
Designing optimizers that remain effective under tight evaluation budgets is critical in expensive black-box settings such as cardiac digital twinning. We propose Frenetic Cat-inspired Particle Optimization (FCPO), a hybrid swarm method that couples particle swarm optimization-like dynamics with an explicit-state Markov switching controller to schedule exploration and refinement operators online. FCPO integrates (i) state-conditioned bounded motion, (ii) an elite-difference global jump operator to escape stagnation, (iii) eigen-space guided local refinement from elite covariance, and (iv) linear population size reduction to control late-stage computational cost. We benchmark FCPO on five representative functions from the Congress on Evolutionary Computation (CEC) 2022 suite (F1, F2, F3, F6 and F10) at dimensions D$\in${10,20} over 30 independent runs, comparing against PSO, CSO, CLPSO, SHADE, L-SHADE and CMA-ES. FCPO achieves the lowest mean runtime across the ten benchmark cases (average 0.183 s), about 2.3x faster than CMA-ES and 2.6x faster than L-SHADE in our Python implementation. On the multimodal composition function F10 at D=20, FCPO attains the best mean objective (9.625x 10^2 $\pm$ 1.275x 10^3) and remains faster than CMA-ES (0.602 s vs. 1.126 s mean runtime). On structured landscapes (F1–F3) and on the hybrid function (F6), CMA-ES remains the most accurate method, while FCPO substantially improves over classical swarms and maintains a favorable accuracy–runtime trade-off. Finally, in a ventricular activation digital twin calibration task, FCPO reaches the target electrocardiogram (ECG) fidelity (RMSE<0.1 mV) within ~ 40 iterations and produces physiologically plausible activation maps with robust convergence across repeated initializations, supporting its use as a practical optimizer for expensive inverse problems.
Read the full abstract
Optimization and Control
Urban transit network design using spanning tree: A case study of Canberra transit network
Transit network design plays an important role in public transport. With the simplicity of spanning tree, this paper adopts the concept of spanning tree to help (re-)design a public transit network that addresses passenger utility by minimizing the total passenger-kilometers, which can be formulated as a mixed-integer optimization model. However, searching for an optimal minimum passenger-kilometer spanning tree is intractable for a large network. This paper proposes a tabu search based heuristic to quickly output a promising spanning tree. The efficacy of the proposed tabu search based heuristic is verified using the Canberra bus network data. With the flexibility of the proposed tabu search heuristic and the efficiency of the transit system, this paper proposes a greedy algorithm to relax the number of links constraint to add more links that can further minimize the total passenger-kilometers. With the case study of Canberra transit network, this paper provides implications to policy makers to further improve the design of a public transit network.
Read the full abstract
Probability
The truncation property and continuity for the long-range contact process on $\mathbb{Z}^d$
We consider a general class of contact processes on $\mathbb{Z}^d$ with potentially long-range interactions. By adapting well established renormalization arguments to the long-range setting we extend by now classical results for finite-range processes to this more general setting. Particularly, we provide general conditions on the decay of the interactions under which a supercritical process remains supercritical after truncation of the interaction parameter at a sufficiently large distance. Further, for the family of parameters satisfying this latter truncation property, we conclude that the probability of the process to never recover is continuous.
Read the full abstract
Information Theory
Adaptive Power Allocation and User Scheduling for LEO Satellites using Channel Predictions
Low earth orbit (LEO) satellites are a key technology to enable connectivity for rural and remote users. Communication satellites in LEO can provide coverage to much larger areas than terrestrial or aerial systems, while offering improved data rates when compared with geostationary systems. However, a major challenge with LEO satellite communications is the high mobility of the satellite, which results in a rapidly changing communication channel. Due to this, it is challenging to fairly allocate communication resources to multiple users in the system. This work proposes an Adaptive Power Allocation and Scheduling Scheme (APASS) to ensure user fairness in the downlink of a LEO satellite system serving mobile ground users. First, a novel channel and transmission model is introduced to capture the variability in channel statistics due to the satellite's trajectory. Then, a non-convex optimization problem is formulated to maximize the minimum rate across all ground users over a fixed set of time slots. To solve this problem, the proposed APASS dynamically allocates power and schedules transmissions based on predicted future channel gains. Numerical results show that APASS achieves strong performance even with substantial prediction errors, faring close to an upper bound that assumes perfect future channel knowledge. Furthermore, it improves the minimum user rate by a factor of 2.98 compared to equal-power allocation and maintains user fairness with a Jain's fairness index of well above 0.99.
Read the full abstract
Geometric Topology
A note on reducing spheres for the genus-4 Heegaard surface in the 3-sphere
For the genus-$4$ Heegaard surface in the $3$-sphere, we present a sufficient condition for a non-separating weak reducing pair to be separated by a reducing sphere for the surface. As a consequence, we reduce the connectivity problem in the reducing sphere complex for the surface to the problem of showing that any two vertices, whose representative reducing spheres are disjoint from a fixed non-separating compressing disk for the surface, are connected in the complex.
Read the full abstract
Analysis of PDEs
Remarks on Lifespan and Continuation Criteria of Two Dimensional Incompressible Fluid Models
In this paper, we study the lifespan and continuation criteria of several two-dimensional incompressible fluid models. Motivated by a novel energy-vorticity formulation, combining linear transport estimate and a bootstrap argument, we are able to show several longtime existence results of two dimensional fluid models in the close-to-Euler regime. A byproduct of our approach is a new conditional BKM type result for the inhomogeneous incompressible Euler equation.
Read the full abstract
Dynamical Systems
Mathematical modeling of biochemical signal propagation in many-stage enzymatic pathways
Biochemical signalling cascades transduce extracellular stimuli into cellular responses through sequences of discrete, node-to-node activations. While signal fidelity depends critically on local interaction kinetics, the mechanisms governing information propagation in realistic, highly variable kinetic contexts remain poorly understood. In this paper, we develop a mathematical framework for travelling waves in canonical feed-forward pathways governed by nonlinear Michaelis-Menten-type kinetics. For uniform pathways, we characterise the complete steady-state landscape and demonstrate that activation bias (the contribution of the binary states of each node to downstream activation) between connected nodes acts as a key bifurcation parameter dictating wave existence. Extending this framework to heterogeneous networks, we show how parameter gradients and random kinetic variations distort wavefronts and induce heavy fluctuations in propagation speed. To recover predictable signal transmission, we introduce a novel reciprocal-velocity spatial rescaling technique. We demonstrate that this coordinate transformation inherently absorbs local kinetic variations, effectively smoothing wave velocities and preserving wavefront profiles without requiring bespoke parameter tuning or continuous limits. Finally, by testing the framework's limits against extreme parameter variability, we reveal how severe kinetic bottlenecks lead to functional pathway fragmentation, offering a mathematically justified basis for rational model reduction in complex biochemical networks.
Read the full abstract
Representation Theory
Matsuki duality for loop groups
We establish versions of Matsuki duality for loop groups. The main result is a bijection between symmetric loop group orbits and real polynomial loop group orbits on the affine Grassmannians or affine flag varieties. Along the way we obtain orbit parametrizations and make connections with vector bundles on real and twistor-$\mathbb P^1$ and Kottwitz sets .