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)

Wednesday 29 April

Statistics Theory · Cross-listed from stat.ME

Principled Estimation and Prediction with Competing Risks: a Bayesian Nonparametric Approach

Competing risks occur in survival analysis when multiple causes of death are present. They play a prominent role in several domains extending beyond biostatistics to encompass epidemiology, actuarial sciences, and reliability theory. This paper adopts a multi-state modeling framework to competing risks. We introduce a class of flexible nonparametric priors, defined through hierarchical completely random measures, to model the transition probabilities, and identify the specific (conditionally) conjugate member of this general class. Furthermore, we determine the joint marginal distribution of the data and of a latent random partition, and characterize the posterior distribution of the model. Leveraging these distributional results, we evaluate the predictive probability that a future event is of a specific type (e.g. death from a particular cause), as a function of the time at which the event occurs. The resulting function, derived on sound principles, is termed the prediction curve, and represents a major innovation in the literature. In addition, we provide posterior estimates for the survival function, and for the cause-specific incidence and subdistribution functions. Suitable simulation algorithms for posterior inference are also devised. The model's performance, as well as the algorithms' effectiveness, is evaluated through simulation studies. Finally, we illustrate our approach on clinical datasets.
Read the full abstract

Algebraic Geometry

Rational curves on cubic hypersurfaces in positive characteristic

We study the moduli spaces of rational curves on cubic hypersurfaces in characteristic $\neq2,3$. As a result, we prove that for every integer $d\geq1$ the Kontsevich moduli space of stable maps on a smooth cubic hypersurface $X$ of degree $d$ is irreducible if the dimension of $X$ is greater than or equal to $4$.
Read the full abstract

Probability

Existence and uniqueness results of a stochastic nonlinear heat equation with a constraint of codimension one

In this work, we investigate the well-posedness of a stochastic heat equation with an arbitrary (but polynomial) nonlinearity in any dimension $d\geq 1$ perturbed by a multiplicative white noise in the Stratonovich form, subject to an $L^2-$norm constraint on the solution. In bounded smooth domains, we establish the existence of a martingale solution taking values in $H_0^1 \cap L^p$ for arbitrary $2 \le p < \infty$, using a modified Faedo-Galerkin scheme. By utilizing a sequence of self-adjoint operators which are bounded in $L^p$ for any $2 \le p < \infty$, we provide a novel proof of an Itô formula for the $L^p-$norm of the solution. Together with pathwise uniqueness of the martingale solution, the Yamada-Watanabe result then yields the existence of a strong solution and uniqueness in law.
Read the full abstract

Numerical Analysis

Projections for handling uncertainties and enabling domain truncation in diffuse optical tomography

This paper presents a projection-based technique to mitigate the impact of modeling errors related to domain truncation, changes in the optode coupling coefficients, and misspecified optical parameters of different tissue types in diffuse optical tomography. The approach considers the primary Jacobian matrix of the forward map in the image reconstruction scheme, linking the primary unknown, i.e., the per-voxel absorption coefficient changes in the region of interest, to the optode measurements, as well as the nuisance Jacobians that do the same for the auxiliary unknown parameters of secondary interest. To mitigate mismodeled coupling coefficients or domain truncation, the method projects the linearized forward model defined by the primary Jacobian onto the orthogonal complement of the range of a nuisance Jacobian, or onto the orthogonal complement of the span of a number of first left singular vectors for the nuisance Jacobian that has been weighted to account for prior information on the measurement setup. In the case of a misspecified baseline optical parameter for some tissue type, the nullspace of the utilized orthogonal projection is defined to be the span of first left singular vectors for a (weighted) difference of two Jacobian matrices evaluated at two different levels for the considered tissue-wise optical parameter. The reconstruction is formed by applying Bayesian inversion with Gaussian prior and noise models to the projected linearized equation. We evaluate the method on simulated brain activity data obtained via Monte Carlo simulations of the radiative transfer equation in a voxelized head anatomy for a neonate with combined gestational and chronological age of 41.7 weeks.
Read the full abstract

All authors Aada Hakula, Pauliina Hirvi, Nuutti Hyvönen, Altti Jääskeläinen, Ville Kolehmainen

Probability

Non-uniqueness for the stochastic incompressible Euler equations with a passive tracer

