Peer Revenue Past citations are no guarantee of future returns

Papers

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

All of arXiv

Sunday 13 September

Optics

Hybrid Nanocone-Nanohole Light Trapping for High-Efficiency Thin-Film Silicon Solar Cells

Thin-film silicon solar cells exhibit weak absorption at longer wavelengths of visible light due to their limited optical thickness. To overcome this inherent limitation, a hybrid nanocone-nanohole light-management architecture is proposed by integrating front-surface silicon nanocones with embedded air-filled nanoholes in the absorber layer. The nanocones provide a gradual refractive-index transition that suppresses front-surface reflection, while the nanoholes enhance optical confinement through multiple scattering and internal reflection. The structural parameters are systematically optimized using finite-difference time-domain (FDTD) simulations coupled with electrical device modeling. Under optimized doping conditions and isothermal steady-state operation, the optimized design yields a short-circuit current density of 34.64 mA cm-2, an open-circuit voltage of 0.82 V, a fill factor of 86.27%, and a power conversion efficiency of 24.42%, representing a 17.74% improvement over a comparable nanohole-based design. Furthermore, coupled opto-electro-thermal simulations show that the proposed hybrid nanocone-nanohole structure retains 95.21% of its efficiency under non-isothermal operation up to45 degree celsius, demonstrating excellent thermal stability. These results highlight the potential of the proposed hybrid nanocone-nanohole design as an effective light-management strategy for high-efficiency and thermally robust thin-film silicon solar cells.
Read the full abstract

Statistics Theory

Hermite Spectra and Kernel Factorization for Gaussian-Weighted Tests of Normality

We study the asymptotic null spectrum of Gaussian-weighted tests of univariate normality with estimated location and scale. Closed Hermite coefficients give equations both away from and at the unperturbed poles. Every positive eigenvalue of the fully standardized covariance is simple, and the odd and even eigenvalues alternate strictly. For each unperturbed even pole except the largest, there is exactly one weight parameter at which it belongs to the perturbed even spectrum. These parameters are strictly ordered and converge to the boundary of the parameter interval. A signed total-positivity argument proves simplicity more generally for consecutive Gaussian covariance corrections and positive even integrable weights. We also derive the limiting quadratic forms directly from degenerate kernels at standardized observations. A derivative summability condition controls the complete spectral tail, including signed kernels, and is verified for characteristic-function kernels with a finite fourth weight moment. A real Hilbert-space factorization identifies the observation and Fourier spectra. Numerical calculations assess asymptotic calibration.
Read the full abstract

Data Structures and Algorithms

Private Graph Property Testing

Graph property testing asks whether a massive graph satisfies a given property, or is far from doing so, using only a sublinear number of queries to the graph. Since property testers typically inspect only a small, randomly sampled portion of the input, they appear naturally compatible with differential privacy and privacy amplification by subsampling. Despite this, few results link these two fields. We initiate a systematic study of differentially private graph property testing with the goal of designing efficient testers with formal privacy guarantees in the dense and bounded-degree graph models. We develop new privacy amplification theorems for several widely used graph-sampling procedures such as induced subgraph sampling, random walks and k-disc sampling. We then leverage these privacy amplification techniques to design a private canonical tester in the dense graph model, as well as private bipartiteness testers and subgraph freeness testers in the dense and bounded-degree graph models. Finally, using the new privacy amplification theorem for k-disc sampling, we prove that every property of hyperfinite graphs is privately testable. The resulting query complexities of our private testers are comparable to those of their non-private counterparts.
Read the full abstract

All authors Hendrik Fichtenberger, Abigail Gentle, Tamalika Mukherjee, Sayantan Sen

Computational Complexity

New lower bounds on tensor rank of $(n,2,m)$ matrix multiplication with GPT-6

The tensor rank of $n\times 2$-with-$2\times m$ matrix multiplication is at least $\left\lceil \frac{24m+2}{5} \right\rceil$ if $m\ge n=3$ and at least $(n+2)m+n-3$ if $m\ge n\ge 4$, over arbitrary fields. This result matches the Hopcroft-Kerr upper bound for $n=3$ and $m\le 6$.

Differential Geometry

