Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 17 May

Combinatorics · Cross-listed from quant-ph

Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics

We present a quantum attack on ML-KEM and related 2-power cyclotomic lattice schemes. Combining with Parts I-III, we provide an algorithm and verify the resulting approximation factor satisfies $\gamma\le 21 < q/2=1664.5$ for ML-KEM-1024, with a success probability $\ge 0.99$. We apply a tower decomposition of the Principal Ideal Problem (PIP) through the chain $\Q\subset \Q(\zeta_8)\subset\cdots\subset \Q(\zeta_{2^k})$ which yields a polynomial-time quantum algorithm costing $O(n^3 \log^2 n)$ gates, $O(n^2 \log n)$ qubits, and poly$(n)$ classical bit operations. We extend the analysis to Falcon, Hawk, and NTRU over 2-power cyclotomic rings with polynomial-time quantum algorithms.
Read the full abstract

Logic

Combinatorics of Schur ultrafilters

In this paper, we provide a combinatorial characterization of the elements of Schur ultrafilters on countable commutative groups. Using this characterization, we construct a Schur ultrafilter on $\mathbb Z$ that is not infinitary Schur. Moreover, assuming the Continuum Hypothesis, we establish the existence of Schur P-points in $\beta(\mathbb Z)$. On the other hand, it is consistent with ZFC that there exist P-points in $\beta(\mathbb Z)$, but none of them are Schur. Also, we extend the result of Fernández-Bretón, Navarro-Castillo, and Soria-Rojas by showing that no Schur ultrafilter on $\mathbb Z$ is a Q-point.
Read the full abstract

Number Theory · Cross-listed from cs.DS

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

We prove that the $L^2$ CVP distance from a random short ring element to the log-unit lattice of $\Q(\zeta_{2^k})$ converges to $\frac{\pi}{2\sqrt{6}}\sqrt{n}$ as $n=2^{k-1}\to\infty$. We then show that this target lies inside the Voronoi cell of the origin for $k\ge 4$. For the $L^\infty$ norm, the maximum over $n$ sub-Gaussian coordinates yields $O(\sqrt{\log n})$ which translates into a sub-polynomial approximation factor for the Short Generator Problem. We show a Coarse Lattice Theorem that Babai's algorithm returns zero for all structured targets, yet exactly recovers unit perturbations of arbitrary size. For module determinant ideals, we further prove the Trigamma Theorem that proves an intrinsic imbalance $\sigma_{g_0}=O(1)$ independent of the modulus $q$. Finally, combined with Parts I and II, we reduce the CDPR factor for ML-KEM from $\exp(\tO(\sqrt{n}))$ to a sub-polynomial value.
Read the full abstract

Analysis of PDEs

Threshold-Sharp Conformal Scalar Stability on Carter Slabs and Black Hole Exteriors

We prove a threshold-sharp stability theory for the conformal scalar-curvature sector on zero-curvature Carter backgrounds. The main result is a fully closed bounded-slab theorem: the reflecting evolution is constructed, the conserved energy is proved positive, the complete affine threshold obstruction is identified, and all remaining finite-energy dynamics are shown to be uniformly stable with no unstable modes. This is the sharp statement for compact reflecting slabs, where genuine time decay is false in general. We then extend the same threshold philosophy to black-hole exteriors, separating the intrinsic conformal mechanism from the exterior scalar-wave inputs needed for red-shift, local energy, limiting absorption, and zero-frequency control. The framework gives main applications to Kerr, Reissner-Nordström, slowly rotating weakly charged Kerr-Newman wall exteriors, and extremal horizon-charge obstructions. Our precise result is that it proves stability only for the conformal scalar-curvature sector, not tensorial or nonlinear gravitational stability, and it distinguishes boundedness, qualitative local decay, polynomial decay, and extremal Aretakis-type obstruction without conflating them.
Read the full abstract

Analysis of PDEs

Time dependent Schrödinger equation for harmonic oscillator in the Aharonov-Bohm magnetic field

