Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 2 March

Algebraic Topology

Algebra of Path Integrals on Digraphs

In this paper, we extend the iterated path integrals from smooth manifolds to digraphs and develop the associated algebraic and geometric structures. Iterated path integrals on a digraph naturally give rise to the iterated path algebra and the iterated loop algebra, both defined as quotient algebras of a shuffle algebra, with the latter carrying a canonical Hopf algebra structure. We construct a non-degenerate pairing between elementarily equivalent classes of loops on a digraph and the iterated loop algebra. By restricting to iterated path integrals that are invariant under $C_\partial$-homotopy, a distinguished subalgebra is obtained which, under this pairing, corresponds to the group algebra of the fundamental group. We further show that this subalgebra is a homotopy invariant and forms a Hopf algebra with involutive antipode.
Read the full abstract

Analysis of PDEs

On the robustness of pullback attractors for a nonlocal reaction-diffusion equation under perturbation

A parametric family of reaction-diffusion equations with nonlocal viscosity is considered. Existence of solutions and actually of pullback attractors is known from previous works. In this paper we obtain a robustness result of the attractors toward the corresponding minimal pullback attractor of the limiting problem. This result extends the ones obtained in \cite{5}. Actually here all terms (reactions, external forces and nonlocal viscosity functions) may vary with the parameter. The upper semicontinuous convergence of attractors is obtained under rather general assumptions and in a fully non-autonomous context using the framework of tempered universes.
Read the full abstract

Mathematical Physics

A Leibniz rule of distributional pairing and hyperforce sum rule

We reformulate and generalize the equilibrium hyperforce sum rule, a generalization of the Bogoliubov-Born-Green-Kirkwood-Yvon (BBGKY) hierarchy, by employing the Schwartz space and its dual. We show that the hyperforce sum rule for the Euclidean space and the equilibrium BBGKY hierarchy at arbitrary level are derived through the Leibniz rule of the derivative for the pairing of tempered distributions and Schwartz functions. We also apply the Leibniz rule to obtain the hyperforce sum rule for systems with periodic boundary conditions.
Read the full abstract

All authors Takashi Maruyama, Tatsuki Seto, Viktor Zaverkin, Henrik Christiansen

Combinatorics · Cross-listed from cs.SI

A two-steps tensor eigenvector centrality for nodes and hyperedges in hypergraphs

Hypergraphs have been a powerful tool to represent higher-order interactions, where hyperedges can connect an arbitrary number of nodes. Quantifying the relative importance of nodes and hyperedges in hypergraphs is a fundamental problem in network analysis. In this paper, we propose a new tensor-based centrality measure for general hypergraphs. We use a third-order tensor to represent the relationship between nodes and hyperedges. The tensor's positive Perron vector is defined as the centrality vector of the hypergraph. The existence and uniqueness of this centrality vector are guaranteed by the Perron-Frobenius theorem for tensors. This new centrality measure captures a higher-order mutual reinforcement mechanism: a node's importance is determined by the importance of its incident hyperedges and the other nodes within these hyperedges; symmetrically, a hyperedge's importance is determined by the importance of its constituent nodes and the other hyperedges containing these nodes. We further provide a combinatorial interpretation by proving that the centrality vector represents the limit geometric capacity of two-steps expansion trees. We illustrate the centrality measure on real-world hypergraph datasets.
Read the full abstract

All authors Qing Xu, Chunmeng Liu, Changjiang Bu, Jihong Shen

Analysis of PDEs

Magneto-Acousto-Electric Tomography with Magnetic Field Measurements: Modeling, Inversion and Stability

Magneto-acousto-electric tomography (MAET) combines ultrasound with a static magnetic field to infer the electrical conductivity of an object. In this paper, we present a rigorous quasi-static mathematical model for MAET with magnetic field measurements and introduce an adjoint problem to decouple the resulting hybrid inverse problem. This yields a two-step inversion procedure: solving an acoustic inverse source problem and then recovering the conductivity from an internal current density. For the second step, by exploiting the analytic structure of a coil-determined field, we establish an interior Hölder stability estimate without imposing a pointwise nonzero constraint on the internal data. We further prove that, under explicit smallness assumptions on the conductivity and coil geometry, the conductivity can be recovered with region-of-interest Lipschitz stability in both bounded and half-space geometries.
Read the full abstract

