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)

Wednesday 13 May

Optimization and Control · Cross-listed from cs.CV

Image AID via continuous-time reinforcement learning

We study image inpainting with generative diffusion models. Existing methods typically either train dedicated task-specific models, or adapt a pretrained diffusion model separately for each masked image at deployment. We introduce a middle-ground model, termed Amortized Inpainting with Diffusion (AID), which keeps a pretrained diffusion backbone fixed, trains a small reusable guidance module offline, and then reuses it across masked images without per-instance optimization. We formulate it as a deterministic guidance problem with a supervised terminal objective. To make this problem learnable in high dimensions, we derive an auxiliary Gaussian formulation and prove that solving this randomized problem recovers the optimal deterministic guidance field. This bridge yields a principled continuous-time actor–critic algorithm for learning the guidance module in a fully data-driven manner. Empirically, on AFHQv2 and FFHQ under the pixel EDM pipeline and on ImageNet under the latent EDM2 pipeline, AID consistently improves the quality–speed trade-off over strong fixed-backbone and amortized inpainting baselines across multiple mask types, while adding less than one percent trainable overhead.
Read the full abstract

Information Theory

Classification of ternary maximal self-orthogonal codes of length 25

Ternary maximal self-orthogonal codes have been classified for lengths up to $24$. In this note, we provide a complete classification of ternary maximal self-orthogonal codes of length $25$.

Probability

Orientation in Poisson Cluster Processes via Imaginary Bispectra

We study what remains detectable about one-sided Poisson cluster processes after cluster orientation is erased. We construct matched reversible cluster nulls preserving intensity and the full Bartlett spectrum, showing that second-order structure alone need not identify temporal direction. For stationary Poisson branching clusters, we derive the Fourier–Stieltjes transform of the reduced third cumulant and show that, in the $L^1$ third-cumulant regime, a nonzero imaginary factorial bispectrum certifies orientation. We also give explicit orientation-erased nulls, reversible spectral matches for monotone Hawkes kernels, and finite-window third-order orientation contrasts.
Read the full abstract

All authors Conor Kresin, Yifu Tang, Boris Baeumer, Ting Wang

Combinatorics

Dyck Symmetric Functions and Applications to \(q,t\)-Catalan Polynomials

This paper develops three related combinatorial results for Dyck-type sequences. First, it constructs a row-insertion algorithm for dual Dyck sequences and extends it to Dyck tableaux. This construction gives a weight-preserving bijection between dual Dyck factorizations and pairs consisting of a Dyck tableau and a semistandard Young tableau of the same shape. As a consequence, the associated dual Dyck symmetric functions are Schur-positive, and the corresponding affine Dyck symmetric functions have the conjugate-shape Schur expansion. Second, it applies these Dyck symmetric functions to the \(q,t\)-Catalan polynomial. It gives a two-column tableau formula for \(C_n(q,t)\), expressing it as a sum over Dyck \(m\)-skeletons and at-most-two-column Dyck tableaux with summands involving two-variable Schur functions. Third, it develops a Dyck-skeleton formula for the deficit range \(\defc\le 2n-8\). Full and special Dyck skeletons, together with local \(\mathrm{East}\), \(\mathrm{West}\), \(\mathrm{up}\), and \(\mathrm{down}\) moves, organize the low-area half of each low-deficit slice into skeleton-indexed strings. The \(q,t\)-symmetry of \(C_n(q,t)\) supplies the complementary high-area half in the resulting interval formula.
Read the full abstract

Information Theory

Grouped Annulus-Modulated Transceiver Is Almost Full DoF-Achieving for RIS-Assisted Symbiotic Radios Over Spatial-Correlated Channels

This paper considers a RIS-assisted symbiotic communication system, where additional information is conveyed by the passive reconfigurable intelligent surface (RIS). In existing schemes, individual phase modulation is usually adopted at the RIS elements, which severely limits exploiting all extra multiplexing gains brought by the RIS. To address the issue, we propose a novel matrix decomposition algorithm that transforms the equivalent channel into a structured form while effectively suppressing the decomposition residual. Based on this, a novel transceiver architecture employing grouped annulus modulation (GAM) with a hexagonal-lattice-based constellation is developed, which is capable of achieving the full degrees of freedom (DoFs) when the decomposition algorithm performs as expected. Numerical results demonstrate that the proposed transceiver achieves much higher communication rates, thereby leading to higher spectral efficiency, compared to the conventional phase-only modulation scheme, while maintaining comparable error performance.
Read the full abstract