Hermitian manifolds with constant holomorphic sectional curvature or real bisectional curvature

An old conjecture in Hermitian geometry states that a compact Hermitian manifold with constant holomorphic sectional curvature is Kähler when the constant is nonzero and Chern flat when the constant is zero. Yang–Zheng introduced the real bisectional curvature as a generalization of the holomorphic sectional curvature and conjectured that, a compact Hermitian manifold with constant real bisectional curvature has zero constant and is Chern flat. They proved that the constant cannot be positive. In this paper, we first prove their conjecture. For a negative constant, we show that the metric is pluriclosed and use comparison with a negative Kähler–Einstein metric to obtain a contradiction. For the zero constant, we combine a torsion identity of Lin–Ren with the Bochner formula of Zhou–Zheng to prove Chern flatness. We also prove that a pluriclosed metric with constant negative holomorphic sectional curvature on a compact Kähler manifold is Kähler.
Read the full abstract

Computer Vision

Newton Deep Unfolding for Compressed Sensing

Compressed sensing (CS) reconstructs images from highly limited measurements, but existing deep unfolding methods are typically driven by first-order optimization and weakly exploit the optimization states generated during reconstruction. To address these limitations, we propose a Newton deep unfolding network (NDU-Net), which, to the best of our knowledge, is the first deep unfolding framework that leverages second-order optimization for CS reconstruction. Specifically, NDU-Net introduces a Newton update (NU) module to estimate Newton-type update directions and generate optimization states that characterize the current reconstruction process. Furthermore, a Newton-guided multi-scale prior (MP) module is designed to incorporate these optimization states into multi-scale feature restoration, thereby enabling the learned prior to adapt to the current reconstruction stage. Experimental results under different CS ratios confirm that our proposed NDU-Net achieves promising reconstruction performance and exhibits enhanced robustness. Our code is available at https://github.com/xianchaoxiu/DNU-Net.
Read the full abstract

Strongly Correlated Electrons

Reservoir-conditioned virtual returns generate random Liouvillian skin localization in a reciprocal Mott insulator

Directional dissipation can concentrate relaxation modes in space, but connecting this accumulation to controlled microscopic processes in correlated matter requires separating virtual charge motion from spin coherence. We study this connection in a half-filled Hubbard chain with reciprocal hopping and number-conserving, direction-selective returns of virtual doublon–hole defects. Eliminating charge defects and then Mott coherences yields asymmetric spin-exchange rates under an explicit separation of timescales, with full short-chain dynamics supporting the reduction on finite exchange times. Balanced random returns concentrate the stationary population and several low-lying right modes at sample-selected positions rather than a predetermined edge, producing random Liouvillian skin localization despite zero end-to-end logarithmic rate bias. The accumulated rate imbalance determines an exact finite-density hard-core stationary state and a one-particle activated relaxation scale governed by random barriers. This connection between locally calibrated return rates, many-body stationary weights and slow relaxation offers a means of controlling transport in constrained open quantum matter without changing the reciprocal Hamiltonian.
Read the full abstract

Dynamical Systems

Phase Transitions and Modulation in Dense Oscillatory Associative Memories

We introduce high-order Winfree models for oscillatory associative memory. We characterize memory performance through the local-stability dichotomy between stored and unstored patterns. Using this criterion, we show that crosstalk noise drives a cascade of ferromagnetic, mixed, and spin-glass transitions as the memory load increases. For both polynomial and exponential Winfree models, we derive the phase boundaries and develop auxiliary-field modulation schemes adapted to the different phases. We further present corresponding circuit designs and numerical simulations that support our theoretical predictions.
Read the full abstract

Representation Theory

Acyclic quantum cluster algebras via Hall algebras associated to cluster categories