We construct an approximation of the kernel of the solution of the time dependent Schrödinger equation whose Hamiltonian is a 2D harmonic oscillator in Aharonov-Bohm magnetic field. The main tools used here were established in the paper of A. Laptev and I.M. Sigal, where the authors considered a class of Fourier Integral Operators with global complex phases approximating the fundamental solutions (propagators) for time-dependent Schrödinger equations. For the example considered in this paper we are able to find the main term in the approximation of the kernel that equals a version of the Mehler formula.
Read the full abstract

Optimization and Control

Stochastic Zeroth-Order Optimization Under Heavy-Tailed Noise

We study stochastic zeroth-order (ZO) optimization of smooth nonconvex objectives under heavy-tailed sample-gradient noise. This regime is motivated by empirical evidence that gradient noise in modern machine learning can violate the bounded-variance assumptions used in classical ZO theory. While first-order methods have optimal rates under bounded $p$-th moment noise for $p\in(1,2]$, analogous high-probability guarantees for nonconvex ZO methods are much less understood. The ZO setting is not a direct corollary of first-order theory. First-order methods observe stochastic gradients, whereas derivative-free methods only query noisy function values and build finite-difference estimates. Thus, weak-$L_p$ control of $\nabla F(x;\xi)-\nabla f(x)$ must first be transferred to scalar directional estimates. We propose the Robust Scalar-Clipped Zeroth-Order method (RSC-ZO), a two-point method that clips each scalar directional derivative before aggregation. Under sample-wise smoothness and a weak-$L_p$ tail condition on the sample-gradient noise, RSC-ZO finds an $\varepsilon$-stationary point with high probability using $$ \widetilde{O}\!\left( d^{\frac{p}{2(p-1)}}\varepsilon^{-\frac{3p-2}{p-1}} \right) $$ noisy function evaluations. This matches the optimal first-order $\varepsilon$-dependence. At $p=2$, the bound becomes $\widetilde{O}(d\varepsilon^{-4})$, matching the classical stochastic ZO dimension–accuracy dependence, but with a high-probability guarantee and under a weaker weak-$L_2$ condition that can allow infinite variance. We also analyze a momentum variant and quantify its batch-size/stepsize tradeoff.
Read the full abstract

All authors Taha El Bakkali, El Mahdi Chayti, Qiuyi Zhang, Imane Rahali, Omar Saadi

Complex Variables

On Average Modulus of Random Polynomials Over a Unit Circle and Disc

This article presents some interesting and novel results concerning the average modulus of random polynomials on the unit circle and the unit disc, with coefficients distributed as standard normal variates. The paper also introduces new results concerning the bounds of the maximum modulus of random polynomials with coefficients distributed as independently as Gaussian and uniform variates, utilizing probability principles to derive findings about the likelihood of the maximum modulus exceeding a specific threshold, using Markov inequality as the primary probabilistic tool. These findings and the approach can potentially initiate the study of a rich class of problems concerning the norms of random polynomials.
Read the full abstract

Dynamical Systems · Cross-listed from physics.chem-ph

A cusp criterion for a local phase-space bottleneck in a minimal adiabatic Marcus Hamiltonian

Marcus–Hush theory describes electron transfer through reorganization energies, driving forces, and electronic coupling, but it does not by itself determine when an adiabatic model possesses a local Hamiltonian bottleneck. We study a minimal asymmetric two-degree-of-freedom lower-sheet Hamiltonian with an exactly separable harmonic transverse mode. For this conservative model, we establish a necessary-and-sufficient root count for the stationary points and recover the known cusp boundary for disappearance of the lower-sheet double well. We then interpret that boundary in Hamiltonian phase space: inside the cusp, the lower sheet has an index-one saddle and the associated local transition-state structures — an unstable periodic-orbit NHIM, its stable and unstable manifolds, and an attached dividing surface — exist; outside the cusp, this local saddle-mediated structure is absent. The result applies to this conservative adiabatic potential-energy Hamiltonian. It does not describe solvent free-energy dynamics, bath-induced mode coupling, or nonadiabatic transfer, and it does not predict Marcus rates for realistic condensed-phase electron-transfer systems.
Read the full abstract