All authors Ruo-Qi Sun, Jianfeng Shi, Yonggang Zhu, Mingliang Xie, Kang Luo, Yifu Sun, Ru-Han Chen, Kang An

Analysis of PDEs

A new selection problem for degenerate viscous Hamilton-Jacobi equations

We study a selection problem for degenerate viscous Hamilton–Jacobi equations with convex Hamiltonians, in which the approximation procedure combines a nonlinear discounted approximation with a small potential perturbation. A key question is how their simultaneous effects influence the asymptotic selection of viscosity solutions of the associated ergodic problem. Based on the nonlinear adjoint method, we establish the uniform convergence of the approximating solutions to a distinguished solution of the ergodic problem and derive a formula for the selected limit in terms of generalized Mather measures and the potential. As an application, we show that this selection principle is sufficiently flexible to realize any prescribed solution of the ergodic problem, with an explicit convergence rate.
Read the full abstract

Geometric Topology

A Lower Bound on the Self-intersections of Fold Singularities

For an oriented surface $S$, the singular set of a fold map $f:S\rightarrow \mathbb{R}^2$ is a collection of smooth curves, also known as fold singularities. We construct a sharp lower bound on the number of self-intersections of such fold singularities. This is done by first establishing a sharp lower bound on the number of self-intersections of the boundary of a surface immersed in $\mathbb{R}^2$. We then construct a sharp lower bound for the number of self-intersections of the singular set of a simple stable fold map of a surface to $\mathbb{R}^2$ by viewing the connected components of the singular set as the boundary components of smaller surface components, and invoking the previously constructed lower bound for the number of self-intersections of an immersed boundary.
Read the full abstract

Metric Geometry

An optimization problem for triangles

We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.

Numerical Analysis · Cross-listed from cs.LG

U-HNO: A U-shaped Hybrid Neural Operator with Sparse-Point Adaptive Routing for Non-stationary PDE Dynamics

Solutions to many partial differential equations (PDEs) display coexisting smooth global transport and localized sharp features within a single trajectory: shock fronts, thin interfaces, and concentrated high-frequency content sit on top of slowly varying backgrounds. This poses a challenge for neural operators: Fourier-based architectures mix nonlocal interactions efficiently but tend to under-resolve localized non-smooth features, whereas spatially local architectures recover fine detail at the cost of long-range propagation and rollout stability. Existing hybrid operators paper over this tension with a fixed, spatially uniform fusion that forces the same trade-off everywhere. We propose U-HNO, a U-shaped hybrid neural operator whose central design is Sparse-Point Adaptive Routing (SPAR): at every spatial location, a per-pixel hard mask selects whether the global Fourier branch or the local multi-scale Gaussian branch should dominate, and the sparsity ratio is a function of the local contrast of the routing signal, so smooth and shock-aligned regions receive different mixtures of global and local computation. SPAR is embedded in a hierarchical encoder-bottleneck-decoder backbone with skip connections so that the dual branches and the gate operate at every resolution. Training combines pointwise supervision with a finite-difference H^1 gradient term and a band-wise spectral consistency regularizer. Across benchmarks spanning 1D Burgers, Kuramoto-Sivashinsky, KdV, 2D advection, Allen-Cahn, Navier-Stokes, Darcy flow, and 3D transonic compressible Navier-Stokes from PDEBench, U-HNO achieves state-of-the-art rollout accuracy on the majority of tasks in both relative L^2 and H^1 metrics, with the largest gains on problems dominated by sharp localized features. Ablations show that removing any single component substantially degrades rollout error.
Read the full abstract

All authors Yingzhe Ma, Xiao Yang, Yuxin Xie, Zihan Xiong, Jinliang Liu

Symplectic Geometry

Elementary spectral invariants and three-dimensional Reeb dynamics