Let $Q$ be a finite acyclic valued quiver. We establish an alternative cluster multiplication formula in the quantum cluster algebra associated with $Q$, which exhibits certain symmetries similar to 2-Calabi–Yau properties of cluster categories. Motivated by this formula, we introduce a Hall algebra $\mathcal {D}\mathcal {H}_\Lambda^{{cl}}(\widetilde{\mathcal{A}})$ via a certain quotient of a derived Hall subalgebra associated with $Q$, serving as an algebra counterpart to cluster categories of hereditary algebras. As our main result, we prove that the quantum cluster algebra associated with $Q$ is isomorphic to the exceptional subalgebra of $\mathcal{D}\mathcal{H}_\Lambda^{cl}(\widetilde{\mathcal{A}})$, namely, the subalgebra generated by exceptional objects. Furthermore, when $Q$ is of Dynkin type, the quantum cluster algebra is naturally isomorphic to $\mathcal{D}\mathcal{H}_\Lambda^{{cl}}(\widetilde{\mathcal{A}})$ itself. This establishes a Hall algebra realization for all acyclic quantum cluster algebras. As an application, we introduce the Hall subalgebra of $\mathcal{D}\mathcal{H}_\Lambda^{cl}(\widetilde{\mathcal{A}})$ generated by projectives, yielding a Hall algebra analogue of the lower bound quantum cluster algebras. Then we show that the standard monomials of quantum projective cluster variables form a basis of the quantum cluster algebras via Hall algebra approach. Moreover, we show that the Auslander–Reiten translation of cluster categories induces an algebra automorphism of $\mathcal {D}\mathcal {H}_\Lambda^{{cl}}(\widetilde{\mathcal{A}})$. Finally, we apply the BGP-reflections to $\mathcal {D}\mathcal {H}_\Lambda^{{cl}}(\widetilde{\mathcal{A}})$, and prove that the Hall algebra $\mathcal {D}\mathcal {H}_\Lambda^{{cl}}(\widetilde{\mathcal{A}})$ is invariant up to isomorphism under the mutations at sink vertices of $Q$.
Read the full abstract

Analysis of PDEs

(In)stability results for the Light Ray Transform

We prove quantitative instability results for the light ray transform in the Minkowski setting, and locally in the smooth and Gevrey categories. In the smooth Sobolev setting, we show that no modulus of continuity can be better than $t^\alpha$ for any $\alpha \in(0,1)$, while in the Gevrey setting we obtain an explicit logarithmic lower bound. On the other hand, using the relation between stationary geometries and magnetic(-potential) systems, we obtain a stability result for "time moments" of the light ray transform.
Read the full abstract

Combinatorics

The (p,q)-Analogues of Bi-Stirling Eulerian Polynomials via continued fractions

We establish Jacobi-type continued fraction expansions for (p,q)-analogues of the bi-Stirling Eulerian polynomials, which refine classical Eulerian statistics on permutations. These polynomials admit equivalent definitions in terms of descents or excedances. The parameters p and q encode refined permutation statistics, including (ldes,rasc) and (cros,nest). Our approach is based on weighted Motzkin path models arising from variants of the bijections of Françon–Viennot and Foata–Zeilberger. As applications, we obtain new results on total positivity and gamma-positivity for several families of enumerative polynomials. Our results unify and extend a number of recent works in the literature.
Read the full abstract

Combinatorics

Matrix-tree theorem for cohomological electrical networks

We introduce a new type of boundary condition for electrical networks by specifying a cohomology class on the underlying cell complex. As special and limiting cases, we recover the Dirichlet boundary condition, multiport condition, and prescribed voltage drops along nontrivial cycles on a surface. In this setting, we obtain a combinatorial formula for minors of the response matrix, generalizing the matrix-tree theorem, the Kenyon-Wilson formula, and a recently discovered formula for networks on surfaces due to Lam et al. To prove this formula, we develop a statistical-physics toolbox, including a new parafermionic observable for the uniform spanning tree model. This is the first parafermionic observable that is intrinsic, in the sense that it does not require an embedding of the graph in the plane or on a surface. Other ingredients are an intrinsic Temperley correspondence and source-synchronized networks, the latter providing a completely elementary reformulation of our results.
Read the full abstract

Computation and Language

Formal Properties of Language as Constraints on Neural Dynamics