Optimization and Control

Retractions by Alternating Projections

Alternating projections and their variants are classical tools for computing points in intersections of sets. Existing analyses for smooth manifolds mainly focus on local convergence rates under transversality or related regularity conditions. In this work, we develop a unified framework for a broad class of (possibly inexact) alternating-projection-type methods on intersections of smooth manifolds. Specifically, under the assumption that two $C^{2,1}$ embedded submanifolds $\mathcal{M}_1, \mathcal{M}_2 \subset \mathbb{R}^n$ intersect cleanly, we show that the associated alternating mapping admits a well-defined local limiting map $\psi$ on the intersection manifold $\mathcal{M}=\mathcal{M}_1\cap \mathcal{M}_2$, and that $\psi$ is a retraction on $\mathcal{M}$. If, in addition, $\mathcal{M}_1$ and $\mathcal{M}_2$ are $C^{3,1}$, then $\psi$ is a second-order retraction. Furthermore, the standard NewtonSLRA scheme, which exhibits quadratic local behavior under transversality, can be understood as inducing a second-order retraction on \(\M\). This framework thus provides new retraction-based optimization tools for problems constrained to the intersection manifold.
Read the full abstract

Combinatorics

Optimization problem for star covers of graphs without four cycles

This work presents a study of star covers on graphs. Unlike traditional formulations that minimize the number of stars, our aim is to optimize the number of bipartite components used in the cover. This problem, motivated by a symmetric nonnegative trifactorization of matrices and the SNT-rank of graphs, is in general hard to solve. We consider a family of graphs that do not contain four cycles, and develop an algorithm to determine the SNT-rank of such graphs.
Read the full abstract

Combinatorics

Equitable partitions of regular graphs, and perfect sets in normal Cayley graphs

An equitable partition of a graph $\Ga$ is a partition $\{V_1, \ldots, V_m\}$ of its vertex set such that for each pair $i, j$ all vertices in $V_i$ have the same number of neighbours in $V_j$. When $m=2$, $V_1$ is called an $(a, b)$-perfect set in $\Ga$, where $a$ is the number of neighbours in $V_1$ of each vertex in $V_1$, and $b$ is the number of neighbours in $V_1$ of each vertex in $V_2$. In this paper we first derive general necessary conditions for a regular graph to admit two equitable partitions. As a corollary we obtain necessary conditions for the existence of an $(a,b)$-perfect set in a regular graph in terms of an arbitrary equitable partition. With the help of these results we then obtain necessary conditions for the existence of an $(a,b)$-perfect set in a normal Cayley graph in terms of the irreducible characters of the underlying group.
Read the full abstract

Information Theory

Channel Modeling and LED Spot Detection for Dense Image-Sensor Visible Light Communication

High-density LED arrays enable high-speed transmission in image-sensor-based visible-light communication (VLC) systems. However, when optical spots become blurred and spatially overlapped due to focal shift, resolution limitations, or interference, severe inter-symbol interference (ISI) occurs, significantly degrading decoding performance. Furthermore, radial distortion introduces geometric deformation of the LED grid, while vignetting leads to incomplete and asymmetric spot shapes at the periphery, both of which further hinder reliable signal detection. Existing methods mitigate ISI by reducing LED transmission signaling density. This paper proposes a robust decoding framework that maintains full LED signaling density. We introduce a pilot-aided geometric recognition method that uses a PSF-constrained Hough transform and circle-center alignment refinement. In addition, radial distortion correction and vignetting-aware compensation are incorporated to restore geometric consistency and suppress edge-related detection errors. By leveraging prior structural knowledge from pilot frames, the system effectively separates overlapping LED signals under severe optical distortion. Experimental results on a real-world VLC testbed confirm that the proposed method achieves superior decoding accuracy and throughput compared to conventional Hough-based and low-density baseline methods. The results highlight its potential for high-efficiency VLC applications in interference-prone environments.
Read the full abstract