We survey various recent results on the existence and properties of periodic orbits of Reeb vector fields in three dimensions. We give an introduction to the "elementary spectral invariants" of contact three-manifolds, and we explain how they can be used to prove some of these results. (The remaining results can be proved using spectral invariants from embedded contact homology, of which the elementary spectral invariants are a simplification.) We then review the "alternative ECH capacities" of symplectic four-manifolds, and explain how these can be modified to define the elementary spectral invariants.
Read the full abstract

Optimization and Control

Stochastic Mean-Field LQ Stackelberg Differential Games with Random Coefficients: Theory and a Deep FBSDE Picard Solver

This paper studies a stochastic mean-field linear-quadratic Stackelberg differential game with random coefficients. The interaction between mean-field terms and random coefficients precludes the direct use of conventional decoupling techniques. We apply an extended Lagrange multiplier method to derive an affine operator representation of the follower's optimal response. The induced leader problem is then formulated as a generalized stochastic LQ control problem with operator-valued coefficients, and the Stackelberg optimal control is characterized through a Riccati-free coupled FBSDE system. We further develop a Deep FBSDE Picard Solver that preserves the Stackelberg order through follower-response learning, response-sensitivity extraction, leader optimization, and neural augmented Lagrangian enforcement of mean-field consistency constraints. Numerical studies covering convergence diagnostics, discretization sensitivity, Riccati calibration, ablation tests, stability under control perturbations, Stackelberg–Nash comparisons, and a financial application support the effectiveness of the proposed framework.
Read the full abstract

Functional Analysis

Variable Muckenhoupt $A_\infty$ Weights

In this article, with introducing concepts of variable scalar $\mathcal{A}_{p(\cdot),\infty}$ weights and variable matrix $\mathscr{A}_{p(\cdot),\infty}$ weights, we seek a comprehensive theory of $A_\infty$ weights within the framework of variable exponent spaces. We first show that a weight belongs to $\mathcal{A}_{p(\cdot),\infty}$ if and only if its $p(\cdot)$-th power is an $A_\infty$ weight. Using this, we characterize the $\mathcal{A}_{p(\cdot),\infty}$ condition by the minimal operator. Then we establish the reverse Hölder's inequality for $\mathcal{A}_{p(\cdot),\infty}$ weights in variable Lebesgue spaces with explicit constants and, combining this with the previously established relationship between $\mathcal{A}_{p(\cdot),\infty}$ weights and $A_\infty$ weights, we prove that, for any weight $w$, the reverse Hölder's inequality holds in variable Lebesgue spaces if and only if $w$ is an $\mathcal{A}_{p(\cdot),\infty}$ weight. For the matrix $\mathscr{A}_{p(\cdot),\infty}$ weights, we first show the existence of the reducing operators for matrix $\mathscr{A}_{p(\cdot),\infty}$ weights and then, combining the matrix $\mathscr{A}_{p(\cdot),\infty}$ weights with the scalar $\mathcal{A}_{p(\cdot),\infty}$ weights, we establish the reverse Hölder's inequality for $\mathscr{A}_{p(\cdot),\infty}$ weights in variable Lebesgue spaces. Finally, for further applications to variable matrix-weighted function spaces, we introduce the upper and the lower dimensions for $\mathscr{A}_{p(\cdot),\infty}$ weights and use these concepts to establish the sharp estimate involving reducing operators.
Read the full abstract

Numerical Analysis

A Uniformly Accurate Multiscale Time Integrator for the Klein-Gordon-Schrödinger Equations in the Nonrelativistic Regime via Simplified Transmission Conditions