Numerical Analysis

An extended Lagrange FEM for the Maxwell eigenvalue problem

We construct an extended Lagrange FE space to solve the Maxwell equation and its eigenvalue problem in $\mathbb R^d$ $(d=2,3)$, which is the sum of the vectorial $p-$order Lagrange FE space ($p\ge1$) and the gradient of the $p+1-$order Lagrange FE space. The two lowest-order methods in 3D adopt slightly less degrees of freedom than the second family of the same order edge element methods in 3D. We construct a Clément interpolant operator to prove the discrete compactness of the FE space and the convergence of the new methods for both Maxwell equation and its eigenvalue problem. For the extended linear Lagrange element method, an average-type curl recovery approach is designed to obtain numerical solution of super-convergence. In the numerical part, we verify the optimal convergence order for the two lowest-order methods, discuss the upper bound property of numerical eigenvalues and investigate the lower bound property by the average-type curl recovery approach.
Read the full abstract

Complex Variables

A domain in $\mathbb C^4$ and its connection with $\mu$-synthesis problem

We explore a domain $\mathbb F$ in $\mathbb C^4$ that has structural similarities with the hexablock $\mathbb{H} \subset \mathbb C^4$. It leads to the question if these two domains are biholomorphic. In this paper, we answer this question in negative. We provide alternative characterizations of the domain $\mathbb{F}$ and find its connection with the domains associated with $\mu$-synthesis problem such as the symmetrized bidisc, the tetrablock, the pentablock and the hexablock. We also address the following question: does $\mathbb{F}$ (which is biholomorphic with $\mathbb L_4$) arise from a $\mu$-synthesis problem in the same manner as $\mathbb{G}_2$ and $\mathbb{E}$ ?
Read the full abstract

Functional Analysis

Violation of Bell-type Inequalities on Mutually-commuting von Neumann Algebra Models of Entanglement Swapping Networks

Violation of Bell inequalities in bipartite systems represented by mutually-commuting von Neumann algebras has pioneered the study of vacuum entanglement in algebraic quantum field theory. It is unexpected that the maximal violation of Bell inequality can discover algebraic structures. In the paper, we establish the mutually-commuting von Neumann algebra model for entanglement swapping networks and Bell-type inequalities on this model. It generalizes the bipartite case to the ternary case. These algebras are all general von Neumann algebras, which provide a natural perspective to investigate Bell nonlocality in quantum networks in the infinitely-many-degree-of-freedom setting. We determine various bounds for Bell-type inequalities based on the structure of von Neumann algebras, and identify the algebraic structural conditions required for their violation. Finally, we show that the maximal violation of Bell-type inequalities in entanglement swapping networks can be used to determine partially the type classification of the underlying von Neumann algebras.
Read the full abstract

All authors Bingke Zheng, Shuyuan Yang, Jinchuan Hou, Kan He

Mathematical Physics · Cross-listed from gr-qc

Modified Teukolsky formalism: Null testing and numerical benchmarking

Next-generation gravitational-wave detectors will make black-hole ringdown an increasingly sensitive probe of small departures from General Relativity in the strong-field regime. This motivates obtaining high-precision predictions of gravitational effective field theory, as spectral shifts can be quite small. Here we perform a focused stress test of the modified-Teukolsky framework by designing two null diagnostics. First, we consider an action with redundant operators that must produce zero first-order vacuum QNM shifts. Second, we exploit a Ricci-flat identity relating two physical cubic Riemann to test such a relation is satisfied by the ringdown spectra obtained. We compute the shifts using two independent numerical approaches: the eigenvalue-perturbation and generalized continued-fraction (Leaver-type) methods. Both null tests are passed across multiple multipoles and overtones, and the control-operator results agree in magnitude with the benchmark values reported in Ref. [1]. These validations support using the framework for obtaining accurate predictions for robust strong-field tests, with straightforward extensions to rotating backgrounds and coupling with matter fields.
Read the full abstract

All authors Fawzi Aly, Mahmoud A. Mansour, Luis Lehner, Dejan Stojkovic, Dongjun Li, Pratik Wagle

