Commutative Algebra
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 4 March
The small finitistic dimension fPD$(R)$ of a ring $R$ is defined to be the supremum of projective dimensions of $R$-modules with finite projective resolutions. In this paper, we show that a commutative ring $R$ has fPD$(R)\leq d$ if and only if for any finitely generated ideal $I$ of $R$, if $Ext_R^i(R/I,R)=0$ for each $i=0,\dots,d$, then $Ext_R^i(R/I,R)=0$ for all $i\geq 0.$ As applications, we obtain that, for any commutative ring $R$, fPD$(R)\leq \mbox{FP-}Id_RR$, the self-FP-injective dimension of $R$. We also give some applications of these results to (weak) $(n,d)$-rings, DW-rings and rings of Prufer type.
Numerical Analysis
A scalar auxiliary variable-based semi-implicit scheme for stochastic Cahn–Hilliard equation
In this paper, we present a novel semi-implicit numerical scheme for the stochastic Cahn–Hilliard equation driven by multiplicative noise. By reformulating the original equation into an equivalent stochastic scalar auxiliary variable (SSAV) system, our method enables an efficient and stable treatment of polynomial nonlinearities in a semi-implicit fashion. In order to accurately capture the impact of stochastic perturbations, we carefully incorporate Itô correction terms into the SSAV approximation. Leveraging the smoothing properties of the underlying semigroup and the $H^{-1}$-dissipative structure of the nonlinear term, we establish the optimal strong convergence order of one-half for the proposed scheme in the trace-class noise case. Moreover, we show that the modified SAV energy asymptotically preserves the energy evolution law. Finally, numerical experiments are provided to validate the theoretical results and to explore the influence of noise near the sharp-interface limit.
Read the full abstract
Optimization and Control
An Adaptive KKT-Based Indicator for Convergence Assessment in Multi-Objective Optimization
Performance indicators are essential tools for assessing the convergence behavior of multi-objective optimization algorithms, particularly when the true Pareto front is unknown or difficult to approximate. Classical reference-based metrics such as hypervolume and inverted generational distance are widely used, but may suffer from scalability limitations and sensitivity to parameter choices in many-objective scenarios. Indicators derived from Karush–Kuhn–Tucker (KKT) optimality conditions provide an intrinsic alternative by quantifying stationarity without relying on external reference sets. This paper revisits an entropy-inspired KKT-based convergence indicator and proposes a robust adaptive reformulation based on quantile normalization. The proposed indicator preserves the stationarity-based interpretation of the original formulation while improving robustness to heterogeneous distributions of stationarity residuals, a recurring issue in many-objective optimization.
Read the full abstract
Functional Analysis
Localization operators on Bergman and Fock spaces
We introduce localization operators on weighted Bergman and Fock spaces and show that, under a natural scaling of symbols and window functions, localization operators on the weighted Bergman space $A_{\beta r^2}^2$ converge, in the weak sense, to localization operators on the Fock space $F_{\beta}^2$ as $r\to\infty$. From this we derive several applications, including one about sharp norm estimates for certain Toeplitz operators on Fock spaces, one about windowed Berezin transforms for weighted Bergman spaces, and another about Szegö-type theorems for localization operators on weighted Bergman spaces.
Read the full abstract
Algebraic Geometry
Differential Goppa Codes
Rosenbloom and Tsfasman, in their foundational work on the $m$-metric, introduced algebraic-geometric codes defined by multiple points on a smooth projective curve $X$. This construction involves a divisor $G$ and another divisor $D=\sum n p_i$, where $p_i$ are distinct rational points with $p_i \notin \text{supp}(G)$ and $n\in\mathbb{N}$. Although these codes are significant, their formal development for arbitrary genus remains incomplete in the literature, as most studies have concentrated on the genus $0$ case. We present a rigorous treatment of this class of codes. Starting with a smooth projective curve $X$, an invertible sheaf $L$, and an effective divisor $D=\sum n_i p_i$ where the $n_i$ are not necessarily equal, as well as tuples of uniformizers $t_D$ at the points of $D$ and trivializations $\gamma_D$ for the localizations $L_{p_i}$, the associated differential Goppa code is defined. This code arises from the theory of $n$-jets of invertible sheaves on curves, which enables the description of codewords using Hasse-Schmidt derivatives of sections of $L$. The variation of the code under changes in the data $(t_D, \gamma_D)$ is examined, and the group acting on these parameters is described. The behavior of the minimum Hamming distance under such variations is analyzed, with explicit examples provided for curves of genus $0$ and $1$. A duality theorem is established, involving principal parts of meromorphic differential forms. It is demonstrated that Goppa codes constitute a proper subclass of differential Goppa codes, and that every linear code admits a differential Goppa code structure on $\mathbb P^1$ using only two rational points.
Read the full abstract
Logic
A new ultrafilter proof of Van der Waerden's theorem
We present a new short proof of Van der Waerden's Theorem about the existence of arbitrarily long monochromatic arithmetic progressions. The proof uses algebra in the compact space of ultrafilters $\beta\N$, but contrarily to the other existing proofs, neither minimal nor idempotent ultrafilters are involved.
Read the full abstract
Analysis of PDEs
Rapid stabilization of general linear systems with F-equivalence
We study the rapid stabilization of general linear systems, when the differential operator $\mathcal{A}$ has a Riesz basis of eigenvectors. We find simple sufficient conditions for the rapid stabilization and the construction of a relatively explicit feedback operator. We use an $F$-equivalence approach \textcolor{black}{relying on Fredholm transformation} to show a stronger result: under these sufficient conditions the system is equivalent to a simple exponentially stable system, with arbitrarily large decay rate. In particular, our conditions improve the existing conditions of rapid stabilization for non-parabolic operators such as skew-adjoint systems.
Read the full abstract
Statistics Theory
On the generalized circular projected Cauchy distribution
\cite{tsagris2025a} proposed the generalized circular projected Cauchy (GCPC) distribution, whose special case is the wrapped Cauchy distribution. In this paper we first derive the relationship with the wrapped Cauchy distribution, and then we attempt to characterize the distribution. We establish the conditions under which the distribution exhibits unimodality. We provide non-analytical formulas for the mean resultant length and the Kullback-Leibler divergence, and analytical form for the cumulative probability function and the entropy of the GCPC distribution. We propose log-likelihood ratio tests for one, or two location parameters without assuming equality of the concentration parameters. We revisit maximum likelihood estimation with and without predictors. In the regression setting we briefly mention the addition of circular and simplicial predictors. Simulation studies illustrate a) the performance of the log-likelihood ratio test when one falsely assumes that the true distribution is the wrapped Cauchy distribution, and b) the empirical rate of convergence of the regression coefficients. Using a real data analysis example we show how to avoid the log-likelihood being trapped in a local maximum and we correct a mistake in the regression setting.
Read the full abstract
Number Theory
Explicit p-adic Hodge theory for elliptic curves and non-split Cartan images
Let $E/\mathbb{Q}_p$ be an elliptic curve whose mod $p$ Galois image is contained in the normaliser of a non-split Cartan. We classify the possible $p$-adic images of $E$ using tools from $p$-adic Hodge theory via a careful analysis of the local Galois structure of the $p$-power torsion of $E$. We pay special attention to the case where $E$ has potentially supersingular reduction, where we give an algorithm to determine the corresponding filtered $(\varphi,\operatorname{Gal}(K/\mathbb{Q}_p))$-module from a Weierstrass model (which appears to be novel), and introduce alternative division polynomials that may be of independent interest. We deduce global consequences for elliptic curves $E/\mathbb{Q}$: when the mod $p$ representation of $E$ has non-split Cartan image and $E$ doesn't have CM, the $p$-adic image must be the full preimage of the normaliser of a mod $p^n$ non-split Cartan for some $n \geq 1$. As an application, we sharpen existing bounds on the adelic image in terms of the Weil height of the $j$-invariant.
Read the full abstract
Operator Algebras
Invariant measures and traces on groupoid $\boldsymbol{\mathrm{C}^\ast}$-algebras
We provide sufficient conditions for the existence of a trace on the essential $\mathrm{C}^\ast$-algebra of a (not necessarily Hausdorff) étale groupoid $G$ which extends an invariant measure $\mu$ on the unit space of $G$. In particular, it suffices for the isotropy groups of $G$ to be amenable, or for $G$ to be essentially free with respect to $\mu$. We also show that $G$ is essentially free with respect to an invariant measure $\mu$ if and only if $\mu$ extends to a unique trace on the full $\mathrm{C}^\ast$-algebra of $G$. We work in the generality of possibly infinite measures and, accordingly, possibly unbounded traces. Moreover, whenever possible, we state our results for twisted groupoids. As an application, we show that gauge-invariant algebras of finite-state self-similar groups admit a unique tracial state.
Read the full abstract
Logic · Cross-listed from cs.LO
Non-Derivability Results in Polymorphic Dependent Type Theory
In the pure Calculus of Constructions (CC) one can define data types and function over these, and there is a powerful higher order logic to reason over these functions and data types. This is due to the combination of impredicativity and dependent types, and most of these features can already be observed in polymorphic (second order) dependent type theory $\lambda$P2. The impredicative encoding of data types (in $\lambda$P2 or CC) is powerful but not fully satisfactory: for example, the induction principle is not provable. As a matter of fact, it can be shown that induction is not provable for whatever possible representation of data types. In a recent paper, Awodey, Frey and Speight show that in an extension of $\lambda$P2 with Sigma-types, identity types with uniqueness of identity proofs and function extensionality, it is possible to define data types for which the induction principle is provable. More recently it has been shown that in this extension of $\lambda$P2, also quotient types can be defined with the proper induction principle, and, using quotient types, coinductive types can be defined with the proper coinduction principle. This leaves various questions open: Are quotient types with induction principle not definable in the original $\lambda$P2? And how about coinductive types, is it impossible to get a strong coinduction principle in $\lambda$P2? Looking at it from the other side: which of the extensions used are really needed to make induction and coinduction work? In this paper, we contribute partial answers to these questions: parametric quotient types are not definable in $\lambda$P2 and the well-known definable stream type does not have a coinduction principle. For the latter question we show that, if we just extend $\lambda$P2 with Sigma-types and identity types with uniqueness of identity proofs, we still cannot prove an induction principle for the natural numbers. So function extensionality is crucial in making induction provable. We show these results by studying models of $\lambda$P2 where the types representing these principles are empty, so these models act as counter models to the derivability of the principles.
Read the full abstract
Information Theory
Training-Free Rate-Distortion-Perception Traversal With Diffusion
The rate-distortion-perception (RDP) tradeoff characterizes the fundamental limits of lossy compression by jointly considering bitrate, reconstruction fidelity, and perceptual quality. While recent neural compression methods have improved perceptual performance, they typically operate at fixed points on the RDP surface, requiring retraining to target different tradeoffs. In this work, we propose a training-free framework that leverages pre-trained diffusion models to traverse the entire RDP surface. Our approach integrates a reverse channel coding (RCC) module with a novel score-scaled probability flow ODE decoder. We theoretically prove that the proposed diffusion decoder is optimal for the distortion-perception tradeoff under AWGN observations and that the overall framework with the RCC module achieves the optimal RDP function in the Gaussian case. Empirical results across multiple datasets demonstrate the framework's flexibility and effectiveness in navigating the ternary RDP tradeoff using pre-trained diffusion models. Our results establish a practical and theoretically grounded approach to adaptive, perception-aware compression.
Read the full abstract
Quantum Algebra · Cross-listed from quant-ph
Spectrally Corrected Polynomial Approximation for Quantum Singular Value Transformation
Quantum Singular Value Transformation (QSVT) provides a unified framework for applying polynomial functions to the singular values of a block-encoded matrix. QSVT prepares a state proportional to $\bA^{-1}\bb$ with circuit depth $O(d\cdot\mathrm{polylog}(N))$, where $d$ is the polynomial degree of the $1/x$ approximation and $N$ is the size of $\bA$. Current polynomial approximation methods are over the continuous interval $[a,1]$, giving $d = O(\sqrt{\kap}\log(1/\varepsilon))$, and make no use of any properties of $\bA$. We observe here that QSVT solution accuracy depends only on the polynomial accuracy at the eigenvalues of $\bA$. When all $N$ eigenvalues are known exactly, a pure spectral polynomial $p_{S}$ can interpolate $1/x$ at these eigenvalues and achieve unit fidelity at reduced degree. But its practical applicability is limited. To address this, we propose a spectral correction that exploits prior knowledge of $K$ eigenvalues of $\bA$. Given any base polynomial $p_0$, such as Remez, of degree $d_0$, a $K\times K$ linear system enforces exact interpolation of $1/x$ only at these $K$ eigenvalues without increasing $d_0$. The spectrally corrected polynomial $p_{SC}$ preserves the continuous error profile between eigenvalues and inherits the parity of $p_0$. QSVT experiments on the 1D Poisson equation demonstrate up to a $5\times$ reduction in circuit depth relative to the base polynomial, at unit fidelity and improved compliance error. The correction is agnostic to the choice of base polynomial and robust to eigenvalue perturbations up to $10\%$ relative error. Extension to the 2D Poisson equation suggests that correcting a small fraction of the spectrum may suffice to achieve fidelity above $0.999$.
Read the full abstract
Logic
Robinson Splitting Theorem and $\Sigma_1$ Induction
Rings and Algebras
Classification of Nottingham algebras
The graded Lie algebra associated with the Nottingham group over a field of prime characteristic serves as a fundamental example of Nottingham algebras, a class of infinite-dimensional, positively graded thin algebras. This paper completes the classification of Nottingham algebras initiated in earlier papers, proving both existence and uniqueness results that determine all such algebras up to isomorphism.
Read the full abstract
Probability
Strong and weak convergence rates for slow-fast system driven by multiplicative Lévy noises
This paper establishes strong and weak convergence rates for slow-fast systems driven by $\alpha$-stable processes with jump coefficients. Unlike existing studies on multiscale systems driven by additive Lévy white noise, our model incorporates multiplicative noise, which brings essential challenges in deriving the exponential ergodicity for the frozen process, particularly gradient estimates. We derive exponential ergodicity in two different ways: the coupling method and the spatial periodic method; then the gradient estimate is developed by heat kernel asymptotic expansion. Moreover, under sufficient Hölder regularity of the time-dependent coefficients of the slow process, we can yield an optimal strong convergence rate of order $1-\frac{1}{\alpha_{2}}$ and a weak convergence rate of order 1. Furthermore, explicit formulas for the tangent map between tangent spaces of $S^{d-1}$ as well as its Jacobian determinant are obtained, where the map is induced by a nonlinear immersion.
Read the full abstract
Probability
A note on outlier eigenvectors for sparse non-Hermitian perturbations
We consider a sparse i.i.d.\ non-Hermitian random matrix model $X_n$ (with sparsity parameter $K_n$) and a deterministic finite-rank perturbation $E_n$. Assuming biorthogonality for $E_n$ and a growth condition on $K_n$, we outline a finite-rank resolvent reduction leading to asymptotics for the overlap between an outlier eigenvector of $Y_n:=X_n+E_n$ and the corresponding spike eigenspace. In particular, for an outlier spike $\mu$ with $|\mu|>1$, the squared projection of the associated (right) eigenvector onto the spike eigenspace converges in probability to $1-|\mu|^{-2}$. Our result generalizes Theorem 1.6 of [HLN26] to general finite rank case solving Open Problem 5.
Read the full abstract
Combinatorics
Spectral radius and rainbow Hamiltonicity in bipartite graphs
Let $\mathcal{G}=\{G_1, G_2, \ldots , G_k\}$ be a family of bipartite graphs on the same vertex set. A rainbow Hamilton path (cycle) in $\mathcal{G}$ is a path (cycle) that visits each vertex precisely once such that any two edges belong to different graphs of $\mathcal{G}.$ In this paper, by adopting the technique of bi-shifting, we present tight sufficient conditions in terms of the spectral radius for a family $\mathcal{G}$ to admit a rainbow Hamilton path and cycle, respectively. Meanwhile, we completely characterize the corresponding spectral extremal graphs.
Read the full abstract
Functional Analysis
Refined numerical radius estimates and Euclidean operator radius
We obtain new lower and upper bounds for the numerical radius of a bounded linear operator $A$ on a complex Hilbert space, which refine the existing ones. In particular, if $w(A)$ and $\|A\|$ denote the numerical radius and operator norm of $A$, respectively, then we show that \begin{eqnarray*} \nu(A) + \frac{1}{4} \left\||A|^2+|A^*|^2\right\| \leq w^2(A) \leq \frac12 w\left(\frac{|A|+|A^*|}{2}A \right)+ \frac14 \left\| |A|^2+ \left( \frac{|A|+|A^*|}{2}\right)^2 \right\|, \end{eqnarray*} where $\nu(A)\geq 0$ is a real number involving the operator norm of the Cartesian decomposition of $A$. We also develop several new numerical radius inequalities for the products and sums of operators via Euclidean operator radius of $2$-tuples of operators. In addition, we deduce equality characterizations for the inequalities. As an application, we obtain numerical radius inequalities for the commutators of operators, which improves the Fong and Holbrook's inequality $w(AB\pm BA) \leq 2\sqrt{2} w(A) \|B\|$ [Canadian J. Math. 1983].
Read the full abstract
Functional Analysis
Localized locally convex topologies
Motivated by ill-posed PDEs such as $\mathrm{div} (v) = F$ we study locally convex topologies $\mathcal{T}_{\mathcal{C}}$ on real vector spaces $X$ that are a “localized” version of a locally convex topology $\mathcal{T}$ to members of a family $\mathcal{C}$ of convex subsets of $X$. The distributions $F$ arising as $\mathrm{div} (v)$ are expected to be the members of the dual of well-chosen $X$ with respect to an appropriate localized topology $\mathcal{T}_{\mathcal{C}}$. In this work, the emphasis is on studying the functional analytic properties of $\mathcal{T}_{\mathcal{C}}$, according to those of $\mathcal{T}$ and $\mathcal{C}$. For instance, we show that in all foreseen applications, $\mathcal{T}_{\mathcal{C}}$ is sequential but none of Fréchet-Urysohn, barrelled, and bornological. These awkward phenomena are illustrated explicitly on a specific example corresponding to the distributional divergence of continuous vector fields in $\mathbb{R}^m$. We also show that, essentially, $\mathcal{T}_{\mathcal{C}}$ is semireflexive if and only if members of $\mathcal{C}$ are $\mathcal{T}$-compact. This leads to an abstract existence theorem, thereby establishing a general scheme for characterizing those $F$ such that $\mathrm{div} (v) = F$ for various classes of regularity of $v$, various classes of domains, and various boundary conditions.
Read the full abstract
Information Theory
Distributed vs. Centralized Precoding in Cell-Free Systems: Impact of Realistic Per-AP Power Limits
In cell-free massive MIMO, centralized precoding is {theoretically known} to {remarkably} outperform its distributed counterparts, albeit {with} high implementation complexity. However, this letter highlights a practical limitation {often overlooked:} {widely used closed-form} centralized {precoders} are typically derived under a sum-power constraint, which often demands unrealistic power allocation that exceeds hardware capabilities. {When two simple heuristics (global power scaling and local normalization) are applied to enforce the per-AP instantaneous power constraint}, the centralized performance superiority disappears, making distributed precoding {a robust option}.
Read the full abstract
Optimization and Control
Identification of Nonlinear Acyclic Networks in Continuous Time from Nonzero Initial Conditions and Full Excitations
This paper addresses the identifiability and identification of nonlinear acyclic networks in continuous time when the dynamics are located on the edges and all the nodes are excited. First, we establish necessary and sufficient conditions for network identifiability. We show that it is necessary and sufficient to measure all the sinks to identify any tree in continuous time when the functions associated with the dynamics are analytic and satisfy $f(0)=0$, which is analogous to the discrete-time case. We then extend the result to general directed acyclic graphs (DAGs), showing that it is necessary and sufficient to measure all sinks when the dynamics are not linear (a condition that can be relaxed for trees). Next, based on these identifiability results and under the assumption of known dictionary functions, we introduce a method for the identification of trees that exploits higher order derivatives and nonzero initial conditions. Finally, we propose a method to identify multiple parallel paths of the same length between two nodes, which allows us to identify any DAG when combined with the algorithm for the identification of trees. Several examples are added to illustrate the results.
Read the full abstract
Information Theory
Joint Gaussian Beam Pattern and Its Optimization for Positioning-Assisted Systems
Beamforming is a fundamental technology that not only enhances communication efficiency but also lays the foundation for massive multiple-input multiple-output~(MIMO) systems. However, its reliance on accurate channel state information (CSI) estimation introduces significant training overhead and feedback costs, especially in large-scale antenna systems. In this paper, we investigate positioning-assisted beamforming as a competitive alternative to the CSI-based methods, which circumvents the complicated CSI estimation. In particular, we analyze the outage probability of positioning-assisted systems with joint Gaussian beams and derive its closed-form expressions for both two-dimensional~(2D) and three-dimensional~(3D) scenarios. Based on these results, we also derive closed-form expressions for the optimal joint Gaussian beam pattern. The optimal solution is independent of the positioning error distribution in 2D scenarios but depends on it in 3D cases. Subsequently, the asymptotic performance of the approximation error is analyzed. Numerical results verify the derived outage probability expressions, and show the effectiveness of the beam pattern optimization.
Read the full abstract
Numerical Analysis
Multivariate Data-dependent Partition of Unity based on Moving Least Squares method
Data approximation is essential in fields such as geometric design, numerical PDEs, and curve modeling. Moving Least Squares (MLS) is a widely used method for data fitting; however, its accuracy degrades in the presence of discontinuities, often resulting in spurious oscillations similar to those associated with the Gibbs phenomenon. This work extends the integration of MLS with the Weighted Essentially Non-Oscillatory (WENO) method and with an innovative partition of unity approach to higher dimensions. We propose a data-dependent operator using the novel Non-Linear Partition of Unity based on Moving Least Squares method in $\mathbb{R}^n$, which improves accuracy near discontinuities and maintains high-order accuracy in smooth regions. We demonstrate some theoretical properties of the method and perform numerical experiments to validate its effectiveness.
Read the full abstract
Numerical Analysis
A Structure-Exploiting Implicit-Explicit Trust Region Method for Computing Second-Order Stationary Points of the Landau-Brazovskii Model
This work focuses on the reliable computation of second-order stationary points in the high-dimensional nonconvex energy landscape of the Landau-Brazovskii (LB) model, a fundamental model for studying phases and phase transitions. For this purpose, we develop an efficient implicit-explicit trust region (IMEX-TR) method. Trust region (TR) methods can avoid saddle-point stagnation and guarantee convergence to second-order stationary points under appropriate conditions. However, their direct application to the LB model has been impractical because the Hessian is dense if treated directly. The proposed IMEX-TR method overcomes this difficulty by exploiting the Hessian's special structure: the linear interaction part is diagonal in reciprocal space, whereas the nonlinear bulk-energy part is diagonal in physical space. Based on this structure, we design an efficient solver for the TR subproblem that with globally convergent guarantee and enjoys FFT-based acceleration, with $\mathcal O(N \log N)$ complexity per iteration. Existing first-order gradient-based methods for the LB model only guarantee convergence to first-order stationary points and may stagnate at saddle points. In contrast, the proposed IMEX-TR method inherits the theoretical guarantee of converging to second-order stationary points while remaining computationally practical. Numerical experiments verify the theoretical properties of the algorithm and demonstrate its robustness in locating stable phases from different initial conditions. Numerical results also show that IMEX-TR can escape unstable stationary states reached by first-order schemes and converge to physically meaningful second-order stationary points. These results suggest that targeting second-order stationary points provides an effective computational paradigm for exploring complex free-energy landscapes and identifying stable or metastable states.
Read the full abstract
Optimization and Control · Cross-listed from physics.ao-ph
A Structurally Localized Ensemble Kalman Filtering Approach
State-of-the-art ensemble Kalman filtering (EnKF) algorithms require incorporating localization techniques to cope with the rank deficiency and the inherited spurious correlations in their error covariance matrices. Localization techniques are mostly ad-hoc, based on some distances between the state and observation variables, requiring demanding manual tuning. This work introduces a new ensemble filtering approach, which is inherently localized, avoiding the need for any auxiliary localization technique. Instead of explicitly applying localization on ensembles, the idea is to first localize the continuous analysis probability density function (pdf) before ensemble sampling. The localization of the analysis pdf is performed through an approximation by a product of independent marginal pdfs corresponding to small partitions of the state vector, using the variational Bayesian optimization. These marginals are then sampled following stochastic EnKF and deterministic ensemble transform Kalman filtering (ETKF) procedures, using ensembles larger than the partitions' size. The resulting filters involve the same forecast steps as their standard EnKF and ETKF counterparts but different analysis steps, iteratively adjusting the EnKF and ETKF updates of each partition based on the ensemble means of the other partitions. Numerical experiments are conducted with the Lorenz-96 model under different scenarios to demonstrate the potential of the proposed filters. The new filters' performances are comparable to those of the EnKF and ETKF with already tuned localization, both in terms of computational burden and estimation accuracy.
Read the full abstract
Algebraic Geometry
Principal twistor models and asymptotic hyperkähler metrics
Let $X$ be a conical symplectic variety admitting a crepant resolution $Y$. Based on the theory of universal Poisson deformations, we construct a complex manifold called the principal twistor model associated with $Y$. We prove a universality theorem for this model: if the regular locus of $X$ admits an algebraic hyperkähler cone metric $g_0$, then the twistor space of any algebraic hyperkähler metric on $Y$ asymptotic to $g_0$ is uniquely recovered by slicing the principal twistor model. As an application, we use this universality to study the moduli space of algebraic hyperkähler structures with asymptotic behavior. We show that this moduli space admits an inclusion into a finite-dimensional real vector space, and furthermore, that this inclusion is an open embedding when $X$ has an isolated singularity.
Read the full abstract
Combinatorics
On the Adjacency spectra of alternating-oriented $n$-gonal staircase digraphs
For integers $n \ge 3$ and $r \ge 1$, let $\Gamma_{n,r}$ be the alternating-oriented digraph obtained by gluing $r$ directed $n$-cycles along a single edge in a staircase pattern, and let $A_{n,r}$ be its adjacency matrix. A canonical $n$-layer partition puts $A_{n,r}$ into an $n$-cyclic block form and isolates a cyclic product core $K_{n,r}$, so the nonzero spectrum of $A_{n,r}$ is obtained from that of $K_{n,r}$ by taking $n$th roots. We show that $K_{n,r}$ is totally nonnegative and irreducible, and hence its nonzero eigenvalues are real, positive, and simple. It follows that all nonzero eigenvalues of $A_{n,r}$ are simple and occur in $\exp(2\pi i/n)$-orbits, forming unions of regular $n$-gons in the complex plane. A one-step Schur complement yields a three-term recursion in $r$ for the characteristic polynomials $\Phi_{n,r} \in \mathbb{Z}[x]$. This determines both the multiplicity of the eigenvalue $0$ and the number of nonzero eigenvalues, and leads to a generating function with cubic denominator. Applying a Tran-type confinement theorem gives the uniform bound $\rho(A_{n,r}) \le (27/4)^{1/n}$ and the sharp limit $\displaystyle\lim_{r \to \infty} \rho(A_{n,r}) = (27/4)^{1/n}$ for each fixed $n$. Finally, specializing at $x=1$ relates $\Phi_{n,r}(1)$ to Padovan spiral numbers and yields a complete classification of rational nonzero eigenvalues.
Read the full abstract
Analysis of PDEs
From maximal entropy exclusion process to unitary Dyson Brownian motion and free unitary hydrodynamics
We investigate the Maximal Entropy Simple Symmetric Exclusion Process (MESSEP) on a discrete ring with L sites and N indistinguishable particles. Its eigenfunctions are Schur polynomials evaluated at the L-th roots of unity, yielding an explicit spectral decomposition. The analysis relies on this eigenstructure and on the link between Schur polynomials and irreducible characters of the symmetric group, which forms the core algebraic tool for the scaling limits. In the low-density regime, where N is fixed and L tends to infinity, the rescaled dynamics converge to the Unitary Dyson Brownian Motion (UDBM). The electrostatic repulsion then emerges as an entropic force, providing a canonical microscopic derivation of the UDBM. In the hydrodynamic regime, where N is equivalent to $\alpha$L with $\alpha$ P p0, 1q, the empirical measure converges to a density solving a nonlinear, nonlocal transport equation. Its moment generating function satisfies a complex Burgers-type equation. As $\alpha$ tends to 0, this equation coincides with that governing the spectral distribution of the Free Unitary Brownian Motion (FUBM), thereby bridging discrete entropic exclusion dynamics and free unitary hydrodynamics. Overall, the MESSEP provides a unified canonical discrete framework connecting unitary Dyson motion and free unitary Brownian motion through nonlinear hydrodynamic limits, with Schur and character theory as the central algebraic structure.
Read the full abstract
Classical Analysis and ODEs
Asymptotic sharpness of a Nikolskii type inequality for rational functions in the Wiener algebra
We establish the asymptotic sharpness of a Nikolskii type inequality proved by A. Baranov and R. Zarouf for rational functions $f$ in the Wiener algebra of absolutely convergent Fourier series, with at most $n$ poles, all lying outside the dilated disc $\frac{1}{\lambda}\mathbb{D}$, where $\mathbb{D}$ denotes the open unit disc and $\lambda\in[0,1)$ is fixed. More precisely, this inequality tells that the Wiener norm of such functions is bounded by their $H^{2}$-norm – i.e., their norm in the Hardy space of the disc – times a factor of order $\sqrt{\frac{n}{1-\lambda}}$. In this paper, we construct explicit test functions showing that this bound cannot be improved in general: the inequality is asymptotically sharp as $n\to\infty$, up to a universal constant, for every fixed $\lambda\in[0,1)$.