Mathematical Physics
On invariant solutions of linear time-fractional diffusion-wave equations with variable coefficients
Sodbaatar Adiya, Khongorzul Dorjgotov, Bayarmagnai Gombodorj et al. (+2 more)
We study invariant solutions of a certain class of time-fractional
diffusion-wave equations with variable coefficients via Lie
symmetry analysis. In physics, the fractional
diffusion equation describes transport dynamics that are governed by anomalous
diffusion while the fractional wave equation describes oscillations and wave propagation in various physical systems. In order to obtain exact invariant solutions of these equations, we firstly determine infinitesimal
symmetries with respect to the variable coefficients of the equations. With the help of these
symmetries, we then find solutions in terms of Mittag-Leffler functions, generalized Wright functions and Fox H-functions.
Read the full abstract ▾
All authors Sodbaatar Adiya, Khongorzul Dorjgotov, Bayarmagnai Gombodorj, Hiroyuki Ochiai, Uuganbayar Zunderiya
Optimization and Control · Cross-listed from eess.SY
A Convexified Eulerian Framework for Scalable Coordination of Massive DER Populations
Ge Chen, Yiwei Qiu, Shiyao Zhang et al. (+3 more)
This paper proposes a scalable coordination framework with aggregator-side
privacy protection for storage-like distributed energy resources (DERs). The framework adopts a two-layer architecture. At the macroscopic layer, building upon an Eulerian modeling perspective, the DER population is represented as a continuum whose density
evolution is governed by a partial differential equation (PDE), such that the computational complexity is independent of the population size. To address the bilinear non-convexity in this PDE-constrained optimization problem, we develop a convexification method that combines finite-volume discretization with a flux-lifting technique, reformulating the macroscopic problem into a sparse linear program (LP). The LP solution yields a unified, state-dependent broadcast signal for population coordination. Furthermore, a Wasserstein-based relaxation is introduced to replace rigid cyclic constraints and provide additional operational flexibility for improved economic performance. At the microscopic layer, individual resources autonomously recover local setpoints from the broadcast signal and their local states, while an upstream data-mixing protocol aggregates individual states into a macroscopic density histogram without exposing raw individual states to the aggregator. Numerical studies validate the scalability, feasibility, and economic effectiveness of the proposed framework.
Read the full abstract ▾
All authors Ge Chen, Yiwei Qiu, Shiyao Zhang, Pengfei Su, Haoran Deng, Hongcai Zhang
Mathematical Physics
How it cools? Studying the heat flow out of a semi-infinite slab in welding: An analytical approach
Fawzi Aly, Alex Kitt and Luke Mohr
Additive manufacturing and welding processes are highly sensitive to heat dissipation, where improper thermal management leads to residual stresses, distortions, and cracking. Existing heat transfer models, such as Rosenthal's solutions, fail to handle finite 3D geometries, cooling effects, or transient behavior, limiting their accuracy. We overcome these limitations by developing an analytical framework that incorporates cooling boundary conditions mimicking Newton's Law of Cooling. Using two different and proven-equivalent approaches, Laplace transform and
Fourier series, we derive closed-form solutions for transient and steady-state temperature profiles under various heat sources, including Gaussian, ellipsoidal, double-ellipsoidal, and time-dependent on/off switch sources. We compare our analytical solutions to numerical implementations, demonstrating strong agreement while providing deeper physical insight. This approach significantly reduces computational cost and experimental requirements, making it a scalable tool for optimizing thermal predictions and mitigating residual stresses in metal-based manufacturing. Additionally, our framework enables the generation of synthetic
datasets for machine learning models to predict heat distribution efficiently.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Optimum adaptation of a Steiner network
Manou Rosenberg, Mengbin Ye and Brian D.O. Anderson
The Euclidean Steiner tree problem, normally posed in two dimensions, seeks to connect a set of prescribed terminal nodes by placing additional nodes, known as Steiner points, with edges connecting such nodes either to another Steiner point or a terminal node, and with the placements minimising the sum of all the edge lengths of the associated tree. We consider a problem in which we start with a known solution to a Steiner tree problem, and the terminal positions are then perturbed. A first-order approximation
theorem is established for efficiently updating the Steiner point positions to recover a Steiner tree solution after the perturbations to terminal nodes. Numerical examples illustrate the effectiveness of our approach (including a stepwise application for large perturbations) as well as its limitations.
Read the full abstract ▾
Algebraic Geometry
Two New Extensions of Reider's Theorem on Algebraic Surfaces
Aaron Bertram, Jonathon Fleck, Liebo Pan et al. (+1 more)
Reider's
Theorem on the very ampleness of adjoint linear series on a complex projective algebraic surface is extended in two new directions. First, Reider-type inequalities are shown to imply nefness of linear series of the form dH - E on the blow-up of projective space along the embedded surface. This can be thought of as a weak analogy of Saint-Donat's
Theorem on the generators of the ideal of a curve embedded by an adjoint linear series. Next, Reider-type inequalities give a sharp estimate for the ample cone of the
Hilbert schemes of length d subschemes of the surface. The proofs consist of (a) finding a natural family of objects parametrized by the base (either the blow-up along the surface or the
Hilbert scheme) and (b) finding the largest chamber in the stability
manifold of the surface where the objects in the family are all Bridgeland semistable. A
Theorem of Bayer-Macri then gives nefness of the determinant line bundle on the base of the family.
Read the full abstract ▾
All authors Aaron Bertram, Jonathon Fleck, Liebo Pan, Joseph Sullivan
Geometric Topology
Real link Floer homology
Yonghan Xiao
In this paper, we define real link Floer homology for strongly invertible and doubly periodic links in closed real $3$-
manifolds with connected fixed sets, which generalizes real Heegaard Floer homology and real sutured Heegaard Floer homology. We give a combinatorial description of the theory in $S^3$ via real grid diagrams and use it to investigate structural properties of the theory as well as properties of strongly invertible
knots. A computer implementation computing real grid homology of
knots was written by Zhenkun Li. An appendix including real grid homology of 50+ small
knots is made jointly by Zhenkun Li and the author, from which we observe several interesting phenomenon.
Read the full abstract ▾
Functional Analysis
Lean-certified four-point HRT results for three lattice points and one off-lattice point
Vignon Oussa
We record a Lean-certified
theorem package for the four-point Heil–Ramanathan–Topiwala configuration \[ \Lambda=\{0,a,b,\nu\}\subset \R^2, \qquad \Lzero=\Z a+\Z b, \qquad \nu=r a+s b, \] with $a$ and $b$ linearly independent. The principal certified
theorem states that if $|\symp(a,b)|>1$ and $1,r,s$ are linearly independent over $\Q$, then for every nonzero $f\in L^2(\R)$ the four vectors \[ f,\qquad \pi(a)f,\qquad \pi(b)f,\qquad \pi(\nu)f \] are linearly independent. A second certified
theorem treats the rational-coordinate case $r,s\in \Q$, where the configuration lies in a finer full-rank
lattice and linear independence follows from Linnell's
theorem. The paper is written in standard mathematical prose. An appendix records the precise Lean certification ledger and the explicit analytic inputs used by the formal development and a download link is provided.
Read the full abstract ▾
Dynamical Systems
Smoothness of Inertial Manifold for the Burgers Equation
Ziqi Niu, Xinhua Li, Chunyou Sun et al. (+1 more)
This paper establishes a ${C^{n,\varepsilon }}$-smooth extension of the inertial
manifold for the one-dimensional Burgers equation, which demonstrates that its long-time behavior can be completely determined by explicit smooth first-order ODEs. We first devise a new framework for an abstract equation with two nonlinear terms, where one preserves regularity and the other reduces regularity, and derive sufficient conditions for constructing the ${C^{n,\varepsilon}}$-smooth extension of the IM by treating these two nonlinear terms separately.
Read the full abstract ▾
All authors Ziqi Niu, Xinhua Li, Chunyou Sun, Xiaoqing Yang
Analysis of PDEs
Temporal decay estimates for global solutions of the Navier-Stokes equations with the Coriolis force
Tomoaki Yoshizawa
We consider temporal decay estimates for global solutions of the Navier-Stokes equations with the Coriolis force. We show that under several conditions including the smallness of the initial data, the solution decays as fast as the corresponding linearized solutions, and its decay rate is higher than expected from the flow of the heat equation. The estimates are derived for all $L^p$-norms with $p\in[2, \infty].$
Read the full abstract ▾
Analysis of PDEs
Critical Compression in Axisymmetric Swirl
Rishad Shahmurov
We study two scale-critical inward-compression mechanisms in smooth axisymmetric Navier–Stokes flow with swirl. For the weighted swirl family Y_d=r^d u^theta, -1<=d<1, an exact L^p balance yields a signed radial-compression action. If p>=3/(1-d), finite L^p mass and a bounded signed action imply continuation. On the critical diagonal Y_q=r^(1-3/q)u^theta, q>=3/2, the integrating factor is universal, exp(3 int Ubar_q); H^1 data automatically supply the critical mass for 2<=q<=3, while bounded circulation extends this to every finite q>3. Independently, a sliding Petrovskii displacement criterion reaches the endpoint coefficient 2 and admits a quantified iterated-log correction, while a pulse train shows terminal-only control is insufficient. For profiles with the corresponding weighted moments, the instantaneous Hodge response to partial_z(F^2) is non-amplifying for power-weighted compressive F^2-work throughout 1<=alpha<=5. Thus a finite-time singularity must escape a continuum of critical signed-compression detectors and recurrently cross the Petrovskii wall.
Read the full abstract ▾
Geometric Topology
Cannon–Thurston maps for Anosov foliations
Ellis Buckminster
Universal circles, introduced by Thurston and Calegari–Dunfield, are not well understood in general. Recently, the author together with Taylor showed that Anosov foliations with branching admit nonconjugate universal circles. We continue the study of these universal circles and show that for an Anosov foliation with branching on a
hyperbolic manifold, the leftmost universal circle admits a Cannon–Thurston-type map to the ideal 2-sphere. This is a new type of construction of a Cannon–Thurston map. As a corollary, we show the fundamental group of the
manifold acts on the leftmost universal circle with pseudo-Anosov dynamics.
Read the full abstract ▾
Analysis of PDEs
A Temperature-Coupled Cahn-Hilliard-Stokes-Heat Model for Thermally Driven Phase Separation
Maria Deliyianni, Boris Muha and Andrej Novak
We study a diffuse-interface model for thermally driven phase separation in viscous incompressible mixtures. The system couples a convective Cahn-Hilliard equation for the order parameter with a Stokes subsystem for the velocity-pressure field and a heat equation for the temperature. Temperature enters the bulk free energy through a Landau-type coefficient, while the phase field affects the flow through concentration-dependent density and viscosity. The model serves as a proxy for temperature-triggered condensation-like phase separation; humidity, latent heat, vapor pressure, and capillary forcing are absorbed into the choice of the threshold temperature $\Theta_S$. We motivate the chemical potential through a temperature-dependent Landau free energy and use a regularized auxiliary formulation to prove local-in-time existence of weak solutions. For the numerical analysis, we employ a first-order sequential finite-element discretization of a simplified quasi-static formulation. The heat equation is advanced by implicit
diffusion, the variable-coefficient Stokes problem is treated by a Taylor-Hood discretization, and the Cahn-Hilliard bulk derivative is evaluated at the previous time level, so each algebraic subproblem is linear. An isothermal diffusive test confirms mass conservation to roundoff and exhibits monotone discrete-energy decay for the tested parameters. Time-step and mesh-refinement studies show first-order temporal and approximately second-order spatial behavior. The remaining computations provide qualitative, parameter-specific illustrations; no global discrete energy law is claimed for the non-isothermal sequential scheme.
Read the full abstract ▾
Number Theory
Moments and joint nonvanishing of symplectic $L$-functions
Valentin Blomer and Soumya Das
We compute an asymptotic formula for a moment involving the spinor and the standard $L$-functions for holomorphic Siegel cusp forms of degree two and large weight $k$. Applications include simultaneous non-vanishing statements and lower bounds for second moments.
Combinatorics
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
Benjamin Przybocki, John Mackey, Marijn J. H. Heule et al. (+1 more)
Ramsey-good graphs are graphs that contain neither a clique of size $s$ nor an independent set of size $t$. We study doubly saturated Ramsey-good graphs, defined as Ramsey-good graphs in which the addition or removal of any edge necessarily creates an $s$-clique or a $t$-independent set. We present a method combining SAT solving with bespoke LLM-generated code to discover infinite families of such graphs, answering a question of Grinstead and Roberts from 1982. In addition, we use LLMs to generate and formalize correctness proofs in Lean. This case study highlights the potential of integrating automated
reasoning, large
language models, and formal verification to accelerate mathematical discovery. We argue that such tool-driven workflows will play an increasingly central role in experimental mathematics.
Read the full abstract ▾
All authors Benjamin Przybocki, John Mackey, Marijn J. H. Heule, Bernardo Subercaseaux
Analysis of PDEs
Analysis of the sine-Gordon equation with a nonlinear $\delta$-potential
Sergio Moroni and Ramón G. Plaza
This paper is devoted to the analysis of the following nonlinear wave equation \[ u_{tt} - u_{xx} + (1 + q\delta_0(x)) \sin u = 0, \] where $\delta_0 = \delta_0(x)$ is the Dirac delta function centered at the origin and $q \in \mathbb{R}$ is a constant. Equations of this form arise in the study of propagating
solitons in the presence of a localized inhomogeneity. It is proved that the Cauchy problem for this equation is globally well-posed in the energy space $H^1_{\sin} \times L^2$. A complete characterization of stationary waves in the energy space, based on the parameter $q$, is also provided. Finally, a criterion to determine the stability or instability of the stationary waves, which depends upon the sign of the parameter $q$, is established.
Read the full abstract ▾
Combinatorics
3-Designs from $\mathrm{GL}_2(\mathbb{F}_q)$-Invariant Subspaces of $\mathbb F_q[X,Y]_k$
Lewen Wang, Huawei Wu and Sihuang Hu
We present a uniform framework for constructing $3$-designs from $\mathrm{GL}_2(\mathbb F_q)$-invariant subspaces of $\mathbb F_q[X,Y]_k$, the space of homogeneous
polynomials of degree $k$. Given such a subspace $W$, we associate a $\mathrm{PGL}_2(\mathbb F_q)$-invariant family of $k$-subsets of $\mathbb P^1(\mathbb F_q)$. Whenever this family is nonempty, it forms a $3\text{-}(q+1,k,\lambda)$ design. Via the Cayley transform, the construction is reformulated on the unit circle $U_{q+1}\subseteq \mathbb F_{q^2}^{\times}$, where the block conditions become explicit linear relations among elementary symmetric
polynomials. This reformulation unifies several previously disparate constructions and simplifies a number of delicate ad hoc computations. When $k\le q$, the evaluation map on $\mathbb P^1(\mathbb F_q)$ identifies $W$ with a subcode $C_W$ of the projective Reed–Solomon code. We show that the associated block family is nonempty if and only if $d(C_W)=q+1-k$. Under this condition, the supports of minimum-weight codewords in $C_W$, as well as the supports of suitable fixed-weight codewords in the dual code $C_W^\perp$, yield further $3$-designs. Applying this framework to the Lucas subspaces, which form a distinguished family of invariant subspaces, we obtain explicit block descriptions, classify the cases in which the defining conditions reduce to a single equation, and establish several emptiness and nonemptiness results. In particular, for $q=p^e$ and $k=p^m+1$, we show that the associated block family is nonempty if and only if $m\mid e$, in which case it yields the Steiner system $S(3,p^m+1,q+1)$. Finally, in the ternary case $p=3$ and $k=7$, we use the weight distribution of the ternary Melas code to determine the design parameters left undetermined by Xu et al.
Read the full abstract ▾
Optimization and Control
Discretization error from regularized Reinforcement Learning to continuous-time stochastic control
Huyên Pham, Yuming Paul Zhang and Yuhua Zhu
This paper establishes a rigorous connection between regularized discrete-time reinforcement learning (RL) and continuous-time
stochastic optimal control. Specifically, classical RL
algorithms are typically solving a regularized discrete-time Bellman equation. We study the discretization error, namely, the gap between the optimal policy induced by the regularized discrete-time Bellman equation and the true optimal feedback control of the underlying continuous-time
stochastic control problem. By deriving quantitative convergence rates for this gap, we provide a rigorous foundation for understanding the stability and implementation of exploratory RL policies in
stochastic continuous-time environments.
Read the full abstract ▾
Differential Geometry
The Hopf Algebraic Structure of Finitely Supported Currents on a Lie Group
Harrison Pugh
The space of de Rham currents supported in finitely many points in a Lie group $G$ has the structure of a filtered differential graded
Hopf algebra. The product is given by convolution of compactly supported currents, and the co-product dualizes to wedge product on differential forms. This space arises as the finitely supported sections functor $ \Gamma^{finite} $ applied to the bundle $ \mathcal{U}(G) $ of currents on $ G $ supported at a single (variable) point, and the differential
Hopf algebra operations pull back via $ \Gamma^{finite} $ to bundle maps. Explicit formulas for these bundle maps are obtained, and we show in particular that the convolution product takes the form of a
Hopf-algebraic smash product.
Read the full abstract ▾
Optimization and Control
Revisiting Subgradient Dominance in Robust MDPs: Counterexamples, Hardness, and Sufficient Conditions
Toshinori Kitamura, Arnob Ghosh, Alex Ayoub et al. (+2 more)
Projected subgradient descent (PSD) has gained popularity for solving robust Markov decision processes (RMDPs) because it applies to a broader class of uncertainty sets than traditional dynamic programming. Existing work claims that RMDPs with a general compact uncertainty set satisfy the subgradient dominance property, under which exact PSD finds an $\varepsilon$-optimal policy in a
polynomial number of updates (e.g., Wang et al., 2023). We show that these claims are incorrect. Even when the uncertainty set has cardinality two, the RMDP objective need not be subgradient-dominant and can admit suboptimal strict local minima. Moreover, we prove that finding an $\varepsilon$-optimal policy can be NP-hard even in settings where subgradients are efficiently computable: (i) finite transition uncertainty sets and (ii) $sa$-rectangular finite transition uncertainty sets with finite non-rectangular cost uncertainty sets. Finally, we identify two conditions under which RMDPs do satisfy subgradient dominance: when, for each policy, either the worst-case transition kernel is unique or a robust action-value function exists.
Read the full abstract ▾
All authors Toshinori Kitamura, Arnob Ghosh, Alex Ayoub, Thang D. Chu, Csaba Szepesvári
Differential Geometry
Higher Covariant Derivative and the Bundle of Dirac Currents
Harrison Pugh
Using the higher covariant derivative on a
manifold $ M $ equipped with a torsion-free connection, we define a natural surjective bundle map $ \Phi $ from $ (\otimes(TM))\otimes (\wedge(TM)) $ to the vector bundle $ \mathcal{U}(M) $ of de Rham currents on $ M $ supported in a single (variable) point. The resulting quotient bundle can be thought of as a bundle of generalized Weyl
algebras, with the
symplectic form replaced with the Riemannian
curvature tensor. The fibers of the bundle $ \mathcal{U}(M) $ are differential co-
algebras, and the boundary, co-product and co-unit stitch together to form bundle maps which lift via $ \Phi $ to commuting bundle maps on $ (\otimes(TM))\otimes (\wedge(TM)) $. Interior product, higher-order covariant differentiation, and their $ L^2 $ adjoints also form bundle maps on $ \mathcal{U}(M) $ which lift via $ \Phi $. The higher-order covariant derivative in particular is an $ \mathbb{R} $-
algebra representation of the space $ C^\infty(\otimes(TM)) $ equipped with a non-standard, covariant product. Its composition with interior product yields a quantization of $ \mathcal{U}(M) $ corresponding to a
Hopf-algebraic smash product. Finitely supported and locally finitely supported sections functors can be applied to $ \mathcal{U}(M) $, yielding the spaces of finitely supported and locally finitely supported currents, respectively. In particular, the finitely supported currents on a smooth
manifold are a filtered differential graded co-
algebra in duality with differential forms.
Read the full abstract ▾
Analysis of PDEs · Cross-listed from cs.CE
Making Gaussian Kolmogorov-Arnold Networks Reliable and Accurate
Amir Noorizadegan, Sifan Wang and Leevan Ling
Kolmogorov-Arnold Networks (KANs) replace fixed activations with learnable univariate edge functions whose behavior depends strongly on the chosen basis. Gaussian radial basis functions provide a simple and efficient alternative to splines, but their accuracy and stability are highly sensitive to the scale parameter \(\epsilon\), which has not been studied systematically. We analyze this dependence through the geometry and conditioning of the first-layer feature
matrix. Because the first layer is defined directly on the input domain, any loss of feature distinguishability introduced there propagates through the entire network. Based on this analysis, we identify the practical operating interval \[ \epsilon \in \left[\frac{1}{G-1},\frac{2}{G-1}\right], \] where \(G\) is the number of Gaussian centers. This interval is proposed as a stable design rule rather than a universal optimum. Extensive experiments on function approximation and physics-informed problems confirm its reliability across different collocation densities, grid resolutions, architectures, and input dimensions. We also show how the same principle supports fixed-scale selection, variable-scale models, constrained optimization of \(\epsilon\), and efficient scale search using early-stage training error. These results establish scale selection as a central design principle for reliable and accurate Gaussian KANs.
Read the full abstract ▾
General Topology
Advanced manifold-metric pairs
Pierros Ntelis
This article presents a novel mathematical formalism for advanced
manifold–metric pairs, enhancing the frameworks of geometry and
topology. We construct various D-dimensional
manifolds and their associated metric spaces using functional methods, with a focus on integrating concepts from mathematical physics, field theory,
topology,
algebra, probability, and statistics. Our methodology employs rigorous mathematical construction proofs and logical foundations to develop generalized
manifold–metric pairs, including homogeneous and isotropic expanding
manifolds, as well as probabilistic and entropic variants. Key results include the establishment of metrizability for topological
manifolds via the Urysohn Metrization
Theorem, the formulation of higher-rank tensor metrics, and the exploration of complex and quaternionic codomains with applications to cosmological models like the expanding spacetime. By combining spacetime generalized sets with information-theoretic and probabilistic approaches, we achieve a unified framework that advances the understanding of
manifold–metric interactions and their physical implications.
Read the full abstract ▾
Rings and Algebras
Globalization of Partial Group Actions on Not Necessarily Associative Algebras and Covariant Representations
Mikhailo Dokuchaev, Emmanuel Jerez and José L. Vilca-Rodríguez
We extend the concept of a partial group action to non-associative
algebras in a variety \(\mathcal{V}(I)\), solve the globalization problem within \(\mathcal{V}(I)\) and examine its universal property. It is achieved using what we call the “$\Lambda$-construction”, which we also apply to deal with covariant representations in the associative and Lie
algebra settings, considering related categories and constructing an adjoint pair of functors between them. We also show that the $\Lambda$-construction behaves well with semidirect products of Lie
algebras.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Efficient Design of Fronthaul-Constrained Uplink Reception for Cell-Free XL-MIMO
Dogon Kim, Hyunmin Noh and Seok-Hwan Park
With the
evolution of multiple-input multiple-output (
MIMO) technology toward extremely large (XL)
MIMO systems comprising hundreds of, or more,
antennas, this work investigates scalable and fronthaul-efficient reception design for the uplink of
cell-free (CF) XL-
MIMO systems. In such systems, the uplink signals transmitted by mobile user equipments (UEs) are jointly decoded at a central processing unit (CPU) connected to distributed access points (APs) via finite-capacity fronthaul links. We address the joint optimization of linear transform
matrices, used by the APs to reduce the signal dimension and fronthaul load, and fronthaul compression strategies to maximize the uplink sumrate. A fractional programming (FP)-based iterative
algorithm is first developed, followed by a reduced-complexity variant, termed accelerated FP (A-FP), along with its decentralized implementation whose fronthaul overhead remains independent of the number of AP
antennas. Numerical results show that the proposed A-FP scheme significantly reduces computational complexity compared to FP implemented with general-purpose solvers, while substantially outperforming scalable baseline schemes that rely solely on local channel state information.
Read the full abstract ▾
Probability
Quantitative stochastic homogenization for long-range random walks with critical jump index
Xin Chen, Chenlin Gu and Jian Wang
In this paper, we study the
stochastic homogenization for a class of symmetric random walks in random conductance model, whose one-step transition probability from $x$ to $y$ is proportional to $|x-y|^{-d-2}$. As the associated jumping kernel fails to be $L^2$-integrable yet admits a finite $\alpha$-th moment for all $\alpha\in (0,2)$, we refer to the corresponding process $(X^\w_t)_{t\ge0}$ as a long-range random walk with critical jump index. In this critical regime, the scaled process $\bigl(k^{-1}X_{k^2(\log k)^{-1}t}\bigr)_{t\ge 0}$, whose scaling order is different from the diffusive scaling and the $\alpha$-stable scaling, converges to a Brownian motion. Besides characterizing the limiting Brownian motion, we will give a convergence rate for associated scaled resolvents, which obeys the order $(\log k)^{-\frac{1}{2}+\frac{1}{2(d-2)}+\varepsilon}$ with any $\varepsilon>0$ for all $d>3$.
Read the full abstract ▾
Group Theory
An inductive approach to the Diaz-Park sharpness conjecture
Marco Praderio Bova
We develop tools which use common fusion systems building techniques in order to compute higher limits over the centric orbit category. We apply these tools in order to study both the Diaz-Park sharpness
conjecture as well as the weaker cohomological sharpness
conjecture which predicts vanishing of higher limits only for the
cohomology Mackey functors . Our approach leads to proving cohomological sharpness (but not sharpness) for all saturated fusion systems over p-groups of either maximal nihlpotency or of rank 2 and all
polynomial, Henke-Shpectorov and van Beek fusion systems. This list includes all but 2 of the cases for which cohomological sharpness was previously known as well as most currently known families of exotic fusion systems. For the
polynomial, Henke-Shpectorov and 6 of the van Beek fusion systems, sharpness is also approximated by proving vanishing of all but the first higher limits of any Mackey functor. The distinction our approach makes between sharpness and cohomological sharpness is somewhat surprising and interesting by itself. Our approach draws a new connection between cohomological sharpness and fusion system building techniques. We believe that this connection will lead to a better understanding of both fusion systems and Mackey functors over them.
Read the full abstract ▾