Functional Analysis

Non-Archimedean Tarski-Maligranda Inequalities

In 1930, Tarski observed that \begin{align*} \bigg||r|-|s|\bigg|=|r-s|+ |r+s|-(|r|+|s|), \quad \forall r, s \in \mathbb{R}. \end{align*} In 2008, Maligranda converted the previous equality into inequalities that are valid in every normed linear space. We derive non-Archimedean versions of Tarski-Maligranda inequalities. Difference between Archimedean and non-Archimedean inequalities is surprising.
Read the full abstract

Algebraic Geometry

Covers of curves, Ceresa cycles, and Unlikely intersections

Fix a smooth, projective, geometrically integral curve $C$ of genus $g \geq 2$ over a characteristic zero field. We prove that the Ceresa cycle $\mathrm{Cer}(\widetilde{C})$ of a very general ramified cover $\widetilde{C}$ of $C$ is nontorsion in the Chow group of its Jacobian. We also show that there exist infinitely many families of ramified covers of a varying family of curves where a general point of these families corresponds to a curve with nontorsion Ceresa cycle. To illustrate this, we write down two explicit $1$-dimensional and $2$-dimensional families of genus $6$ curves where the locus of curves with torsion Ceresa cycle is Zariski closed and has positive codimension. Our strategy is to reduce the question of whether the Ceresa cycle is torsion to the question of whether a related point on the Jacobian of the curve is torsion. For this, we use the “relative canonical shadow" of the Ceresa cycle, which is a point in the Jacobian of the curve obtained by intersecting the Ceresa cycle with a natural correspondence arising from the covering map. We combine this with ideas from unlikely intersection theory (namely the relative Manin–Mumford theorem) to study the locus where the relative canonical shadows of the Ceresa cycle become torsion.
Read the full abstract

All authors Tejasi Bhatnagar, Sheela Devadas, Toren D'Nelly-Warady, Padmavathi Srinivasan

Algebraic Topology

Finite subset spaces of spheres

We find the complete rational homology for the finite subset spaces of a $d$-dimensional sphere. We also determine the integral homology in top $d$ degrees and obtain a partial description of it in codimension $d$.

Probability

Color symmetry in the Potts spin glass at high temperature

We show that color symmetry is preserved at high temperatures in the Potts spin glass model with $\kappa \ge 3$ colors. Our proof employs the second moment method applied to the balanced model with a suitable centering of the Hamiltonian, while incorporating results from the non-disordered Potts model Ellis–Wang (1990), https://doi.org/10.1016/0304-4149(90)90122-9. For $\kappa = 2$, we exploit the model's gauge symmetry to show that unbalanced configurations occur with exponentially small probability at all temperatures $\beta \in [0, \infty]$.
Read the full abstract

Statistics Theory

A Laplace-based perspective on conditional mean risk sharing

The conditional mean risk-sharing (CMRS) rule is an important tool for distributing aggregate losses across individual risks, but its implementation in continuous multivariate models typically requires complicated multidimensional integrals. We develop a framework to compute CMRS allocations from the joint Laplace–Stieltjes transform of the risk vector. The LSTs of the allocation measures $\nu_i(B)=\mathbb{E}[X_i\boldsymbol{1}_{\{S\in B\}}]$ are expressed as partial derivatives of the joint LST evaluated on the diagonal $t_1=\cdots=t_n$. When densities exist, this yields one-dimensional Laplace inversions for $f_S$ and $\xi_i$, and hence $h_i(s)=\xi_i(s)/f_S(s)$ on the absolutely continuous part, providing closed-form or semi-analytic solutions for a broad class of distributions. We also develop numerical inversion methods for cases where analytic inversion is unavailable. We introduce an exponential tilting procedure to stabilize numerical inversion in low-probability aggregate events. We provide several examples to illustrate the approach, including in some high-dimensional settings where existing approaches are infeasible.
Read the full abstract

Probability

Nearly-symmetric matrices in the Cohen-Lenstra universality class