In this work we investigate the phenomenon of pathwise non-uniqueness for the stochastic incompressible Euler equations with a passive tracer on the whole Euclidean space. The stochastic perturbations are interpreted as a transport noise and a linear multiplicative noise in the Stratonovich sense. In both cases, via classical transformations, we convert the SPDEs into PDEs with random coefficients. Using the Baire category method developed by De Lellis and Székelyhidi Jr., we then construct infinitely many global-in-time weak solutions to the random PDEs in any spatial dimension greater than or equal to two. By applying the inverse transformations, we obtain pathwise non-uniqueness for the original SPDEs. Finally, we present an application of our result to the three-dimensional stochastic ideal MHD equations. This study can be regarded as a stochastic counterpart of Bronzi et al.~[Commun.~Math.~Sci.,~2015]. In particular, our non-uniqueness result in the random setting extends theirs from a constant energy profile equal to one to arbitrary positive, bounded, and continuous time-dependent profiles, originally established in two dimensions via the convex integration technique.
Read the full abstract

Functional Analysis

Norm additive mappings between the positive cones of continuous function algebras

We study bijections between the positive cones of spaces of continuous functions vanishing at infinity that satisfy a norm additive condition. Such maps arise naturally in the study of nonlinear functional equations and norm-preserving structures on function spaces. While in the compact (unital) case these maps can often be analyzed via linear extension techniques, the non-unital setting $C_0(X)$ requires a different approach due to the absence of a distinguished unit element. In this paper, we show that every bijection $T:C_0^+(X)\to C_0^+(Y)$ between the positive cones of $C_0(X)$ and $C_0(Y)$ satisfying \[ \|T(f+g)\|=\|Tf+Tg\| \] for all $f,g\in C_0^+(X)$ admits a representation of the form \[ Tf(y)=h(y)f(\tau(y)), \] where $\tau:Y\to X$ is a homeomorphism and $h$ is a bounded continuous function from $Y$ to $(0,\infty)$. This yields a complete characterization of norm additive bijections on positive cones of $C_0^+(X)$.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ME

ARMA approximation of a Non-separable Spatio-Temporal Model with Fractional Smoothnesses in Space and Time

The Matérn covariance model is ubiquitous in spatial modelling, but there is no default choice for spatio-temporal modelling. In this paper, we consider the recently proposed “diffusion-based” extension of the spatial Matérn covariance model to a spatio-temporal non-separable covariance model that allows fractional smoothnesses in space and in time. The model is described in terms of a space-time fractional stochastic partial differential equation, but currently proposed computational approaches have strong restrictions on the possible smoothnesses in time. We propose a discretization method based on rational approximations in time to handle arbitrary smoothnesses, which leads to a vector autoregressive moving average process (VARMA). We prove that the covariance function of the approximation converges pointwise, determine explicit convergence rates as a function of spatial and temporal resolutions and the accuracy of the rational approximation, and conduct numerical verification to demonstrate small pointwise error for low orders of the VARMA process. Through a simulation study, we demonstrate that the parameters can be estimated back and that correctly specifying the temporal smoothness is especially important for forecasting. The approach is illustrated for three months of daily mean temperatures in mainland France.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Hybrid Digital and Microwave Linear Analog Computer (MiLAC)-aided Beamforming for Multiuser MIMO-OFDM Systems

Microwave linear analog computing (MiLAC) has recently emerged as a promising architecture for analog-domain beamforming. In particular, a hybrid digital-MiLAC architecture was proposed and was shown to achieve fully-digital beamforming flexibility in narrowband systems when the number of RF chains equals the number of data streams. However, its performance in wideband systems remains unexplored. This paper presents the first study of hybrid digital-MiLAC beamforming for wideband multi-user multiple-input single-output (MU-MISO) systems. We first characterize the minimum number of radio-frequency (RF) chains required for hybrid digital-MiLAC beamforming to realize an arbitrary set of fully-digital beamforming matrices across all subcarriers. It turns out that, unlike in the narrowband case, a larger number of RF chains is generally required in frequency-selective channels to achieve fully-digital beamforming flexibility, which may be unfavorable in practice. To study the performance of hybrid digital-MiLAC beamforming with a limited number of RF chains, we then formulate the average sum-rate maximization problem and develop an efficient weighted minimum mean-square error (WMMSE)-based algorithm for beamforming design. Simulation results show that hybrid digital-MiLAC beamforming consistently outperforms conventional hybrid digital-analog beamforming, and achieves $89.93\%$ of the fully-digital sum-rate while using only $12.5\%$ of the RF chains in highly frequency-selective channels.
Read the full abstract

