Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Thursday 30 April

Number Theory

A divisor function of Wigert and higher degree forms

Let $k\in\mathbb{N}$. Wigert's divisor function $d^{\left(\frac{1}{k}\right)}(j)$ counts the number of representations of $j$ of the form $m^k+mn$ with $m\geq1 , n\geq0$. Let $\mathcal{F}_k(s)$ denote the Dirichlet series of $d^{\left(\frac{1}{k}\right)}(j)$. While $\mathcal{F}_2(s)$ is essentially a well-known special case of the Euler-Zagier double zeta function, and hence well-studied, very little is known about $\mathcal{F}_k(s)$ for $k>2$. We offer three new representations for $\mathcal{F}_k(s)$ for $k\geq2$, one of which is an analogue of the Chowla-Selberg formula as well as of a formula of Atkinson. The meromorphicity of $\mathcal{F}_k(s)$ is also discussed. The special value $\mathcal{F}_3\left(\frac{3}{2}\right)$ is expressed in terms of an infinite series of Bessel functions and a generalized divisor function.
Read the full abstract

Algebraic Geometry

Towards Bigness equivalence

On the flag variety $ \mathcal{F}l_s(E)$ associated to a vector bundle $E,$ , a sequence $s$ and a partition $a,$ there is a line bundle $\it Q^a_s$ on $ \mathcal{F}l_s(E).$ The aim of this paper is to prove the following conjecture: $Q^a_s $ on $ \mathcal{F}l_s(E)$ is big if only if $\pi_*(Q^a_s)=S_a(E)$ on X is big. The "if" part is proven here, the "only if" part is proven under the V-bigness hypothesis.
Read the full abstract

Combinatorics

Families of Shape-Wilf-Equivalent Claw-Shaped Partially Ordered Patterns

Partially ordered patterns (POPs) generalize classical permutation patterns and have been extensively studied in the contexts of permutations, words, compositions, and partitions. Burstein, Han, Kitaev, and Zhang established the shape-Wilf-equivalence for individual claw-shaped POPs. In this paper, we extend their result by proving that certain families of claw-shaped POPs are shape-Wilf-equivalent and enumerate the number of permutations avoiding that set of claw-shaped POPs. Our approach is based on a new encoding process, which is entirely different from the method used in their work.
Read the full abstract

Probability

Multifractional Stable Motion with Random Hurst Exponent

The fractional stable motion is a prototypical stochastic process exhibiting both heavy tails and long-range dependence, parameterized via a stability index $\alpha$ and a Hurst exponent $H$. We consider a nonstationary extension where the Hurst exponent is a function of time, and potentially random. The construction admits the standard linear fractional stable motion as tangent process, and we exactly determine its local Hölder exponent in terms of the pointwise values of the Hurst function. This is in contrast to other definitions of multifractional processes, where the Hurst function needs to have additional regularity in time.
Read the full abstract

Mathematical Physics

Hamilton–Jacobi theory for non-conservative field theories in the $k$-contact framework

This article develops a Hamilton–Jacobi theory for non-conservative classical field theories, with particular emphasis on dissipative systems, in the framework of co-oriented k-contact geometry. We introduce evolution k-contact k-vector fields, extending the contact evolution formalism to field theories, and analyse the corresponding Hamilton–De Donder–Weyl equations. Moreover, we develop two distinct families of Hamilton–Jacobi theories: a z-independent approach, based on the reconstruction of the dynamics from an integrable k-vector field defined on the base manifold of $(\bigoplus^kT^*Q)\times\mathbb{R}^k\to Q$, and a z-dependent approach, where the integrable k-vector field is defined on the base manifold of $(\bigoplus^kT^*Q)\times\mathbb{R}^k\to Q\times\mathbb{R}^k$. We develop in detail the important case of Hamiltonian functions with affine dependence on the dissipative variables, show how quadratic dependence on these variables can be used structurally to enlarge the range of applications, and recover the ordinary contact Hamilton–Jacobi theory as the particular case k=1, while removing some technical assumptions appearing in previous formulations. Our theory is illustrated through several representative examples, including the telegrapher/Klein–Gordon equation, a dissipative Hunter–Saxton equation, a simple dissipative non-regular first-order field model, and a relativistic thermodynamic model.
Read the full abstract

All authors Javier de Lucas, Julia Lange, Xavier Rivas, Cristina Sardón