Information Theory

Algebraic Resolutions of Seven Open Problems on Cyclic and Negacyclic Codes Supporting Designs

This paper gives a unified algebraic solution to seven open problems of Wang, Tang and Ding on cyclic, negacyclic and constacyclic codes supporting designs. For the cyclic code \[ C\left(\frac{p^s-1}{2},\frac{p^s+1}{2}\right), \] a Cayley parametrization of the unit circle reduces the trace-zero condition to a semilinear equation on \(\PG(1,q)\). Its large root sets are exactly the \(\F_{p^{\gcd(m,s)}}\)-sublines, yielding the complementary design \[ \overline{S(3,q_0+1,q+1)}. \] For the length \(q^2+1\) negacyclic code, a quotient transport from \(\U_{2(q^2+1)}\) to \(\U_{q^2+1}\) and a unit-circle parametrization show that the minimum zero sets are precisely the Baer sublines of \(\PG(1,q^2)\). Equivalently, the corresponding support design is the complement of the non-tangent plane sections of an elliptic quadric \(\Q^-(3,q)\). For constacyclic ovoid codes of length \(q^2+1\) over \(\F_q\), the exact existence criterion is \[ \lambda\in\F_q^*,\qquad \exists\ \lambda\text{-constacyclic ovoid code} \Longleftrightarrow \lambda\notin(\F_q^*)^2. \] In particular, negacyclic ovoid codes exist exactly when \(q\equiv3\pmod4\). The proof uses the corrected projective-order congruence \[ a=(q+1)c,\qquad c\equiv b\pmod{q-1},\qquad \operatorname{ord}(\theta\F_q^*)=\frac{q^2+1}{\gcd(q^2+1,c)}. \] The paper also derives a universal weight enumerator for lifted ovoid codes over extension fields, independent of the chosen ovoid. Finally, consecutive-root negacyclic MDS codes are constructed to give complete simple \(5\)-designs, including a proper negacyclic \([11,5,7]_{23}\) code whose minimum supports form the complete \(5-(11,7,15)\) design.
Read the full abstract

Differential Geometry

Automorphisms of Lie groupoids and symplectic reduction on orbifolds

In this paper, the 2-group BAut(X) of automorphisms of a Lie groupoid X is constructed. Considering the 2-group G action on X, we explain the equivalence between 2-group homomorphisms from G to BAut(X) with Kan fibrations over G with fiber X. This justifies the notion of Kan fibration for 2-group actions on Lie groupoids. As an application, we formulate Hamiltonian actions of étale Lie 2-groups on orbifolds in terms of Kan fibrations and study the symplectic reductions. We show that, in general, the reduction is in fact a symplectic Lie 2-groupoid, and under certain isotropic free condition, the reduction is still an orbifold. Also the slice theorem of a group G action on Lie groupoids is proved.
Read the full abstract

Algebraic Geometry

Generic $\mathcal{A}$-finite determinacy and singularities of homogeneous polynomial mappings

We make a detailed investigation of the generic properties that polynomial mappings possess. An important starting point is the work by Farnik, Jelonek and Ruas in 2019, where they prove some of those properties in the context of homogeneous polynomial mappings of $\mathbb{C}^3$ to $\mathbb{C}^3$, and conclude the genericity of $\mathcal{A}$-finite determinacy by applying the geometric criterion. Using their strategy, we further extend and generalize some of their key findings to dimensions greater than or equal to $2$, though some of those properties can only be extended up to dimension $4$.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.dis-nn

At Most Two Infinite Blue Clusters in the CMR Representation of the Edwards-Anderson Spin Glass