Metric Geometry

A stellated tetrahedron that is probably not Rupert

A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuan, Steininger and Yurkevich recently constructed a convex polyhedron which is not Rupert. We propose a search for the simplest possible non-Rupert polyhedron and provide numerical evidence suggesting that a particular stellated tetrahedron is not Rupert. The computational techniques utilize linear program solvers to compute the largest possible scalings of polygons that can be translated to fit in other polygons. The relative simplicity of the stellated tetrahedron as compared to other polyhedra allows this more rudimentary check to be computationally tractable. In particular, we show that over 88% of a particular encoding of $\text{SO}(3) \times \text{SO}(3)$ equipped with the standard measure does not yield a Rupert passage.
Read the full abstract

Differential Geometry

Intermediate curvature and splitting theorem

In this paper, we prove several rigidity results for complete noncompact manifolds with nonnegative intermediate curvatures. We show that when either $3\leq n\leq 5$, $1\leq m\leq n-1$, or $6\leq n\leq 7$, $m\in \{1,n-1,n-2\}$, any manifold of the topological type $M^{n-m}\times \mathbb{T}^{m-1}\times \mathbb{R}$ with nonnegative $m$-intermediate curvature is isometrically covered by the canonical product $M\times \mathbb{R}^m$. We also construct smooth metrics on $M^{n-m}\times \mathbb{T}^{m-1}\times \mathbb{R}$ with uniformly positive $m$-intermediate curvature for $6\leq n\leq 7$, $2\leq m\leq n-3$. This proves that the algebraic condition $m^2-mn+m+n>0$ from \cite{chenshuli_end} is sharp. The proof is based on a new recursion theorem for spectral intermediate curvatures and cylindrical splitting theorems. In particular, when $m=n-1$, this provides a new proof of some results by Chodosh–Li \cite{chodoshlisoapbubble} and Zhu \cite{zhu-splitting}. Moreover, the recursion theorem can be used to reprove the result of Brendle–Hirsch–Johne \cite{brendlegeroch'sconjecture}.
Read the full abstract

Combinatorics

MacNeille completions of parabolic quotients

Alternating sign matrices (ASMs) arise as the Dedekind-MacNeille completion of the Bruhat order on the symmetric group. They enjoy fruitful combinatorial and geometric properties, with a particularly rich history on enumerations and bijections. In this paper, we explicitly describe the Dedekind-MacNeille completion of the Bruhat order on any parabolic quotients of the symmetric group. It is naturally a subposet of the alternating sign matrices, with different lattice operations. Moreover, we demonstrate the relations between the meet and join operations in this lattice with taking unions and intersections of the corresponding ASM varieties, respectively. Finally, we conclude with a more detailed discussion of special cases.
Read the full abstract

Probability

Spectrum of Random Matrices with Exploding Moments

We study the central limit theorem (CLT) for linear eigenvalue statistics of several types of matrix models, whose entries are having exploding moments, i.e., moments of the entries are increasing with the size of the matrix. In particular, we study elliptic, centrosymmetric, circulant, and inter-correlated block matrices. The CLTs are established using asymptotic Wick formula.
Read the full abstract

Number Theory

Families of Unit Equations and Exponential Diophantine Problems via Integral Points

This paper investigates the distribution of integral points on projective varieties via two distinct methods: the Ru-Vojta theorem and our higher-dimensional generalization of the Huang-Levin-Xiao inequalities. These approaches operate under distinct geometric conditions, specifically the transverse and proper intersections of boundary divisors. Applying this framework, we prove degeneracy results for the solution sets of two classes of one-parameter families of unit equations, differentiated by the degrees of their polynomial coefficients. Finally, we extend previous greatest common divisor (GCD) estimates to derive new results for specific exponential Diophantine equations and the distribution of digits in $q$-adic representations.
Read the full abstract

Information Theory · Cross-listed from eess.IV

Adaptive Transform Coding for Semantic Compression

Visual data compression is shifting from human-centered reconstruction to machine-oriented representation coding. In this setting, an image is often mapped to a compact semantic embedding, which is then compressed and transmitted for downstream inference. We propose an adaptive transform-coding method for semantic-feature compression motivated by the conditional rate-distortion function of a Gaussian mixture model. The scheme uses mode-dependent transforms and quantizers selected according to the inferred source component, enabling more efficient coding of heterogeneous feature distributions. Evaluations on features from widely used vision backbones and foundation models show that the proposed method outperforms or is competitive with state-of-the-art neural compression methods while preserving flexibility and interpretability.
Read the full abstract

Metric Geometry

Directional curvature and medial axis

The medial axis $M_X$ of a closed set $X\subset \mathbb{R}^n$ is the set of points from the ambient space that admit more than one closest point in $X$. We study the problem of reaching the singularities, i.e. of characterising the points of the set $\overline{M_X}\cap X$. In order to tame the geometry, we assume that $X$ is definable in a polynomially bounded structure and obtain a general criterion based on a generalisation of the notion of superquadraticity previously introduced by Birbrair and Denkowski for $C^1$-smooth hypersurfaces and extended to any codimension by Białożyt. We do not require any smoothness as we achieve our goal by introducing a notion of directional curvature in some naturally chosen camber directions. This allows us in particular to complete the study of the plane case.
Read the full abstract

Functional Analysis

Equilibrium in the Canonical Stackelberg Triopoly via Response Functions and Fixed Point Theory

We analyze a canonical extension of the Stackelberg duopoly to a sequential framework, where each firm strategically anticipates the reactions of all subsequent players. In a triopoly (three-firm) settings, we obtain existence and uniqueness of market equilibrium via a reformulation of the equilibrium conditions that draws on coupled fixed-point theory. Even with linear demand, convergence of myopic best-response dynamics is not guaranteed. A recursive equilibrium formulation enables the analysis of the limiting case as the number of participants grow.
Read the full abstract

Analysis of PDEs

Geometric structure of singular free boundary points for the logarithmic obstacle problem

In the previous work [Interfaces Free Bound., 19, 351–369, 2017], de Queiroz and Shahgholian established the optimal $C^{1,\log}_{\mathrm{loc}}$ regularity of solutions for the obstacle problem with singular logarithmic forcing term $$-\Delta u = \log u\,\chi_{\{u>0\}} \quad \text{in } \Omega,$$ where $\Omega\subset\mathbb{R}^d$ ($d\geq 2$) is a smooth bounded domain. In our earlier work [arXiv:2408.08104, 2024], we proved the $C^{1,\alpha}$ regularity of the free boundary $\Omega\cap\partial\{u>0\}$ near regular points. In this paper, we investigate the more delicate structure of the singular free boundary. Since the nonlinearity $-\log u$ is singular near the free boundary and destroys the scaling invariance, so that neither the classical blow-up arguments nor the standard epiperimetric inequality [Weiss, Invent.\ Math., 138, 23–50, 1999] apply directly; moreover, the Weiss type monotonicity formula requires a variable-parameter correction that introduces non-integrable remainder terms into the energy estimates. Motivated by Colombo–Spolaor–Velichkov [Geom.\ Funct.\ Anal., 28, 1029–1061, 2018], we develop a new log-epiperimetric inequality for the modified Weiss energy, also proved by the direct method. A key novelty is the introduction of an auxiliary correction term $T$ that absorbs the non-integrable errors. As consequences, we establish a logarithmic energy decay, uniqueness of blow-ups at singular points, and a $C^{1,\log}$-type geometric description of the singular strata. In dimension two, the logarithmic modulus improves to a Hölder modulus.
Read the full abstract

Optimization and Control

Improved Penalty Function Approaches for Optimization Problems with General Orthogonality

In this paper, we consider a class of generalized orthogonal optimization constraint problems (GOOCP) over $\mathbb{R}^{n \times p}$, where the variable $X$ is restricted within the intersection of a certain subspace $\mathcal{F}$ and satisfies the quadratic constraint $\{X \in \mathbb{R}^{n \times p}: X^{\top} \phi(X) = I_p\}$. Such constraints generalize a wide range of structured matrix manifolds, such as the Stiefel manifold, the symplectic Stiefel manifold, the indefinite Stiefel manifold, the third-order tensor Stiefel manifold, etc. We show that the feasible region of GOOCP is a closed embedded submanifold of $\mathbb{R}^{n \times p}$ and characterize the necessary geometric materials for the existing Riemannian optimization frameworks. Based on the constraint dissolving approach for Riemannian optimization problems, we propose the constraint dissolving penalty function (GOCDF) for the constrained optimization problem GOOCP with easy-to-compute formulations. We further establish the equivalence between GOCDF and GOOCP in the aspects of first-order and second-order stationary points. We also analyze the computational complexity of applying first-order methods to minimize GOOCP, which could be significantly lower than those of first-order Riemannian optimization methods. Numerical experiments demonstrate that solving GOOCP through applying unconstrained optimization methods to minimize constraint dissolving function demonstrates superior efficiency to existing Riemannian optimization methods.
Read the full abstract

All authors Yongshen Zhang, Xin Liu, Nachuan Xiao, Chunming Tang

Combinatorics

Order-Sensitive Sequential Interventions on Ideal Lattices

We study sequential interventions under prerequisite constraints. In this setting, admissible intervention sequences are paths in the ideal lattice of a finite prerequisite poset rather than unconstrained action strings. We give an exact local-to-global theory of order sensitivity on this state space. First, we prove that any two admissible paths with the same endpoints differ by a finite sequence of elementary diamond swaps. Second, for edge-additive path valuations, we show that path-independence is equivalent to vanishing diamond curvature, yielding an endpoint potential with a canonical Möbius parameterization on the ideal lattice. Third, we prove that a local diamond field is induced by an edge-based path model if and only if it satisfies cube consistency, with uniqueness after fixing a reference-tree gauge. Under reduced-state longitudinal assumptions, supported reference paths identify reference-path scores, whereas local order effects require two-sided support of both orders on each diamond. These results yield exact planning consequences, including an order-insensitivity bound and dynamic programming on the truncated ideal lattice.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

The Fock-Darwin-Darboux system: eigenstates, information entropies and dispersion-like measures

The Fock-Darwin (FD) quantum system describes the motion on the plane of a charged particle under the action of an isotropic oscillator potential together with a perpendicular constant magnetic field. When the isotropic oscillator is suppressed, the FD system leads to the Landau Hamiltonian with infinitely degenerate Landau levels. The Fock-Darwin-Darboux (FDD) system is the generalisation of the FD system to a particle moving on the Darboux III space, which is a conformally flat surface with non-constant negative curvature. We present a systematic study of some information-theoretic entropy and dispersion-like measures for these quantum systems. Since both systems are exactly solvable, analytical expressions for Shannon, Rényi and Tsallis entropies, among others, can be obtained. We show that for the FD system, its information-theoretic measures are formally the same as the ones for the harmonic oscillator, provided a modified effective frequency depending on the magnetic field is introduced. In the FDD case, the nonlinear nature of the underlying manifold precludes the existence of a simple closed form for the wave-function on momentum space, which is numerically analysed. We compare the numerical behaviour of the different entropy measures and we analyse the interplay arising in the FDD system between the curvature parameter and the magnetic field. In particular, it is shown that the Landau system on the Darboux III space has no infinitely degenerate Landau levels.
Read the full abstract

Optimization and Control · Cross-listed from quant-ph

Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms

The optimization of front-end crude oil scheduling is a critical determinant of refinery profitability and operational stability. However, the coupling of discrete logistics events (e.g., vessel berthing) with continuous material flows (e.g., pipeline transfers) renders this problem an NP-hard Mixed-Integer Linear Programming (MILP) challenge, often intractable for classical solvers at industrial scales. This study proposes a novel hybrid quantum-classical framework to address these computational bottlenecks. We employ Benders Decomposition to decouple the monolithic model into a discrete Master Problem (MP) and a continuous Subproblem (SP). To exploit the search capabilities of quantum computing, the MP is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) model and solved via a hybrid quantum solver, while the SP enforces mass balance and quality constraints through iterative optimality and feasibility cuts. Extensive experiments on 15 multi-scale instances demonstrate that the proposed framework significantly outperforms traditional metaheuristics (e.g., Genetic Algorithms, Tabu Search), reducing total operating costs by approximately 73–80% and achieving computational speeds comparable to state-of-the-art commercial solvers (Gurobi). By effectively leveraging global optimality cuts, the method overcomes the tendency of heuristic approaches to trap in local optima, providing a robust and scalable solution for complex refinery logistics.
Read the full abstract