Statistics Theory

A note on estimation of quarticity based on spot volatility

We study an estimator of twice the integrated quarticity of a continuous Itô semimartingale, constructed from squared returns and local estimates of spot volatility. For a shrinking estimation window, we establish a functional stable central limit theorem for a bias-corrected version of the estimator. The limiting conditional variance is $56\int_0^t c_s^4\dd s$, where $c$ denotes spot variance. The proof identifies a common martingale approximation for the three components of the estimator and determines their joint covariance structure. The volatility process may have jumps. We also compare the limiting variance with those of the realized-quarticity and quadratic spot-volatility estimators.
Read the full abstract

Differential Geometry

Harmonic Gauge on the Space of Riemannian Metrics and Its Role in the Ricci-DeTurck Flow

We develop a harmonic gauge on the space of Riemannian metrics and study its role in the variational and flow-theoretic structure of geometric analysis. We prove that the harmonic gauge eliminates divergence-type terms in the first variation of the Hilbert-Einstein functional and induces a natural elliptic structure for the second variation. As a consequence, positivity of the curvature operator of the second kind implies spectral stability of the functional. This establishes a conceptual link between gauge fixing, elliptic operator theory, and geometric rigidity, and provides a variational counterpart to the Ricci-DeTurck mechanism.
Read the full abstract

Analysis of PDEs

Propagation of nonlinear pulses near diffractive points of any order

We construct pulse-type approximate solutions to nonlinear hyperbolic equations near diffractive points, allowing arbitrary (even infinite) order of grazing. We show that in low regularity spaces and the high frequency limit, such solutions can be approximated by a sum of incoming and reflected pulses constructed using incoming and reflected phases and profiles that satisfy transport equations. New low-regularity estimates comparing the size of pulses to the size of their profiles are required. Earlier geometric optics results for pulses assumed much higher regularity, and considered only propagation in free space or transversal reflection at boundaries.
Read the full abstract

Dynamical Systems

Endogenous Measures and Refinement Dynamics on Finite {\sigma}-Algebra Systems

We study systems of {\sigma}-algebras ordered by refinement and introduce the notion of an endogenous probability measure, invariant under admissible refinement transformations. We prove existence and structural properties of such measures on finite systems and show how refinement operators induce a natural dynamical structure on the lattice of {\sigma}-algebras.
Read the full abstract

Combinatorics

How large part of a graph can be covered by the neighborhoods of k vertices?

Let $k\ge 2$ be fixed integer, $0<c<1$ a constant. Consider a graph $G$ with $n$ vertices and average degree $cn$. We answer a question of Simon Griffiths by showing that $G$ has $k$ vertices such that their neighborhoods together cover at least $\min(1-(1-c)^{k},\sqrt{c})n$ vertices. This result is essentially tight.
Read the full abstract

Geometric Topology

Some remarks on $h$-cobordisms between smooth 4-manifolds