What must a neural system be capable of to implement language? Current research annotates stimuli with linguistic variables and tests which electrodes, voxels, or language-model layers predict neural activity. Yet predictive success leaves mechanisms under-constrained. Here, we show that algebraic properties of language specify invariants that mechanisms must preserve: non-associative hierarchical grouping, commutativity, recursive closure, access to substructures, and structured workspace transitions. We term this the Neural Admissibility Program (NAP). Syntactic structure building is analyzed algebraically, with candidate mechanisms offered for each requirement: content-addressable workspace memory, graph-structured transient dynamics scheduling structure-building operations (e.g. stable heteroclinic channels), and a phase-coupled sealing operation recording grouping. Simulations show that a corrected Marcolli-Berwick entropy-optimized binding gate preserves grouping only within a narrow commitment band. As an alternative, we propose a novel neural binding operation we term 'Meld': two constituent populations converge through shared synapses, integrate sublinearly, and saturate. Meld is, to our knowledge, the closest neurally plausible composition law to syntactic Merge. It preserves every NAP invariant, uses known cortical operations, and recovers hierarchical structure at every tested depth and temperature. It predicts that effective population dimensionality separates alternative bracketings and that the composite depends on constituent disagreement. Importantly, the laws decoding bracketing most accurately are a priori inadmissible, showing that decoding accuracy alone cannot adjudicate between mechanisms. By specifying how neural dynamics can remain faithful to linguistic structure, the NAP changes the criterion by which neural implementations of cognition are evaluated.
Read the full abstract

Computer Vision

Contour-Guided Spectral Routing for Robust Real-Time Pedestrian Detection

Real-time pedestrian detection in driving scenes is constrained by three coupled failure modes: tiny targets lose discriminative evidence, occlusion weakens geometric support, and weather or illumination changes distort appearance statistics. We formulate the detector through a unified contour-guided spectral routing view rather than treating frequency processing, attention, and boundary reasoning as independent add-ons. The detector routes information in a prescribed order: spatial evidence is first augmented with global spectral context, deep representations then exchange spatial and spectral cues, and cross-scale fusion is finally conditioned on boundary–semantic disagreement. This ordering yields a compact representation pipeline in which low-frequency context stabilizes global structure while high-frequency evidence protects small-object contours. We further retain a wavelet-subband training transformation that perturbs low- and high-frequency coefficients independently, targeting appearance shifts caused by fog, rain, snow, and low illumination. The formulation exposes a single routing variable at each stage and distinguishes reusable signal transforms from the task-specific policy that decides where each signal is injected. On CityPersons, the proposed detector obtains 70.4 AP$_{50}$ and 44.2 AP$_{50:95}$, compared with 68.1 and 42.2 for RT-DETR, while the full wavelet-augmented configuration reaches 71.1 and 44.6.
Read the full abstract

Category Theory

A Counterexample to the Open Question on Object Ideals

We give a counterexample to completeness descent from ideal cotorsion pairs to their objects. A radical-square-zero algebra on the two-cycle gives a finite-dimensional example. The construction is intrinsically non-weakly-idempotent-complete.

Functional Analysis

$H$-Operator Approximation Spaces via Delayed Riesz Means and Quasi-Banach Moduli

We establish a constructive and quasi-Banach framework for approximation spaces $A_\mu^\rho$ of compact $H$-operators between Banach and quasi-Banach spaces. By leveraging delayed Riesz means $V_{2^{bn}}$ generated by self-adjoint differential operators $P(D)$, we replace abstract best approximants with explicit linear operator decompositions. Furthermore, we extend the theory of $H$-operator approximation spaces to quasi-Banach settings ($0 < p < 1$), bypassing the collapse of Peetre's $K$-functional by employing localized moduli of smoothness $\omega_\varphi^r(f,t)_p$. Integrating seminal spectral bounds due to Markus \cite{M1966} and factorization techniques for operator ideals, we prove that operators belonging to $A_\mu^\rho$ possess complete systems of root vectors whose expansions are Abel summable.
Read the full abstract

Statistical Methodology

Nonparametric Change-Point Detection and Inference for High-Dimensional Distributions