The two-replica Chayes-Machta-Redner (CMR) representation is one of the main proposed geometric signatures of spin-glass order in the short-range Edwards-Anderson model. Mean-field arguments and recent numerics suggest that the low-temperature phase should exhibit two macroscopic blue clusters carrying opposite overlap signs. We prove a rigorous structural constraint in this direction. For any subsequential local weak limit of the standard periodic-torus joint laws on disorder, two spin replicas, and CMR bond variables, the blue subgraph contains at most two infinite connected components; if two exist, then they lie in a common infinite grey cluster and belong to opposite overlap-parity classes. The main obstacle is that the labelled blue geometry does not permit unrestricted insertions across overlap classes, and no positive-association input is available, so the usual Burton-Keane and random-cluster arguments do not apply directly. We isolate an abstract multicolour Burton-Keane proposition based on finite-box label-class coalescence and verify its hypothesis for CMR blue bonds by resampling the full joint measure. As auxiliary input, we establish finite energy and a percolation transition for the grey subgraph via local resampling of the disorder and a parity-based Peierls estimate. These results do not prove the existence of infinite blue clusters or a spin-glass phase transition, but they give a rigorous upper bound compatible with the two-cluster picture for short-range spin glasses.
Read the full abstract

Analysis of PDEs

On the Minimax Bifurcation Formula

We introduce a Rayleigh-quotient minimax method for locating maximal one-sided saddle-node bifurcations in nonlinear equations, including non-variational ones. The method avoids branch continuation and instead selects the critical point directly through the minimax bifurcation formula \[ \lambda^* := \sup_{u\in\mathcal U^o} \inf_{v\in\mathcal S\setminus\{0\}} \mathcal R(u,v), \] where \(\mathcal R\) is a two-variable extended Rayleigh quotient on fixed cones. A saddle point of this quotient simultaneously determines the critical parameter, the bifurcation solution, and the adjoint singularity relation. This gives a direct characterization of the bifurcation threshold and leads to Galerkin minimax approximations, a posteriori parameter-margin estimates, and perturbation bounds for the critical value. The abstract assumptions are verified for nonlinear elliptic systems, including non-potential systems.
Read the full abstract

Combinatorics

The Outerplanar Turán Number of Double Stars

Let $H$ be a nonempty graph. A graph is $H$-free if it does not contain any copy of $H$ as a subgraph. The outerplanar Turán number of $H$, denoted by $ex_{_\mathcal{OP}}(n,H)$, is the maximum number of edges among all $H$-free outerplanar graphs on $n$ vertices. A double star $S_{p,q}$ is the graph obtained from an edge by joining its two endpoints with $p$ and $q$ isolated vertices respectively, where $q \ge p\ge 1$. In this paper, we determine the exact values of $ex_{_\mathcal{OP}}(n,S_{p,q})$ for all $q\ge p\ge 2$, with the sole exception of $p=2$ and $q=3$; for the latter, we establish a lower bound.
Read the full abstract

Probability

Transportation cost inequalities for mean reflection SPDEs with white noise

We establish a quadratic transportation cost inequality under the uniform norm for solutions to mean reflected stochastic partial differential equations, a new type of equation in which the compensating reflection part depends not on the paths but on the law of the solution.

Functional Analysis

Nonuniform Periodic Wavelet Frames on Non-Archimedean Fields

In real life application all signals are not obtained from uniform shifts; so there is a natural question regarding analysis and decompositions of these types of signals by a stable mathematical tool. Gabardo and Nashed and Gabardo and Yu filled this gap by the concept of nonuniform multiresolution analysis and nonuniform wavelets based on the theory of spectral pairs for which the associated translation set $\Lambda =\left\{ 0,r/N\right\}+2\,\mathbb Z$ is no longer a discrete subgroup of $\mathbb R$ but a spectrum associated with a certain one-dimensional spectral pair and the associated dilation is an even positive integer related to the given spectral pair. In this paper, we introduce a notion of nonuniform periodic wavelet frame on non-Archimedean field. Using Fourier transform technique and the unitary extension principle, we propose an approach for the construction of nonuniform periodic wavelet frames on non-Archimedean fields.
Read the full abstract

Commutative Algebra