All authors Jian Yang, Bohang Wang, Lina Wang, Jiacheng Chen, Gaoxiang Tang, Zihan Deng, Wending Zhao, Xianfeng Cai

Analysis of PDEs

The local Calderón problem and the determination at the boundary of a complex anisotropic admittivity

We address Calderón's problem of stably determining the anisotropic complex admittivity $\sigma$ in a domain $\Omega\subset\mathbb{R}^n$, with $n\geq3$, representing a conducting medium, in terms of a Dirichlet-to-Neumann map locally prescribed on a non-empty portion $\Sigma$ of the boundary of $\Omega$, $\partial\Omega$. $\sigma$ is assumed to be of type $\sigma(\cdot)=A(\cdot,a(\cdot))$ in $\Omega$, where the one-parameter family of complex-symmetric matrices $[\lambda^{-1},\:\lambda]\ni t\mapsto A(\cdot,\: t)$ is assumed to be a-priori known and the scalar function $a$ is unknown. We establish Lipschitz and Hölder stability estimates at the boundary for $\sigma$ and its derivatives of arbitrary order on $\Sigma$, respectively, in terms of the local map.
Read the full abstract

Optimization and Control

Fixed-Time and Arbitrarily Fast Exponential Stabilization of Discrete-Time Switched Linear Systems

