Numerical Analysis
Verification of reciprocity in anisotropic poroelastic wave simulation using symmetric Strang splitting
Morten Jakobsen and Jose Carcione
Poroelastic wave simulations are important for many applications relating fluid flow and wave characteristics in porous rock formations. Reciprocity is a key physical property of wave propagation in porous media that is important for such applications, even when viscous dissipation is present. However, numerical poroelastic simulations often fail to reproduce reciprocal responses because the discretization does not preserve the balance between reversible wave dynamics and irreversible fluid-solid drag. To address this, we formulate the Biot equations in terms of a continuous
evolution operator split into a reversible (skew-adjoint) wave part and an irreversible (self-adjoint, non-positive) Darcy part, including the leading-order Johnson-Koplik-Dashen correction. This structure clarifies why reciprocity holds in the continuous equations and how it is easily broken in discrete form. Guided by this interpretation, we construct a symmetric second-order Strang-splitting scheme with half-step source injection. The method conserves energy in the reversible subsystem, treats Darcy dissipation unconditionally stably, and retains Courant limits similar to elastic solvers. Using a staggered pseudo-spectral discretization, we model multimode propagation in 2D VTI media and obtain cross-component reciprocity with a relative L2 misfit approaching machine precision, demonstrating that the discrete scheme inherits the
symmetry properties of the continuous
evolution operator.
Read the full abstract ▾
Geometric Topology
Stable-norm boundary geometry on once-punctured tori
Nhat Minh Doan, Xiaobin Li and Van Nguyen
We use normal-turn estimates to study the local and global geometry of the boundaries of stable-norm balls $B_X$ for complete finite-area
hyperbolic once-punctured
tori $X$. We show that the boundary $\partial B_X$ is a convex-
geometric detector of exponential Diophantine approximation: rational directions give genuine corners with exponentially small exterior angles, while at an irrational direction $\beta$ the graph-flatness order admits an explicit formula in terms of the exponential rate at which rational directions approach $\beta$ and the $\ell^\infty$-radius of $B_X$ in the projective direction $\beta$. Thus irrational directions are not uniformly flat to infinite order, correcting the McShane–Rivin local picture. We also determine all possible irrational flatness orders and the size of the corresponding level sets. The computation of the rational corners unexpectedly yields a new McShane-type identity for the area of the dual body $B_X^*$: $$ \operatorname{Area}(B_X^*) = 4\sum_{\gamma} \ell_X(\gamma) \log\coth\left(\frac{\ell_X(\gamma)}{2}\right), $$ where the sum is over unoriented simple closed geodesics on $X$. As another global application, the normal-turn estimates also give a logarithmic-square bound for the number of integer points on the boundary of each dilated norm ball. Consequently, the number of simple closed geodesics of length exactly $L\geq2$ is at most $C_X(\log L)^2$. For the modular
torus this yields $$ \#\lambda_M^{-1}(m)\leq C(\log\log(3m))^2 $$ for every Markoff number $m$, improving the previous logarithmic bounds for Markoff fibers.
Read the full abstract ▾
Probability · Cross-listed from stat.ML
Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model
Arie Wortsman-Zurich, Hugo Tabanelli, Yatin Dandi et al. (+2 more)
We propose a simple mechanism by which scaling laws emerge from feature learning in multi-layer networks. We study a high-dimensional hierarchical target that is a globally high-degree function, but that can be represented by a combination of latent compositional features whose weights decrease as a power law. We show that a layer-wise spectral
algorithm adapted to this compositional structure achieves improved scaling relative to shallow, non-adaptive methods, and recovers the latent directions sequentially: strong features become detectable at small sample sizes, while weaker features require more data. We prove sharp feature-wise recovery thresholds and show that aggregating these transitions yields an explicit power-law decay of the prediction error. Technically, the analysis relies on random
matrix methods and a resolvent-based perturbation argument, which gives matching upper and lower bounds for individual eigenvector recovery beyond what standard gap-based perturbation bounds provide. Numerical experiments confirm the predicted sequential recovery, finite-size smoothing of the thresholds, and separation from non-hierarchical kernel baselines. Together, these results show how smooth scaling laws can emerge from a cascade of sharp feature-learning transitions.
Read the full abstract ▾
All authors Arie Wortsman-Zurich, Hugo Tabanelli, Yatin Dandi, Florent Krzakala, Bruno Loureiro
Statistics Theory · Cross-listed from stat.ME
A Bayesian Longitudinal Spatial Normative Model for Individualized Brain Deviation Mapping
J. T. Korley
Normative modeling enables individualized characterization of structural
brain deviations by evaluating subjects against a reference population rather than a group average. Most existing implementations treat
brain regions independently and remain cross-sectional, despite the availability of repeated neuroimaging measurements and the well-documented spatial organization of neuroanatomical variation. We propose a
Bayesian longitudinal spatial normative model that jointly captures within-subject temporal dependence and spatially structured subject-specific deviations within a unified hierarchical framework. The individualized deviation map is treated as a latent spatial process with an explicit posterior distribution, yielding a principled Bayes
estimator under squared error loss rather than an ad hoc residual summary. Across six simulation scenarios encompassing varying spatial dependence, nonlinear trajectories, irregular visit schedules, and missing follow-up, the proposed model consistently reduced deviation-map reconstruction error relative to independent cross-sectional and longitudinal non-spatial
benchmarks while maintaining stable calibration. In an application to OASIS-3 structural MRI data, the model reduced RMSE by 54% relative to the independent cross-sectional model and by 45% relative to the longitudinal non-spatial model. Regional deviation burden was concentrated in the temporal pole, entorhinal cortex, inferior temporal cortex, posterior cingulate, and parahippocampal cortex, consistent with regions implicated in early Alzheimer-type neurodegeneration. Subject-level profiles revealed substantial heterogeneity in regional abnormality patterns, including marked multiregional deviation with preserved global cognitive scores.
Read the full abstract ▾
General Mathematics
Roughness and entropy measures of a soft set
Santanu Acharjee and Sankar K. Pal
Soft set theory is an important and emerging area within soft computing, owing to its attribute-oriented mathematical framework and its wide applicability in diverse domains, including science and social sciences. The theoretical constraints associated with the selection of subsets of the sets of attributes in soft set theory have further motivated the development of hybrid and extended theoretical models. In this paper, we introduce two distinct roughness measures and six
entropy measures for soft sets and systematically investigate their properties using both theoretical analysis and computational techniques. The proposed roughness measures are defined within two distinct conceptual frameworks. Throughout the development of these measures and the corresponding results, the foundational principles of soft set theory, as established by Molodtsov, are strictly preserved. Furthermore, the proposed framework is shown to be novel with respect to roughness characterization, and a comparative analysis with classical rough set theory is presented to highlight the theoretical distinctions and contributions of this work.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.AI
PyCSP3-Scheduling: A Scheduling Extension for PyCSP3
Sohaib Afifi
PyCSP$^3$ provides a productive way to build constraint models for solving combinatorial constrained problems and export them to XCSP$^3$, preserving a complete separation between modeling and solving. However, it lacks native support for scheduling abstractions such as interval variables, sequence variables, and resource functions. As a result, scheduling models must be encoded with low-level integer variables and manual channeling constraints, even though PyCSP$^3$ already provides global constraints like NoOverlap and Cumulative on integer arrays. We present PyCSP$^3$ Scheduling, a library that adds scheduling abstractions to PyCSP$^3$ through 53 dedicated constraints and 27 expressions, and compiles them down to standard PyCSP$^3$/XCSP$^3$ constraints, maintaining the modeling/solving separation that underpins the PyCSP$^3$ ecosystem. On 261 paired instances across 17 model families (5 runs each), both formulations produce identical objectives on all 72 doubly-proved optimal pairs and nearly half of the families (8/17) remain structurally unchanged after compilation; however, runtime performance diverges across families, with clear gains on some (up to 5.8x) and regressions on others due to the overhead of compilation decompositions. Code and
benchmarks are available at: https://github.com/sohaibafifi/pycsp3-scheduling
Read the full abstract ▾
Combinatorics
A non-hereditary Pollyanna class that is not strongly Pollyanna
Hongzhang Chen and Kaiyang Lan
Chudnovsky, Cook, Davies, and Oum introduced the notion of Pollyanna graph classes: a class $\mathcal{C}$ is Pollyanna if for every $\chi$-bounded class $\mathcal{F}$, the intersection $\mathcal{C} \cap \mathcal{F}$ is polynomially $\chi$-bounded. They further defined $\mathcal{C}$ to be strongly Pollyanna if it is $k$-strongly Pollyanna for some integer $k$, meaning that $\mathcal{C} \cap \mathcal{F}$ is polynomially $\chi$-bounded for every $k$-good class $\mathcal{F}$. They asked whether there are Pollyanna graph classes that are not strongly Pollyanna. In this note we answer this question affirmatively, under the literal interpretation that graph classes are not required to be hereditary. We construct a class $\mathcal{C}$ that is Pollyanna but, for every $k \ge 1$, is not $k$-strongly Pollyanna; in particular $\mathcal{C}$ is not strongly Pollyanna.
Read the full abstract ▾
Algebraic Topology
Non-vanishing of homotopy groups of Manin–Schechtman arrangements
Takuya Saito and So Yamagata
One of the central problems in the
topology of hyperplane arrangements is determining whether the complement is a $K(\pi,1)$-space. In this paper, we study Manin–Schechtman arrangements, introduced as higher-dimensional analogs of the braid arrangement, and prove that their complements have non-vanishing higher homotopy groups. Consequently, these arrangements fail to be $K(\pi,1)$ in a broad range of cases.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.GR
DiffPhD: A Unified Differentiable Solver for Projective Heterogeneous Materials in Elastodynamics with Contact-Rich GPU-Acceleration
Shih-Yu Lai, Sung-Han Tien, Jui-I Huang et al. (+9 more)
Differentiable simulation of soft bodies is a foundation for system identification, trajectory optimization, and Real2Sim transfer. Yet, existing methods such as the differentiable Projective Dynamics (DiffPD) struggle when faced with heterogeneous materials with extreme stiffness contrasts, hyperelasticity under large deformations, and contact-rich interactions, which are common scenarios in the real world. We present DiffPhD, a unified GPU-accelerated differentiable Projective Dynamics framework for heterogeneous materials that tackles these intertwined challenges simultaneously. Our key insight is a careful integration of: (i) stiffness-aware projective weights to embed heterogeneity into the global system; (ii) trust-region
eigenvalue filtering lifted to the backward pass for stable hyperelastic gradients and a type-II Anderson Acceleration scheme with dual-gate convergence to stabilize forward iteration under large stiffness contrasts; and (iii) a unified GPU pipeline that reuses a single sparse factor across forward, backward, and contact computations, with stiffness-amplified Rayleigh damping folded into the same factor for heterogeneity-aware dissipation at zero recurring cost. DiffPhD achieves strict gradient accuracy while delivering up to an order-of-magnitude speedup over prior differentiable solvers on heterogeneous, hyperelastic, contact-rich
benchmarks. Crucially, this speedup does not come at the cost of stability: DiffPhD remains convergent on stiffness contrasts up to 100x where prior PD solvers degrade. This unlocks end-to-end gradient-based optimization on regimes previously bottlenecked by either solver fragility or per-iteration cost – shell–joint composite creatures, soft characters wielding stiff weapons, and soft-gripper robotic manipulation – all handled within a single forward–backward pass.
Read the full abstract ▾
All authors Shih-Yu Lai, Sung-Han Tien, Jui-I Huang, Yen-Chen Tseng, Yi-Ting Chiu, Siyuan Luo, Ziqiu Zeng, Fan Shi, Peter Yichen Chen, Tiantian Liu, Yu-Lun Liu, Bing-Yu Chen
Analysis of PDEs
Runaway avalanches in plasmas with external electric fields: spatially inhomogeneous case in a perturbation framework
Ling-Bing He, Richard M. Höfer, Jie Ji et al. (+1 more)
We consider the Landau-Coulomb equation for a (hydrogen)
plasma heated by an external electric field. In this setting, theoretical and experimental results in
plasma physics show the emergence of so-called runaway electrons which are linearly accelerating but only lead to a minimal increase of the
plasma temperature. Runaway electrons are a major obstacle in
nuclear fusion since they can overcome the confinement and damage the structure of the reactor. We rigorously prove the well-posedness of the underlying nonlinear open Landau-Coulomb system in a perturbative setting and the conjectured growth bounds for the mean velocity and
plasma temperature. We show that the mean velocity is linearly increasing in time, and capture the sharp logarithmic growth of the temperature. Furthermore, we prove that the electron distribution can be asymptotically described by a scattering-type Maxwellian. Due to the different nature of the electron-electron and electron-ion interactions, we recast the equation as a novel coupled system that allows us to isolate the dissipation structures of the two operators. For the coupled system, we perform a micro-macro decomposition to show convergence to the scattering-type Maxwellian.
Read the full abstract ▾
All authors Ling-Bing He, Richard M. Höfer, Jie Ji, Raphael Winter
Optimization and Control
On the optimal portfolio problem with partial information and related mean field games with relative performance criteria
Panagiotis Souganidis and Thaleia Zariphopoulou
We study optimal portfolio choice models in
markets with partial information about the stock's drift. We solve the single
agent problem for general utilities using a new approach that yields regularity of the value function and closed form expressions for the optimal processes. We consider a N player game in which players interact through the law of peer's wealth and study its mean field limit. This leads to a a game with field
equilibrium. We analyze the cases of separable couplings and general utilities, and represent the value of the game as a compilation of the single player problem and a function solving a non local quasilinear pde in the space of measures. We interpret the findings using elements from indifference valuation and arbitrage free pricing, Finally, when the couplings depend only on the average of peer's wealth, we derive explicit solutions and various regularity results for representative cases.
Read the full abstract ▾
Probability
Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors
Christopher D. Long
We study three nonmonotone coupon-collector models through a stationary-entry viewpoint. In such models the all-present state is not absorbing, so completion is governed not by the disappearance of a monotone terminal cloud but by rare new entries into a target state, except in the reset-button model, where exact regeneration gives a separate reduction. We prove a finite stationary-entry
theorem: a mixing estimate, a one-block clump-control estimate, and the stationary entry flux imply an exponential hitting law. For the reset-button collector, regeneration gives an exact probability-generating function in terms of the ordinary coupon-collector transform and recovers the known beta-function expectation, while also yielding rare-success exponential limits and negligible-reset Gumbel limits. For the clumsy collector with fixed loss probability $p$ and $q=1-p$, the stationary-entry flux is $p q^n$, and $p q^n T_n$ converges to $\operatorname{Exp}(1)$. Thus the fixed-loss standardized limit is exponential rather than Gumbel. For the post-loss careless collector, we compute the sharp stationary-entry flux $$ \mu_n\sim (q;q)_\infty^{-1}\frac{n!}{n^n}q^{n(n+1)/2} $$ and prove $\mu_nT_n\Rightarrow\operatorname{Exp}(1)$, with matching moment asymptotics. This shows that the careless scale is governed by a stationary high tail, or ordered lucky climb, rather than by the independent one-point marginal heuristic. We also analyze a combined clumsy-careless model, confirming stability of the high-tail entry mechanism.
Read the full abstract ▾
Combinatorics
On the Eccentricity Laplacian and Eccentricity Signless Laplacian Matrices of a Graph
Keshav Saini, Anubha Jindal and K. Palpandi
In this paper, we introduce the
Laplacian and the signless
Laplacian for the eccentricity
matrix of a connected graph, referred to as the eccentricity
Laplacian and the eccentricity signless
Laplacian, respectively. We establish the equivalence among the eccentricity
Laplacian, eccentricity signless
Laplacian, and eccentricity spectrum for different classes of graphs. We provide spectral characterization of $\mathcal{E}$-bipartite graphs by the
symmetry of $\mathcal{E}$-spectrum and the similarity of these
Laplacian matrices.
Read the full abstract ▾
Analysis of PDEs
Some lifting and approximation properties for maps in $W^{1,2}(\mathbb{B}^3;\mathbb{S}^2)$
André Guerra, Xavier Lamy and Konstantinos Zemas
Smooth maps $u\colon\mathbb B^3\to\mathbb S^2$ can be lifted to $\hat u\colon\mathbb B^3\to\mathbb S^3$ using the
Hopf fibration $h\colon \mathbb S^3\to\mathbb S^2$ via the factorization $u=h\circ\hat u$. In this note we characterize the $W^{1,2}$-maps which have this lifting property in terms of exactness of the pullback form $u^*\omega_{\mathbb S^2}$, and deduce a smooth approximation property preserving the constraint $u^*\omega_{\mathbb S^2}=d\eta$.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Adaptive Long-Run Variance Thresholding for Sparse Covariance Estimation in High-Dimensional Time Series
Wenhao Zhang and Zhaoxing Gao
Estimating a sparse covariance
matrix is a fundamental problem in high-dimensional statistics. However, thresholding methods developed for independent data are generally not directly applicable to high-dimensional time series, where temporal dependence alters the
stochastic behavior of sample covariance
estimators. This paper studies sparse covariance
matrix estimation for high-dimensional time series under weak dependence. We propose a thresholding procedure that incorporates long-run variance into the construction of entry-specific thresholds, thereby adapting to temporal dependence. Under suitable regularity conditions, we show that the proposed
estimator is consistent under the spectral norm and attains the optimal convergence rate over a class of sparse covariance
matrices. We further establish support recovery consistency for identifying the nonzero entries of the covariance
matrix. In addition, we show that universal and adaptive thresholding methods developed for independent data may fail to recover the support consistently in the presence of autocorrelation. Simulation studies demonstrate that the proposed method compares favorably with existing thresholding
estimators in terms of both estimation accuracy and support recovery. Applications to gene expression data and stock return data further illustrate its practical usefulness.
Read the full abstract ▾
Mathematical Physics
Geometric construction of superintegrable Poisson projection chains via Poisson centralizers
Kai Jiang, Guorui Ma, Ian Marquette et al. (+2 more)
We introduce a
geometric framework for constructing superintegrable systems from Poisson centralizers (commutants) in the Lie-Poisson
algebra $S(\mathfrak{g})$ of a complex semisimple Lie
algebra. Starting from a chain of reductive subgroups, we study the corresponding invariant Poisson subalgebras and their Poisson centers, and formulate superintegrability in terms of a Poisson projection chain of affine Poisson varieties. For a maximal
torus $T\subset G$, we prove that the inclusions $S(\mathfrak{g})^G\subset S(\mathfrak{g})^T\subset S(\mathfrak{g})$ determine a superintegrable chain and identify the associated quotient maps $\mathfrak{g}\xrightarrow{\chi_T}\mathfrak{g}//T\xrightarrow{\rho}\mathfrak{g}//G$. The rank (transcendence degree) computations yield the expected dimension split between commuting
Hamiltonians and first integrals, and we describe the corresponding
symplectic leaves in the intermediate space. Several examples illustrate how the centralizer generators organize into explicit superintegrable Poisson chains.
Read the full abstract ▾
All authors Kai Jiang, Guorui Ma, Ian Marquette, Junze Zhang, Yao-Zhong Zhang
Algebraic Geometry
The Localization Theorem for the Motivic Homotopy Theory of Complex Analytic Stacks and other Geometric Settings
Roy Magen
We prove the analog of the Morel-Voevodsky localization
theorem over complex analytic stacks, which is used in arXiv:2511.09371 to establish a 6-functor formalism of complex analytic motivic homotopy theory and produce an analytification map that is compatible with the six operations. Along the way, we establish general techniques for proving this
theorem over other
geometric settings, which also apply, for example, to the settings of algebraic stacks and differentiable stacks.
Read the full abstract ▾
Geometric Topology
Geodesic currents of coarse negative curvature
Meenakshy Jyothis and Dídac Martínez-Granado
Strong hyperbolicity is a coarse notion of negative
curvature, stronger than Gromov hyperbolicity, that includes all CAT(-k) metrics for k positive and allows the use of dynamical techniques available in negative
curvature, such as thermodynamical formalism. We prove that the subset of geodesic currents whose dual pseudometric is strongly
hyperbolic is dense in the space of geodesic currents. The proof combines an elementary finite-cover argument with a characterization of strong hyperbolicity in terms of boundary data for pseudometrics dual to geodesic currents. In contrast, we show that currents arising from non-positively curved metrics on the surface are not dense. As a consequence, we construct infinitely many pairwise non-roughly-isometric invariant strongly
hyperbolic geodesic metrics on the universal cover of the surface which are not CAT(0). Finally, we establish correlation counting results for the associated length spectra.
Read the full abstract ▾
Numerical Analysis
Neural Networks for Singular Perturbations – Finite Regularity
F. Rohner, Ch. Schwab and C. Xenophontos
We study finite-element and deep feedforward neural network (DNN for short) expressivity rate bounds for solution sets of a model linear, second order singularly perturbed,
elliptic two-point boundary value problem, in Sobolev norms on a bounded interval $(-1,1)$, with explicit dependence on the singular perturbation parameter $\e\in (0,1]$. Emphasis is on low Sobolev regularity of the data, i.e., source term $f$ and reaction coefficient $b$. A proof of $\e$-explicit solution regularity based on exponentially weighted energy-norm bounds is developed, and \emph{$\e$-robust, algebraic expression rate bounds} in Sobolev norms for $\mathbb{P}_1$ Finite-Elements on exponential and Shishkin type meshes is proved. Expression rates for shallow (fixed depth) $\ReLU$-NNs are shown which are robust w.r. to $\e$ and explicit in terms of the NN size. Robust NN expression rate bounds are further studied for deep feedforward DNNs with ReLU and tanh-activations. As in \cite{OSX24_1085}, tanh- and sigmoid-activated sub-NNs allow to include exponential boundary layer functions exactly into the NN feature space, leading to reduced NN sizes. Recent bitstring encoding techniques for deep NNs with ReLU activations afford, still under low data regularity $f,b \in H^1(I)$ \emph{twice the (robust) convergence rate of $\mathbb{P}_1$ Finite-Elements} achievable with “eXp” or Shishkin meshes.
Read the full abstract ▾
Functional Analysis
The dual of the Hardy space associated to the Dunkl-Schrödinger operator with reverse Hölder class potential
P. Athulya and S.K. Verma
Let $\mathcal{L}_k = -\Delta_k + V$ be a Schrödinger operator associated with the Dunkl
Laplacian $\Delta_k$, where $V$ is the non-negative potential function belonging to the reverse Hölder class $RH_k^q(\mathbb{R}^n)$ with $q> \max\{1, \frac{n+2\gamma}{2}\}$. Here, $2\gamma$ denotes the degree of homogeneity of the weight function $w_k$, which is determined by the normalized root system and the non-negative multiplicity function $k$. In this paper, we investigate the dual space of the Hardy space $H_{\Tilde{\mathcal{L}}_k}^1$ associated with the Dunkl-Schrödinger operator. The dual space $BMO(\mathcal{L}_k)$ is a subspace of the $BMO_k$ space, which is the Dunkl analogue of the classical $BMO(\mathcal{L})$ space. We provide a characterization for the $BMO(\mathcal{L}_k)$ space. The duality result is obtained via the atomic decomposition of $H_{\Tilde{\mathcal{L}}_k}^1$, where the cancellation condition of atoms depends on the critical radius function associated with the potential $V$. Finally, we establish the boundedness of the uncentered maximal function on the space $BMO(\mathcal{L}_k)$.
Read the full abstract ▾
Analysis of PDEs
Local and global solutions to continuous fragmentation-coagulation equations with vanishing diffusion and unbounded fragmentation and coagulation rates
Sergey Shindin
In the paper, we study spatially distributed particle systems whose time
evolution is governed by vanishing
diffusion in space $\mathbb{R}^d$, $d\ge 1$, and by size-continuous fragmentation and coagulation processes with unbounded rates. We show that for a large class of coefficients, such systems are classically locally well-posed, provided the
diffusion and the coagulation processes are suitably dominated by the fragmentation. In the special case of power rates, we demonstrate existence of global in time classical solutions in all spatial dimensions $d\ge 1$ and without any restrictions on the size of input data.
Read the full abstract ▾
Information Theory
CP-OFDM Achieves Lower Ranging CRB Than Frequency-Spread Waveforms in the Large-Sample Regime
Fan Liu, Yifeng Xiong, Ya-Feng Liu et al. (+3 more)
The inherent randomness of communication symbols creates a fundamental tension in Integrated Sensing and Communications (
ISAC). On the one hand, they enable data transmission while allowing sensing to fully reuse communication resources. On the other hand, their randomness induces waveform-dependent fluctuations that directly affect sensing accuracy. This paper investigates a foundational question arising from this tradeoff: How does the modulation waveform affect the ranging Cramér–Rao Bound (CRB) when sensing reuses random data symbols? We address this question by revealing a structural factorization of the Fisher information
matrix (FIM) for joint delay-amplitude estimation, which separates the deterministic Jacobian of the target geometry from the random frequency-domain signal power induced by the data symbols. This structure yields a Jensen-type universal lower bound on the CRB, which is exactly attained by CP-OFDM under PSK constellations. For QAM and broader sub-Gaussian constellations, we develop an asymptotic perturbation analysis of the inverse FIM and prove that, when the number of transmitted symbols $N$ grows large, CP-OFDM achieves a lower ranging CRB than any frequency-spread orthogonal waveform over the almost-sure event where the random FIM is invertible. This superiority is further extended to amplitude estimation and full joint delay-amplitude estimation. We also characterize the local geometry of the
stochastic CRB minimization problem over the
unitary group. The analysis reveals that CP-OFDM is a stationary point for finite $N$, and its Riemannian Hessian is positive semidefinite for sufficiently large $N$, establishing its asymptotic local optimality. Numerical results confirm that OFDM outperforms representative waveforms including SC, OTFS, and AFDM.
Read the full abstract ▾
All authors Fan Liu, Yifeng Xiong, Ya-Feng Liu, Jie Yang, Christos Masouros, Shi Jin
Combinatorics
Integer points in a simplex and related Diophantine problems: Hardy–Littlewood asymptotics in higher dimensions
M.M.Skriganov
In the early 1920s, Hardy and Littlewood considered the number of integer points in the right-angled triangles with irrational inclines of the diagonal. We extend their results to higher dimensions.
Statistics Theory · Cross-listed from quant-ph
Singular Asymptotics of SPADE in Quantum Source Discrimination
Natsuki Kariya
We study far-field discrimination between one and two incoherent point sources in the singular regime of weak and closely spaced emitters. Under ideal
alignment, spatial-mode demultiplexing (SPADE) attains the
quantum-optimal large-sample Stein exponent, but the finite-
photon behavior near the one-source boundary and the effect of realistic imperfections remain less understood. Using singular learning theory, we analyze both the aligned and misaligned problems. In the aligned Gaussian case, for prior densities that are smooth and strictly positive in the physical $(\epsilon,s)$ coordinates near the singularity of the aligned model, direct imaging and SPADE share the same real log canonical threshold $\lambda=1/2$ but have different multiplicities, yielding distinct Bayes free-energy asymptotics. A fixed nonzero misalignment removes the exact support mismatch of ideal SPADE: locally, the fixed-offset binary-SPADE Kullback–Leibler function has the normal-crossing form $K\asymp\epsilon^2s^2$, giving $(\lambda,m)=(1/2,2)$ under the same prior class, as for direct imaging. The local separation scale nevertheless depends on the source-position convention. Moreover, full Hermite–Gaussian mode counting about an offset sorter axis has a reflection-induced KL-zero branch at $s^\ast=2\theta$, where the two-source alternative becomes indistinguishable from the null. Pointwise finite-$n$ binary-SPADE calculations exhibit the corresponding power collapse. These results identify measurement support, nuisance geometry, prior weighting, and identifiability as structural ingredients that must be tracked in finite-
photon quantum discrimination.
Read the full abstract ▾
Optimization and Control
OPTIMUS: Optimization Productivity Tool for Intelligent Management of Utilizable Space
Souvik Bhattacharyya, Nisha Singh, Salman Haider et al. (+4 more)
We study department-level retail space optimization, where limited bay capacity must be allocated among planograms (POGs) under business and operational constraints. The problem is formulated as a linear binary knapsack model, with potential SKUs treated as items characterized by space requirements and weighted value contributions from sales, margin, units, and assortment similarity. Dynamic Programming (DP) is employed to obtain exact and reproducible assortment decisions in O(nc) time, avoiding the variance inherent in heuristic approaches. These decisions are integrated with a second-stage bay optimization model formulated as a mixed-integer program. Evaluated end-to-end across ten optimization runs spanning multiple departments and store clusters, the OPTIMUS framework achieves an average sales lift of 11.8% and an average margin lift of 9.5%. Overall, OPTIMUS provides a scalable, interpretable, and profit-driven solution for enterprise-scale retail space management.
Read the full abstract ▾
All authors Souvik Bhattacharyya, Nisha Singh, Salman Haider, Balaji Nagarajan, Ved Prakash Dwivedi, Nithin Surendran, Karthik Nair
Complex Variables
On some properties of bi-univalent functions in the unit disc
Milutin Obradović, Nikola Tuneski and Paweł Zaprawa
In this paper we use a method based on the Grunsky coefficients to find upper bounds of the modulus of the initial coefficients, difference of the
moduli of two consecutive initial coefficients, of the modulus of the initial logarithmic coefficient, and of the second Hankel determinant for the class of normalized bi-univalent functions.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.DS
Branch-width of represented matroids in matrix multiplication time
Mujin Choi, Tuukka Korhonen and Sang-il Oum
For an $n$-element matroid $M$ given by an $n \times n$
matrix representation over a finite field $\mathbb F$ and an integer $k$, we present an
algorithm with running time $O_{k,\mathbb F}(n^2)+O(n^\omega)$ that either finds a branch-decomposition of $M$ of width at most $k$, or confirms that the branch-width of $M$ is more than $k$, where $\omega < 2.3714$ is the
matrix multiplication exponent, and the $O_{k,\mathbb F}(\cdot)$-notation hides factors that depend on $k$ and $\mathbb F$ in a computable manner. All previous
algorithms, including Hliněný and Oum [SIAM J. Comput. (2008)] and Jeong, Kim, and Oum [SIAM J. Discrete Math. (2021)], have cubic-time bottlenecks. Moreover, if the input
matrix representation is given in standard form, our
algorithm runs in $O_{k,\mathbb F}(n^2)$ time, since $O(n^\omega)$ time is only needed for finding a standard form of the input
matrix. When $M$ is given by an $m \times n$
matrix, the overhead for finding a standard form is $O(mn \min(m,n)^{\omega-2})$. As corollaries, we obtain faster
algorithms for rank-width of directed graphs and path-width of matroids represented over a fixed finite field. Furthermore, we also present an approximation
algorithm for finding branch-width that works on infinite fields provided that the input
matrix is in standard form and contains a bounded number of distinct values of entries. To suggest that our
algorithm is optimal, we observe that for every field $\mathbb F$, deciding whether the branch-width of a matroid represented over $\mathbb F$ is $0$ is as hard as deciding whether a square
matrix over $\mathbb F$ is singular. Under the assumption that singularity testing requires $\Omega(n^\omega)$-time, this implies that the overhead of $O(n^{\omega})$ is unavoidable. We also show strengthenings of this observation to rule out some approximations under this assumption.
Read the full abstract ▾
Complex Variables
On some properties of logarithmic coefficients of inverse of univalent functions
Milutin Obradović, Nikola Tuneski and Paweł Zaprawa
In this paper we consider some properties of the initial logarithmic coefficients for inverse functions of functions univalent in the unit disc. The case of convex functions is treated separately. We give estimate, in some cases sharp, of the modulus of the initial coefficients, as well as the difference of the modulus of two consecutive coefficients.
Read the full abstract ▾
Optimization and Control
On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
Xiaotian Jiang, Chang He, Mingyi Hong et al. (+1 more)
In this paper, we study the regularity assumptions commonly adopted in bilevel optimization with constrained lower-level problems, including the linear independence constraint qualification, the strict complementary slackness condition, and the second-order sufficient condition. These conditions are typically required to hold for the lower-level problem at every upper-level variable $x$. We first show that the requirement that these conditions hold at every upper-level variable $x$ is strong, in the sense that it is non-prevalent: there exist problems for which no sufficiently small perturbation of the lower-level objective and constraints can make the conditions hold at every $x$. To establish the result, we prove
rigidity theorems showing that certain structural quantities of the lower-level problem must remain invariant across all $x$ whenever these conditions hold everywhere. We then construct explicit counterexamples in which these invariants differ between two values of $x$. In contrast, we show that the weaker requirement, that these conditions hold at almost every $x$, is a weak assumption, in the sense that it is prevalent: with probability one over a random perturbation of the lower-level objective and constraints, each condition holds at almost every $x$. We further analyze the gap between the two requirements. Although the “every $x$” and “almost every $x$” versions differ only on a measure-zero set, we show that this difference introduces fundamental difficulties in both theory and computation for bilevel optimization.
Read the full abstract ▾
All authors Xiaotian Jiang, Chang He, Mingyi Hong, Shuzhong Zhang
Dynamical Systems · Cross-listed from cs.LG
Watch your neighbors: Training statistically accurate chaotic systems with local phase space information
Joon-Hyuk Ko, Andrus Giraldo and Deok-Sun Lee
Chaotic systems pose fundamental challenges for data-driven dynamics discovery, as small modeling errors lead to exponentially growing trajectory discrepancies. Since exact long-term prediction is unattainable, it is natural to ask what a good surrogate model for chaotic dynamics is. Prior work has largely focused either on reproducing the Jacobian of the underlying dynamics, which governs local expansion and contraction rates, or on training surrogate models that reproduce the ground-truth dynamics' long-term statistical behavior. In this work, we propose a new framework that aims to bridge these two paradigms by training surrogate dynamics models with accurate Jacobians and long-term statistical properties. Our method constructs a local covering of a chaotic attractor in phase space and analyzes the expansion and contraction of these coverings under the dynamics. The surrogate model is trained by minimizing the maximum mean discrepancy between the pushforward distributions of the coverings under the surrogate and ground-truth dynamics. Experiments show that our method significantly improves Jacobian accuracy while remaining competitive with state-of-the-art statistically accurate dynamics learning methods. Our code is fully available at https://anonymous.4open.science/r/neighborwatch.
Read the full abstract ▾