In this paper, we study cokernels of random $n\times n$ matrices over $\mathbb Z$ with symmetry conditions determined by fixed alternating bilinear forms on $\mathbb Z^n$. These include perturbations of random symmetric matrices at a very small (but unbounded with $n$) number of entries. We show that, subject to fairly weak conditions on the distributions of the entries, the distribution of these cokernels converges weakly to the Cohen-Lenstra distribution, which is the limiting distribution of cokernels of random matrices with no symmetry constraints. This result demonstrates that the cokernel distributions of symmetric matrices are quite sensitive to small perturbations of the symmetry conditions.
Read the full abstract

Optimization and Control

On the Stability Connection Between Discrete-Time Algorithms and Their Resolution ODEs: Applications to Min-Max Optimisation

We establish a connection between the stability of discrete-time algorithms (DTAs) and continuous-time dynamical systems, in particular their $O(s^r)$-resolution ordinary differential equations (ODEs). We show that exponential stability of a common equilibrium transfers to the DTA whenever the one-step error is small relative to the distance to the equilibrium and the one-step Lyapunov decay. This condition is sharp in order, and one-step consistency alone is insufficient. The result is local and allows step-size-dependent ODEs and Lyapunov functions, covering $O(s)$-resolution ODEs whose decay rate vanishes as the step size tends to zero. Asymptotic stability is not inherited in general, but a comparison criterion and a checkable compatibility condition ensure it carries over for equilibria and compact sets. For resolution ODEs, joint regularity of the update map guarantees the required error bound. We apply the framework to two-timescale gradient descent ascent (TT-GDA), generalised extragradient, two-timescale proximal point, and (regularised) damped Newton, showing that for small step sizes and suitable parameters, every saddle point with invertible Hessian is locally exponentially stable for all but TT-GDA. For degenerate saddle points, the framework yields asymptotic stability and convergence rates.
Read the full abstract

All authors Amir Ali Farzin, Yuen-Man Pun, Philipp Braun, Iman Shames

Rings and Algebras

Cotorsion pairs, thick subcategories, and finitely generated Gorenstein projective modules

Let $R$ be a noetherian algebra over a Cohen–Macaulay ring $S$ admitting a canonical module $\omega$, and assume that $R$ is maximal Cohen–Macaulay over $S$. We prove that the category of finitely generated Gorenstein projective $R$-modules coincides with the left $\mathrm Ext$-orthogonal class of the thick subcategory generated by $R$ and ${\mathrm Hom}_S(R,\omega)$. As an application, finitely generated Gorenstein projective $R$-modules form the left half of a hereditary cotorsion pair. In the case of Cohen–Macaulay local rings, this yields an affirmative answer to a question of R. Takahashi. We further characterize when $R$ is left weakly Gorenstein. Finally, we prove that a Cohen–Macaulay local ring is Gorenstein if and only if the right $\mathrm Ext$-orthogonal class of finitely generated Gorenstein projective modules coincides with the category of finitely generated modules of finite projective dimension.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

One Operator to Rule Them All? On Boundary-Indexed Operator Families in Neural PDE Solvers

Neural PDE solvers are often described as learning solution operators that map problem data to PDE solutions. In this work, we argue that this interpretation is generally incorrect when boundary conditions vary. We show that standard neural operator training implicitly learns a boundary-indexed family of operators, rather than a single boundary-agnostic operator, with the learned mapping fundamentally conditioned on the boundary-condition distribution seen during training. We formalize this perspective by framing operator learning as conditional risk minimization over boundary conditions, which leads to a non-identifiability result outside the support of the training boundary distribution. As a consequence, generalization in forcing terms or resolution does not imply generalization across boundary conditions. We support our theoretical analysis with controlled experiments on the Poisson equation, demonstrating sharp degradation under boundary-condition shifts, cross-distribution failures between distinct boundary ensembles, and convergence to conditional expectations when boundary information is removed. Our results clarify a core limitation of current neural PDE solvers and highlight the need for explicit boundary-aware modeling in the pursuit of foundation models for PDEs.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Koopman-based Estimation of Lyapunov Functions: Theory on a Reproducing Kernel Hilbert Space