It is not known whether the realisation part of the $s$-cobordism theorem holds for smooth 4-manifolds, nor whether every pair of smoothly $h$-cobordant 4-manifolds is also smoothly $s$-cobordant. We provide some new conditions under which these questions admit a positive answer. We also give conditions under which the `standard' method to construct an $h$-cobordism with specified torsion cannot work.
Read the full abstract

Algebraic Geometry

Structural properties of Białynicki-Birula decompositions

We investigate several aspects of the Bialynicki-Birula decomposition of a smooth complete $\mathbb{G}_m$-variety with finite fixed locus. Our results include novel characterizations of when the Bialynicki-Birula decomposition is filterable or forms a stratification, showing that these properties are invariant under reversing the $\mathbb{G}_m$-action. We additionally classify the smooth projective toric varieties for which the Bialynicki-Birula decomposition either may or must be a stratification. Our study of $\mathbb{G}_m$-convexity and $\mathbb{G}_m$-rigidity – properties recently introduced by Buch–Chaput–Perrin – answers several questions posed in their $\textit{Equivariant rigidity of Richardson varieties}$. In particular, assuming only filterability of the decomposition, we show that the Bialynicki-Birula cell closures are determined by their $\mathbb{G}_m$-equivariant Chow classes.
Read the full abstract

Commutative Algebra

Parseval-Rayleigh identities for graded Artinian Gorenstein algebras

We formulate and prove Parseval-Rayleigh identities for graded Artinian Gorenstein algebras over fields of positive characteristic. Specializing the general result, we provide an alternative proof of the Parseval-Rayleigh identities of generic Artinian reductions of Stanley-Reisner rings of oriented simplicial spheres.
Read the full abstract

Probability

Jump Itô-type formula with arbitrary regularity

We establish an Itô-type formula for finite $p$-variation paths with jumps for arbitrary $p\geq 1$. The formula is stated in a fully pathwise form and separates the reduced rough integral from explicit left- and right-jump correction terms. In the càdlàg case, only the left-jump correction remains, while in the continuous case, both jump correction terms vanish and the formula recovers the corresponding continuous arbitrary-regularity change-of-variable formula. The proof is based on the reduced rough path framework and a refinement Riemann-Stieltjes convergence criterion adapted to discontinuous paths. This approach allows us to handle the higher-order Taylor expansions required for large values of $p$ and to control the interaction between rough increments and discrete jumps. As applications, we derive Itô-type formulas for stochastic processes whose sample paths have finite $p$-variation, including pure-jump models and mixed fractional Brownian-jump signals. The latter class includes cases with Hurst parameter $H\leq 1/3$, which fall outside the regime $2\leq p<3$. We also obtain chain-rule identities for nonlinear observables of càdlàg finite-$p$-variation solutions of random differential equations with jumps, together with a pathwise log-wealth decomposition.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Sensing-Assisted Channel Estimation for Flexible-Antenna Systems: A Unified Framework

Flexible-antenna systems, which use a small number of radio frequency (RF) chains to dynamically access a large set of candidate antenna locations, have emerged as a hardware-efficient architecture for 6G networks. Acquiring accurate channel state information (CSI) is critical for these systems, but it typically incurs a prohibitive pilot overhead that scales with the massive number of candidate locations. To address this bottleneck, we propose a unified sensing-assisted channel estimation framework tailored for flexible-antenna systems. It reduces the full CSI reconstruction problem to a consistent two-stage process: it first resolves the dominant DOAs from the uplink data symbols by exploiting the spatial geometry, requiring no dedicated sensing pilot, and then calibrates the associated path gains using a minimal number of calibration pilots. Building on this pipeline, we develop two Newton-MUSIC algorithms tailored to different propagation environments. For line-of-sight (LOS)-dominant environments with uncorrelated sources, we propose SOC-Newton-MUSIC, which leverages second-order covariance (SOC) for low-complexity DOA sensing. For non-line-of-sight (NLOS) environments with coherent multipath, where the number of sources may exceed the number of activated RF chains, we propose FOC-Newton-MUSIC, which exploits fourth-order cumulants (FOC) to restore source identifiability and structurally expand the available spatial degrees of freedom (DOFs) through a continuous difference co-array. In both cases, by reformulating the spatial spectrum search as a continuous optimization problem, we replace exhaustive dense grid searches with parallelized Newton refinements.
Read the full abstract

All authors Ruoxiao Cao, Wentao Yu, Zixin Wang, Shenghui Song, Jun Zhang, Yi Gong, Khaled B. Letaief

Optimization and Control

Exact formulations for rectangular-warehouse single-picker routing with scattered storage in single-block and two-block layouts

Order picking travel dominates much of warehouse effort, and exact routing is especially valuable when storage is scattered so pick locations are not fixed in advance. We address the single picker routing problem (SPRP) and its scattered-storage variant (SPRP-SS) in single-block and two-block rectangular warehouses. We propose two mixed-integer linear programming formulations that exploit structural properties of optimal tours to simplify connectivity modelling and remove redundant edge configurations: a Configuration Connectivity model tailored to single-block layouts and an Edge Connectivity model that extends to two-block layouts. In extensive computational experiments on large randomly generated benchmark sets for single-block and two-block rectangular layouts, we compare these formulations against established MILP and network-flow baselines for SPRP and SPRP-SS and report computational gains tied to the structural restrictions. The results support using compact, solver-based exact routing models in industrial settings where dynamic programming is cumbersome to integrate, particularly for SPRP-SS and for routing subproblems embedded in larger planning or warehouse-design optimizations.
Read the full abstract

Probability

Rising GUE Eigenvalue Process from a Fixed Level

We construct the multilevel correlation kernel for the rising GUE eigenvalue process starting from a fixed initial configuration $x^{(m)}$, and show that it converges on short time scales (as quickly as $\text{polylog}(m)$) to the extended semi-discrete sine kernel. As an application, we show fixed-energy universality of bulk local statistics of complex Hermitian Wigner matrices matching the covariance structure of GUE and with a finite $4+\varepsilon$ moment for $\varepsilon>0$. This application demonstrates that it is possible to obtain universality of bulk local statistics under near-optimal moment assumptions without using a Dyson Brownian motion relaxation step, which was a key ingredient in many results on this topic.
Read the full abstract

Symplectic Geometry

Monodromy action of mirror stops for toric Calabi-Yau surfaces

Mirror symmetry predicts an action by the fundamental group of a conjectural stringy Kähler moduli space on the derived category of an algebraic variety. For a toric variety, a model for this space is understood, but constructing the action is still an open problem in general. We propose that this action can be studied on the $A$-side via a moduli space of Legendrians isotopic to the FLTZ Legendrian. For the $A_{n-1}$ singularity, we construct an annular braid-group action on the corresponding partially wrapped Fukaya category by exact autoequivalences. The standard braid subgroup recovers the Seidel–Thomas action on the derived category, while the additional annular generator corresponds to tensor product with $\mathcal O(-1)$. We additionally extend the Floer-theoretic approach to homological mirror symmetry for toric varieties to the setting of semiprojective toric Deligne–Mumford stacks over an arbitrary field.
Read the full abstract

Optimization and Control

A Systematic Review of Recent Advancements in PINN Augmented Deep Learning and Mathematical Modeling for Efficient Portfolio Management

In finance, portfolio management is a traditional yet difficult problem that has drawn attention from practitioners and researchers for many years. However, there are still difficult technological problems that need to be solved. In the world of finance, managing a portfolio has never been easy. Selecting portfolios in a volatile market is made easier with the help of portfolio management. The goal of this review study is to present the concept of physics-informed neural networks because they provide a novel approach to directly incorporating physics and finance principles into the neural network's learning process. By doing so, physics-informed neural networks ensure that their forecasts are in line with established financial regulations and processes in addition to offering precise forecasts. Furthermore, this article provides an overview of the current state of research in portfolio optimization with the support of mathematical models, deep learning models and physics-informed neural networks. In addition, the advantages and disadvantages of various deep learning and mathematical modelling are discussed. Researchers and business professionals alike should find the data useful for advancing the field of investment management and trying out new portfolio management strategies. For this purpose, in this review work, emphasis is given to these factors. Finally, a few challenging issues and potential future directions are discussed, encouraging readers to consider fresh ideas in this field of study.
Read the full abstract

Numerical Analysis

Waveform Relaxation for Field/Circuit Coupled DAEs with Generalized Capacitances

Field/circuit coupling is a common approach when a lumped representation of a certain electrotechnical device is not accurate enough. To exploit existing code and underlying properties of the coupled systems, cosimulation techniques such as waveform relaxation can be used. The coupled system is of differential-algebraic type, which can potentially lead to divergence. This paper presents a novel, sufficient topological convergence criterion for field/circuit coupled systems of higher index containing a generalized capacitance. Hereby, the criterion holds for a full range of field systems whose structure can be classified as a generalized capacitance. Finally, the theoretical results are supported by numerical simulations.
Read the full abstract

Combinatorics

Structural description of (bull, house)-free graphs

The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if it is k-chromatic but each of its proper induced subgraphs is (k-1)-colorable. It is known that the number of k-critical P_5-free graphs and bull-free graphs are infinite for large enough k. We give a structural description of (bull, house)-free graphs and also (bull, P_5)-free graphs. Using these structural properties we prove that for any fixed k, the number of k-critical (bull, P_5)-free graphs is finite. This improves on a result of Huang, Li and Xia (Critical (P_5, bull)-free graphs, Discrete Applied Mathematics 334 (2023) 15-25). A graph G is perfectly divisible if for each induced subgraph H of G with at least one edge, V(H) can be partitioned into two sets V_1, V_2 such that every largest clique of H contains a vertex in V_i for i = 1,2. Chudnovsky and Sivaraman proved that (P_5, bull)-free graphs are perfectly divisible (Perfect divisibility and 2-divisibility, Journal of Graph Theory 90 (2019) 54-60). Our structural result allows us to give a short proof of this theorem.
Read the full abstract

Rings and Algebras

Polynomial Maps with Constants on Matrix Algebra

Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map with constant. We consider $\mathcal {A} = M_n(\mathbb{F})$, the algebra of $n \times n$ matrices over an algebraically closed field $\mathbb{F}$ of characteristic $0$, and polynomial maps given by $\omega(x_1, x_2) = A_1x_1^k + A_2x_2^k$, where $A_1,A_2\in M_n(\mathbb F)$. For $n=2$, the images of such a map is competely determined in an earlier work (Panja, S.; Saini, P.; Singh, A., Images of polynomial maps with constants, Mathematika 71 (2025), no. 3, Paper No. e70031). In this article, by assuming one of the coefficients, say $A_1$, is invertible, we relate the surjectivity of $\omega$ to the nullity of $A_2$. When $n=3, 4$, we completely classify the surjectivity of $\omega(x_1, x_2)$ by obtaining the necessary and sufficient condition in terms of $n$, $k$, and the nullity of $A_2$.
Read the full abstract

Category Theory

Quasi-pseudometric modular spaces as $\mathscr{Q}$-categories

We prove that the category of quasi-pseudometric modular spaces whose morphisms are the nonexpansive mappings is isomorphic to a quantale enriched category. To achieve this, we construct an appropriate quantale of isotone functions. We also show that, by means of this isomorphism, the topology associated with a quasi-pseudometric modular coincides with that generated by its corresponding quantale enriched category. Furthermore, we demonstrate that the class of quasi-pseudometrizable topological spaces coincides with the topological spaces whose topology is induced by a quasi-pseudometric modular.
Read the full abstract

Optimization and Control

Robust Constrained Optimization via Sliding Mode Control

This paper develops a sliding mode control based frame work for equality constrained optimization by reformulation the first order Karush Kuhn Tucker conditions as control affine dynamical system. The optimization variables are treated as states and the Lagrange multipliers as control input, with equality constraints defined as sliding manifold. The resulting design guarantees exact constraint enforcement with finite time convergence, independent of objective convexity, and exhibits robustness to matched disturbance, structural uncertainty and bounded measurement noise. To accelerate the convergence, a nonsingular terminal sliding mode based normed gradient flow is introduced, ensuring both finite time convergence to optimal solution and constraint satisfaction. Rigorous Lyapunov analysis establishes closed loop stability and convergence. Numerical studies across diverse benchmark problems demonstrate superior accuracy and robustness over classical continuous time optimization method, highlighting effectiveness under disturbance.
Read the full abstract

All authors Shyam Kamal, Baby Diana, Sunidhi Pandey, Sandip Ghosh, Thach Ngoc Dinh

Information Theory · Cross-listed from cs.LG

Statistical Channel Fingerprint Construction for Massive MIMO: A Unified Tensor Learning Framework

Channel fingerprint (CF) is considered a key enabler for facilitating the acquisition of channel state information (CSI) in massive multiple-input multiple-output (MIMO) communication systems. In this work, we investigate a novel type of CF that stores statistical CSI (sCSI) at each potential location, referred to as statistical CF (sCF). Specifically, we reveal the relationship between sCSI, namely the channel spatial covariance matrix (CSCM), and the channel power angular spectrum (CPAS). Building on this foundation, we construct a unified tensor representation of the sCF and further reduce its dimension by exploiting the eigenvalue decomposition of the CSCM and its correlation with the PAS. Considering the practical constraints imposed by measurement cost, privacy, and security, we focus on three representative scenarios and uniformly formulate them as tensor restoration tasks. To this end, we propose a unified tensor-based learning architecture, termed LPWTNet. The architecture incorporates a closed-form Laplacian pyramid (LP) decomposition and reconstruction framework that replaces the traditional encoder-decoder structure, enabling efficient inference while capturing multi-scale frequency subband characteristics of the sCF. Additionally, a shared mask learning strategy is introduced to adaptively refine high-frequency sCF components through level-wise adjustments. To achieve a larger receptive field without over-parameterization, we further propose a small-kernel convolution mechanism based on the wavelet transform (WT), which decouples convolution across different frequency components of the sCF and enhances feature extraction efficiency. Extensive experiments show that the proposed approach delivers competitive reconstruction accuracy and computational efficiency across various sCF construction scenarios when compared with state-of-the-art baselines.
Read the full abstract

All authors Zhenzhou Jin, Li You, Xiang-Gen Xia, Xiqi Gao

Combinatorics

Fibonacci numbers and the probability of polygon formation using random length sticks

We present two complementary proofs that, if the lengths of $n$ sticks are sampled at random, then the probability that no $p+1$ sticks can form a $(p+1)$-sided polygon can be expressed as the product of the reciprocals of a series of terms involving the $p$-step Fibonacci numbers. The first proof uses matrix algebra to extend the method previously used by Sudbury et al. to derive expressions for the probabilities of not being able to form triangles and quadrilaterals. The second alternative proof uses a different approach based on expressions for the minimum and maximum lengths of each stick that are compatible with the constraint of not being able to form a $(p+1)$-sided polygon, and provides insights into the structure of the probability expressions and the underlying reason that they include the Fibonacci numbers. Furthermore, the approach is developed in a generalised way that can, in principle, be applied to sticks randomly sampled from any probability distribution.
Read the full abstract

Information Theory

Harnessing the Freedom of Non-Uniformity in Monostatic ISAC with Antenna Flexibility

This paper studies flexible non-uniform array design for monostatic integrated sensing and communication (ISAC) systems. An antenna pool is considered at the base station, where each candidate antenna can be dynamically assigned to transmit, receive, or inactive modes, such that a non-uniform effective array is jointly constructed with the ISAC precoding design. We formulate a sum communication rate maximization problem by jointly optimizing the ISAC beamforming schemes and antenna-mode assignment under sensing, power, and antenna mode constraints. We develop an alternating-optimization-based solution framework mainly with the aid of weighted minimum mean square error, continuous relaxation-based penalty, and successive convex approximation. Numerical results show that the proposed non-uniform array achieves higher sum-rates than the uniform-array baselines, with particularly large gains when the number of activated antennas is small. Moreover, the proposed non-uniform array can achieve, and in some cases exceed, the performance of uniform array baselines with substantially fewer activated antennas, highlighting geometry-aware non-uniform array design as a compelling alternative to brute-force antenna scaling-based array design.
Read the full abstract

All authors Zhe Wang, Mahmoud Zaher, Vitaly Petrov, Emil Björnson

Representation Theory

On the Hereditariness of the Representations of Thread Quivers

We prove a conjecture of Paquette, Rock, and Yildirim by showing that, for every thread quiver, the abelian category of pointwise finite dimensional representations is hereditary. Since this category typically lacks enough projectives and injectives, standard homological methods do not apply directly. Our approach combines a Yoneda Ext criterion for hereditariness, established in this paper, with structural reductions to the subcategory of quasi noise free representations. We also indicate an alternative proof using a Keller's theorem on derived categories.
Read the full abstract

Analysis of PDEs

Finite-time blow-up in a class of chemotaxis systems with spatially heterogeneous diffusion sensitivity

\indent In this paper, we study a class of parabolic-elliptic Keller-Segel systems with diffusion sensitivity dependent on spatial position, given by type \begin{equation} \left\{ \begin{array}{ll} u_{t} = \bigtriangledown\cdot(|x|^{\beta} \bigtriangledown u)-\bigtriangledown\cdot(u^{\alpha} \bigtriangledown v), 0=\bigtriangleup v-\mu +u, \qquad \mu:=\frac{1}{|\Omega|}\int_{\Omega}udx,\end{array}\right. \end{equation} under homogeneous Neumann conditions in a ball $\Omega=B_{R}(0)\subset \mathbb{R}^{n}$ with $\alpha \ge 1$, $\beta>0$ and $n\ge 2$.\par \indent It is proved that any nonconstant nonnegative radial initial data $u_{0}\in C^{\theta}(\overline{\Omega})$, where $\theta \in (0,1)$, there exists a radially symmetric classical solution of the system (0.1) in $(\Omega \setminus \{ 0 \})\times (0,T)$ for some $T>0$; moreover, if the initial values $u_{0}\in C^{1+\theta}(\overline{\Omega})$ for some $\theta \in (0,1)$ and satisfy a certain compatibility criterion and are radially decreasing, then this solution is bounded and unique in $(\Omega \setminus \{ 0 \})\times (0,T^{*})$ with $T^{*}<T$.\par Finally, it is found that the initial mass corresponding to this parabolic-elliptic problem (0.1) is sufficiently concentrated to allow the solution to blow up in finite time.
Read the full abstract