High-dimensional distributions can change without altering means or covariances, while the number of affected coordinates is often unknown. We propose nonparametric procedures that address both challenges through standardized rank comparisons of marginal distributions. Sum and maximum scans target dense and sparse changes, and a Cauchy combination adapts to unknown sparsity. The procedures require no marginal moment assumptions and extend to multiple-change detection through wild binary segmentation. Under a weakly dependent Gaussian copula model, we establish asymptotic null distributions, asymptotic independence, detection consistency, and localization guarantees. Simulations demonstrate competitive performance for changes in shape and tails, including alternatives that preserve the first two moments. Applications to gene expression and sensor data illustrate the practical benefits of combining dense and sparse evidence.
Read the full abstract

Cryptography and Security

Cryptanalytic Extraction of Neural Networks Without Known Architecture Assumption

Cryptanalytic model extraction aims to reconstruct a functionally equivalent model through black-box interactions with the victim model. Under the fundamental assumption that the network architecture is completely known, existing attacks achieve the goal by recovering the model parameters. In this paper, we explore whether this assumption can be removed practically. Focusing on ReLU fully connected networks, which are widely studied in this field, we propose a guess-and-determine framework that jointly recovers the network architecture (including network depth and hidden-layer dimensions) and the model parameters. This framework is based on a simple yet effective high-level idea: after designing a parameter recovery attack under the known-architecture assumption, we can analyze the architecture-sensitive traces observed during parameter recovery to recover the network architecture. We identify two such traces in differential extraction attacks: (i) a zero suffix in the merged weight vectors produced by signature recovery, whose length reveals the hidden layer dimension; and (ii) an equality pattern in the preimage-based sign recovery, which occurs only under the true hidden layer dimension. These two signals give rise to two routes for network architecture recovery. For the second-to-last layer, we further propose two methods, one for identifying it, and one for recovering its dimension. Practical end-to-end attacks are implemented on a wide range of ReLU neural networks, including both expansive and non-expansive networks. To the best of our knowledge, this is the first time the feasibility of achieving functionally equivalent extraction on deep neural networks, after removing the known-architecture assumption, has been demonstrated in practice.
Read the full abstract

All authors Yantian Shen, Yi Chen, Anyu Wang, Hongbo Yu, Xiaoyun Wang

Chemical Physics

From Transition-State Geometry to Gap Times: What Lagrangian Betweenness Measures in Chemical Reaction Dynamics

A chemical transition state is a phase-space bottleneck: trajectories approach along stable directions and leave along unstable directions. Lagrangian betweenness (LB), introduced in finite-time transport theory for fluid flows, combines backward and forward deformation in a way suggestive of this gather-and-disperse geometry. We ask what LB measures when the transition-state geometry is known. For a linear rank-one saddle, LB is spatially constant even though the stable and unstable manifolds are present. Relative nonlinear corrections remain small on shrinking initial neighborhoods, including observation times on the logarithmic local escape scale. At fixed spatial resolution, however, increasing observation time can concentrate the spatial variation of LB near a stable or unstable manifold. A separable quartic Hamiltonian makes these two limits explicit. A nonseparable Hamiltonian shows local flattening near a hyperbolic periodic orbit. We then use HCN/CNH isomerization, where dividing surfaces and gap times are established by phase-space transition-state theory. Before any exit, larger LB generally accompanies longer eventual gap times. The incoming reactive action provides a dynamical interpretation: initial conditions closer to the normally hyperbolic invariant manifold have longer local passages and greater accumulated stretching during passage. Among trajectories still inside at 0.5 ps that exit before 5 ps, early LB does not usefully rank exit times. LB therefore characterizes transition-state-organized transport in this example; a large value is neither an intrinsic manifold marker nor a general measure of molecular residence time.
Read the full abstract

Computer Vision

Rethinking Camouflage Image Generation towards a Training-Free Paradigm