We propose a novel and simplified multiscale time integrator Fourier pseudospectral (MTI-FP) method for the Klein-Gordon-Schrödinger (KGS) equations with a dimensionless parameter epsilon in (0,1], where epsilon is inversely proportional to the speed of light. The proposed MTI-FP method is rigorously proved to achieve uniform first-order accuracy in time in the nonrelativistic regime, i.e., as epsilon->0. In this regime, the solution of the KGS equations exhibits temporal oscillations with an O(epsilon^2)-wavelength, imposing stringent resolution requirements on classical numerical methods. The uniformly accurate MTI-FP method is built upon two key points: (i) a multiscale decomposition by frequency in each time interval with simplified transmission conditions, and (ii) an exponential integrator for temporal discretization combined with the Fourier pseudospectral method for spatial discretization. Using the energy method and mathematical induction, we rigorously establish two independent error bounds in H^1-norm at O(h^{m0-1} + tau^2/epsilon^2) and O(h^{m0-1} + epsilon^2) with mesh size h, time step tau and m0 an integer dependent on the regularity of the solution. These estimates imply that the MTI-FP method converges uniformly and optimally in space, and uniformly in time at O(tau) with respect to epsilon in (0,1]. Furthermore, by incorporating a linear interpolation of the micro-variables with the multiscale decomposition in each time interval, we obtain a uniformly accurate numerical solution for any t>0. Consequently, the proposed MTI-FP method has a super-resolution property in time from the perspective of Shannon sampling theory. Ample numerical experiments are provided to validate the error estimates and to demonstrate the super-resolution property. Finally, the method is applied to numerically investigate the convergence rates of the KGS equations to different limiting models.
Read the full abstract

Numerical Analysis

An NPDo Approach for Tensor Block-Diagonalization

This paper is concerned with Partial Tensor Block-Diagonalization of a multiway tensor by orthonormal matrices so that the extracted block-diagonal part optimally represents the tensor. The basic idea is to maximize the block-diagonal part via the tensor's mode-multiplications by orthonormal matrices. For that reason, it will be referred to Principal Tensor Block-Diagonalization (PTBD), which contains the Tucker decomposition (TD) of a tensor as a special case with just one block. Also as a special case is the approximate dominant tensor SVD in which each block-size is 1-by-1. An NPDo approach is proposed to optimize the block-diagonal part for computing \ptbd. It is shown the NPDo approach combined with Gauss-Seidel-type updating is globally convergent to a stationary point while the objective increases monotonically. Numerical experiments are presented to illustrate the efficiency of the NPDo approach.
Read the full abstract

Functional Analysis

Embedding complexity into the universal Banach space and the strong Novikov conjecture

Brown-Guentner and Haagerup-Przybyszewska showed that every discrete group admits a proper affine isometric action on the universal Banach space $\bigoplus_{p=1}^{\infty} \ell^{2p}(\mathbb{N}),$ taken as the $\ell^{2}$-direct sum, and hence admits a coarse embedding into this space [7, 28]. They further asked whether such embeddings could be used to study the Novikov conjecture. In this paper, we address this question by proving that the strong Novikov conjecture holds for any discrete group that admits a coarse embedding with finite complexity into this universal Banach space. Finally, we show that the recently discovered non-sofic groups constructed by Kun and Thom have Property A and therefore satisfy the Novikov conjecture.
Read the full abstract

Optimization and Control

Infinite-Horizon Non-Autonomous Zero-Sum Stochastic Recursive Differential Games and HJBI Equations

In this paper, we study an infinite horizon non-autonomous stochastic recursive differential game. To this end, we first establish well-posedness and stability results for BSDEs with a time-dependent discount factor and a possibly unbounded random terminal time. The generator $f$ is allowed to be non-uniformly bounded at the origin, namely, $|f(t,0,0)|\les \beta_1(t)+\beta_2,$ $t\in[0,\infty),$ $\dbP\text{-a.s.},$ with $\beta_1\in L^1(0,\infty)$ and $\beta_2\ges0$. We then formulate a two-person zero-sum stochastic recursive differential game on the infinite horizon, where the drift, diffusion, generator and discount factor may depend explicitly on time. The lower and upper value functions are defined through Elliott–Kalton nonanticipative strategies and BSDE recursive payoffs. By finite horizon approximation, BSDE stability estimates and viscosity solution arguments, we prove that both the lower and upper value functions are deterministic and are the unique bounded viscosity solutions of their corresponding non-autonomous HJBI equations. Finally, the time-homogeneous case is recovered as a special case. Using the uniqueness of the non-autonomous HJBI equation, rather than a probabilistic shift argument, we show from the PDE viewpoint that the value functions of the autonomous system are independent of the initial time and solve the corresponding stationary HJBI equations in the viscosity sense.
Read the full abstract

Geometric Topology

An irreducible real projective plane in the 4-sphere

