Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 7 April
We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a compact closed form in terms of the Gauss hypergeometric function ${}_2F_1(-n,1/2;1;1-a)$, valid for all complex values of the parameter $a$. The sum admits a natural interpretation in terms of return probabilities of independent simple random walks, linking weighted convolutions of central binomial coefficients to classical probability theory. Furthermore, a refinement via Narayana numbers highlights the contribution of peak distributions in pairs of Dyck paths, providing a finer combinatorial perspective. An integral representation is also proposed, suggesting a connection with orthogonal polynomials and spectral measures. Our approach illustrates how analytic and probabilistic techniques complement combinatorial reasoning in evaluating complex sums.
Numerical Analysis
A boundary integral equation method for Steklov eigenvalue problems for smooth planar domains
In this paper, we present a novel numerical method for computing the Steklov spectrum of bounded and unbounded simply connected planar domains with smooth boundaries. For the unit disk, the Dirichlet-to-Neumann operator can be written explicitly in terms of the classical conjugation operator. We extend this framework to general simply connected domains by expressing the Dirichlet-to-Neumann operator in terms of the generalized conjugation operator, which is defined via the boundary integral equation with the generalized Neumann kernel. Combined with Fourier differentiation on an equidistant boundary grid, this approach leads to a dense algebraic eigenvalue problem for the boundary traces of the Steklov eigenfunctions. The resulting method is simple, highly accurate, and uses only boundary data. It treats interior and exterior problems in a unified manner and reconstructs eigenfunctions inside the domain using the Cauchy integral formula. Numerical experiments on benchmark domains and parameter-dependent smooth families, including ellipses and star-like curves, demonstrate high accuracy and illustrate how the Steklov spectrum changes with geometry.
Read the full abstract
Dynamical Systems · Cross-listed from cs.LG
On Dominant Manifolds in Reservoir Computing Networks
Understanding how training shapes the geometry of recurrent network dynamics is a central problem in time-series modeling. We study the emergence of low-dimensional dominant manifolds in the training of Reservoir Computing (RC) networks for temporal forecasting tasks. For a general linear continuous-time reservoir in the infinite-data limit, we show that the training data generate an invariant subspace of the trained reservoir, whose dimension equals the number of dominant modes. We then specialize to a simplified diagonal linear reservoir, where we link the dominant eigenvalues and eigenvectors to the spectrum of a backward Dynamic Mode Decomposition matrix, which yields a finite-dimensional approximation of the backward-time Koopman operator of the system generating the training data. We illustrate the emergence of these dominant modes during training in simulation, and discuss how the analysis may be extended to nonlinear RC via tangent dynamics and differential p-dominance.
Read the full abstract
Geometric Topology
The ${\rm SL}(2,\mathbb{C})$-character variety of the magic $3$-manifold
We determine the irreducible ${\rm SL}(2,\mathbb{C})$-character variety of the 3-chain link exterior which is called the `magic $3$-manifold', and deduce a formula for the twisted Alexander polynomial associated to each ${\rm SL}(2,\mathbb{C})$-representation.
Geometric Topology
Stably tangential strict hyperbolization
We show that the Charney–Davis strict hyperbolization procedure can preserve stable tangent bundles, answering a question of Charney and Davis. The key input is the construction of many hyperbolizing pieces, obtained using separability properties of hyperbolic cubulable groups. Moreover, these pieces may be chosen so that every face is connected, answering a question of Belegradek. We then apply this construction to suitable cubulations of flat manifolds to produce infinitely many commensurability classes of closed hyperbolic manifolds, both arithmetic and non-arithmetic, with diverse topological features. In particular, we obtain the first examples in which all the Stiefel–Whitney classes are non-trivial below the top degree, and the first orientable examples with non-trivial Pontryagin classes. We also construct infinite towers of finite covers of closed hyperbolic manifolds in which no cover is stably parallelizable or spin. Our methods further yield new pairs of exotic negatively curved Riemannian manifolds.
Read the full abstract
General Topology
Many coarse topologies on the real line
Let c denote the cardinality of the continuum. Let L denote the family of all Hausdorff topologies on the real line coarser than the natural topology. We construct 2^c pairwise non-homeomorphic completely normal topologies in L among which 2^c are Baire and 2^c are of first category. We also construct c pairwise non-homeomorphic completely metrizable topologies in L. Furthermore, we investigate complete lattices of topologies in L and construct extremely long chains of homeomorphic topologies in L.
Read the full abstract
Numerical Analysis
On the submatrices with the best-bounded inverses
The following hypothesis was formulated by Goreinov, Tyrtyshnikov, and Zamarashkin in \cite{goreinov1997theory}. If $U$ is $n\times k$ real matrix with the orthonormal columns $(n>k)$, then there exists a submatrix $Q$ of $U$ of size $k\times k$ such that its smallest singular value is at least $\frac{1}{\sqrt{n}}.$ Although this statement is supported by numerical experiments, the problem remains open for all $1<k<n-1,$ except for the case of $n = 4,\ k=2.$ In this work, we provide a proof for the case $k=2$ and arbitrary $n.$
Read the full abstract
Probability
Banach spaces of continuous paths with finite $p$-th variation
We study pathwise $p$-th variation of continuous paths on a compact interval along a fixed partition sequence. Although the class of continuous paths with finite $p$-th variation is generally not linear, we develop a coefficient-based approach via Faber-Schauder expansions that, for any $p>1$, enables the construction of paths with prescribed $p$-th variation while preserving useful linear structures and Hölder regularity. We first construct continuous paths with linear $p$-th variation from suitable conditions on their Faber-Schauder coefficients. We then prescribe nonlinear $p$-th variation through a multiplicative transformation and show that, whenever nonempty, the class of Hölder continuous paths with a given $p$-th variation is dense in $C([0,1])$. Next, we introduce a transport procedure that turns a Banach subspace of continuous functions into a Banach subspace of paths with explicitly controlled $p$-th variation. We also prove stability of the associated pathwise Föllmer-Itô map on these transported subspaces. Finally, via time-changes, we show that this constructive framework extends from $q$-adic partition sequences to broader classes of dense $q$-refining partition sequences.
Read the full abstract
Numerical Analysis · Cross-listed from physics.comp-ph
Efficient High-order Mass-conserving and Energy-balancing Schemes for Schrödinger-Poisson Equations
We study relaxation-based approaches for conserving mass and energy in the numerical solution of Schrödinger-Poisson (SP) type systems. Relaxation-based methods offer a general approach that can be applied as post-time step processing to achieve conservation with any time-stepping scheme. Here we study two types of relaxation techniques applied to implicit-explicit Runge-Kutta schemes, with Fourier collocation in space. We also study SP equations with time-varying coefficients (which appear naturally in cosmology) where energy is not conserved but satisfies a balance equation. We show that the fully-discrete system conserves both mass and energy (or satisfies the balance equation in case of time-varying coefficients), up to rounding errors. The effectiveness of these methods is demonstrated via numerical examples, including a three-dimensional cosmological simulation.
Read the full abstract
Analysis of PDEs
Numerical study of probabilistic well-posedness of one dimensional fractional nonlinear wave equations
The three dimensional cubic defocusing nonlinear wave equation is known to be ill-posed for general low regularity initial data. Well-posedness can however be recovered globally in time on a probabilistic level, provided the Fourier coefficients of the random initial data follow a sub-Gaussian law, an assumption on which the available proofs rely heavily. In this article we perform numerical simulations of the one dimensional fractional cubic defocusing wave equation in a periodic setting, with low regularity random initial data drawn either from a Gaussian or from a heavy tailed Student law. Besides illustrating probabilistic well-posedness and norm inflation in both the energy subcritical and supercritical regimes, our simulations display no qualitative difference between the heavy tailed and the sub-Gaussian cases. This leads us to conjecture that probabilistic well-posedness holds under the sole assumption that the Fourier coefficients are centered with finite variance.
Read the full abstract
Differential Geometry
Bubble classification of immersions at the boundary of the moduli space with $8\pi$ Willmore energy
We study the asymptotic bubbling behavior of sequences of weak genus-$p$ immersions with diverging conformal classes and limiting Willmore energy of $8\pi$. After applying suitable Möbius transformations, in a strong $W^{2,2}_{\mathrm{loc}}$-limit, we obtain two round spheres at the largest scale and $p+1$ catenoids at the smallest scales. Moreover, we apply this classification to sequences of isoperimetrically, conformally and normalized-total-mean-curvature constrained Willmore minimizers when the constraints approach the boundary of the domain where minimizers exist, respectively.
Read the full abstract
Analysis of PDEs
Quantitative stability of constant equilibria in a non-linear alignment model of self-propelled particles
We are interested in the long-time behaviour of the kinetic Vicsek equation, rigorously derived as the mean-field limit~\cite{bolley2012meanfield} of a coupled system of~$N$ stochastic differential equations describing particles moving at unit velocity and aligning with their neighbours. We focus on the local-in-space version (that may for instance appear as a moderate interaction limit instead of mean-field), which is not a priori globally well-posed and could explode in finite time. Despite its simple expression, little is rigorously established about the behaviour of its solutions. We use hypocoercivity methods to show that finite time explosion does not occur in the vicinity of uniform and homogeneous equilibria in space below the critical threshold. We recast the now-classic~\cite{villani2009hypocoercivity} approach of modifying Sobolev-type norms by adding cross-terms, linked to commutators between the different operators appearing in the kinetic equation. However, the fact that the velocity space is the sphere adds significant subtleties and requires to develop an adapted algebraic framework of operators. Taking advantage of this new framework, we manage to perform an approach \textità la} Hérau~\cite{herau2007short} to show the nonlinear stability. Our main results are a quantitative decay estimate in the case of the whole space, despite the absence of control of the $L^1$ norm of the perturbation, and a gain in regularity at the nonlinear level which allows to have well-posedness and stability in the space~$H^{s,0}(\mathbb{R}^d\times\S)$ for some~$s<\frac{d}2$ (that is to say without a priori uniform bound in space on the~$L^2$ norm in velocity, that would come with Sobolev injection in the case~$s>\frac{d}2$).
Read the full abstract
Commutative Algebra
A Counterexample to Problem 19 on Integer-valued Polynomial Rings
We give a negative answer to Problem 19 of Cahen, Fontana, Frisch, and Glaz concerning the flatness and freeness of rings of integer-valued polynomials. We construct an explicit one-dimensional Noetherian local domain D over the field with two elements and prove that the ring of integer-valued polynomials on D is not flat as a D-module. The argument shows that a certain polynomial is integer-valued on D with values in the integral closure T of D, but does not belong to the product of T with the ring of integer-valued polynomials on D. An application of Elliott's flatness criterion then yields the counterexample. In particular, the ring of integer-valued polynomials on an arbitrary integral domain need not be free.The proof presented in this note was completed by Rethlas, a natural-language automated reasoning system; the author was responsible for reviewing and checking the argument.
Read the full abstract
Probability
Simplicity of random hypergraphs
Random hypergraphs extend the classical notion of random graphs by allowing hyperedges to join more than two vertices, making them well-suited for modeling higher-order interactions in complex systems. Despite their broad applicability, many structural properties of random hypergraphs remain less understood than in the graph setting. One such property is simplicity: the absence of self-loops, multi-hyperedges, and, in the hypergraph context, degenerate hyperedges where hyperedges contain a copy of the same vertex at least twice. While the behaviour of the number of such self-loops and multi-hyperedges is well understood for random graphs through the configuration model, analogous results for hypergraphs are comparatively sparse. In this work, we study both undirected and directed hypergraphs generated by the configuration model with prescribed vertex and hyperedge degrees. We derive exact, explicit expressions for the expected number of self-loops, multi-hyperedges and degenerate hyperedges, extending classical results from the graph setting. In addition, an asymptotical analysis shows that, under mild moment conditions on the degree distribution, the expected fraction of self-loops, multi-hyperedges and degenerate hyperedges vanishes as the number of vertices grows. Our results provide a systematic understanding of simplicity in directed and undirected hypergraph models.
Read the full abstract
Numerical Analysis
Overview of Bayesian Solvers in EEG Distributed Source Models: Prior Selection, Algorithmic Implementation, and Depth Bias Reduction
Electroencephalography (EEG) source imaging aims to reconstruct the spatial distribution of neural activity within the brain from non-invasive scalp measurements. This inverse problem is severely ill-posed due to the low spatial resolution of EEG and the presence of measurement noise, necessitating robust regularization techniques. Bayesian approaches provide a principled framework for incorporating prior knowledge into the solution, where regularization naturally arises through prior distributions and their associated hyperparameters. In this work, we provide an overview of key Bayesian methods for EEG source imaging based on Gaussian, Laplace, and group Laplace priors, with particular emphasis on hierarchical models that promote sparsity. We analyze the connections between these hierarchical formulations and classical optimization techniques, and provide an analytical description of their implementation using expectation -maximization and alternating optimization algorithms. To address the issue of depth bias where deeper sources are systematically underestimated or mislocalized - we extend a statistical signal-to-noise ratio (SNR) framework to derive depth-weighted priors that account for differences in how strongly sources at different depths are reflected in the measurements. Finally, we illustrate the behaviour of the considered models through simulation studies involving sources at varying depths. The results highlight the impact of prior selection and depth weighting on reconstruction accuracy and demonstrate the importance of informed model design for depth-sensitive EEG source localization.
Read the full abstract
Analysis of PDEs
Exponential mixing for nonlinear Schrödinger equations perturbed by bounded degenerate noise
We prove the exponential convergence to a unique invariant measure for locally damped nonlinear Schrödinger equations, perturbed by bounded noise acting on only two Fourier modes. To tackle the lack of smoothing effect, we introduce asymptotic compactness of linearized system to enhance the coupling method. Inspired by [14,33,39], we establish a new criterion for exponential mixing. Elements from global stability, nonlinear smoothing, and geometric control are combined when applying this criterion.
Read the full abstract
Probability
Well-posedness and Hurst parameter estimation for fluid equations driven by fractional transport noise
We study a two-dimensional incompressible vorticity equation on the torus driven by transport-type fractional Brownian noise with Hurst parameter $H \in (1/2,1)$. The model captures persistent, long-range correlated forcing consistent with inertial-range scaling laws and fractional Brownian approximations of turbulent fluctuations. A central ingredient of our approach is a version of the sewing lemma adapted to a class of integrands that includes, but is not limited to, transport-type structures. This result provides a flexible tool for constructing the Young integral and serves as a basis for analysing a wider class of stochastic partial differential equations. Using this approach, we establish existence and uniqueness of solutions via a fixed point argument and investigate statistical properties of the flow. In particular, we study quadratic functionals of the solution and derive an estimator for the Hurst parameter $H$.
Read the full abstract
Number Theory
Asymptotic expansions of integrals and Nielsen's polylogarithms
This article derives full asymptotic expansions for integrals of the form \[ \int_{0}^{1}f(u)(1+q\cdot u^{n})^{w/n}du \] as $n\rightarrow\infty$, with parameters real $w\neq 0$ and $q\in(-1,1]$, or positive $w$ for $q=-1$. We relate the coefficients of the asymptotic expansions to Nielsen's generalized polylogarithms. For $q=-1$, we obtain an expansion in terms of multiple zeta values, which in this setting, reduce to ordinary zeta values. A key point is that for $q=1$, the integrals typically produce alternating multiple zeta values; we formulate a precise symmetry constraint on the relevant coefficient sequence under which all coefficients reduce to polynomials in ordinary zeta values. We also translate this symmetry into a statement about a binomial transform, and we verify the condition for several classical Appell-type families, like Euler, Bernoulli, Genocchi, and Hermite. Finally, we obtain precise results about the convergence of norms of random variables.
Read the full abstract
Information Theory
A Tensor-Train Framework for Bayesian Inference in High-Dimensional Systems: Applications to MIMO Detection and Channel Decoding
Bayesian inference in high-dimensional discrete-input additive noise models is a fundamental challenge in communication systems, as the support of the required joint a posteriori probability (APP) mass function grows exponentially with the number of unknown variables. In this work, we propose a tensor-train (TT) framework for tractable, near-optimal Bayesian inference in discrete-input additive noise models. The central insight is that the joint log-APP mass function admits an exact low-rank representation in the TT format, enabling compact storage and efficient computations. To recover symbol-wise APP marginals, we develop a practical inference procedure that approximates the exponential of the log-posterior using a TT-cross algorithm initialized with a truncated Taylor-series. To demonstrate the generality of the approach, we derive explicit low-rank TT constructions for two canonical communication problems: the linear observation model under additive white Gaussian noise (AWGN), applied to multiple-input multiple-output (MIMO) detection, and soft-decision decoding of binary linear block error correcting codes over the binary-input AWGN channel. Numerical results show near-optimal error-rate performance across a wide range of signal-to-noise ratios while requiring only modest TT ranks. These results highlight the potential of tensor-network methods for efficient Bayesian inference in communication systems.
Read the full abstract
Dynamical Systems
Mathematical modeling and analysis of the Notch-Delta pathway
In this paper mathematical models for the evolutionary conserved Notch-Delta pathway are developed and analyzed in order to better understand how two neighboring biological cells can become different. We pursue a structure-based stoichiometric type of approach, such that no specific reaction kinetics have to be defined. Only their dependencies on the relevant species participating in the model network are taken into account. Reaction networks and their related systems of ODEs are presented and analyzed with respect to their capacity for symmetry-induced bifurcations. The possibility to obtain a singular Jacobian is analyzed symbolically. This approach is valid for parameter-rich kinetics, where the parametrization of the steady-state fluxes and of the first derivatives of the reaction rates evaluated at the steady state are independent. In this context, also with the help of abstract minimal models, we could mathematically identify some of the Notch pathway's features being more relevant than others.
Read the full abstract
Commutative Algebra
Everything I always wanted to know about resultants and Chow forms (but was too lazy to ask)
This note develops some fundamental properties of resultants and related notions. It represents my own personal exploration of this domain, which I found more instructive than seeking answers in the standard literature. Consequently, notation and terminology may be quite idiosyncratic, and the approach is very algebraic. Read at your own risk.
Read the full abstract
Combinatorics
New directed strongly regular graphs on 60 vertices
We prove the existence of directed strongly regular graphs with parameters (60,21,11,6,8), (60,22,12,8,8), (60,24,10,9,10), (60,25,17,8,12), (60,27,21,12,12) and (60,28,20,14,12). The group $S_5 \times 2$ acts transitively on the constructed graphs.
Optimization and Control
Lecture Note for Bounded Controls in Continuous-Time and Control of Several Variables
In this note, we develop the first-order theory of optimal control problems with box constraints on the control. We emphasize the precise modification of Pontryagin's maximum principle when the admissible control set is compact, the projection/clamping formula for scalar quadratic Hamiltonians, the distinction between intrinsic projection inside the optimality system and post hoc truncation of an unconstrained solution, and the corresponding forward-backward sweep implementation. The presentation is pitched at senior PhD students who are already comfortable with variational arguments, adjoint systems, and basic nonlinear analysis. These notes are mainly based on the book “optimal control applied to biological models” of Suzanne Lenhart and John T. Workman.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Exact WKB analysis of inverted triple-well: resonance, PT-symmetry breaking, and resurgence
We study non-Hermitian quantum mechanics of an inverted triple-well potential within the exact WKB framework. For a single classical potential, different Siegert boundary conditions define three distinct quantum problems: the PT-symmetric, resonance, and anti-resonance systems. For each case, we derive the exact quantization condition and construct the associated trans-series solution. By identifying the resurgent structures and cancellations in these non-Hermitian setups, we obtain the median-summed series, clarifying when the spectra are real or complex in accordance with the physical properties of each system. Establishing explicit links to the semi-classical path integral formalism, we elucidate the roles of bounce and bion configurations in these non-Hermitian systems. This analysis predicts PT-symmetry breaking, which we also verify numerically. Using the median quantization conditions, we prove the existence of this symmetry breaking and establish an exact equation for the exceptional point, which emerges as a remarkably simple algebraic relation between the bounce and bion actions. We further show that the median-summed non-perturbative correction to the spectrum vanishes at the exceptional point, while the resurgent structure survives through a universal minimal trans-series. For the resonance and anti-resonance systems, we find that the exact median-summed spectra are related by complex conjugation, representing time reversal in this setting, are necessarily complex, and do not exhibit an exceptional point. Although their spectra differ significantly from the PT-symmetric case, they share the same minimal trans-series. By maintaining explicit links with the path integral saddles and the formal theory of resurgence, our analysis provides a unified and general perspective on the quantization of non-Hermitian theories.
Read the full abstract
Combinatorics
Distance spectral radius and perfect matchings in graphs with given fractional property
A matching in a graph $G$ is a set of independent edges in $G$. A perfect matching in a graph $G$ is a matching which saturates all the vertices of $G$. A fractional perfect matching in a graph $G$ is a function $h:E(G)\rightarrow [0,1]$ such that $\sum\limits_{e\in E_G(v)}h(e)=1$ for every $v\in V(G)$, where $E_G(v)$ is the set of edges incident to $v$ in $G$. Clearly, the existence of a fractional perfect matching in a graph is a necessary condition for the graph to possess a perfect matching. Let $G$ be a $k$-connected graph of even order $n$ with a fractional perfect matching, where $k$ is a positive integer. We denote by $\mu(G)$ the distance spectral radius of $G$. In this paper, we prove that if $n\geq8k+6$ and $\mu(G)\leq\mu(K_k\vee(kK_1\cup K_3\cup K_{n-2k-3}))$, then $G$ contains a perfect matching unless $G=K_k\vee(kK_1\cup K_3\cup K_{n-2k-3})$.
Read the full abstract
Information Theory
Improved Capacity Upper Bounds for the Deletion Channel using a Parallelized Blahut-Arimoto Algorithm
We present an optimized implementation of the Blahut-Arimoto algorithm via GPU parallelization, which we use to obtain improved upper bounds on the capacity of the binary deletion channel. In particular, our results imply that the capacity of the binary deletion channel with deletion probability $d$ is at most $0.3578(1-d)$ for all $d\geq 0.64$.
Read the full abstract
Probability
Quantitative bounds for high dimensional entropic CLT
By extending the Johnson–Barron projection method from one dimension to high dimensions and utilizing a Wang type dimension-free Harnack inequality, we obtain a new quantitative bound for the entropic central limit theorem under the assumption that the Poincaré inequality holds. We compare our results with recent developments to demonstrate the merits of our approach.
Read the full abstract
Dynamical Systems · Cross-listed from nlin.AO
Symmetry-Breaking and Hysteresis in a Duplex Voter Model
We introduce and analyze a voter-type model on a two-layer multiplex network, where the presence of a state on one layer acts as a catalyst or inhibitor to the propagation of that state on the other layer. Despite the model's simplicity, our mathematical analysis reveals a rich phase diagram that includes spontaneous symmetry-breaking and a cusp bifurcation, which arises when noise is introduced into the model. In particular, this bifurcation mechanism can be viewed as a prototypical unfolding of the change between explosive and non-explosive transitions observed in various other network models. We cross-validate our analytic results by numerical simulations.
Read the full abstract
Analysis of PDEs
Refined boundary layer asymptotics for elliptic equations with multiplicative nonlocal effects
We investigate singularly perturbed elliptic problems with multiplicative nonlocal diffusion terms subject to Robin boundary conditions. The diffusion depends on a global quantity of the solution, which introduces a nonlocal coupling between the global behavior of the solution and the boundary asymptotics. As the perturbation parameter tends to zero, we establish precise asymptotic expansions of the solutions that capture the structure of boundary layers coupled with the multiplicative nonlocal diffusion effect. Moreover, the interaction between the nonlocal diffusion and the boundary geometry manifests as refined higher-order terms wherein geometric quantities, such as the mean curvature, appear explicitly; our analysis thus quantifies the influence of global coupling on the boundary layer structure, extending classical singular perturbation theory to multiplicative nonlocal frameworks.
Read the full abstract
Analysis of PDEs
On the pointwise convergence of NLS flow on $ \S^2 $
In this paper, we study the almost everywhere convergence of the cubic nonlinear Schrödinger flow to the initial data on $\mathbb S^2$, \begin{equation*} iu_t + \Delta_g u = |u|^2u, \quad (t,x)\in\R\times \S^2. \end{equation*} Inspired by the randomization method and the ansatz introduced by Burq, Camps, Sun, and Tzvetkov [Preprint, arXiv:2404.18229], we prove almost sure pointwise convergence almost everywhere for the nonlinear solution at very low regularity. This extends Compaan-Lucà-Staffilani [Int. Math. Res. Not. IMRN, (1) (2021), 596–647] to the spherical setting. We also provide a new necessary condition for the associated $L^p$ maximal estimate for the linear Schrödinger equation on $\S^2$. More precisely, we show that the $L^p$ maximal estimate fails for $s<\frac{1}{2}-\frac{1}{2p}$ with $p\ge 2$. In the special case $p=3$, our result matches the corresponding range in the $\R^2$ case, up to the endpoint, and improves the previous result of Chen-Duong-Lee-Yan [J. Math. Pures Appl. 163 (2022), 433–449].