Camouflage image generation (CIG) aims to synthesize realistic camouflaged images by blending foreground objects into concealment-compatible background contexts. Achieving this objective requires jointly satisfying three coupled requirements: foreground preservation to retain target integrity, semantic compatibility to select plausible concealment contexts, and appearance assimilation to reduce visual discrepancies. Recent approaches predominantly rely on task-specific training on camouflage datasets to address these requirements, incurring substantial computational cost and limiting generalization beyond the training domain. To address these limitations, we formulate training-free CIG as a concealment-oriented paradigm that preserves the target while reducing its perceptual separability from the synthesized surroundings, rather than maintaining its visual prominence, without parameter updates. We instantiate this paradigm with FreeCam based on a frozen inpainting diffusion framework to preserve the foreground. Within this framework, a Contextual Reasoning Module exploits frozen multimodal priors to infer an environment favorable to concealment, thereby promoting semantic compatibility, while an Intrinsic Appearance Module extracts low-level color and texture cues from the foreground to guide background synthesis toward appearance assimilation. Extensive experiments demonstrate that FreeCam achieves state-of-the-art generation quality and camouflage effectiveness without task-specific training, while its generated images provide synthetic supervision for camouflaged object detection and reduce target detectability under general object detectors.
Read the full abstract

Robotics

Orientation Control of Soft Robots via Adiabatic Spectral Submanifolds

Soft robots are commonly sought for safety-critical interactions in delicate environments, where accurate position and orientation control is imperative. Model predictive control (MPC) offers a solution, but it requires a model of the robot's infinite-dimensional nonlinear dynamics that is at once accurate and computationally cheap. Recent theory on adiabatic spectral submanifolds (aSSMs) and their applications to soft robots provide data-driven model-reduction methods to construct such models. Here, we extend these methods to identify aSSMs from enlarged observable datasets and upgrade the currently available aSSM-MPC schemes. Evaluated on a high-fidelity finite-element simulation of a pressure-actuated soft arm, our controller reduces position and orientation tracking error by more than 60% compared to existing data-driven baselines.
Read the full abstract

All authors Aron Karakai, Roshan S. Kaundinya, Mike Yan Michelis, Robert Katzschmann, George Haller

Quantum Physics

Quantum synchronization: A tutorial guide

Synchronization is a collective phenomenon in which interacting nonlinear oscillators develop a persistent relation between their phases and frequencies. In quantum systems, its description requires connecting the classical dynamics of limit-cycle oscillators with quantum fluctuations, dissipation, and the notion of phase. In this tutorial review, we offer a systematic framework for analyzing synchronization in classical and quantum dynamical systems. Starting from amplitude-phase dynamics, we introduce successively topics of relevance, such as phase locking, the Adler equation, Arnold tongues, and the Kuramoto model, and use these concepts to analyze coupled oscillators and their stability. We then formulate the corresponding description for quantum limit-cycle oscillators using Lindblad master equations and phase-space methods, with explicit examples of two and many coupled oscillators. We further discuss noise, synchronization measures, and the extreme quantum regime, including synchronization in spin systems. The emphasis throughout is on analytical derivations and a practical methodology for identifying synchronized states, determining their stability, and characterizing synchronization in quantum systems. The review is designed as a self-contained guide from which we hope that students can learn the essential concepts and techniques, while researchers can readily find the analytical tools and methodological insights needed to approach new synchronization problems.
Read the full abstract

Systems and Control

LLaTSA: Large Language Model-Aligned General-Purpose Transient Stability Analysis

Dynamic trajectory prediction has become an important paradigm for data-driven transient stability analysis (TSA), yet most existing predictors remain system-specific and require substantial retraining when network configurations, generation mixes, or state-variable sets change. Uni-TSA introduced a general-purpose TSA framework that combines channel-independent modeling with a pretrained large language model (LLM) predictor. Nevertheless, its application to heterogeneous systems is limited by ambiguity in short observations, a mismatch between numerical trajectories and LLM embeddings, neglected coupling among state variables, and the high inference cost of dense backbones. This paper proposes LLaTSA, an LLM-aligned framework for general-purpose trajectory-based TSA. LLaTSA first incorporates operating conditions, disturbance attributes, and state-variable identity through a structured textual prefix. It then aligns normalized temporal patches with a TSA-related vocabulary before processing them with a pretrained sparse decoder-only mixture-of-experts (MoE) backbone. A state-variable coupling module captures coordinated post-fault evolution, while teacher forcing and rollout-based training support iterative long-horizon prediction. Case studies on multiple test systems demonstrate accurate trajectory prediction, reliable stability discrimination, and effective adaptation across unseen scenarios.
Read the full abstract

All authors Chao Shen, Hongwei Zhen, Junyan Shao, Zhenghao Yang, Yifan Zhang, Mingyang Sun