Factorization in almost Dedekind domain

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional Bézout domain but not a Dedekind domain, and $D$ is an almost Dedekind domain if and only if char$(F) \neq p$. In this paper, we study the element-wise factorization properties of $D$. For example, we determine when an irreducible element of $D_n$ is an irreducible element of $D$, in terms of $n$ and $p$. In particular, we show that if $F$ is algebraically closed or a finite field of char$(F)=p$, then $D$ has no irreducible element. We also show that if $F$ is a finite field of odd characteristic, then an irreducible element $f(X)$ of $D_0$ is irreducible in $D$ if and only if it is a factor of a cyclotomic polynomial $\Phi_n(X)$ for some integer $n \geq 1$ which satisfies a certain equation in terms of $|F|$ and deg$(f(X))$. Finally, we introduce the notion of infinite product and we then show that if $F= \mathbb{Q}$ and $p=2$, every nonzero nonunit of $D$ can be written as a product of countably many prime elements of $D$ and every proper nonzero principal ideal of $D$ can be uniquely written as a countable intersection of principal primary ideals.
Read the full abstract

Optimization and Control

Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm

We study sampling from posterior distributions with nonsmooth composite potentials, a setting in which proximal-based Langevin methods are theoretically appealing but in practice limited to simple functions with closed-form proximal operators. We introduce iPULA for composite potentials, an inexact proximal unadjusted Langevin algorithm that replaces exact proximal steps with controlled approximations. Our approach leverages the Moreau envelope to smooth the potential, while allowing inexact evaluation of its gradient through inexact proximal computations. We establish non-asymptotic convergence guarantees for iPULA, explicitly characterizing the impact of inexactness on the sampling error and showing that the inexactness preserves convergence rates up to a quantifiable bias. We demonstrate the practical relevance of iPULA on a medical image reconstruction task, where proximal operators cannot be computed exactly. Experiments demonstrate the effectiveness of iPULA and support our theoretical results.
Read the full abstract

All authors Susan Ghaderi, Alireza Kabgani, Yves Moreau, Masoud Ahookhosh

Symplectic Geometry

Holomorphic disks and GIT quotients

Let $G$ be a connected compact Lie group and let $\mathbb{G}$ be its complexification. In this paper, we establish a correspondence between the moduli spaces of holomorphic disks bounded by a $G$-invariant Lagrangian submanifold $L \subseteq X$ and those bounded by its quotient $L/G$ in the GIT quotient $X \mathbin{/\mkern-6mu/} \mathbb{G}$. Under suitable positivity and topological assumptions, we derive a computationally effective formula for the disk potential of $L/G$ from that of $L$ via the {semistable disk potential}, which reflects the choice of a level set of a value of the moment map.
Read the full abstract

Information Theory

SERE: A Stabilized Element-Wise Method for Downlink Rate Estimation in Clustered Cell-Free Networks

Clustered cell-free networks have emerged as a promising architecture for sixth generation ultra-dense wireless communication systems by enabling local cooperation among base stations while controlling system complexity. For resource allocation and performance optimization of such networks, accurate and efficient estimation of the ergodic achievable downlink rate is a fundamental prerequisite. Existing rate estimation approaches mainly rely on computationally prohibitive Monte Carlo simulations or adopt random matrix theory-based methods, which have been well-developed for conventional cellular and cell-free networks. However, existing RMT-based methods have not addressed the unique inter-subnetwork interference in clustered cell-free networks, and therefore lack an efficient solution for accurate downlink rate estimation under both regularized zero-forcing and zero-forcing precoding. In this paper, we propose a stabilized element-wise rate estimation method for downlink rate estimation in clustered cell-free networks. We establish the diagonal element-wise convergence of resolvent matrices, which enables the derivation of deterministic equivalents for inter-subnetwork interference and the downlink ergodic rate. We further introduce a stabilized variable transformation to address the numerical instability when the regularization parameter is very small, hereby enabling a unified formulation applicable to both regularized zero-forcing and zero-forcing precoding. Simulation results show that the proposed method achieves a relative error below 6% while significantly reducing computational complexity compared with the Monte Carlo simulation.
Read the full abstract

