Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 24 March
We define a generalized Golomb–Dickman constant $\lambda_{\theta}$ as the limiting expected proportion of the longest cycle in random permutations under the Ewens measure with parameter $\theta > 0$. Exploiting the independence properties of Kingman's Poisson process construction of the Poisson–Dirichlet distribution, we obtain an explicit integral representation for $\lambda_{\theta}$ in terms of the exponential integral. The dependence of $\lambda_{\theta}$ on $\theta$ reflects the transition between regimes dominated by long cycles (small $\theta$) and those with many small cycles (large $\theta$). We also derive the asymptotic behavior of $\lambda_{\theta}$ for small and large $\theta$ and illustrate our results with numerical computations, Monte Carlo simulations of the Hoppe urn, and an application.
Optimization and Control · Cross-listed from cs.LG
A Schrödinger Eigenfunction Method for Long-Horizon Stochastic Optimal Control
High-dimensional stochastic optimal control (SOC) becomes harder with longer planning horizons: existing methods scale linearly in the horizon $T$, with performance often deteriorating exponentially. We overcome these limitations for a subclass of linearly-solvable SOC problems-those whose uncontrolled drift is the gradient of a potential. In this setting, the Hamilton-Jacobi-Bellman equation reduces to a linear PDE governed by an operator $\mathcal{L}$. We prove that, under the gradient drift assumption, $\mathcal{L}$ is unitarily equivalent to a Schrödinger operator $\mathcal{S} = -\Delta + \mathcal{V}$ with purely discrete spectrum, allowing the long-horizon control to be efficiently described via the eigensystem of $\mathcal{L}$. This connection provides two key results: first, for a symmetric linear-quadratic regulator (LQR), $\mathcal{S}$ matches the Hamiltonian of a quantum harmonic oscillator, whose closed-form eigensystem yields an analytic solution to the symmetric LQR with arbitrary terminal cost. Second, in a more general setting, we learn the eigensystem of $\mathcal{L}$ using neural networks. We identify implicit reweighting issues with existing eigenfunction learning losses that degrade performance in control tasks, and propose a novel loss function to mitigate this. We evaluate our method on several long-horizon benchmarks, achieving an order-of-magnitude improvement in control accuracy compared to state-of-the-art methods, while reducing memory usage and runtime complexity from $\mathcal{O}(Td)$ to $\mathcal{O}(d)$.
Read the full abstract
Numerical Analysis
Long-time error analysis of finite element fully discrete schemes for SPDEs with non-globally Lipschitz coefficients
The present paper proposes new fully discrete schemes for long-time approximations of stochastic partial differential equations (SPDEs) with non-globally Lipschitz coefficients in a bounded domain $D \subset \R^d, d =1,2,3 $. A novel family of linearly implicit time-stepping schemes is introduced, based on a standard Galerkin finite element spatial semi-discretization. A distinguishing feature of the schemes is that the proposed finite element fully discrete approximations preserve uniform-in-time moment bounds in a Banach space $L^{r}(D), r >2$, without requiring any restriction on the time-space discretization stepsize ratio. %established... To show it, some non-standard arguments are developed. First, we derive long-time error estimates in the Banach space $L^r(D)$ for finite element fully discrete approximations of the deterministic linear parabolic equation with non-smooth initial value, which is, to our knowledge, new for the literature on numerical PDEs and of independent interest. These error estimates together with the contractive property of the semi-group in $L^{r}(D), r > 2$, the dissipativity of the nonlinearity and the particular benefit of the taming strategy help us establish the desired uniform-in-time moment bounds. Then both strong and weak error bounds of the proposed schemes are carefully analyzed in a setting of low regularity, with uniform-in-time convergence rates obtained for cases of both space-time white and trace-class noises. The analysis is highly nontrivial, due to the finite element discretization, the low regularity and the presence of the super-linearly growing nonlinearity. %in the long-time scenario... the discretization parameters $h$ and $\tau$. Finally, numerical results are presented to verify the previous theoretical findings.
Read the full abstract
Number Theory
Symmetric measures of pseudorandomness for binary sequences
We compare ordinary and symmetric variants of two classical measures of pseudorandomness for binary sequences, the $2$-adic complexity and the linear complexity. In the periodic setting, we show that for binary periodic sequences constructed from the binary expansions of non-palindromic primes, the symmetric $2$-adic complexity can be strictly smaller than the ordinary $2$-adic complexity. We also give a direct proof (of the known result) that the linear complexity of a periodic binary sequence is invariant under reversal, and hence coincides with its symmetric version. In the aperiodic setting, we provide explicit families of finite binary sequences for which both the $N$th symmetric 2-adic complexity and the $N$th symmetric linear complexity are substantially smaller than their ordinary counterparts. Furthermore, we show that the expected values of the $N$th rational complexity and of the $N$th exponential linear complexity exceed those of their symmetric analogues by at least a term of order of magnitude $N$. Thus, the effect of symmetrization is clearly visible on an exponential scale. We also establish lower bounds for the expected values of the symmetric rational complexity, symmetric $2$-adic complexity, symmetric linear complexity, and symmetric exponential linear complexity.
Read the full abstract
Commutative Algebra
The Separating Noether Number of Finite Abelian Groups
For a finite abelian group $G$, let $\beta_{\mathrm{sep}}(G)$ denote its separating Noether number. We determine $\beta_{\mathrm{sep}}(G)$ exactly for every finite abelian group $ G \cong C_{n_1}\oplus \cdots \oplus C_{n_r}$ with $ 1<n_1 \mid \cdots \mid n_r. $ If $r=2s-1$, then $$ \beta_{\mathrm{sep}}(G)=n_s+n_{s+1}+\cdots+n_r, $$ whereas if $r=2s$, then $$ \beta_{\mathrm{sep}}(G)=\frac{n_s}{p_1}+n_{s+1}+\cdots+n_r, $$ where $p_1$ denotes the smallest prime divisor of $n_1$. Our proof is additive-combinatorial in nature. It avoids the Davenport-equality assumption $\mathsf{D}(n_sG)=\mathsf{D}^{*}(n_sG)$ used in previous works. The key ingredients are a geometric reduction of auxiliary sequences via the novel construction of geodesic surrogates, alongside a uniform lifting procedure for relation groups. As an application, we prove that if $r\ge 2$, then every extremal separating atom $A$ over $G_0$ with $|G_0|\le r+1$ satisfies $|\supp(A)|=|G_0|=r+1$. Equivalently, the conjectured support conclusion of Schefler, Zhao, and Zhong holds for all finite abelian groups of rank at least $2$. By contrast, the rank-$1$ case is exceptional: for cyclic groups, the analogous conjectural conclusion is false.
Read the full abstract
K-Theory and Homology
The universal property of graded $KK^G$-theory
To each Kasparov cycle $z$ we attach inclusions $B\xrightarrow{j_z}Y_z\xrightarrow{i_z}X_z$ satisfying $[z]j_zi_z=s_zi_z$. A lift of a second factor along $k_z=j_zi_z$ therefore reduces the product to precomposition by a homomorphism. An additional even symmetry gives a retraction of $k_z$; this includes all cycles between trivially graded algebras and the splitting cycles of graded split extensions. The resulting cycle presentation recovers the ungraded equivariant Kasparov category. For arbitrary gradings, explicit tensor and Dirac relations give fusion by passing to a shifted and doubled cycle. We provide concrete Dirac cycles and a compact verification of the two scalar product identities used in this argument. Finally, an index obstruction shows that the corner of the original cycle need not admit a retraction, even after replacing that cycle by an equivalent representative.
Read the full abstract
Optimization and Control
Mean Field Games for Renewable Energy Development
We propose a mean field game (MFG) framework to model the evolution of renewable energy production in competitive electricity markets. Producers interact through the spot price while optimising their profits under production, installation, and capacity adjustment costs, as well as the generation uncertainty. We first formulate the market as an $N$-player stochastic differential game and analyse its mean field game limit as $N\to\infty$. We characterise the representative producer's optimal control via forward-backward stochastic differential equations (FBSDEs) derived from the stochastic maximum principle and determine the corresponding equilibrium spot price. We establish existence and uniqueness of solutions to the FBSDEs and prove that the MFG admits a unique equilibrium, which yields an $\epsilon$-Nash equilibrium of the $N$-player game. We then extend the model to a Stackelberg MFG to incorporate the role of a social planner. The planner's optimisation problem leads to an extended Hamilton-Jacobi-Bellman (HJB) system, for which we prove existence and uniqueness of viscosity solutions. Finally, we implement a deep learning-based numerical scheme to approximate the equilibrium and investigate the impact of policy interventions on capacity dynamics. Our results highlight how optimal subsidy design depends on prevailing market conditions and can mitigate both capacity shortages and overproduction.
Read the full abstract
Combinatorics
Shellability of 3-cut complexes of powers of cycle graphs
In connection with commutative algebra, Bayer et al. introduced cut complexes in [Topology of cut complexes of graphs, SIAM J.\ Discrete Math., 38(2):1630-1675, 2024]. For a positive integer $k$, the $k$-cut complex of a graph $G$, denoted as $\Delta_k(G)$, is the simplicial complex whose facets are the $(|V(G)|-k)$-subsets $\sigma$ of the vertex set $V(G)$ of $G$ such that the induced subgraph $G[V(G) \setminus \sigma]$ is disconnected. Let $C_n^p$ denote the $p$-th power graph of the cycle graph $C_n$ on $n$ vertices. In this article, we show that $\Delta_3(C_n^p)$ is shellable for $n \geq 6p-3$, and therefore these complexes are homotopy equivalent to a wedge of spheres of dimension $n-4$. We provide an explicit shelling order on the facets of $\Delta_3(C_n^p)$. We also characterize and count the number of spanning facets in this shelling order, and determine the number of spheres appearing in the wedge in the homotopy type of $\Delta_3(C_n^p)$.
Read the full abstract
Analysis of PDEs
Exponential Decay for a Boundary-Controlled Nonlinear Parabolic Reactor Model
We study an axial dispersion tubular reactor model governed by a nonlinear parabolic equation with Robin-type boundary conditions and boundary feedback control. We derive sufficient conditions for the exponential stability of the steady-state solution of the closed-loop system and provide an explicit estimate of the decay rate. In addition, numerical simulations are presented to illustrate the sharpness of the obtained decay rate for different choices of the feedback gain parameter.
Read the full abstract
Numerical Analysis
A Systematic Framework for Stable and Cost-Efficient Matrix Polynomial Evaluation
A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson–Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically determined by the number of matrix products, this reduction directly affects the total execution time. However, the coefficients in these optimized formulas emerge as solutions to systems of nonlinear polynomial equations, resulting in multiple potential solution sets. An inappropriate selection of these coefficients can lead to numerical instability in floating-point arithmetic. This paper presents a systematic framework and a MATLAB implementation, MatrixPolEval1, used to obtain and validate stable coefficient sets for matrix polynomials of degrees $m \in \{8, 10, 12\}$ and above. The framework introduces structural variants to maintain stability even when the original configuration fails to yield a robust solution. The provided tool identifies stable coefficient sets using variable precision arithmetic (VPA) and provides a reliability indicator for expected accuracy. Numerical experiments on polynomials arising in applications, including the matrix exponential and geometric series, show that the framework achieves the $1M$ saving while maintaining numerical accuracy comparable to the PS method.
Read the full abstract
Geometric Topology
A Characterization of Relative Hyperbolicity via Morse and Contracting Boundaries
We prove the following boundary-theoretic characterization of relatively hyperbolic groups. Let $G$ be a finitely generated group with a finite collection $\mathcal{H}$ of finitely generated subgroups, and let $G^h$ denote the associated cusped space. We prove that the pair $(G,\mathcal{H})$ is non-elementary relatively hyperbolic if and only if the Morse boundary $\partial_M^{\mathcal{DL}} G^h$ or the contracting boundary $\partial_c^{\mathcal{FQ}} G^h$ is non-empty and compact.
Read the full abstract
Combinatorics
Extending partial edge-colorings of bounded size in Cartesian products of graphs
This paper studies edge-precoloring extensions in Cartesian products of graphs, motivated by a conjecture of Casselgren, Petros, and Fufa. We formulate a general hypothesis stating that if every edge-precoloring of $G$ and $H$ of sizes $k<\chi'(G)$ and $l<\chi'(H)$, respectively, is extendable, then any edge-precoloring of $G \square H$ of size $k+l+1$ can be extended to a proper $(\chi'(G)+\chi'(H))$-coloring. We provide partial progress toward this conjecture by establishing the result in cases where $k<\Delta(G)$, $G$ is a triangle-free $r$-regular graph and $H$ is a star, an even cycle, a path or, more generally, an arbitrary tree $F$. Furthermore, we prove the conjecture in the case where $G$ is a subcubic graph and $H = K_2$.
Read the full abstract
Optimization and Control
The relief distribution problem with trucks and drones under incomplete demand information
Disaster relief operations often take place under uncertainty regarding the extent of damage across locations. In this paper, we study the delivery of relief aid in the aftermath of disasters when delivery vehicles are assisted by surveillance drones and the demand for relief supplies is initially unknown. We introduce a stylized problem that arises in many emergency supply delivery settings – the relief distribution problem (RDP). In RDP, emergency vehicles, referred to as trucks, must distribute relief supplies on a network, starting from the depot to potential delivery locations, whose demand is initially unknown. The trucks are assisted by surveillance drones, which cannot deliver relief supplies, but scout delivery locations to see whether relief supplies are needed or not. The objective is to visit all location by any vehicle, deliver supplies to all damaged ones, and minimizing the completion time of the relief operation. We study two natural policies for the online problem RDP which we evaluate in two ways: the competitive ratio quantifies the performance in comparison to an optimal solution obtained under full information on damages, the drone-impact is the ratio of the algorithm's performance to the best outcome achievable without drones. Through theoretical analysis and computational experiments, we characterize the operational trade-offs between these policies and derive insights for the effective deployment of drones in disaster response.
Read the full abstract
Number Theory
The second minimum of Barnes-Wall lattices
Optimization and Control · Cross-listed from eess.SY
Optimal Control of Switched Systems Governed by Logical Switching Dynamics
This paper investigates the optimal co-design of logical and continuous controls for switched linear systems governed by controlled logical switching dynamics. Unlike traditional switched systems with arbitrary or state-dependent switching, the switching signals here are generated by an internal logical dynamical system and explicitly integrated into the control synthesis. By leveraging the semi-tensor product (STP) of matrices, we embed the coupled logical and continuous dynamics into a unified algebraic state-space representation, transforming the co-design problem into a tractable linear-quadratic framework. We derive Riccati-type backward recursions for both deterministic and stochastic logical dynamics, which yield optimal state-feedback laws for continuous control alongside value-function-based, state-dependent decision rules for logical switching. To mitigate the combinatorial explosion inherent in logical decision-making, a hierarchical algorithm is developed to decouple offline precomputation from efficient online execution. Numerical simulations demonstrate the efficacy of the proposed framework.
Read the full abstract
Information Theory
Agentic Verifier-in-the-Loop Solver Orchestration for Cell-Free Massive MIMO Downlink Power Control
Cell-free massive multiple-input multiple-output (MIMO) systems can provide uniformly strong service through distributed access points, but performance still depends critically on downlink power control. Existing methods are typically selected offline and then applied uniformly across channel and load regimes, even though no single solver is uniformly best. We therefore propose VISO-PC, a verifier-in-the-loop solver-orchestration framework in which an agent routes among trusted solvers rather than generating power coefficients directly. Given a structured instance descriptor, the router selects an initial solver and fallback order, and an independent verifier accepts only candidates that satisfy the constraints and produce a valid verified common rate. For fairness-oriented downlink cell-free power control under per-AP constraints, verification-aware orchestration improves accepted rate over all fixed single-solver baselines on a reproducible prototype benchmark. Moreover, a lightweight memory-based router matches the accepted rate of a strong rule-based router while reducing average runtime and fallback rate. These results show that solver orchestration is a practical agentic layer for cell-free massive MIMO downlink power control.
Read the full abstract
Information Theory
Towards a Unified Coding Scheme for 6G
The growing demand for higher data rates necessitates continuous innovations in wireless communication systems, particularly with the emergence of 6G. Channel coding plays a crucial role in this evolution. In 5G systems, rate-adaptive raptor-like quasi-cyclic irregular low-density parity-check codes are used for the data link, while polar codes with successive cancellation list decoding handle short messages on the synchronization channel. However, to meet the stringent requirements of future 6G systems, a versatile and unified coding scheme should be developed - one that offers competitive error-correcting performance alongside low complexity encoding and decoding schemes that enable energy-efficient hardware implementations. This white paper outlines the vision for such a unified coding scheme. We explore various 6G communication scenarios that pose new challenges to channel coding and provide a first analysis of potential solutions.
Read the full abstract
Analysis of PDEs
Hausdorff measure of the free boundary for the $p$-obstacle problem with subcritical exponents
This paper investigates a class of $p$-obstacle problems with subcritical exponents having the form \begin{align} \mathrm{div}\left( a(x)|\nabla u|^{p-2}\nabla u\right) =m_1\chi_{\{u>0\}}-m_2u^{\lambda-1}\chi_{\{u>0\}} \ \text{in}\ \Omega,\notag \end{align} where $\Omega $ is a smooth bounded domain in $ \mathbb{R}^N (N \geq 2)$, $m_1,m_2$ are positive constants, the coefficient function $a \in C^2(\Omega)$ has a positive lower bound, and $2 \leq p < \lambda <p^*:= \frac{Np}{N-p}$ when $p<N$ and $N \geq 3$, or $2\leq p < \lambda <+\infty$ when $ N = 2$. By using the mountain-pass lemma, combined with the penalty method, we first establish the existence of non-negative weak solutions. Then, using the De Giorgi-Nash iteration, we prove the $L^\infty$ bound and local $C^{1,\alpha}$ continuity for the solutions. In addition, we prove local porosity of the free boundary based on the optimal growth and non-degeneracy of solutions near the free boundary. Furthermore, by means of Lebesgue measure estimates for gradient level sets, we show that at least one solution corresponds the free boundary having locally finite $(N-1)$-dimensional Hausdorff measure.
Read the full abstract
Quantum Algebra
Quasi-particles and the Kanade-Russell and Kurşungöz formula for Capparelli's identity
We construct a quasi-particle basis of the integrable highest weight module of highest weight $3\Lambda_0$ for the twisted affine Lie algebra of type $A_2^{(2)}$ in the principal realization. More specifically, by introducing the concept of polychromatic quasi-particle and finding relations among quasi-particles, we construct the spanning set of the standard module. Finally, its linear independence is proved by using Kanade-Russell and Kurşungöz's Andrews-Gordon type series of Capparelli's identities.
Read the full abstract
Quantum Algebra
Global Koszul Duality: Differential Graded Cocommutative Coalgebras and Curved Lie Algebras
We give a combinatorial model structure to the category of, not necessarily conilpotent, differential graded (dg) cocommutative coalgebras and an $\infty$-category structure to the category of curved Lie algebras over an algebraically closed field of characteristic $0$. Further, we extend the Harrison and Chevally-Eilenberg functors between dg cocommutative conilpotent coalgebras and dg Lie algebras to these categories and show they form an equivalence of $\infty$-categories.
Read the full abstract
Numerical Analysis · Cross-listed from stat.ML
High-Resolution Tensor-Network Fourier Methods for Exponentially Compressed Non-Gaussian Aggregate Distributions
Characteristic functions of weighted sums of independent random variables exhibit low-rank structure in the quantized tensor train (QTT) representation, also known as matrix product states (MPS), enabling up to exponential compression of their fully non-Gaussian probability distributions. Under variable independence, the global characteristic function factorizes into local terms. Its low-rank QTT structure arises from intrinsic spectral smoothness in continuous models, or from spectral energy concentration as the number of components $D$ grows in discrete models. We demonstrate this on weighted sums of Bernoulli and lognormal random variables. In the former, despite an adversarial, incompressible small-$D$ regime, the characteristic function undergoes a sharp bond-dimension collapse for $D \gtrsim 300$ components, enabling polylogarithmic time and memory scaling. In the latter, the approach reaches high-resolution discretizations of $N = 2^{30}$ frequency modes on standard hardware, far beyond the $N = 2^{24}$ ceiling of dense implementations. These compressed representations enable efficient computation of Value at Risk (VaR) and Expected Shortfall (ES), supporting applications in quantitative finance and beyond.
Read the full abstract
Optimization and Control
DSO Led-Bilevel Optimization Framework for TSO-DSO Coordination across Active Distribution Networks
This work presents a bilevel coordination model that captures the hierarchical interaction between the transmission and distribution layers under a Distribution System Operator(DSO)-led configuration. In this scheme, multiple DSOs independently optimize the operation of their active distribution networks (ADNs), including photovoltaic (PV) generation, battery energy storage systems (BESS), and peer-to-peer (P2P) energy exchanges both within and across ADNs through the Transmission Network (TN), before the Transmission System Operator (TSO) performs the global coordination. The proposed formulation combines the Second-Order Cone relaxation of the DistFlow model to represent the distribution networks (DNs) with the classical DC optimal power flow (OPF) model for the transmission layer. The DSO-first decision sequence enables the reformulation of the bi-level problem into an equivalent single-level optimization model using the Karush-Kuhn-Tucker (KKT) conditions, resulting in a Mixed-Integer Second-Order Cone Programming (MISOCP) formulation that captures both the discrete and convex characteristics of the problem, while preserving the binary variables associated with DER and P2P operation, which would otherwise need to be relaxed in traditional TSO-led approaches. The model is tested on a hybrid system composed of the IEEE 30-bus transmission network and five IEEE 33-bus DNs. Results show that the DSO-led coordination leads to a more efficient use of BESS, improves local self-consumption, and reduces imports from the TN compared to the conventional top-down scheme. Furthermore, computational results from the case study reveal that the model exhibits near-linear or quadratic growth in problem size as the number of ADNs increases, suggesting its applicability to large-scale multi-ADN configurations.
Read the full abstract
Geometric Topology
Formalizing Pick's Theorem, efficiently
Pick's astonishing theorem explains how to obtain the area of any integer polygon by counting lattice points. It is a notoriously difficult challenge to translate the geometric statement and intuitive reasoning into a formal statement and rigorous proof. We transform the beautiful geometry into equally elegant algebra, and then implement the algebraic proof in Lean.
Read the full abstract
Logic
Todorcevic's Problem on Rado's Conjecture
In his Mostowski lecture in Wrocław in 2024, Stevo Todorčević asked whether it is consistent that Rado's Conjecture holds at two successive cardinals. We show that it is consistent that Rado's Conjecture holds at all regular cardinals.
Dynamical Systems
Stability Regions and Bifurcations for Higher-Order Fractional Difference Equations
We study stability regions for the higher-order, two-term fractional difference equation $\Delta^{\alpha}x(t) + a\,\Delta^{\beta}x(t + \alpha - \beta - 1) = (b - 1)x(t + \alpha - 2)$, where $0 < \beta \leq 1 < \alpha \leq 2$, $a > 0$, and $b \in \mathbb{C}$. The Z-transform yields a characteristic function whose image of the unit circle determines the stability boundary. Using a winding-number formulation, we give a necessary and sufficient root-count condition for asymptotic stability. Two analytically derived parameter values, $a_1 = 2^{\alpha-\beta}$ and $a_2 = 2^{\alpha-\beta}(4 - \alpha)/(2 - \beta)$, characterize an endpoint collision and a loss of regularity of the boundary curve, respectively. The real-parameter case and a nonlinear higher-order logistic map are treated as consequences of the same stability criterion. We also analyze the one-term family $\Delta^{\alpha}x(t) = (c - 1)x(t + \alpha - N)$ for $N - 1 < \alpha \leq N$. A winding-number bound proves that its stability region is empty for every $N \geq 3$. Numerical experiments illustrate the theoretical results.
Read the full abstract
Combinatorics
Construction of graph coverings with prescribed Iwasawa invariants
For a $\mathbb{Z}_p$-covering of connected graphs, an analogue of Iwasawa's class number formula describes the growth of the number of spanning trees in terms of Iwasawa $\lambda$- and $\mu$-invariants. In this paper, we show that any pair $(\lambda, \mu)$ can be realized as the Iwasawa invariants of an unramified $\mathbb{Z}_p$-covering of a bouquet, provided that the necessary condition that $\lambda$ is odd is satisfied. We further show that any pair $(\lambda, \mu)$, without a parity condition, can be realized if we allow ramified $\mathbb{Z}_p$-coverings.
Read the full abstract
Analysis of PDEs
Global well-posedness of solutions for the equations modelling the motion of a rigid body in a bidimensional perfect fluid
This paper considers a system modelling the evolution of a rigid body immersed in a bidimensional incompressible perfect fluid. In the special case of a disk-shaped rigid body, it was shown by C. Rosier and L. Rosier (2009) that the system admits a unique global solution when the initial fluid velocity $u_0$ belongs to $H^s$ ($s \ge 3$) and its vorticity $\operatorname{curl} u_0$ lies in $L^p$ with $1 \le p < 2$. By establishing a Beale-Kato-Majda type bound, we generalize the result by removing the constraint $\operatorname{curl} u_0 \in L^p$ and allowing the rigid body to be of arbitrary shape. Moreover, we obtain an explicit energy bound.
Read the full abstract
Differential Geometry
Foliation of null cones by surfaces of constant spacetime mean curvature near MOTS
Marginally Outer Trapped Surfaces (MOTS) in spacetimes are well-known to indicate the existence of black holes. Using flow techniques, we prove that a neighbourhood of a stable MOTS in a null cone may be foliated by hypersurfaces of constant spacetime mean curvature. We also provide methods to construct prescribed spacetime mean curvature surfaces within null cones.
Read the full abstract
Analysis of PDEs
A unified treatment of degenerate nonlocal elliptic problems
We develop a unified framework for a broad class of nonlocal elliptic problems, encompassing a wide spectrum of nonlocal terms, including the classical Kirchhoff and Carrier-type equations as particular cases, and nonlinearities having sublinear or asymptotically linear growth. By combining the study of a suitable auxiliary problem and fixed-point techniques with careful parameter analysis, we establish existence, non-existence, and multiplicity results for positive solutions. Our method reveals sharp parameter thresholds and provides a comprehensive description of the solution set. Finally, for powerlike nonlinearities (including superlinear and singular ones) we provide a more direct approach, based on homogeneity.
Read the full abstract
Numerical Analysis
Data-dependent approximation through RBF
In this article we present a modification of classical Radial Basis Function (RBF) interpolation techniques aimed at reducing oscillations near discontinuities in one and two dimensions. Our approach introduces an adaptive mechanism by varying the shape parameter of the RBFs and making it data-dependent, forcing it to tend to infinity in the vicinity of discontinuities. This modification results in kernel functions that locally resemble %Kronecker delta functions, effectively minimizing spurious oscillations. To detect discontinuities, we employ smoothness indicators: for grid-based data, these are computed as undivided second-order differences squared. For scattered data, we use least squares approximations of the Laplacian multiplied by the square of the mean local separation of the stencil points, and then squared. These indicators guide the adaptive adjustment of the shape parameter. We prove the invertibility of the resulting interpolation matrix and propose a solution strategy that maintains the condition number comparable to that of a system where points near discontinuities are excluded. Numerical experiments in one and two dimensions demonstrate that the proposed method significantly reduces oscillations near discontinuities across various kernel types, whether locally or globally supported. At the same time, the interpolation accuracy and matrix conditioning in smooth regions remain essentially unchanged, as measured by the infinity norm of the error and the condition number.