Signal Processing

Low-Complexity Near-Field Channel Estimation and Subcarrier-Cooperative Hybrid Precoding for Wideband XL-MIMO OFDM Systems

This paper addresses both accurate near-field channel acquisition and scalable precoding for wideband extremely large aperture MIMO (XL-MIMO) OFDM systems, with particular focus on reducing complexity. In the considered system, each MIMO multipath component is characterized by five continuous angle-distance-delay parameters, making conventional sparse recovery methods computationally infeasible while suffering from grid mismatch. We propose a decoupled off-grid channel estimation algorithm based on sequential sparse Bayesian learning (SBL). By exploiting the separable structure of the OFDM near-field atom, the five-dimensional joint search is replaced by a sequence of low-dimensional operations and active-set inference, avoiding multiplicative scaling with the per-dimension grid sizes. A continuous-domain Newton refinement is incorporated based on the exact marginal likelihood to mitigate the grid mismatch. Based on the estimated multipath parameters, we then develop a subcarrier-cooperative hybrid precoding framework for multiuser wideband transmission. A large-scale-matrix-inversion-free alternating optimization algorithm is established to maximize the sum user rate, together with a non-iterative low-complexity design that exploits the parameterized channel structure and provides an effective initialization. Simulation results demonstrate the accuracy of the estimation methods compared to several benchmarks and the effectiveness of the precoding algorithm based on estimated channel parameters.
Read the full abstract

Exactly Solvable and Integrable Systems

A Classification of Hirota-Integrable Supersymmetric Bilinear KdV-Type Equations

We present a classification of supersymmetric bilinear KdV-type equations admitting unconstrained three-super-soliton solutions. Extending Hirota's classical three-soliton criterion to the supersymmetric setting, we derive the complete bosonic and fermionic compatibility conditions governing the existence of three-super-soliton solutions. We prove that every supersymmetric bilinear KdV-type equation possesses unconstrained one- and two-super-soliton solutions, whereas three-super-soliton solutions exist only when eight integrability conditions are satisfied. These conditions provide a supersymmetric analogue of Hirota's classical integrability criterion and naturally recover the fermionic relations previously introduced by Carstea, revealing their structural origin. As a consequence, we classify the supersymmetric extensions of Hirota bilinear KdV-type equations and show that only a subset of Hietarinta's classical classification remains valid in the unrestricted supersymmetric framework.
Read the full abstract

Chemical Physics

Accelerating ab initio spin-phonon relaxation simulation of single-ion magnets by quantum embedding and spatial truncation

Single-ion magnets (SIMs) show promise for high-density storage and quantum computing, but predicting spin-phonon coupling (SPC) and magnetic relaxation remains challenging due to the need for numerous non-equilibrium multiconfigurational calculations. Recent advances in quantum embedding methods offer a potential route to address this issue. In this work, density matrix embedding theory (DMET) combined with complete active space self-consistent field (CASSCF) is benchmarked for the static magnetic properties and spin-phonon coupling (SPC) parameters of Dy$^{3+}$-based SIMs. The method is further combined with spatial truncation to calculate SPC parameters for these SIMs. It is found that truncating the space near the first coordination sphere reduces the computational cost dramatically while keeping the errors in the effective energy barrier and relaxation time-scale negligible. This study provides a practical calculation framework for accurate and efficient spin dynamics prediction, laying the foundation for the rational design of high-performance single-molecule magnets.
Read the full abstract

All authors Yifan Deng, Zhe-Bin Guan, Zilong Zou, Zheng Sun, Ze-Wei Li, Bingwu Wang, Hong Jiang

Databases

DiaLSM: Towards Write-Stall-Free Performance via Shard-based LSM-tree