Koopman operator provides a general linear description of nonlinear systems, whose estimation from data (via extended dynamic mode decomposition) has been extensively studied. However, the elusiveness between the Koopman spectrum and the stability of equilibrium point poses a challenge to utilizing the Koopman operator for stability analysis, which further hinders the construction of a universal theory of Koopman-based control. In our prior work, we defined the Koopman operator on a reproducing kernel Hilbert space (RKHS) using a linear–radial product kernel, and proved that the Koopman spectrum is confined in the unit disk of the complex plane when the origin is an asymptotically stable equilibrium point. Building on this fundamental spectrum–stability relation, here we consider the problem of Koopman operator-based Lyapunov function estimation with a given decay rate function. The decay rate function and the Lyapunov function are both specified by positive operators on the RKHS and are related by an operator algebraic Lyapunov equation (ALE), whose solution exists uniquely. The error bound of such a Lyapunov function estimate, obtained via kernel extended dynamic mode decomposition (kEDMD), are established based on statistical learning theory and verified by a numerical study.
Read the full abstract

Probability

Asymptotic normality for triangle counting in the sparse $\beta$-model

We study the number of triangles $T_n$ in the sparse $\beta$-model on $n$ vertices, a random graph model that captures degree heterogeneity in real-world networks. Using the norms of the heterogeneity parameter vector, we first determine the asymptotic mean and variance of $T_n$. Next, by applying the Malliavin-Stein method, we derive a non-asymptotic upper bound on the Kolmogorov distance between normalized $T_n$ and the standard normal distribution. Under an additional assumption on degree heterogeneity, we further prove the asymptotic normality for $T_n$, as $n\to\infty$.
Read the full abstract

Differential Geometry

Surfaces with parallel mean curvature in warped product spaces

In this work, we obtain a geometric description of surfaces $M^2$ of arbitrary codimension in the warped product $\mathbb{R}\times_\rho\mathbb{Q}^n_\epsilon$, with parallel mean curvature vector field in the normal connection, extending a result by Alencar-do Carmo-Tribuzy.

Representation Theory

Some closed formulas for super Kazhdan-Lusztig polynomials

Kazhdan–Lusztig theory for finite-dimensional representations of the general linear Lie superalgebra $\mathfrak{gl}(m|n)$ is well understood through the Khovanov arc-diagram combinatorics. On the other hand, the Kazhdan–Lusztig conjecture for the full super category $\mathcal O$ was established by Cheng–Lam–Wang and Brundan–Losev–Webster, and the corresponding Kazhdan–Lusztig polynomials can be computed by Brundan's algorithm. The aim of this paper is to deepen our understanding of super category $\mathcal O$ and its Kazhdan–Lusztig polynomials by bringing together three ingredients: auxiliary modules associated with changes of Borel subalgebras introduced by Cheng–Lam–Wang, the Koszul grading studied by Brundan–Losev–Webster, and Whittaker coinvariants functor investigated by Brundan–Goodwin. We obtain, in particular, closed formulas for certain Kazhdan–Lusztig polynomials associated with odd reflections, determine the socles of some auxiliary modules, and realize certain pullbacks of standard modules via parabolic Miura transforms. We also use Khovanov arc-diagram combinatorics to characterize certain regular dominant weights intrinsically in terms of the underlying abelian category. We discuss how this viewpoint can be used to obtain concrete examples relevant to the study of Morita equivalence classes of blocks of super category $\mathcal O$.
Read the full abstract

Information Theory · Cross-listed from q-bio.NC

An Information-Theoretic Framework For Optimizing Experimental Design To Distinguish Probabilistic Neural Codes

The Bayesian brain hypothesis has been a leading theory in understanding perceptual decision-making under uncertainty. While extensive psychophysical evidence supports the notion of the brain performing Bayesian computations, how uncertainty information is encoded in sensory neural populations remains elusive. Specifically, two competing hypotheses propose that early sensory populations encode either the likelihood function (exemplified by probabilistic population codes) or the posterior distribution (exemplified by neural sampling codes) over the stimulus, with the key distinction lying in whether stimulus priors would modulate the neural responses. However, experimentally differentiating these two hypotheses has remained challenging, as it is unclear what task design would effectively distinguish the two. In this work, we present an information-theoretic framework for optimizing the task stimulus distribution that would maximally differentiate competing probabilistic neural codes. To quantify how distinguishable the two probabilistic coding hypotheses are under a given task design, we derive the information gap–the expected performance difference when likelihood versus posterior decoders are applied to neural populations–by evaluating the Kullback-Leibler divergence between the true posterior and a task-marginalized surrogate posterior. Through extensive simulations, we demonstrate that the information gap accurately predicts decoder performance differences across diverse task settings. Critically, maximizing the information gap yields stimulus distributions that optimally differentiate likelihood and posterior coding hypotheses. Our framework enables principled, theory-driven experimental designs with maximal discriminative power to differentiate probabilistic neural codes, advancing our understanding of how neural populations represent and process sensory uncertainty.
Read the full abstract