In this paper we first study the fixed-time stabilizability of discrete-time switched linear control systems. Using a geometric approach, we derive conditions under which such systems can be stabilized within a prescribed number of steps, independently of the switching sequence. We address both the mode-dependent case, where the controller has access to the active mode, and the mode-independent case, where a common feedback law must be employed. For each setting, we present constructive procedures to compute the stabilizing state-feedback gains. Building on these results, we then introduce a structural decomposition of switched systems, which serves to simplify stabilizability analysis and controller design. This allows us to establish the equivalence between fixed-time stabilizability and arbitrarily fast exponential stabilizability. The effectiveness of the proposed methods is illustrated through a numerical example.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Integrable Deformations of the Breitenlohner-Maison Model from 4d Chern-Simons Theory

We derive integrable deformations of the 2d Breitenlohner-Maison (BM) sigma model that describes the stationary, axisymmetric sector of 4d general relativity, as well as higher-rank generalisations thereof, using the framework of 4d Chern-Simons theory. In particular, we consider deformations of the boundary conditions and action of the 4d Cole-Weck model, which lead to deformations of the BM model associated with solutions to the homogeneous and inhomogeneous classical Yang-Baxter equations respectively.
Read the full abstract

Numerical Analysis

Multiscale Modeling for Time-harmonic Maxwell equations with impedance boundary conditions in highly heterogeneous media