We construct an irreducible embedded projective plane in $S^4$. This gives a counterexample to the Kinoshita conjecture and answers Problem 4.37 of the K3 problem list. Moreover, we answer both Questions (i) and (ii) of Problem 4.37: (i) the connected sum $R\# R$ is a Klein bottle in $S^4$ with extremal normal Euler number that does not admit an unknotted projective plane summand, and (ii) we show that our projective plane $R$ is irreducible by showing that the peripheral map $\pi_1 (\partial (S^4\setminus\mathring{N}(R)))\to \pi_1 (S^4 \setminus \mathring{N}(R))$ has kernel of order $2$.
Read the full abstract

All authors Mark Hughes, Seungwon Kim, Maggie Miller, Gheehyun Nahm

Numerical Analysis

Fully Discrete Active Flux Method based on Transported Acoustic Increments for the Compressible Euler Equations

A fully discrete Active Flux method is proposed for the two-dimensional compressible Euler equations. The method builds on the evolution-operator formulation of multidimensional Active Flux proposed by Roe in which conservative cell averages are updated by unsplit flux quadrature while primitive point values are evolved by acoustic and advective subsolvers. This has recently been extended to the Euler equations by Barsukow, who developed an efficient approach by adding acoustic increments at the Eulerian target point. The proposed method reconstructs the acoustic increment as a cellwise Q2 field, using vertex, edg–midpoint, and cell-center acoustic increments, and evaluates this field at the convective foot of the target point. For constant frozen coefficients, the resulting point update reduces to the transported composition, eliminating the additive split defect and yielding the exact unsplit frozen evolution when the acoustic and advective generators commute. The resulting method preserves the exact locally linearized acoustic evolution operator of Barsukow, the compact stencil, and the conservative one-stage average update. Numerical experiments probe several facets of the numerical method. A mixed Fourier wave packet with the linearized Euler equations isolates the split error and shows third-order point accuracy for the transported update. Isentropic vortex convection confirms reduced error constants, and an enlarged empirical CFL range. Nonlinear Gaussian acoustic pulse evolution demonstrates preservation of radial symmetry and near-third-order decay of the symmetry error. Low-Mach shear-layer tests show coherent vorticity evolution, low entropy dissipation, and absence of the coarse-grid secondary vortices seen in displayed DG/CG comparisons. A compressible under-resolved Kelvin-Helmholtz test demonstrates robust evolution with consistent entropy dissipation.
Read the full abstract

Analysis of PDEs

Half-space problem on the Boltzmann equation with zero Mach number at infinity

We study the long-time dynamics of the time-evolutionary Boltzmann equation with hard sphere collisions in the three-dimensional half-space \( \mathbb{R}^2 \times \mathbb{R}^+\), subject to diffuse reflection boundary conditions and small perturbations around a global Maxwellian equilibrium. The far-field velocity is assumed to be at rest; namely, we take the zero Mach number at infinity. In the first goal, we construct global-in-time low-regularity solutions near Maxwellians. We leverage time-decay properties along the two-dimensional tangential direction to establish polynomial decay rates of solutions matching the 2D heat equation. In the second goal, we further prove the propagation of Gevrey regularity: analyticity (Gevrey index 1) in the tangential spatial variable \(x_\parallel\), and Gevrey class with index 2 in the tangential velocity variable \(v_\parallel\), under suitably regular initial data. The proofs combine an \(L^1_k \cap L^p_k\) Fourier-space approach for decay estimates, macro-micro decomposition with \(L^2 - L^\infty\) frameworks adapted to unbounded domains, and weighted Gevrey norms to control regularity propagation, overcoming challenges from boundary effects and nonlinear interactions.
Read the full abstract

Quantum Algebra

Diagrammatic technique for Vogel's universality

In his 1999 preprint "Universal Lie Algebra", P. Vogel put forward a hypothesis on the existence of a universal Lie algebra. Although this hypothesis remains open, it is known that many quantities in Lie theory admit universal descriptions. Remarkably, almost all such universal formulas have been obtained through the representation theory of simple Lie (super)algebras, whereas Vogel's original framework was based on a more abstract diagrammatic algebra. Nevertheless, the diagrammatic approach has received little attention over the past two decades, since the last contributions by P. Vogel and J. Kneissler. In this work, we revive the diagrammatic technique grounded in Vogel's $\Lambda$-algebra and show that it enables truly universal computations. We examine numerous examples and discuss them.
Read the full abstract