Information Theory

GNN Based Joint Beamforming Design for Extremely Large-Scale RIS Assisted Near-Field ISAC Systems

This paper investigates an extremely large-scale reconfigurable intelligent surface (XL-RIS) assisted near-field integrated sensing and communication (ISAC) system, where a multi-antenna base station (BS) simultaneously sends unicast data to multiple single-antenna communication users (CUs) and senses multiple targets (TGTs). The BS, CUs and TGTs are all assumed to be located in the near-field region of the XL-RIS. We aim to maximize the weighted sum rate (WSR) of all CUs, subject to the sensing beampattern gain constraint for each TGT, the transmit power constraint for the BS, and the unit modulus constraints on the XL-RIS phase shift. First, we develop a fractional programming (FP) based block coordinate descent (BCD) algorithm to obtain a locally optimal solution for such a non-convex joint design problem. Secondly, to address the high-dimensional spatial correlations and scalability of the XL-RIS near-field channels, we propose a customized graph neural network (GNN) scheme to generate the BS transmit beamforming variables and the XL-RIS reflecting coefficient vector for ISAC, where the near-field ISAC system is modeled as a heterogeneous graph comprising XL-RIS/CU/TGT nodes. The proposed GNN scheme can effectively learn the near-field channel state information (CSI) features, in which the message passing mechanism is employed to exchange CSI among these directly connected nodes in the graph. Furthermore, each XL-RIS/CU/TGT node maintains a feature vector for mapping to the BS transmit beamforming variables or the XL-RIS reflecting coefficient vector. Numerical results show that the proposed GNN-based beamforming design scheme achieves a better performance than the existing baselines, in terms of computational efficiency, feasibility, robustness, and the ability of generalization.
Read the full abstract

All authors Jiahao Chen, Feng Wang, Guojun Han, Xin Wang, Vincent K. N. Lau

Representation Theory

Simple character formulas for finite $W$-superalgebras of type $A$

We establish a canonical basis character formula for the irreducible modules in arbitrary parabolic BGG-type categories, including the category of finite-dimensional modules, for finite $W$-superalgebras of type $A$. These categories categorify the tensor product modules of irreducible polynomial representations and their duals over a quantum group of type $A$. Moreover, the standard modules and irreducible modules in these categories categorify the standard basis and Lusztig's dual canonical basis in the tensor product modules. Our formula provides a uniform generalization of several character formulas in BGG categories for Lie superalgebras and for $W$-algebras of type $A$.
Read the full abstract

Combinatorics

Triangular cutoff threshold for the inversion walk on tournaments and the state space of restricted inversions

Given a labelled tournament on $[n]$, inverting a vertex subset $X$ means reversing every edge with both endpoints in $X$. Alon, Powierski, Savery, Scott, and Wilmer~\cite{AlonPowierskiSaveryScottWilmer2024} asked for the mixing time of the Markov chain that repeatedly inverts a uniformly random subset of $[n]$. We show that this inversion walk has a triangular cutoff threshold. Let $T(s):=\binom{s+1}{2}$. For every integer sequence $s_n\in[0,n]$, $$ d_n(n-s_n)\longrightarrow \begin{cases} 1,& T(s_n)-n\to+\infty, 0,& T(s_n)-n\to-\infty. \end{cases} $$ Consequently, for every fixed $\varepsilon\in(0,1)$, $ t_{\mix}^{(n)}(\varepsilon)=n-\sqrt{2n}+O(1).$ We also prove quantitative one-sided bounds, with absolute constants $C_\star<0.36$ and $\kappa<3.47$, $$ d_n(n+c)\le C_\star 2^{-c}\quad(c\ge0), \qquad d_n(n-s)\ge 1-\kappa\,2^{\,n-\binom{s+1}{2}}\quad(0\le s\le n). $$ As a second result, we characterise the state space of the \emph{$k$-restricted inversion walk}, which inverts a uniformly random $k$-subset at each step. For $n\ge 4$ and $2\le k\le n-2$, the reachable states form a coset of a subgroup $H_k\le\F_2^{\binom{n}{2}}$ whose defining parity constraints are determined by $k\bmod 4$; equivalently, its codimension is $0,1,n-1$, or $n$ according as $k\equiv2,0,3$, or $1\pmod4$.
Read the full abstract