All authors Panpan Niu, Han Hao, Hao Wu, Junyuan Wang

Probability

Zero correlations and averaged fields of orthonormal Gaussian functions

We consider the family of point processes $\{\mathcal{Z}_{f_{n}}\}_{n=0}^{\infty}$ of zeros of Gaussian random functions $\{f_{n}(z,\overline{z})\}_{n=0}^{\infty} $, arising from the Gaussian Entire Function \[ f_{0}(z):=\sum_{k=0}^{\infty} \zeta_{k} \frac{z^{k}}{\sqrt{k!}}, \quad \zeta_{k} \sim N_{\mathbb{C}}(0,1)\text{ i.i.d.} \] by iteration of the Landau raising operator, and orthonormal at each point in expectation in the sense that \[ \mathbb{E}\left[ e^{-\left\vert z\right\vert^{2}}f_{n}(z,\overline{z})\overline{f_{n^{\prime }}(z,\overline{z})}\right] ={\delta }_{nn'}. \] We first show that the normalized pair correlations $g_{n,n+k}(z,w)$ of the pairs $(\mathcal{Z}_{f_{n}},\mathcal{Z}_{f_{n+k}})$ exhibit a pattern reminiscent of the classical interlacing of zeros of orthogonal polynomials: when $w\rightarrow z$, $g_{n,n+k}$ displays repulsion for $k=1$, attraction for $k=2$, and no short-range second-order correlation for $k \ge 3$. We complement this with the convergence of real-valued averaged fields on compacts $K \subset \mathbb{C}$, \[ \lim_{N \to \infty} \frac{1}{N}\sum_{n=0}^{N-1}\left\vert f_{n}(z,\overline{z})e^{-\frac{\left\vert z\right\vert^{2}}{2}} \right\vert^{2} \rightarrow 1 \quad \text{ almost surely in $C(K)$}, \] and a functional central limit theorem for the corresponding scaled fluctuations, which converge to the Gaussian process \[\mathcal{G}(z) = \frac{1}{\sqrt{\pi}} \int_{\mathbb{C}} \mathbf{1}_{B(z,1)}(u) dW_{\mathbb{R}}(u), \] where $W_{\mathbb{R}}$ denotes real white noise on $\mathbb{C}$ and $B(z,1)$ is the unit disk centered at $z$. The results are motivated by problems in signal processing. Due to an identification with white noise spectrograms, they confirm conjectures of Flandrin and Bayram-Baraniuk and provide a rationale for the efficiency of high resolution time-frequency algorithms, namely ConceFT, by Daubechies, Wang and Wu.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CD

FEG-Pro: Forecast-Error Growth Profiling for Finite-Horizon Instability Analysis of Nonlinear Time Series

Estimating the largest Lyapunov exponent from a scalar time series is difficult when the governing equations, tangent dynamics, and full state vector are unavailable. We propose FEG-Pro, a forecast-error growth profiling framework for nonlinear scalar time series. The method constructs autocorrelation-guided sparse histories, performs distance-weighted k-nearest-neighbor multi-horizon forecasting, and analyzes the logarithmic growth of geometrically averaged forecast errors. Its primary output is the finite-horizon forecast-error growth slope, lambda_FEG. When the error-growth curve supports a quasi-linear regime, this slope can be compared with reference largest Lyapunov exponents as an estimate of the dominant instability rate. The same pipeline also extracts the formal fit-selection regime, curvature, residual roughness after quadratic detrending, monotonicity, and forecast-error distribution entropy (FEDE) from signed multi-horizon errors. These secondary descriptors are intended not only as diagnostic controls for the slope, but also as candidate machine-learning features for nonlinear signal analysis, because they encode profile geometry and distributional uncertainty not captured by lambda_FEG alone. We evaluate the method on chaotic maps, Mackey-Glass delay dynamics, and scalar Lorenz-63 observables with known or reference exponents. Full-record experiments show good agreement in quasi-linear cases and meaningful curve-shape information in curved or weak profiles. A dyadic length-halving experiment on representative logistic, Mackey-Glass, and Lorenz records shows that residual roughness and mean FEDE often change monotonically and remain interpretable as record length decreases, even when the slope becomes biased or highly variable. The results support treating forecast-error growth as a structured profile and feature-generation framework rather than a single-number estimator.
Read the full abstract

All authors Andrei Velichko, N'Gbo N'Gbo, Bruno Carpentieri, Mudassir Shams

Rings and Algebras

Varieties and quasivarieties of lattices with complementation

We investigate (quasi)varieties of lattices with complementation, i.e., complemented lattices equipped with a fixed complementation as a unary operation. We focus on subclasses satisfying additional conditions, such as the quasi-identity $({x'\wedge y\approx 0} \;\&\; {x\wedge y'\approx 0})$ $\Rightarrow x\approx y$, modularity, or De Morgan's laws. We present a construction resembling a semidirect product that yields infinitely many finite subdirectly irreducible modular lattices with complementation satisfying this quasi-identity. We axiomatize small varieties, each of which covers the variety of Boolean algebras, generated by certain small modular lattices with De Morgan complementation.
Read the full abstract

All authors V. Cenker, I. Chajda, J. Kühr, H. Länger

Information Theory

ISI Modeling and BER Performance for Rotating Light-Trail Image Sensor Communication

Image sensor communication (ISC) employing a propeller-LED transmitter encodes data along rotating light trails. We present an analytical framework that (i) constructs a single-LED, single-blink light trail model that maps optical power to pixel values, and (ii) integrates a probabilistic noise model to derive a closed-form bit-error rate (BER) using the $Q$-function. Trimodal pixel-value histograms motivate an adjacent-only inter-symbol interference (ISI) model in which the decision at segment $j$ depends on adjacent segments. Applying a hardest-pair midpoint threshold yields per-segment BER and a general BER after marginalization. We further provide practical sufficiency conditions under which adjacent-only ISI is adequate, and validate its tightness against Monte Carlo simulations and experimental results. Using the analytical BER, we select the control angle that maximizes throughput while satisfying a target BER reliability constraint.
Read the full abstract

All authors Shin Asaoka, Shan Lu, Zhengqiang Tang, Takaya Yamazato

Optimization and Control

Scalable Bi-causal Optimal Transport via KL Relaxation and Policy Gradients

Bi-causal optimal transport (OT) is a natural framework for comparing and coupling stochastic processes under nonanticipative information constraints, with important applications in robust finance, sequential uncertainty quantification, and multistage stochastic optimization. In particular, a learned bi-causal coupling naturally serves as a simulator for generating joint sample paths that respect both prescribed marginal laws and the underlying information flow. Its practical use, however, is limited by the computational difficulty of enforcing bi-causal coupling constraints over path space, especially for continuous distributions and long horizons. We develop a scalable stochastic-optimization framework for computing bi-causal OT couplings under general marginals. Our approach introduces a Kullback–Leibler (KL)-penalized relaxation that replaces hard marginal constraints with tractable divergence penalties while preserving the recursive structure of the problem. We establish dynamic programming principles for both the original and relaxed formulations, prove that the relaxed problem converges to the original bi-causal OT problem as the penalty grows, and derive explicit policy-gradient representations for the relaxed objective. Building on these results, we propose a practical policy-gradient algorithm with unbiased mini-batch estimators, variance reduction, and nonasymptotic regret guarantees. Numerical experiments show that the method accurately captures marginal laws and temporal dependence, and performs well in applications including robust subhedging and time series statistical downscaling. These results provide a scalable computational approach to bi-causal OT and broaden its applicability in settings where nonanticipative information constraints are essential.
Read the full abstract

All authors Haoyang Cao, Jesse Hoekstra, Renyuan Xu, Yumin Xu, Ruixun Zhang