Information Theory

Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective

Emerging wireless systems are evolving toward larger, denser, higher-frequency, and more reconfigurable apertures, which motivates the study of continuous-aperture arrays (CAPAs). Unlike conventional spatially discrete arrays (SPDAs), CAPAs are more naturally modeled as spatially continuous electromagnetic apertures and therefore call for a fundamental shift in both signal processing and information-theoretic analysis. In particular, the underlying channels, signals, and beamformers are no longer finite-dimensional vectors and matrices, but continuous fields and operators governed by Maxwell's equations. This paper provides a tutorial overview of CAPA systems from the perspective of electromagnetic signal and information theory (ESIT), with an emphasis on the transition from discrete array models to physics-consistent continuous-aperture formulations. We review the electromagnetic foundations of CAPAs, practical hardware implementations, line-of-sight and multipath channel modeling, continuous-space beamforming and channel estimation, and the fundamental degrees of freedom and capacity limits of CAPA systems. We also highlight how tools such as wavenumber-domain methods, functional analysis, and compressive sensing can transform challenging infinite-dimensional problems into tractable finite-dimensional ones while preserving the essential physical structure of the channel. Overall, this tutorial aims to clarify the key principles, analytical tools, and open challenges that shape CAPA-enabled wireless communications.
Read the full abstract

All authors Zhaolin Wang, Chongjun Ouyang, Kuranage Roche Rayan Ranasinghe, Shuai S. A. Yuan, Giuseppe Thadeu Freitas de Abreu, Emil Björnson, Yuanwei Liu

Combinatorics

The mapping index through the lens of the cross-index

We study the cross-index of free \(G\)-posets as a combinatorial analogue of the equivariant topological index. We demonstrate that the cross-index exhibits many structural properties closely paralleling those of the topological index, while its behavior with respect to unions displays a pronounced dichotomy depending on the acting group. Specifically, if \(P = A \cup B\) is a union of \(G\)-invariant subposets, then for \(G = \mathbb{Z}_2\) we obtain the sharp inequality \[ \operatorname{xind} P \le \operatorname{xind} A + \operatorname{xind} B + 1, \] which is directly analogous to the classical union inequality for the topological index. In contrast, for every group \(G\neq \mathbb{Z}_2\), this phenomenon fails in general, and we establish the best possible weaker estimate \[ \operatorname{xind} P \le \operatorname{xind} A + 2(\operatorname{xind} B+1). \] This reveals a fundamental distinction between the \(\mathbb{Z}_2\)-equivariant and non-\(\mathbb{Z}_2\)-equivariant settings at the purely combinatorial level. As further consequences, we compare the cross-index with both the topological index and the simplicial index, showing in particular that the gap between the cross-index and the topological index can be arbitrarily large. These results clarify the role of the cross-index as a combinatorial analogue of the equivariant topological index and further strengthen the interplay between equivariant topological methods and combinatorial structures endowed with symmetry.
Read the full abstract

Number Theory

Logarithmic source curves in polynomial fiber products

Let $k$ be a field of characteristic zero and let $f,g\in k[x]$ be nonconstant. We study rational lifts of $f(a)$ through $g$ that do not arise from a composition $f=g\circ h$. To each non-graph component of $f(X)=g(Y)$ we attach its logarithmic source curve, namely the smooth compactification of its normalization with reduced boundary. The main geometric result is a sharp contact formula at infinity: if $N=\deg g/\gcd(\deg f,\deg g)$, then every one-infinity non-graph source has $X$-degree $N$, and in general the $X$-degree is $N$ times the number of boundary points. Over number fields this yields a finite symmetric-difference expansion of $S$-integral new lifts. Active one-infinity sources give exactly the power terms in height counts; positive-rank admissible two-infinity sources give logarithmic $S$-unit families; and inactive one-infinity sources, rank-zero two-infinity sources, and the remaining components contribute only finitely many inputs. Primitive one-infinity source classes have only polylogarithmic overlap, and ordered configuration covers introduce no new exponent. Over $\mathbb Q$, the $B^{1/2}$ boundary is precisely the quadratic Bilu–Tichy source cell.
Read the full abstract