Log-Structured Merge-tree (LSM) aims to achieve high write throughput, but is known to experience the write stall problems when subjected to sustained write pressure. We quantify the occurrence probability and average duration of write stalls in LSM using a queuing model in the write–flush–compaction pipeline, moving beyond existing empirical analysis. The proposed model demonstrates that a monolithic LSM with a single pipeline cannot eliminate write stalls, revealing that internal sharding within the LSM offers an opportunity for fundamental write stall mitigation. To break this structural bottleneck, we propose DiaLSM, an internally shard-based LSM architecture. Instead of forcing all writes through one pipeline, DiaLSM splits the write–flush–compaction path into multiple independent shards and employs dynamic fallback redirection, allowing writes to proceed even when some shards stall. Implemented on RocksDB, DiaLSM achieves up to 2.4x higher throughput, 94% lower stalls, and significantly lower latency than state-of-the-art methods ADOC and Sub-Compaction, as demonstrated by db_bench, YCSB, and Sysbench OLTP evaluations.
Read the full abstract

All authors Hongsu Byun, Safdar Jamil, Honghyeon Yoo, Sungyong Park, Myungcheol Lee, Xubin He, Zhichao Cao, Youngjae Kim

Differential Geometry

Morse Index of a $G_2$-Instanton over $S^7$

In this paper, we determine the nonpositive spectrum of the Yang-Mills Jacobi operator in Coulomb gauge at the standard $G_2$-instanton on $S^7$. We prove that the only negative eigenvalue is $-3$, with multiplicity $8$, and the kernel has dimension $20$. Thus the connection attains the sharp lower bound for the Morse index of nonflat Yang-Mills connections on $S^7$. We also give an explicit description of the kernal of the Jacobi operator, which contains Waldron's $15$-dimensional deformation space for the fixed nearly parallel $G_2$-structure. The 5 additional zero modes are isometry-induced variations that do not satisfy the corresponding linearized instanton equation.
Read the full abstract

Combinatorics

Avoidability of Digraphs with Height Functions and Orientations of $C_4$

A digraph $F$ is avoidable if, for every positive integer $k$, there exists an integer $d$ such that every digraph of minimum out-degree at least $d$ contains an $F$-free subdigraph of minimum out-degree at least $k$. We prove that no digraph admitting a height function is avoidable, where a height function increases by one along every arc. This answers a question of Christoph, Janzer, Petrova, and Steiner and, together with an additional avoidance argument, determines which orientations of $C_4$ are avoidable. Motivated by a further question of Christoph, Janzer, Petrova, and Steiner, we also study Eulerian avoidability, in which the host digraph is required to have equal in-degree and out-degree at every vertex. We show that no one-directed complete bipartite digraph with nonempty parts is Eulerian-avoidable. In contrast, the orientation of $C_4$ consisting of two directed paths of length two with common endpoints is Eulerian-avoidable. Consequently, the one-directed complete bipartite orientation is the only orientation of $C_4$ that is not Eulerian-avoidable, completing the classification of $C_4$-orientations.
Read the full abstract

All authors Hui Lei, Xiaoyi Wang, Zhijun Xu, Zhenyu Yang

Systems and Control

Grid Topology Optimization for Congestion Management Under High Renewable Penetrations and Discrete Load Growth

Transmission grids are increasingly stressed by the fluctuating nature of renewable energy sources and by increasing electricity demand. Such grids were mainly built for a different generation fleet and load conditions. Grid topology optimization offers the possibility to redistribute power flows by modifying the busbar topology of substations in the grid. However, the combinatorial explosion of feasible busbar configurations makes topology optimization impractical for system operators. This paper proposes a methodology to identify a small subset of high-value busbar topologies to capture the economic benefit of topology optimization across a range of renewable-demand patterns. The optimization model is based on a LPAC approximation of the optimal power flow formulation, and AC-feasibility checks of the optimal topology applied to the IEEE 118-bus test case. In the test case, we select two distinct pairs of substations (46-49 and 24-69) and we optimize their topology separately over 365 clustered timesteps with different wind and load conditions. For each pair, we identify the four most recurrent optimal topologies and evaluate their performance under standard, and congested conditions, with and without a discrete load growth. Results show that selecting from this reduced set of topologies reduces total generation costs by up to 0.147% compared to a plain AC-OPF. In addition, we show the influence of topology optimization on the hosting capacity of selected busbars under discrete load growth. Our findings provide a practical methodology for system operators to select a subset of optimal busbar topologies to be used in their grid for different wind-load conditions, resulting in decreasing generation costs without the computational and operational risks of real-time switching decisions.
Read the full abstract