Dynamical Systems
On components of stable connectivity of gradient-like diffeomorphisms of the 2-torus
D.A. Baranov, E.V. Nozdrinova and O.V. Pochinka
Gradient-like diffeomorphisms of a closed surface $M^2$ are characterized by a finite
hyperbolic limit set and the absence of intersections of invariant
manifolds of distinct saddle points. In the case where such diffeomorphisms $f_0, f_1:M^2\to M^2$ are isotopic, they are connected by some arc $\{f_t:M^2\to M^2, t\in [0,1]\}$ in the space of diffeomorphisms. If every diffeomorphism of the arc has a finite limit set and the arc is stable (does not change its qualitative properties under small perturbations) in the space of diffeomorphisms, then $f_0,f_1$ are said to be stably connected. Thus, the set of isotopic diffeomorphisms splits into components of stable connectivity, of which there may, in general, be infinitely many. For instance, it is known that gradient-like diffeomorphisms of the 2-sphere (both orientation-preserving and orientation-reversing) consist of a countable number of stable connectivity components. Moreover, belonging to a particular component is uniquely determined by the periodic data of the diffeomorphism. In the present paper, we consider gradient-like diffeomorphisms of the 2-
torus that are not isotopic to the identity. We establish that the set of such diffeomorphisms splits into a finite number of stable connectivity components. For each isotopy class, we define the periodic data of the diffeomorphism, which uniquely determine membership in a given component.
Read the full abstract ▾
Information Theory
On Trajectory-Based Stability Analysis for $1$-bit Sigma-Delta Quantization and its Application to the Second-Order Case
Rohan Joy, Felix Krahmer and Alessandro Lupoli
A state-of-the-art strategy for digitally representing a bandlimited signal $f$ is $\Sigma\Delta$ quantization. $\Sigma\Delta$ quantization schemes choose a bit sequence $(q_n)$ representing the samples $(y_n)$ of $f$ sequentially based on a state sequence $(u_n)$ defined via a recurrence relation of the form \begin{equation*} u_n = (h*u)_n + y_n - q_n, \end{equation*} where $h_j = 0$ for $j\le 0.$ The effectiveness of a quantization scheme crucially depends on the fact that it is stable, i.e. , the state variable remains uniformly bounded in a given class of signals. Thus, a common strategy is to choose $$q_n = \operatorname{sign}((h*u)_n + y_n).$$ It is well known that a sufficient condition for this quantization rule to induce stability is that $$ \|h\|_{\ell^1}+\|f\|_{\infty}\le 2.$$ At the same time, one empirically observes that this condition is conservative and stability holds significantly beyond this bound. In this paper, we address this gap by establishing the first stability guarantees beyond first order that outperform the $\ell^1$ based stability condition. In contrast to many previous approaches, our analysis describes the trajectories of the state variables rather than characterizing the invariant set, an approach that had previously been performed only in some specific example cases. This viewpoint has the main advantage that it makes it possible to treat longer filters, which are difficult to handle through invariant-set analysis because of the resulting high dimensionality. We apply our technique to second-order $\Sigma\Delta$ schemes with sparse feedback filters as proposed by Günturk \cite{gunturk2003one}, showing that the filter length required to guarantee stability significantly improves from the length $O\left(\frac{1}{1-\|f\|_{\infty}}\right)$ needed to apply the $\ell^1$ based criterion to $O\left(\frac{1}{\sqrt{1-\|f\|_{\infty}}}\right)$.
Read the full abstract ▾
Combinatorics
Codes and designs in multivariate $Q$-polynomial association schemes
Minjia Shi, Jing Wang and Patrick Solé
We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Solé, 1989). We give upper bounds on the size of codes of given degree, and also on the size of codes with a given number of pairwise distances. Codes meeting these bounds are characterized by the identification of suitable annihilators with the degree (resp. distance) Wilson
polynomial. We give two analogues of the Rao bound on the size of designs with given strength. Designs meeting that bound we call degree tight designs or distance tight design depending on the bound met. In both cases, the existence of a tight design implies a Lloyd-like condition on a suitable analogue of the Wilson
polynomial. Applications to the Lee distance, mixed level orthogonal arrays, ordered orthogonal arrays, and more are given. The formal duality between codes and designs, connecting perfect codes and tight designs, is made concrete in self-dual translation schemes.
Read the full abstract ▾
Analysis of PDEs
Global Regular Solutions of the Compressible Navier-Stokes Equations with Nonlinear Density-Dependent Viscosities and Large Initial Data of Spherical Symmetry
Gui-Qiang G. Chen, Jiawen Zhang and Shengguo Zhu
For the physically important case in which the viscosity coefficients depend on the density $\rho$ through a power law (i.e., $\rho^\delta$ with some exponent $\delta \in (\frac{1}{2},1)$), we establish the global well-posedness of regular solutions of the compressible Navier-Stokes equations for barotropic flow with large initial data of spherical
symmetry in two and three spatial dimensions. The initial density considered here is positive everywhere but vanishes in the far field, ensuring that the resulting solutions satisfy the conservation laws of total mass and momentum. The most crucial step in our analysis is to obtain a uniform upper bound for the density, which is challenging due to the combined difficulties of degeneracy near the far-field
vacuum, coordinate singularity at the origin, and nonlinearity of viscosity coefficients. Furthermore, the methodology developed here can also be applied to the corresponding problem in which the density remains strictly away from the
vacuum.
Read the full abstract ▾
Analysis of PDEs
Global Well-posedness of the 2D Stochastic Self-consistent Keller-Segel-Navier-Stokes System with Subcritical Cellular Mass
Fanze Kong, Chen-Chih Lai and Krutika Tawri
We consider a
stochastic Keller-Segel-Navier-Stokes system in $R^2$ describing the collective motion of
cells in an ambient
stochastic fluid flow, where the
cells are attracted by a chemical substance and transported by the ambient fluid velocity, and the fluid motion is self-consistently driven by forces induced by the
cells. We prove the existence of a unique mild solution globally-in-time to the two-dimensional
stochastic Keller-Segel-Navier-Stokes system with subcritical mass.
Read the full abstract ▾
Information Theory · Cross-listed from stat.ME
Symmetry-Aware Convex Shrinkage for High-Dimensional Covariance Estimation
Mitchell A. Thornton
We develop a class of data-adaptive shrinkage
estimators for high-dimensional covariance estimation in which the shrinkage target is a Reynolds projection of the sample covariance under a finite
symmetry group selected from a candidate library by held-out predictive performance. The class generalizes the convex shrinkage
estimator of Ledoit and Wolf by replacing the scalar-identity target with a structured target derived from a
symmetry group when one is available, and generalizes the group-symmetric maximum-likelihood
estimator of Shah and Chandrasekaran by combining structural targeting with adaptive convex shrinkage and by selecting the group from data rather than treating it as prespecified. A two-tier procedure performs the group selection: a universal per-candidate evaluation based on held-out negative log-likelihood, optionally preceded by a domain-specific step that constructs the candidate library from structural priors. We establish a finite-sample regret bound for the held-out calibration of the convex combination weight, an oracle inequality for the data-driven group selection, and a quantitative sufficient-match condition under which the proposed
estimator dominates Ledoit-Wolf shrinkage in Frobenius mean-squared error. The procedure is illustrated on six real-data problems spanning finance (S&P~500 daily returns),
climate (NOAA OISST sea-surface temperature anomalies), genomics (TCGA-BRCA gene expression),
radio signal processing (RadioML 2018.A), astronomical imaging (
Galaxy10 DECaLS), and natural image patches (CIFAR-10 with a CIFAR-10.1 distribution-shift companion). An empirical comparison is also made against the
Bayesian permutation-
symmetry estimator of Chojecki and colleagues. Outside the few-shot regime, where structural priors carry the most information per observation, Ledoit-Wolf shrinkage remains the appropriate baseline.
Read the full abstract ▾
Optimization and Control · Cross-listed from stat.ML
Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations
Phuoc-Toan Huynh, Richard Archibald and Feng Bao
We introduce a novel framework for uncertainty quantification of solution operators associated with
stochastic partial differential equations (SPDEs). Although SPDEs play a central role in modeling complex physical systems under uncertainty, their practical use typically requires specifying the magnitude and structure of model uncertainties that are often unknown and difficult to infer from noisy measurements. To address this challenge, we develop a
stochastic operator-learning framework that learns directly from noisy data and outputs both a mean solution field and a quantification of uncertainty. The proposed method, namely the
Stochastic Operator Network (SON), is constructed by combining the structure of the Deep Operator Network (DeepONet) with
Stochastic Neural Networks (SNNs) to model stochasticity and enable probabilistic prediction. The training procedure is carried out by minimizing a
Hamiltonian-type loss and optimizing the resulting objective using the
Stochastic Maximum Principle. Numerical experiments on
benchmark SPDEs under multiple uncertainty sources demonstrate the accuracy and robustness of the proposed method in capturing solution structure and quantifying predictive uncertainty.
Read the full abstract ▾
Complex Variables
Abundance of Bergman metrics with constant positive holomorphic sectional curvature
Shreedhar Bhat, Soumya Ganguly, Achinta Kumar Nandi et al. (+1 more)
An outstanding open question, which has attracted renewed
attention following the pioneering work of Huang–Li–Treuer, is whether, for a given positive integer $m$, there exists a complex
manifold whose Bergman metric is locally isometric to $m$ times the Fubini–Study metric. Previously, this question had only been resolved in the case $m=1$. In this paper, we construct, for any pair of positive integers $(m,n)$ with $n \geq 2$, an $\mathbb{R}$-parameter (hence uncountable) family of Reinhardt domains in $\mathbb{C}^n$ whose Bergman metrics are all locally isometric to $m$ times the Fubini–Study metric. Moreover, we show that the domains in this family are mutually Bergman inequivalent. This not only answers the folklore question, but also suggests that a reasonable classification of the geometry of such complex
manifolds is infeasible. We also note such examples cannot exist in dimension one. The results complete the remaining open case in the study of complex
manifolds whose Bergman space separates points and whose Bergman metric has constant holomorphic sectional
curvature. Our approach differs from existing methods in the literature. We reduce the construction to a mapping problem and apply a Brouwer fixed point argument to establish the existence of the desired domains.
Read the full abstract ▾
All authors Shreedhar Bhat, Soumya Ganguly, Achinta Kumar Nandi, Ming Xiao
Differential Geometry
Gauss curvature solitons on invariant surfaces in the homogeneous space Sol
Rafael Belli and Rafael López
We classify invariant surfaces in the 3-dimensional solvable Lie group $\sol$ that act as
solitons for the Gauss
curvature flow. We consider
solitons associated with the canonical basis of Killing vector fields $\{F_1, F_2, F_3\}$, where $F_1$ and $F_2$ generate horizontal translations and $F_3$ generates the scaling isometry. We establish
rigidity results for $F_3$-invariant surfaces, proving that specific totally geodesic vertical planes are the only $F_1$- and $F_2$-
solitons. For $F_1$-invariant surfaces, we establish the main
geometric properties of $F_2$- and $F_3$-
solitons in both the extrinsic and intrinsic Gauss
curvature.
Read the full abstract ▾
Analysis of PDEs
Newton's problem of minimal resistance in Lorentz-Minkowski space
Rafael López
We extend Newton's problem of minimal resistance to the Lorentz-Minkowski space. We derive the functional energy and determine the Euler-Lagrange equation. In contrast to the Euclidean case, this equation is quasilinear
elliptic, and thus, a maximum principle holds in this context. We obtain the solutions of separable variables of this equation via separation of variables. Furthermore, we find all radial solutions to the problem, which present conical singularities at the origin. We also analyze the Single Shock Condition.
Read the full abstract ▾
Optimization and Control
A preconditioned augmented Lagrangian method for solving semidefinite programming problems
Tianyun Tang and Kim-Chuan Toh
In this work, we propose a preconditioned augmented Lagrangian method (ALM) for solving semidefinite programming (SDP) problems. The preconditioner is implemented via a weighted penalty function in the ALM subproblem, with the weight
matrix derived from the projection operator onto the tangent space of the feasible region. This simple yet effective modification significantly accelerates ALM, particularly for ill-conditioned SDPs. By combining the preconditioned ALM with our previously developed feasible method SDPF, we develop SDPF+, an SDP solver capable of handling convex problems with possibly nonlinear objective functions. Extensive numerical experiments demonstrate the efficiency and robustness of SDPF+, showing that it can generally outperform other solvers on large-scale SDPs whose optimal solutions exhibit low-rank structure.
Read the full abstract ▾
Probability
Spectral Purification in Reversible Markov Chains: Hidden Parameters, Observable Equivalence, and Finite-Time Rigidity
Qiao Wang
Classical spectral theory of reversible Markov chains characterizes the asymptotic relaxation dominated by the slowest eigenmode, governed by the spectral gap. This paper studies a complementary finite-time phenomenon: long before stationarity, many observables of the relaxation trajectory behave as if only a single spectral mode remains – a collapse we term spectral purification. We develop a quantitative theory for it. The theory rests on three structural insights: (i) shifting focus from the state trajectory to the modal distribution $p_i(k)$ (normalized spectral energy across modes); (ii) a hidden purification parameter $x_k$ driven by the spectral separation ratio $\lambda_3/\lambda_2$ that governs the
evolution of $p_i(k)$; and (iii) an equivalence class of six seemingly distinct purification diagnostics (slow-mode energy fraction, power-iteration error, direction deficit, Rayleigh quotient error,
eigenvalue estimate error, and spectral
entropy), all reducing to $x_k$ to leading order up to explicit constants. This equivalence yields sharp non-asymptotic two-sided bounds on the
rigidity time $T_{\mathrm{rigid}}(\delta)$ (when the slowest mode captures a prescribed spectral energy fraction), controlled by $\lambda_3/\lambda_2$ rather than the gap $1-\lambda_2$. It also provides an exact non-asymptotic
entropy representation, including a spectral Clausius equality and a spectral second law $G(k+1) \le G(k)$. The boundary of the theory is identified: while the asymptotic variance of time-average
estimators is monotone in $\lambda_3/\lambda_2$, the finite-$k$ mean-squared-error correction lies outside the $x_k$-governed exponential regime. Applied to power iteration, the theory delivers an exact error identity, an observable spectral variance formula, and a fully data-driven adaptive stopping criterion with provable guarantees.
Read the full abstract ▾
Combinatorics
Structural characterization and efficient recognition of probe diamond-free graphs
Luciano Norberto Grippo Min Chih Lin
A graph is probe diamond-free if its vertex set admits a partition into probes and nonprobes, where the set of nonprobes is independent, such that adding edges only between pairs of nonprobes yields a diamond-free graph. Although this class admits a characterization by forbidden induced subgraphs, such a characterization does not directly lead to an efficient recognition
algorithm. In this work we introduce a new structural characterization of probe diamond-free graphs based on a local condition, called the locally union of complete split property, together with an auxiliary bipartite graph. Using this framework, we obtain an \(O(nm)\)-time recognition
algorithm for (nonpartitioned) probe diamond-free graphs. A distinctive feature of our
algorithm is that it is certificate-producing. When the input graph does not belong to the class, the
algorithm outputs a negative certificate in the form of a sequence of vertices inducing a minimal forbidden subgraph, ordered according to a fixed degree–lexicographic rule. This ordered representation enables particularly simple and efficient certificate verification. When the input graph is probe diamond-free, the
algorithm outputs a positive certificate consisting of a probe partition and a completion set. To the best of our knowledge, this is the first $O(nm)$-time recognition
algorithm for probe diamond-free graphs that produces explicit certificates, providing an alternative to both sandwich-based approaches and exhaustive forbidden subgraph testing.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Path-Extrema Upper Bounds on Mean Entropy Production
Surachate Limkumnerd
Fluctuation relations imply the second-law inequality $\langle\Sigma_T\rangle\ge0$, but path extrema can also constrain how large the mean
entropy production can be. For steady-state processes with
entropy-production martingale $M_t=e^{-\Sigma_t}$, we show that knowing only the positive running maximum of $\Sigma_t$ gives no improvement over the trivial endpoint bound: rare negative
entropy-production excursions can still carry the exponential weight required by the fluctuation relation. Using the running extrema $L_T=\inf M_t$ and $H_T=\sup M_t$, we derive a path-extrema upper envelope $\mathcal{U}_{\rm ext}$. The relaxed envelope problem ranks realized intervals by the
entropy gain per martingale cost, $\ln(H_T/L_T)/(H_T-L_T)$, giving a continuous knapsack problem. The actual mean satisfies the exact identity $\langle\Sigma_T\rangle=\mathcal{U}_{\rm ext}-\mathcal{A}-\mathcal{C}$, where $\mathcal{A}$ is an allocation gap across realized envelopes and $\mathcal{C}$ is a
curvature gap within each envelope. Thus path extrema set the upper envelope, while the two gaps quantify how actual dynamics allocate terminal outcomes across envelope classes and place terminal values within each realized envelope. This turns path-extrema information into a quantitative upper-bound theory for
entropy production, complementary to the usual lower-bound role of fluctuation relations.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Ensuring reliability in 100% renewable microgrids: a scenario-based joint planning and operational design framework
Mohammed Zeehan Saleheen, Markus Wagner and Hao Wang
Off-grid microgrids powered entirely by renewable energy sources face substantial challenges in achieving utility-grade reliability standards. Existing microgrid planning frameworks often prioritize cost minimization while treating reliability as a secondary metric, thereby leading to suboptimal designs. This paper presents a comprehensive scenario-based optimization framework that simultaneously addresses long-term capacity planning and short-term operational dispatch in two stages for 100%-renewable microgrids. The developed two-stage
stochastic programming model co-optimizes the investment and operation of photovoltaic generation and battery energy storage, while ensuring compliance with stringent reliability constraints following utility grid standards. Network modeling with operational constraints, such as line capacities and voltage limits, is incorporated to allow distributed resource placement leveraging power sharing between microgrid nodes. A novel scenario generation approach captures critical uncertainties, including seasonal demand fluctuations,
solar output variations, and probabilistic equipment failures, through the statistical clustering of historical data. The optimization framework integrates utility-grade reliability constraints limiting the expected energy not served to below 0.002% of the annual demand while minimizing the total system costs. Numerical simulations demonstrate the effectiveness of the proposed framework, achieving 99.998% supply reliability using only photovoltaic power and battery energy storage. The optimized network-aware distributed resource allocation provides inherent resilience through power rerouting during component outages, maintaining load continuity even under simultaneous equipment failures. This study confirms the feasibility of 100%-renewable microgrids to support remote communities while meeting utility-grade reliability
benchmarks.
Read the full abstract ▾
Mathematical Physics · Cross-listed from physics.class-ph
Variational Openness
Francisco Monroy
Variational principles in mechanics, field theory and
geometric analysis are usually formulated on closed admissible classes, where boundary variations are either fixed or independently cancelled through natural boundary conditions. Variational openness is formulated here as a conservative extension of this setting. Its central premise is that stationarity requires cancellation of the total first variation, not necessarily separate cancellation of bulk and boundary contributions. Separate Euler–Lagrange and boundary equations arise only when admissible variations are independently localizable. Two regimes are distinguished. In separable open systems, bulk and boundary variations remain independently testable, and stationarity yields the usual interior equation together with an open boundary balance. In regulated open systems, admissible variations form a graph subspace in which bulk and boundary displacements are linked by a compatibility operator. Stationarity then becomes a projected balance on the admissible exchange space, allowing nontrivial bulk–boundary action exchange before total cancellation occurs. At second order, the open action defines a closed quadratic form on the admissible graph space. For pressure-like boundary couplings, the open Hessian is obtained by subtracting from the stabilizing
geometric form a boundary-pressure form pulled back through the compatibility operator. A Rayleigh–Ritz criterion then yields a critical threshold at which positivity and coercivity are lost. A minimal spherical example illustrates the corresponding regulated spectral shift. The framework contains fixed-boundary, natural-boundary and classical free-boundary problems as limiting cases, while extending stationarity to regulated bulk–boundary exchange classes.
Read the full abstract ▾
Optimization and Control
Clipped Stochastic Gradient Tracking For Locally Smooth Functions
Leilei Mei and Junyu Zhang
Most
stochastic gradient tracking (GT) methods adopt pre-scheduled stepsize rules, while a few recent works studied adaptive stepsizes that attempt to respond to the problem's local landscape. These methods are typically built upon the problem's global smoothness constant in both analysis and implementation, even for the adaptive ones. On the one hand, for many problems the local smoothness constant may vary drastically across the domain, and sometimes even unbounded, using the global upper bound of the local constants is too conservative. On the other hand, drastic stepsize changes can cause difficulties in the analysis of convergence and consensus of distributed
algorithms, making the direct use of local smoothness constants risky and theoretically challenging. In this paper, we propose a Relative Uniform Continuity (RUC) regularity condition for the local smoothness constant as a function of sets. The RUC condition covers most common growth functions for local smoothness constant, ranging from constant and logarithmic to
polynomial and even exponential. For RUC-regular distributed optimization problems with finite-sum structure, we derive a clipped gradient tracking method with staggered variance reduction, which only relies on the local smoothness of objective functions, and an $\mathcal{O}(\sum_in_i^{1.5}+n_i^{0.5}\epsilon^{-1})$ complexity has been established for our
algorithm.
Read the full abstract ▾
Information Theory
Intermediate Constacyclic Codes and Scalar-Residue Reed–Muller Layers
Yaoran Yang and Yutong Zhang
A 2024 paper of Sun, Ding and Wang introduced a second class of constacyclic codes over finite fields, denoted $C(q,m,r,\ell)$, with length $(q^m-1)/r$, where $r\mid(q-1)$ and the defining monomials have total $q$-ary degree congruent to $r-1$ modulo $r$. In the non-projective intermediate range $2<r<q-1$ the paper gave a sharp-looking upper bound and a BCH-type lower bound, and left the minimum distance open. We prove that the upper bound is the exact minimum distance for every admissible intermediate parameter. More precisely, if $\ell=(q-1)a+b<(q-1)m-1$, $0\le b\le q-2$, and $b\equiv r-1\pmod r$, then, for every
prime power $q$, every divisor $r$ of $q-1$ with $2<r<q-1$, and every $m\ge2$, \[ d(C(q,m,r,\ell))= \begin{cases} \displaystyle \frac{q-1}{r}(q-b+1)q^{m-a-2},&0\le a\le m-2,\\[1mm] \displaystyle \frac{q-b+r-2}{r},&a=m-1. \end{cases} \] The first line settles the open problem of Sun, Ding and Wang; the second line is the terminal case already forced by their BCH bound. We also determine the minimum affine support of every non-terminal scalar-residue layer of a generalized Reed–Muller code. The resulting dichotomy says that the first Reed–Muller weight survives exactly for residue classes $0$ and $1$, while every other residue-matched layer starts at the second Reed–Muller weight. The proof uses the hidden scalar homogeneity of the evaluation model, an orbit-counting obstruction for minimum Reed–Muller supports, and a homogeneous pencil construction that attains the second weight.
Read the full abstract ▾
Quantum Algebra
Conformal Blocks: Vector bundle structures, Sewing, and Factorization
Bin Gui
This is an informal note on the complex-analytic approach to the theory of conformal blocks for rational VOAs. Its main body was completed in November 2020.
Mathematical Physics · Cross-listed from quant-ph
Exact nonequilibrium steady states of boundary driven circuit with XYZ gates
Xin Zhang, Tomaz Prosen and Vladislav Popkov
We obtain the exact many-body density operator of a boundary-driven XXZ
quantum circuit via a spatially inhomogeneous
matrix product Ansatz. The Ansatz has formally infinite bond-dimension and generalizes authors' previous construction \cite{2025XXZcircuit} for the XXZ interactions. The boundary
qubits are coupled to reset
quantum channels that project them toward arbitrary pure target states. We find and describe a family of relatively robust separable
chiral nonequilibrium steady states (NESS), which are
elliptic analogs of
spin helices for the
circuit, and which are particularly attractive from an experimental perspective.
Read the full abstract ▾
Combinatorics
Positivity of arbitrary-order P-recursive sequences with a unique dominant root
Zhongjie Li
We establish a sufficient condition for the ultimate positivity of P-recursive sequences of arbitrary order with a unique dominant root. By additionally verifying finitely many initial terms, the positivity can also be resolved. As an application, we provide several examples of P-recursive sequences of order greater than two.
Read the full abstract ▾
Number Theory
One-level densities of large even and odd orthogonal families of automorphic L-functions
Vorrapan Chandee, Xiannan Li and Micah B. Milinovich
We prove one-level density results for L-functions attached to primitive forms of level q, averaged over square-free q, conditional on the Generalized Riemann Hypothesis (GRH). We treat the even and odd orthogonal families separately and extend the support of the
Fourier transform of the test function to (-3,3). This extended support yields the strongest known non-vanishing results for these families of L-functions and their derivatives at the central point, conditional on GRH.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Design and Practical Validation of a Novel Modulation Scheme for RIS Detection and Identification
Aymen Khaleel, Adam Umra and Aydin Sezgin
The reconfigurable intelligent surfaces detection and identification (RISs-ID) is a critical process that enables a base station (BS) to adaptively assign the appropriate RIS to a given \ac{UE}. This work proposes a novel modulation scheme to enhance the reliability of RIS-ID by reducing the miss-detection ($P_\text{m}$) and false-alarm ($P_\text{f}$) probabilities. Specifically, we leverage the RIS's passive beamforming gain to enable over-the-air modulation of the RIS ID, combined with passive beam sweeping to extend detection coverage in angular space. Prototype experiments demonstrate the effectiveness of the proposed scheme in reducing $P_\text{m}$ and $P_\text{f}$ to $10^{-3}$ across different operating points.
Read the full abstract ▾
Differential Geometry
Strong uniqueness and rectifiability of generalized cylindrical singularities in Ricci flow
Hanbing Fang and Yu Li
In this paper, we extend the results of \cite{fang2025strong, fang2025singular} to generalized cylinders. More precisely, we establish a Lojasiewicz inequality for the pointed $\mathcal{W}$-
entropy in
Ricci flow under the assumption that the geometry near the base point is close to a generalized cylinder $\mathbb{R}^k \times N^{n-k}$, where $N$ is an Einstein
manifold with obstruction of order three satisfying a suitable spectral condition. As an application, we prove the strong uniqueness of generalized cylindrical tangent flows. Furthermore, we show that the subset $\mathcal{S}^k_{\mathrm{qc}}(N)\subset \mathcal{S}^k$, consisting of points at which some tangent flow is given by $\mathbb{R}^k \times N^{n-k}$ or its quotient, is horizontally
parabolic $k$-rectifiable.
Read the full abstract ▾
Analysis of PDEs
Leray–Hopf Type Weak Solutions for the Three-Dimensional Beris–Edwards System with Stable Landau–de Gennes Potential
Yao Zhang, Han Ni Soe and Zhipeng Xu
We prove existence of a weak solution to the three-dimensional Beris–Edwards system in the whole space under the stable bulk assumption $c>0$. The solution satisfies the natural bounds $Q\in L^\infty_tH^1_x\cap L^2_tH^2_x$ and $u\in L^\infty_tL^2_x\cap L^2_tH^1_x$, the distributional form of the equations, and the expanded Leray–
Hopf type energy inequality used in weak–strong uniqueness arguments. The proof does not pass directly to the limit in that expanded inequality, where the non-corotational terms contain products of the form $|Q^n|^4Q^n:\nabla u^n$. It first obtains the physical free-energy inequality through a hyperviscous approximation and a localized tail estimate, and then derives the expanded inequality from a low-order chain rule for the bulk part of the energy. The last section records the elementary uniaxial reduction which explains why the present argument is restricted to stable bulk potentials.
Read the full abstract ▾
Numerical Analysis
Low Stage and High Order Explicit Runge–Kutta Methods via $Q$- and $D$-Conditions: Several Construction Details
Junyuan He and Jizu Huang
This note provides additional details on the construction of the $Q$/$D$-space framework for sufficient order conditions of explicit Runge–Kutta (ERK) methods. Specifically, it presents a general version of the sufficiency
theorem, several examples illustrating the verification of the sufficient conditions, a detailed construction of an ERK scheme of order $p=10$, the assembly of the associated linear systems, a complexity analysis of the construction
algorithm, and tables of coefficients for the constructed ERK methods.
Read the full abstract ▾
Mathematical Physics
Nonlocal thermal Willis coupling in laminated conductors
Chunlin Wu, Gal Shmuel and Huiming Yin
Building on Willis' homogenization framework, recent work has revealed that heterogeneous conductors exhibit macroscopic thermal bianisotropy, in which the macroscopic heat flux and
entropy are nonlocally coupled to both temperature and temperature gradient. Existing numerical examples, however, are limited to the subwavelength regime. Here, we provide the first explicit demonstration of this spatial nonlocality by computing the effective kernels of a periodic laminate using three independent homogenization methods. The three approaches yield consistent nonlocal cross-coupling terms, clarifying the roles of spatial asymmetry and averaging choice. We also calculate the corresponding thermal impedance and show that it is direction-dependent, highlighting a physical signature of thermal bianisotropy relevant to thermal metamaterials.
Read the full abstract ▾
Rings and Algebras
n-ary elliptic groups, rings, and primes in arithmetic progressions
Ilia Pirashvili
I introduced the notion of an
elliptic group in [
Elliptic groups and rings. Beiträge zur
Algebra und Geometrie 66(2), 497-529]. It is a quasi-group based on the tangent-chord law of
elliptic curves and thus, becomes an abelian group upon singling out an element. This close proximity to abelian groups is reflected in the theory, and among other things, we can define
elliptic rings, which are monoidal objects in
elliptic groups. An other way of expressing this is to say that they are commutative monoids with an
elliptic group structure that distributes over them. In this paper, we generalise this theory from the binary
elliptic group structure to the $n$-ary structure, which we call $n$-ary
elliptic groups and $n$-ary
elliptic rings. The latter are once again (binary) commutative monoids with an $n$-ary operation that distributes over the monoidal structure in an $n$-ary sense. The key interest of these objects for us is their arithmetic properties, which are surprisingly pleasant. The key result is that Dirichlet's famous
theorem on arithmetic progressions becomes simply Euclid's
theorem in these $n$-ary rings, at least for progressions of the form $an + 1$. Motivated by the hope to eventually prove this $n$-ary Euclidean
theorem purely algebraically using the theory of $n$-ary rings (and thus give an alternative and purely algebraic proof of Dirichlet's
theorem), we start by exploring the first arithmetic facts of these objects, including introducing the $n$-ary class group and showing that it indeed captures the unique $n$-ary factorisation. We also obtain a type of Dedekinds
theorem for our main $n$-ary ring of interest: $\mathsf{nEl}(\mathbb{Z})$.
Read the full abstract ▾
Statistics Theory
Quantifying Dependence Between Random Vectors: A New Index with Applications
Chuancun yin
This article proposes a new index for quantifying the degree of dependence between random vectors. The index takes values in [0,1] and equals zero if and only if the random vectors are sub-independent. Unlike mere uncorrelatedness, sub-independence implies a stronger form of dependence while remaining strictly weaker than full independence. The proposed index is constructed via characteristic functions and admits a simplified representation in terms of moments. We establish its theoretical properties and derive a computationally efficient formula for the corresponding empirical measure. Furthermore, we investigate the asymptotic behavior of the
estimator and demonstrate its practical utility through applications in machine learning, actuarial science, and renewal theory.
Read the full abstract ▾
Geometric Topology
GL-racks and coloring invariants of Legendrian knots
Zhiyun Cheng and Zhiyi He
In this paper, we explore the algebraic structure of GL-racks, and demonstrate that finite GL-racks decompose canonically into permutation GL-racks and block GL-racks. As a corollary, we verify that two Legendrian
knots with the same classical invariants share equivalent coloring invariants with respect to any given finite GL-rack.
Read the full abstract ▾