Analysis of PDEs

From Polynomial Stability to Periodic Well-posedness in Partially Dissipative Systems

The study of resonances (and well-posedness) for complex systems under time-periodic loading is of broad interest in application. The work of Galdi et al.~(2014) connects asymptotic stability of solutions to an unforced Cauchy problem to solvability of the time-periodic forced problem. Uniform stability of the solution semigroup gives periodic well-posedness for all forces in the natural mild forcing class, whereas strong stability yields only existence of a dense set of forcings for which resonance can be excluded. We address an intermediate regime for polynomial (also: rational or semiuniform) stability. Working with a Fourier decomposition in Hilbert space, we demonstrate that polynomial stability of the semigroup yields an explicit characterization of the dense forcing set on which periodic well-posedness holds. More precisely, resolvent bounds translate directly into certain losses of time derivatives on the forcing required to ensure well-posedness. Our result is motivated by partially dissipative models – including the famous heat-wave interaction problem idealizing fluid-structure interactions, as well as some thermoelastic, viscoelastic, and weakly damped hyperbolic systems – for which polynomial decay is the natural regime.
Read the full abstract

Functional Analysis

Tensor-Lifted Multivariate Functional Calculus Beyond Commutativity and Boundedness

Classical functional calculus is primarily spectral, capturing eigenvalue information through resolvent methods while largely ignoring nilpotent structure. Building on the projector-nilpotent characterization developed in our companion work, we introduce a multivariate functional calculus for arbitrary operators that incorporates both spectral and algebraic information. The framework has three main components. First, nilpotent derivative terms are explicitly included in the functional expansion, allowing the calculus to capture generalized eigenspaces and Jordan structures beyond classical resolvent methods. Second, tensor lifting treats non-commuting operators by embedding them into a commuting system on a tensor-product space. Third, a two-level convergence theory is established: Level 1 proves existence through strong resolvent convergence implying strong operator topology convergence, while Level 2 provides stability through norm resolvent convergence implying operator norm convergence with explicit error bounds. The framework simultaneously handles discrete, continuous, and hybrid spectra. Results are developed for bounded operators, unbounded self-adjoint operators recovering the classical spectral theorem, and unbounded non-self-adjoint operators with compact resolvent. For operators without compact resolvent, we introduce a compactifying regularization method based on perturbation by a positive self-adjoint operator with compact resolvent. The proposed framework is compatible with existing functional calculi and recovers their behavior under corresponding assumptions. To our knowledge, this is the first unified framework simultaneously addressing non-commutativity, non-self-adjointness, and unboundedness while explicitly preserving nilpotent structure and providing convergence guarantees.
Read the full abstract

Analysis of PDEs

Mixing and Small-Scale Formation in a Passive Divergence-Free Vector Field

We study mixing for a divergence-free passive vector field $u$ transported by another divergence-free vector field $U$, where $u$ evolves according to $ \partial_t u + (U \cdot \nabla) u + \nabla p = 0.$ In recent years, a lot of attention has been given to the question of optimal mixing in the scalar case, where there is a Sobolev constraint on the advecting velocity. In the vector setting considered here, however, the pressure term introduces substantial difficulties, since the simple Lagrangian perspective available in the scalar case is no longer applicable. In this paper, we investigate mixing on a torus $\mathbb{T}^d$ under the assumption that the field $U$ satisfies $ \|U(t)\|_{W^{1,q}} \leq C $ and we quantify mixing through the decay of the homogeneous $ H^{-\alpha}$ norm of $u$. We start with establishing conditions on $U$ that guarantee existence and uniqueness of solutions. We then derive lower bounds on the mixing rate for various ranges of $q$ and $\alpha$. In addition, we carry out numerical simulations of mixing by choosing, at each time instant, a field $U$ that maximizes the instantaneous decay of the $ H^{-\alpha}$ norm. These simulations provide evidence that the optimal mixing rate is at least exponential in time. More broadly, we view the present model and its diffusive analogue, as a useful framework for probing mechanisms of small-scale formation in divergence-free vector fields and for formulating simplified versions of open questions related to the incompressible Euler and Navier–Stokes equations.
Read the full abstract