Modeling time-harmonic Maxwell problems in heterogeneous media presents significant mathematical and computational challenges. Due to the inherent non-elliptic structure and non-coercive nature of Maxwell equations, conventional methods face severe numerical instabilities, particularly in high-contrast media and at high wave numbers. These challenges often lead to ill-conditioned discrete systems and prohibitively high computational costs, limiting their practical applicability. To overcome these challenges, we introduce an efficient multiscale framework for time-harmonic Maxwell equations with impedance boundary conditions in high-contrast media. A major novelty of this study lies in circumventing the need for an explicit divergence-free constraint on multiscale basis functions. To achieve this, an auxiliary space is constructed via local spectral problems incorporating a mass term and a Silver-Müller-type boundary penalty. This novel design guarantees the coercivity of the corresponding bilinear form and automatically excludes the kernel of the curl operator from the leading eigenspaces. Building upon the auxiliary space, we then construct the multiscale space by using a distinct bilinear form. By exploiting a resolution condition and establishing key norm relationships, we rigorously prove the coercivity of this modified bilinear form a crucial property that underpins the whole analysis. Theoretical analysis shows that, with appropriate oversampling, the method achieves $O (H)$ convergence independent of the local contrast and the approximation error increases with the wave number $k$. Extensive numerical experiments are reported to validate the effectiveness of the proposed approach.
Read the full abstract

Metric Geometry

Curly Kakeya: The Hausdorff dimension of sets containing circles or line segments in many directions

In this paper, we establish a lower bound for the Hausdorff dimension of a set $K\subset \mathbb{R}^n$ that contains a dilated and translated copy of every meridian, that is, of every $(d-2)$-dimensional sphere passing through the poles of $S^{d-1}$, a $(d-1)$-dimensional sphere, with $3\le d\le n$, and $S^{d-1}$ contained in $\mathbb{R}^n$. Under this assumption, we have \[ \dim_H(K)\ge d-1. \] This result is closely related to, and reminiscent of, the classical Kakeya set problem. We build upon this connection, employing similar techniques to show that if $K\subset \mathbb{R}^n$ contains a unit straight line segment in every direction corresponding to a smooth curve on $S^{n-1}$, then its Hausdorff dimension is $\ge 2$.
Read the full abstract