Analysis of PDEs

Asymptotic long-time behavior of Darcy–Boussinesq convection in layered porous media with narrow transition zones

We study the asymptotic long-time behavior of Darcy–Boussinesq convection in layered porous media with narrow transition zones in the material properties. As the transition-layer width tends to zero, we prove the upper semi-continuous convergence of the global attractor, invariant measure, and Nusselt number to their counterparts in the limiting sharp-interface model. We also show that the global attractors have finite fractal dimensions, with an explicit upper bound uniform in the transition-layer width. The analysis combines a carefully designed background temperature/contaminant profile together with a novel choice of phase space that ensures global well-posedness of the model and asymptotic compactness of the solution semigroup, and a new interpolation inequality. The phase space is associated with fractional powers of the principal elliptic operator with discontinuous coefficients. These results provide a rigorous long-time validation of the sharp-interface Darcy–Boussinesq model and extend our earlier finite-time convergence theory (H. Dong and X. Wang, SIAM J. Appl. Math. 85 (2025), 1621–1642) to the long-time regime.
Read the full abstract

Analysis of PDEs

Scattering for the quintic generalized Benjamin-Bona-Mahony equation

We consider the quintic generalized Benjamin-Bona-Mahony equation $$ u_t-u_{xxt} + \partial_x\big(u + u^{5}\big)= 0,\qquad (t,x)\in \mathbb{R}_+ \times \mathbb{R}. $$ Using the space-time resonance method, we prove that sufficiently small and smooth solutions scatter to the linear flow. While the higher nonlinearity simplifies the treatment of nonresonant interactions compared to the quartic model in \cite{Morgan}, resonance analysis is more intricate. The resonance analysis occurs in a higher-dimensional geometric setting, and certain null or vanishing conditions present in the quartic case fail at specific resonance points. As a result, refined computations and precise estimates near the resonant set are required to close the bootstrap argument.
Read the full abstract

Probability

Beta Ensembles in the Freezing Regime and Finite Free Convolutions

In the freezing regime where the system size N is fixed and the inverse temperature beta tends to infinity, the eigenvalues of Gaussian beta ensembles converge to zeros of the Nth Hermite polynomial. That law of large numbers has been proved by analyzing the joint density or reading off the random matrix model. This paper studies its dynamical version of this phenomenon. We show that in the freezing regime the eigenvalue processes called beta Dyson Brownian motions converge to deterministic limiting processes which can be written as the finite free convolution of the initial data and the zeros of Hermite polynomials. This result is a counterpart of those in the random matrix regime where N tends to infinity with fixed beta, as well as to the high temperature regime where N tends to infinity while beta N remains bounded. We also establish Gaussian fluctuations around the limit and deal with the Laguerre case.
Read the full abstract

Quantum Algebra

Dual canonical bases of quantum groups and $\imath$quantum groups II: geometry

The $\imath$quantum groups admit two realizations: one via the $\imath$Hall algebras and the other via the quantum Grothendieck rings of quiver varieties, as developed by the first author and Wang. Based on these two realizations, we establish the dual canonical bases for $\imath$quantum groups of type ADE in two distinct ways, using perverse sheaves and Hall algebras respectively. In this paper, we prove that these two dual canonical bases coincide, thereby proving their invariance under braid group actions, and that their structural constants are integral and positive. Furthermore, we establish the positivity of the coefficients of the transition matrix from the Hall basis (and PBW basis) to the dual canonical basis.
Read the full abstract