Combinatorics

Temperley-Lieb Immanants of Ribbon Decomposition Matrices

Ribbon decomposition matrices give determinantal formulas for skew Schur functions that include as special cases the classical Jacobi-Trudi, Giambelli, and Lascoux-Pragacz formulas. We prove that certain elements of Lusztig's dual canonical basis, called Temperley-Lieb immanants, are Schur-positive when evaluated on ribbon decomposition matrices. We conjecture that this positivity holds for all elements of the dual canonical basis. This is known in the special case of Jacobi-Trudi matrices by a result of Haiman.
Read the full abstract

Optimization and Control

Adam-SHANG: A Convergent Adam-Type Method for Stochastic Smooth Convex Optimization

We propose Adam-SHANG, a Lyapunov-guided Adam-type method that couples momentum, adaptive preconditioning, and a curvature-aware correction through a more stable lagged-preconditioner update. For stochastic smooth convex optimization, we prove convergence in expectation under an admissible stepsize condition that can always be satisfied by a conservative spectral bound, without imposing global monotonicity on the second-moment sequence. To obtain a less conservative practical rule, we introduce a computable trace-ratio stepsize, motivated by a local coordinatewise alignment condition. The same structural update is also tested beyond the convex setting with simplified parameters. Experiments validate the predicted stochastic decay and show competitive training performance against Adam and AdamW on deep learning tasks.
Read the full abstract

Quantum Algebra

Affine Yangians as Limits of Quantum Toroidal Algebras

We establish a degeneration isomorphism between quantum toroidal algebras and untwisted affine Yangians, valid for all untwisted affine Kac-Moody Lie algebras. Specifically, we prove that the affine Yangian $Y_\hbar(\mathfrak{g})$ is isomorphic, as a $\mathbb{C}[\hbar]$-algebra, to the associated graded algebra of the quantum toroidal algebra $U_\hbar(\mathfrak{g}^{\mathrm{tor}})$ with respect to a canonical filtration. This result constitutes the affine analogue of Drinfeld's conjecture on the relationship between Yangians and quantum loop algebras, previously established in the finite-dimensional setting by Gautam–Toledano Laredo and by Guay–Ma. As principal applications of this isomorphism, we derive two fundamental structural properties of affine Yangians: a Poincaré–Birkhoff–Witt (PBW) basis for $Y_\hbar(\mathfrak{g})$ in all untwisted affine types, and the identification of its classical limit as the universal enveloping algebra $U(\mathfrak{g}[u])$ of the polynomial current Lie algebra. A key ingredient of independent interest is our construction of a PBW basis for $U_\hbar(\mathfrak{g}^{\mathrm{tor}})$ itself, which relies on a new torsion-freeness argument for the quantum toroidal algebra and the topological Nakayama lemma.
Read the full abstract

Combinatorics

A study on Type-2 isomorphic circulant graphs. Part 6: Abelian groups $(T2_{n,m}(C_n(R)), \circ)$ and $(V_{n,m}(C_n(R)), \circ)$

This article is the $6^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. In this part, we define $V_{n,m}(C_n(R))$ and Type-2 set $T2_{n,m}(C_n(R))$ of $C_n(R)$ and present their properties. We prove that $(V_{n,m}(C_n(R)), \circ)$ is an Abelian group and $(T2_{n,m}(C_n(R)), \circ)$ is a subgroup of $(V_{n,m}(C_n(R)), \circ)$ where $T2_{n,m}(C_n(R))$ = $\{C_n(R)\}$ $\cup$ $\{C_n(S):$ $C_n(S)$ is Typ-2 isomorphic to $C_n(R)$ w.r.t. $m \}$ and $(T2_{n,m}(C_n(R)), \circ)$ is the Type-2 group of $C_n(R)$ w.r.t. $m$. We also present many examples of Type-1 and Type-2 groups where $T1_{n}(C_n(R))$ = $\{C_n(xR): x\in\varphi_{n}\}$ is the Type-1 set of $C_n(R)$ and $(T1_{n}(C_n(R)), \circ')$ is its Type-1 group.
Read the full abstract