Dynamical Systems

Topological Horseshoe Induced by Periodic Switching Between Non-Isochronous Planar Systems

We establish a criterion for the existence of a topological horseshoe in a class of planar systems generated by periodic switching between two subsystems, each admitting a family of closed orbits, where the mechanism for chaos arises from the non-isochronicity of each subsystem. Exploiting the relationship between the period function of a Hamiltonian system and the rate of change of the area enclosed by its periodic orbits, we derive a criterion, which can be checked by numerical methods, for the existence of horseshoe in planar systems obtained by switching between two Hamiltonian subsystems. Furthermore, by invoking monotonicity results for the period function in Newtonian Hamiltonian systems, we obtain an explicit and computable criterion that guarantees chaotic dynamics in planar systems generated by switching between two such subsystems.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CE

A Matrix-Free Galerkin Multigrid Solver and Failure-Mode Screen for Single-GPU 3D SIMP Linear Systems

Large 3D SIMP studies require repeated elasticity solves for density-dependent operators whose finest matrices are expensive to assemble and whose conditioning degrades under high contrast. We study this linear-solver layer rather than claiming end-to-end optimization acceleration. The solver builds a matrix-free Galerkin geometric multigrid (GMG) hierarchy around a fused fine operator: the finest level remains matrix-free, the first coarse level is assembled by local Galerkin aggregation, and deeper levels use sparse Galerkin products. The practical default is FP32-GMG; BF16 is evaluated as a guarded mixed-precision variant and diagnostic stress test, not as the main speed mechanism. In a 27-case heterogeneous cantilever sweep, pass rates under a 200-iteration budget are 7/9, 4/9, and 1/9 at 64k, 216k, and 512k elements; converged-only mean iteration counts are about 112, 134, and 146. On uniform rho=0.5, p=3 solves, FP32-GMG gives 1.62x, 1.75x, and 3.12x wall-time ratios relative to the capped flat Jacobi-PCG baseline at the same sizes; that non-converged baseline reaches the 200-iteration cap in all timed trials. BF16-GMG is not faster than FP32-GMG. In 18 fixed-seed heterogeneous BF16 validation cases, 7/18 converge, matching the FP64 count, and 11 cases that pass the spectral screen still fail the 500-iteration cap; the screen is therefore diagnostic rather than a convergence certificate. The largest reported solve is a 1M-element uniform-modulus system solved in 1.50+/-0.58 s with an 8.66 GiB hierarchy-allocation delta during setup, not a peak-memory trace; this point is reported as uniform scaling, not heterogeneous robustness evidence. The contribution is therefore a bounded single-GPU solver result built on an inherited Level 0 matrix-free operator: a Galerkin GMG hierarchy, direct BF16 guard evidence, and an explicit failure-mode screen for structured 3D SIMP linear systems.
Read the full abstract

Classical Analysis and ODEs

Blend-to-zero operators for smooth transition functions

Motivated by existing blend-to-zero techniques, a formal framework is developed for defining and constructing blend-to-zero operators on closed intervals for the generation of sufficiently smooth transitions between functions. Such transitions are first formulated as a two-point Hermite-type interpolation that is not necessarily polynomial. It is shown that, in the polynomial case, the corresponding interpolant can be explicitly represented in terms of the regularized incomplete Beta-function. This representation is then used to generate linear blend-to-zero operators. Following this, additional blend-to-zero operators are constructed by considering the algebraic and geometric properties of functions with sufficiently flat ends (e.g., smooth staircase functions and smooth step functions). Finally, explicit formulas for a family of trigonometric smooth step functions are provided, and these functions are shown to be related to certain higher-order two-point boundary value problems.
Read the full abstract

Analysis of PDEs

Analytic semigroup generated by the dispersal process of a sylvatic transmission model of Chagas disease

In this work, we develop a new biological transmission model for Chagas disease. This model, set in two juxtaposed habitats with skew Brownian motion conditions at the interface, is composed of two reaction–diffusion equations and takes into account the sylvatic transmission. We write it as an abstract perturbed Cauchy problem using operator theory. Then, we show that the main operator, which models the dispersal process, generates an analytic semigroup in an adequate Banach space.
Read the full abstract

All authors Narimene Benarbia, Rabah Labbas, Tewfik Mahdjoub, Alexandre Thorel