Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 27 March
We study the long-time behaviour of solutions to a one-dimensional linear Klein-Gordon equation with Kelvin-Voigt damping. One of the interesting features of the equation is that the generator of the associated $C_0$-semigroup has multiple spectral points on the imaginary axis. As our main result, we show that the energy of every possible solution converges to zero as time goes to infinity and, moreover, we provide an optimal polynomial energy decay rate for a certain class of solutions.
Numerical Analysis
A Family of Even-Order Central-Upwind WENO Schemes with Averaged Downwind and Novel Global Smoothness Indicators
We propose a simple yet effective local smoothness indicator for the downwind stencil in central-upwind weighted essentially non-oscillatory (WENO) schemes of even order for hyperbolic conservation laws. Starting from an odd-order upwind WENO scheme, we construct an even-number-of-points stencil by incorporating a downwind substencil whose smoothness indicator is the arithmetic mean of all local smoothness indicators. This straightforward averaging approach incorporates regularity information from the entire stencil without requiring additional tuning parameters or complex formulations. Combined with affine-invariant Z-type nonlinear weights and a carefully designed global smoothness indicator, the resulting scheme, termed WENO-ZA6 for the sixth-order case, achieves optimal convergence rates at critical points up to second order, exhibits favorable dispersion and dissipation properties as confirmed by approximate dispersion relation analysis, and provides sharp, essentially non-oscillatory resolution of discontinuities. Numerical experiments on scalar problems and the one- and two-dimensional Euler equations demonstrate that WENO-ZA6 achieves accuracy comparable to or better than existing sixth-order central-upwind schemes (WENO-CU6, WENO-S6) and the seventh-order WENO-Z7, while requiring approximately 15%–21% less computational time. The framework extends naturally to fourth-, eighth-, and tenth-order schemes.
Read the full abstract
Optimization and Control
A note on first-order and transversality conditions in infinite-horizon continuous-time optimal control models
We provide simple and easily verifiable necessary and sufficient conditions for infinite-horizon continuous-time optimal control problems. Under standard concavity and integrability assumptions, we show that optimal paths are fully characterized by first-order conditions together with a transversality condition. Importantly, the transversality condition is derived as a consequence of the model's structure rather than imposed a priori. Our results apply directly to standard economic models, including optimal growth and consumption–saving problems.
Read the full abstract
Combinatorics
Effect of edge-stretching on Steklov eigenvalues and sharp Steklov eigenvalue bounds on leaf–boundary trees
Let $T$ be a finite tree with leaf set $\dO$ as the boundary and let $\lambda_2$ be the first nontrivial Steklov eigenvalue. Let $D$ and $\ell$ be the maximum vertex degree and the number of leaves, respectively. Motivated by the spectral influence of neck-stretching on Riemannian manifolds, we investigate a discrete counterpart–edge-stretching–and its effect on the Steklov eigenvalues of graphs. We prove that Steklov eigenvalues decrease monotonically under the edge–stretching operation. As a consequence, we prove that $\lambda_2\le D/\ell$, with equality if and only if $T$ is a star. This fundamentally improves the constant in He–Hua's bound $\lambda_2\le 4(D-1)/\ell$ to the optimal value~$1$. We also provide a closed-form diagonalization of the Steklov problem on level–regular trees, yielding explicit eigenvalues and multiplicities. In addition, we provide a general upper bound $\lambda_k\le \min\{1,\,16Dk/\ell\}$ for higher eigenvalues. Systematic numerical experiments verify the sharp bound and provide evidence for the extremal conjecture of Lin–Zhao on balanced minimum–height trees.
Read the full abstract
Mathematical Physics
Conditioning the tanh-drift process on first-passage times: Exact drifts, bridges, and process equivalences
In this article, we consider the Benes process with drift $\mu(x)=\alpha \tanh(\alpha x + \beta)$, with $\alpha > 0$, $\beta \in \mathbb{R}$, that is, the diffusion defined by the stochastic differential equation $dX(t)=\alpha \tanh(\alpha X(t)+\beta)\,dt + dW(t)$, with an absorbing barrier at $x=a$. After deriving the propagator and key associated quantities–the first-passage-time distribution and the survival probability–we then condition this process to have various prescribed first-passage-time distributions. When the conditioning is imposed at an infinite time horizon, this procedure reveals the existence of different processes that share the same first-passage-time distribution as the Benes process, a phenomenon recently observed in the case of Brownian motion with drift. When the conditioning is imposed at a finite time horizon, the procedure shows that the conditioned Benes process and the Brownian motion with drift under the same conditioning exhibit identical behaviors. This strengthens an elegant result of Benjamini and Lee stating that Brownian motion and the Benes process share the same Brownian bridge, and it also connects with more recent findings obtained by conditioning two independent identical Brownian motions with drift, or two independent Benes processes that annihilate upon meeting. Moreover, we show that several conditioned Benes drifts converge near the absorbing boundary to the drift of the taboo diffusion, i.e., the diffusion conditioned to never reach the absorbing boundary, which motivates a parallel analysis of the taboo process itself. Using Girsanov's theorem, we derive its propagator, first-passage-time distribution, and conditioned versions, thereby further clarifying the structural relationships between Benes, Brownian, and taboo dynamics.
Read the full abstract
Numerical Analysis
A Globally Conservative Compact Framework for Conservation Laws: Fourth-Order Schemes with Enhanced Resolution and Stability
The compact finite difference method is a powerful tool for discretizing conservation laws, owing to its inherent flexibility in developing high-resolution and highly stable schemes. In this paper, we propose a framework for the design of genuine globally conservative compact finite difference schemes, which addresses a critical requirement in conservation laws. Within our framework, we rigorously establish that the discrete conservation law maintains strict conservation for flux functions in polynomial spaces with optimal algebraic order, i.e., the discrete scheme achieves an optimal algebraic precision.Our work advances the existing conservative compact finite difference schemes, which rely on approaches to maintaining global conservation that are fundamentally consistent with the method proposed by Lele [Lele, J. Comput. Phys., 1992]. As an application, we propose an algorithm for designing globally conservative fourth-order schemes, aimed at optimizing resolution and asymptotic stability. Three schemes are generated using the algorithm, with their excellent performance across multiple aspects validated through numerical experiments.
Read the full abstract
Functional Analysis
Generalized BMO-type seminorms and vector-valued Sobolev functions
We establish a pointwise limit theorem for a broad class of pa\-ra\-me\-ter-\-de\-pen\-dent BMO-type seminorms as the parameter tends to zero. By introducing novel BMO-type seminorms, we provide a unified framework that extends several existing results and yields non-distributional characterizations of Sobolev-type spaces, both in the scalar and in the vector-valued setting. More precisely, for any open set $\Omega\subset \mathbb{R}^n$ and any $p\in (1, \infty)$, we provide a characterization of the Sobolev space $W^{1,p}(\Omega; \mathbb{R}^m)$. In addition, we characterize the space $E^{1,p}(\Omega;\mathbb{R}^n)$ of $L^p$ maps with $p$-integrable distributional symmetric gradient.\\ Finally, for all $p\in [1, \infty)$, we show that these seminorms converge to integral functionals with convex, $p$-homogeneous integrands associated with the distributional gradient and the symmetric gradient.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach
Synchronous federated learning scales poorly due to the straggler effect. Asynchronous algorithms increase the update throughput by processing updates upon arrival, but they introduce two fundamental challenges: gradient staleness, which degrades convergence, and bias toward faster clients under heterogeneous data distributions. Although algorithms such as AsyncSGD and Generalized AsyncSGD mitigate this bias via client-side task queues, most existing analyses neglect the underlying queueing dynamics and lack closed-form characterizations of the update throughput and gradient staleness. To close this gap, we develop a stochastic queueing-network framework for Generalized AsyncSGD that jointly models random computation times at the clients and the central server, as well as random uplink and downlink communication delays. Leveraging product-form network theory, we derive a closed-form expression for the update throughput, alongside closed-form upper bounds for both the communication round complexity and the expected wall-clock time required to reach an $\epsilon$-stationary point. These results formally characterize the trade-off between gradient staleness and wall-clock convergence speed. We further extend the framework to quantify energy consumption under stochastic timing, revealing an additional trade-off between convergence speed and energy efficiency. Building on these analytical results, we propose gradient-based optimization strategies to jointly optimize routing and concurrency. Experiments on EMNIST demonstrate reductions of 29%–46% in convergence time and 36%–49% in energy consumption compared to AsyncSGD.
Read the full abstract
Probability
A local limit theorem for nonlattice multidimensional random walks in cones
We study the asymptotic behavior of a nonlattice random walk in a general cone of $R^d$ . Following the approach initiated by D. Denisov and V. Wachtel in [8], we use a strong approximation of random walks by the Brownian motion and prove local limit theorems, combining integral theorems for random walks in cones with classical theorems for unrestricted random walks.
Read the full abstract
Statistics Theory
Dependencies in Multiplex Networks: A Motif Count Approach
Multiplex networks are a powerful framework for representing systems with multiple types of interactions among a common set of entities. Understanding their structure requires statistical tools capturing higher-order cross-layer correlations. We develop a comprehensive framework for estimating and testing dependence in exchangeable multiplex networks through motif counts. We first propose a moment-based estimation methodology that extends the multi-layer stochastic block model network histogram to arbitrary motif counts. This allows us to estimate the $2^d-1$ graphons defining a $d$-layer multiplex network. We then derive the joint asymptotic distribution of cross-layer motif counts, that is aligned motifs shared across layers. Extending existing results from the unilayer setting, we show that the limiting distribution in the motif-regular case exhibits a covariance structure involving minimum-based distances between graphons. Finally, we construct hypothesis tests to detect inter-layer similarity and dependence. This work provides a rigorous extension of motif-count asymptotics and inference procedures to the multiplex setting, providing new tools to study high-order dependencies in complex networks.
Read the full abstract
Number Theory
A further $q$-generalization of the (C.2) and (G.2) supercongruences of Van Hamme
Applying the $q$-Zeilberger algorithm, we establish a unified $q$-analogue of the (C.2) and (G.2) supercongruences of Van Hamme, which can be viewed as a refinement of several previously known results. As consequences, we obtain a $q$-analogue of supercongruence involving Bernoulli numbers, as well as a refinement of (G.2) supercongruence.
Read the full abstract
K-Theory and Homology
On the K-theory of algebraic Cuntz-Pimsner rings
We establish a long exact sequence for the homotopy K-theory groups of the algebraic Cuntz-Pimsner rings introduced by Carlsen and Ortega [CO11] by adapting Pimsner's original proof [Pim97] to Cuntz's formalism.
Numerical Analysis
A Fourier spectral method for the cutoff Boltzmann equation: Convergence analysis and numerical simulation
This work presents a novel Fourier spectral method for the cutoff spatially homogeneous Boltzmann equation with Maxwellian and hard potentials. We establish finite-time error estimates in a weighted whole-space $L^2$ norm, with explicit dependence on the velocity cutoff $R$ and the number of Fourier modes $N$.
Read the full abstract
Numerical Analysis
Discrete hypocoercive estimates for discontinuous Galerkin methods: application to the Vlasov-Poisson-Fokker-Planck system
We develop and analyze a class of structure-preserving discontinuous Galerkin schemes for the nonlinear Vlasov-Poisson-Fokker-Planck model, reformulated as a hyperbolic system through a Hermite expansion in the velocity variable. We discretize the Vlasov-Fokker-Planck equation with the discontinuous Galerkin method, while the Poisson equation is approximated with either a discontinuous Galerkin method or a Raviart-Thomas mixed finite element method. We prove the exponential relaxation to equilibrium for suitable initial data, uniformly with respect to the discretization parameters thanks to discrete hypocoercivity arguments. Moreover, we check that the resulting semi-discrete schemes preserve the physical invariants along with the L 2 variational structure of the linearized model. Numerical simulations verify the accuracy and the long-time behavior of the scheme.
Read the full abstract
Probability
On associative neural networks for sparse patterns with huge capacities
Generalized Hopfield models with higher-order or exponential interaction terms are known to have substantially larger storage capacities than the classical quadratic model. On the other hand, associative memories for sparse patterns, such as the Willshaw and Amari models, already exhibit enhanced storage capacities in the sparse regime. In this paper we combine these two mechanisms. We introduce higher-order versions of sparse associative memory models and study their storage capacities in the sense of fixed-pattern stability. For the Amari and Willshaw models with fixed interaction order $n$, we obtain storage scales of order $\frac{N^n}{(\log N)^n}$. When the interaction order grows logarithmically with the number of neurons, the resulting storage scale becomes super-polynomial. We also study higher-order interactions in the block-structured Gripon–Berrou architecture, where the natural storage scale is of order $c^n$. Our results show that the capacity increase caused by higher-order interactions persists in the sparse setting, while the precise storage scale depends on the underlying architecture.
Read the full abstract
Combinatorics
Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
In a colouring of a graph, a vertex is b-chromatic if it is adjacent to a vertex of every other colour. We consider four well-studied colouring problems: b-Chromatic Number, Tight b-Chromatic Number, Fall Chromatic Number and Fall Achromatic Number, which fit into a framework based on whether every colour class has (i) at least one b-chromatic vertex, (ii) exactly one b-chromatic vertex, or (iii) all of its vertices being b-chromatic. By combining known and new results, we fully classify the computational complexity of b-Chromatic Number, Fall Chromatic Number and Fall Achromatic Number in $H$-free graphs. For Tight b-Chromatic Number in $H$-free graphs, we develop a general technique to determine new graphs $H$, for which the problem is polynomial-time solvable, and we also determine new graphs $H$, for which the problem is still NP-complete. We show, for the first time, the existence of a graph $H$ such that in $H$-free graphs, b-Chromatic Number is NP-hard, while Tight b-Chromatic Number is polynomial-time solvable.
Read the full abstract
Numerical Analysis
Divergence-free unfitted finite element discretisations for the Darcy problem
We develop an unfitted compatible finite element discretisation for the Darcy problem based on $H(\mathrm{div})$-conforming flux spaces and discontinuous pressure spaces. The method is designed to preserve pointwise discrete mass conservation while remaining robust in the presence of arbitrarily small cut cells arising from unfitted meshes. Robustness is achieved by combining an $L^2$-stabilisation of the flux with an additional mixed-term stabilisation that enhances pressure control without destroying the local conservation structure. We consider both cell-wise (bulk) and face-based ghost-penalty realisations of the stabilisation. Mixed boundary conditions are handled by weak imposition of both flux and pressure traces on unfitted boundaries. We prove stability and a priori error estimates with constants independent of the cut configuration, and establish pressure-robust flux error bounds in the case of pure pressure boundary conditions. We also introduce an augmented Lagrangian variant that improves control of the conservation constraint and is amenable to efficient preconditioning strategies. Numerical experiments for a range of cut configurations, boundary-condition regimes and parameter choices confirm the theoretical results, demonstrating optimal convergence, cut-independent conditioning and mass conservation up to solver tolerance.
Read the full abstract
Group Theory
Topologically simple and metrizable free groups with no non-trivial NSS quotients
A topological group $G$ is said to have no small subgroup (resp. no small normal subgroup) if it admits an open neighbourhood of the identity containing no non-trivial subgroup (resp. normal subgroup) of $G$. These properties are usually denoted by NSS (and respectively NSnS). The NSS property plays an important historical role in the solution to the fifth problem of Hilbert due to Gleason, Montgomery-Zippin and Yamabe for the characterization of Lie groups. In 2019, Shakhmatov and the author proved that a free group $F$ with countably infinitely many generators admits a metric Hausdorff group topology $\mathscr{T}$ which satisfies the so-called algebraic small subgroup generating property ASSGP: for each open neighbourhood $U$ of the identity of $F$, the family of subgroups contained in $U$ algebraically generates $F$. In particular $(F,\mathscr{T})$ admits no non-trivial continuous homomorphisms to either NSS or locally compact groups, making it minimally almost periodic. In this paper, we prove that $(F, \mathscr{T})$ can be made topologically simple; namely, $(F, \mathscr{T})$ contains no closed normal subgroups other than $\{e\}$ and $F$. In particular, this implies that $F$ satisfies the no small normal subgroup (NSnS) property.
Read the full abstract
Mathematical Physics
Lieb-Robinson bounds for Bose-Hubbard Hamiltonians: A review with a simplified proof
We review recent progress on state-dependent Lieb–Robinson bounds for Bose–Hubbard Hamiltonians. In particular, Kuwahara, Vu, and Saito established that, for general bounded-density initial states, the Lieb–Robinson velocity is bounded by $t^{d-1}$ for large times, where $d$ denotes the lattice dimension. We present a shorter proof of the weaker, but still polynomial velocity bound $t^{d+\epsilon}$.
Read the full abstract
Dynamical Systems
Non-bulging Fatou components for transcendental skew-products
In this paper, we investigate the bulging of escaping or oscillating Fatou components on invariant fibers for general skew-products, with a focus on the dependence on the perturbation. We show that any orbitally unbounded component is non-bulging for an appropriate choice of perturbation, whereas sufficiently well-behaved perturbations can render it bulging when the fiber is attracting. Our results highlight that bulging is influenced by more than just the dynamics on the fiber and in the one-dimensional coordinate, contrasting sharply with established results for non-escaping Fatou components.
Read the full abstract
Information Theory
SAFT: Sensitivity-Aware Filtering and Transmission for Adaptive 3D Point Cloud Communication over Wireless Channels
Reliable transmission of 3D point clouds over wireless channels is challenging due to time-varying signal-to-noise ratio (SNR) and limited bandwidth. This paper introduces sensitivity-aware filtering and transmission (SAFT), a learned transmission framework that integrates a Point-BERT-inspired encoder, a sensitivity-guided token filtering (STF) unit, a quantization block, and an SNR-aware decoder for adaptive reconstruction. Specifically, the STF module assigns token-wise importance scores based on the reconstruction sensitivity of each token under channel perturbation. We further employ a training-only symbol-usage penalty to stabilize the discrete representation, without affecting the transmitted payload. Experiments on ShapeNet, ModelNet40, and 8iVFB show that SAFT improves geometric fidelity (D1/D2 PSNR) compared with a separate source–channel coding pipeline (G-PCC combined with LDPC and QAM) and existing learned baselines, with the largest gains observed in low-SNR regimes, highlighting improved robustness under limited bandwidth.
Read the full abstract
Algebraic Geometry
Lattice homology of integrally closed submodules and Artin algebras
The general construction of lattice (co)homology assigns to a lattice $\mathbb{Z}^r$ and a weight function $w:\mathbb{Z}^r \to \mathbb{Z}$ a bigraded $\mathbb{Z}[U]$-module $\mathbb{H}_*$. The weight function $w$ is often obtained from some geometric data as the difference of two `height functions'. In this paper we consider the case when these height functions are Hilbert functions of valuative multifiltrations on a Noetherian $k$-algebra $\mathcal{O}$ and a finitely generated $\mathcal{O}$-module $M$. We introduce the notion of `realizable submodules' in $M$, the prime example of which are finite codimensional integrally closed submodules in the sense of Rees (or integrally closed ideals when $M=\mathcal{O}$). We prove, that whenever two sets of `extended' discrete valuations `realize' the same submodule $N \leq M$, then, although the corresponding lattices and weight functions might be different, the resulting lattice homology modules are isomorphic and have Euler characteristic $\dim_k(M/N)$. In this way, we associate a well-defined lattice homology to any quotient of type $M/N$, where $N$ is a realizable submodule of $M$. We also present some structural and computational results: e.g., we geometrically characterize the (lattice) homological dimension of integrally closed monomial ideals of $k[x,y]$. The main upshot of the paper, however, is the possibility of categorifying numerical invariants defined as codimensions of realizable submodules or integrally closed ideals. The geometric applications include: the delta invariant $\delta(C, o)$ of a reduced curve singularity; the geometric genus $p_g(X, o)$, the irregularity $q(X, o)$ and the various plurigenera of higher dimensional isolated normal singularities. The corresponding categorifications generalize the analytic lattice homologies of Ágoston and the first author.
Read the full abstract
Combinatorics
List packing of graphs with bounded tree-width
Assume $L$ is a $k$-assignment of a graph $G$. An $L$-packing $\phi$ of $G$ is a sequence $\phi=(\phi_1, \ldots, \phi_k)$ of $k$-mappings such that each $\phi_i$ is an $L$-coloring of $G$, and for each vertex $v$ of $G$, $\{\phi_1(v), \ldots, \phi_k(v)\} = L(v)$ (and hence $\phi_i(v) \ne \phi_j(v)$ when $i \ne j$). We say $G$ is list $k$-packable if for any $k$-assignment $L$ of $G$, there is an $L$-packing of $G$. The list packing number $\chi_l^{\star}(G)$ of $G$ is the minimum integer $k$ such that $G$ is $k$-packable. For a positive integer $d$, let $t(d)$ be the maximum packing number of graphs of tree-width at most $d$. It was known that $d+1 \le t(d) \le 2d$ for any $d$. In this paper, we prove that $t(d) \le 2d-1$ for $d \ge 3$, and $t(d) \ge d+2$ for $d \ge 2$. In particular, $t(2)=4$ and $t(3)=5$. Furthermore, we show that for constant positive integers $k, d$, the problem of determining $\chi_l^{\star}(G)\leq k$ or not for a graph $G$ of tree-width at most $d$ is solvable in linear time.
Read the full abstract
Algebraic Geometry
Smooth plane curves with a unique outer Galois point and their automorphism groups
We consider smooth plane curves $\mathcal{X}$ of degree $d\geq4$, defined over an algebraically closed field of characteristic $0$, that possess a unique outer Galois point. This geometric condition forces the curve to be a cyclic covering of the projective line, and ensures that its automorphism group fits into a specific theoretical framework. For each possible non-cyclic reduced automorphism group $\operatorname{Aut}_{\operatorname{red}}(\mathcal{X})$, we fully characterize the defining equation of $\mathcal{X}$ and the precise structure of its full automorphism group $\operatorname{Aut}(\mathcal{X})$. This comprehensive analysis not only identifies the exact form of the equation for each automorphism type but also establishes the detailed criteria under which these scenarios can occur, thereby offering a complete classification of defining equations for smooth plane curves with a unique outer Galois point and a non-cyclic reduced automorphism group.
Read the full abstract
Spectral Theory
Bounds on eigenvalue ratios of quantum graphs
We study ratios of eigenvalues of the Laplacian on compact metric graphs. Our goals are threefold: First, we prove a sharp Ashbaugh–Benguria-type bound for the ratio of the first two eigenvalues on compact trees with Dirichlet conditions at all leaves, concretely showing that the ratio is maximized when the graph is an interval or an equilateral star. This improves a previous Payne–Pólya–Weinberger-type result due to Nicaise [Bull. Sci. Math., II. Sér. 111 (1987), 401–413]. Second, we extend this bound to a set of inequalities for the ratio of any pair of eigenvalues of such compact Dirichlet trees which respect the Weyl asymptotics up to an absolute constant. Third, we show that on non-trees, on which we also allow any mix of Neumann and Dirichlet conditions at the leaves, it is possible to recover bounds on the eigenvalue ratios depending only on the number of independent cycles and the number of Neumann leaves, in addition to the eigenvalue indices. This complements previously known counterexamples to analogues of the Ashbaugh–Benguria bound for general quantum graphs, by showing that the only way the bound can fail is through cycles and Neumann leaves, and by explicitly quantifying the extent to which it can fail.
Read the full abstract
Analysis of PDEs
An inverse problem for semilinear wave equations on metric tree graphs
We study the inverse problem for a semilinear wave equation on metric tree graphs. From the Dirichlet-to-Neumann map defined at all but one of the boundary vertices, we recover unknown connectivity of the graph, lengths of the edges, the time-independent potential and the time-dependent coefficient of the nonlinear term of the equation.
Read the full abstract
Analysis of PDEs
Effective elastic wave transmission through a periodically voided interface
Effective interface conditions for a periodically voided thin layer separating two homogeneous bulk regions are derived for the elastic wave equation by taking the simultaneous limit of vanishing layer periodicity and layer thickness. The limit problems are obtained using the unfolding method for thin perforated domains. We consider three different scalings of the material parameters in the layer that characterise its stiffness, each leading to a distinct type of interface condition and requiring the solution of scaling-dependent cell problems. Depending on the scaling, the resulting effective model yields either a membrane equation or a Kirchhoff-Love plate equation. In the critical regime of reduced stiffness, the interface equation additionally depends on the microscopic variable. By selecting appropriate cell problems, this equation can be reformulated as an effective interface condition between the bulk domains.
Read the full abstract
Analysis of PDEs
Large time asymptotic behavior for the weakly damped Jordan-Moore-Gibson-Thompson equation
This manuscript considers the Jordan-Moore-Gibson-Thompson (JMGT) equation and its linearized equation with an additional weak damping term (proposed by [B. Kaltenbacher, Inverse Problems (2025)] firstly) in the whole space $\mathbb{R}^n$. We mainly study the unique existence and large time behavior, including optimal decay estimates and asymptotic profiles, of global in-time Sobolev solutions for any $n\geqslant 1$. This weak damping term leads to diffusion profiles in the sub-critical case $\delta>0$ and regularity-loss decay properties in the critical case $\delta=0$, which are greatly different from the results for the corresponding classical models without the weak damping term.
Read the full abstract
Group Theory
Torsion subgroups and fixed-point rigidity in CAT(0) geometry
We develop new methods for studying groups acting on CAT(0) spaces, which lead to several general structural results. First, we prove that every torsion subgroup of a CAT(0) group is finite, resolving a question of Swenson from the 1990s. The proof is based on showing that random walks on any finitely generated torsion group with bounded exponent acting on a CAT(0) space have zero drift. This is then combined with the fixed-point rigidity that we develop. Second, we show that any finitely generated torsion group of bounded exponent has a global fixed point whenever it acts properly by isometries on a CAT(0) space of bounded geometry, or, without the properness assumption, by isometries on a finite-dimensional CAT(0) space. Third, we establish a Kazhdan-type rigidity principle that underlies many of our results: let $\Gamma$ be a finitely generated group such that every isometric action of $\Gamma$ on $\mathbb{R}^n$ has a fixed point. Then every fixed-point-free action of $\Gamma$ on a geodesically complete $n$-dimensional CAT(0) space of bounded geometry has joint minimal displacement uniformly bounded away from zero. In particular, almost fixed points imply a global fixed point. This applies in particular to groups with property (T), torsion groups, certain branch groups, and mapping class groups. Fourth, we establish the following alternative for any finitely generated amenable group: either every action on a finite-dimensional CAT(0) space has a global fixed point, or the group has non-vanishing virtual first Betti number. Further consequences include that finitely generated torsion groups cannot act without a global fixed point on geodesically complete CAT(0) spaces of bounded geometry that are either visibility spaces or have compact Tits boundary. The methods involve scalings of actions by ultralimits and random walks.
Read the full abstract
Mathematical Physics
Exponential decay of correlations at high temperature in $H^{2|2n}$ nonlinear sigma models
We consider a family of nonlinear sigma models on $\mathbb{Z}^{d}$ whose target space is the hyperbolic super manifold $H^{2|2n}$, $n >1$, introduced by Crawford as an extension of Zirnbauer's $H^{2|2}$ model for disordered systems. We prove exponential decay of the two-point correlation function in the high-temperature regime $\beta \leq C n^{-1}$, with $C>0$ a universal constant, for any $n>1$ and any dimension $d\geq 1$, with mass $\log \beta^{-1}$. We also consider models with long-range interaction and prove fast decay in the same high-temperature regime. The proof is based on the reduction to a marginal fermionic theory and combines a high-temperature cluster expansion, exact combinatorics and bounds derived via Grassmann norms.