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)

Sunday 1 March

Numerical Analysis

Pressure-robustness for the axisymmetric Stokes problem by velocity reconstruction

This paper studies pressure-robustness for the axisymmetric Stokes problem. The transformation to cylindrical coordinates requires that the radially weighted velocity is divergence-free in the classical sense. Consequently, traditional divergence-free finite element methods from the Cartesian setting – even if inf-sup stable – are in general not divergence-free in the axisymmetric formulation. We therefore explore the approach that restores pressure-robustness via reconstruction operators for a low-order Bernardi–Raugel discretization. We show that an application of standard interpolation operators from the Cartesian setting to radially weighted test functions works in principle, but it lacks properties needed to derive optimal consistency error estimates. To address this, we introduce a reconstruction operator into a finite element space spanned by Raviart–Thomas functions that are modified such that they vanish on the rotation axis. This vanishing-on-axis property is the key to obtain optimal consistency error estimates. Numerical examples demonstrate the overall feasibility of the approach and include cases where the vanishing-on-axis property yields significantly better results.
Read the full abstract

All authors Philip L. Lederer, Christoph Lehrenfeld, Christian Merdon, Tim van Beeck

Combinatorics

On the list version of a conjecture of Erdős and Neumann-Lara

The dichromatic number of a digraph $D$, denoted by $\vec{\chi}(D)$, is the smallest number of colours required to colour the vertices of $D$ such that each colour class induces an acyclic digraph. A conjecture of Erdős and Neumann-Lara states that there exists a function $f(k)$ such that for every graph $G$ with $\chi(G) \geq f(k)$ there is an orientation of $G$ such that the resulting digraph $D$ satisfies $\vec{\chi}(D) \geq k$. We prove the list version of this conjecture: if $G$ has large list chromatic number then there is an orientation of $G$ such that the resulting digraph has large list dichromatic number. The main tool in our result is the following theorem, which is an extension of an analogous result of Alon for the chromatic number: every graph of minimum degree $d$ admits an orientation such that the resulting digraph has list dichromatic number of order at least $\ln d$.
Read the full abstract

Combinatorics

A note on the Möbius uncertainty principle for posets

We consider two generalizations of Pollack's uncertainty principle for Möbius inversion to locally finite posets. The first generalization was previously studied by Goh. Here, we provide a simplified sufficient criterion for the uncertainty principle to hold. We also provide a necessary criterion for the same which, in particular, disproves Goh's conjectural characterization of posets for which an uncertainty principle holds. Nevertheless, we prove that Goh's conjecture indeed holds when the poset forms a lattice. The second generalization is new and applies to posets with reduced incidence algebras of a certain form. Here, we make some preliminary observations, including the fact that the uncertainty principle holds for the poset of finite subsets of natural numbers and the poset of finite dimensional subspaces of $\mathbb{F}_q^\infty$. Our proofs in these settings are quite different from the proof for the poset of natural numbers under divisibility.
Read the full abstract

Combinatorics

On shortening universal words for multi-dimensional permutations

A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that u-words (in fact, even u-cycles, a stronger claim) for $d$-dimensional permutations exist. In this paper, we use the idea of incomparable elements to prove that u-words of length $(n!)^{d-1}+n-1-i(n-1)$, for $d\geq 2$ and $$0\leq i\leq \frac{2^{d-1}}{n-1}\left[(1+(n-1)!)^{d-1}-\left(1+\frac{(n-1)!}{2}\right)^{d-1}\right],$$ for $d$-dimensional permutations of length $n$ exist, which generalizes the respective result of Kitaev, Potapov and Vajnovszki for “usual” permutations ($d=2$).
Read the full abstract

Combinatorics

Optimal strategy in the game Risk or Safety

In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the transition equations depending on the players decisions at each game situation is presented. However, the method requires the solution of many large linear equation systems, which makes the problem practically unsolvable for more than 6 coins. Hence, an iterative method is used to determine the optimal strategy for up to 20 coins. A look-up table gives the number of coins a player should toss at each possible game situation.
Read the full abstract

Probability

Robust Queueing for Single-Server Queues with Abandonment

Single-server queues with customer abandonment arise in call centers and other service systems, yet their steady-state performance is analytically tractable only in special cases. We develop Robust Queueing approximations for the mean stationary virtual waiting time in the $GI/GI/1+GI$ model. Our starting point is an exact reverse-time representation of the workload in terms of the net-input process, defined as the work brought by customers who eventually enter service minus cumulative service capacity. RQ approximates this random process by its mean plus a robustness parameter times its standard deviation. Abandonment makes both moments endogenous because the probability that a customer enters service depends on the waiting time observed upon arrival. We resolve this dependence by imposing self-consistency through a deterministic trial approximation to the mean stationary virtual waiting time. For the drift, the Poisson compensator identity is exact under Poisson arrivals; under renewal arrivals, the resulting mean Palm correction is controlled on the relevant heavy-traffic optimizer scales. For the variance, we develop a deterministic-time-change surrogate and a refined finite-system surrogate. The refined surrogate interpolates between two proved variance limits using a scale-dependent variance-reduction factor derived from a heavy-traffic diffusion limit. Both constructions reduce to one-dimensional fixed-point equations that can be solved by bisection using the arrival index of dispersion for counts, the service-time squared coefficient of variation, and the patience distribution. We establish heavy-traffic limits for the $GI/GI/1+GI$ model and for both RQ fixed points, which calibrate the robustness parameter and provide theoretical support for the variance-reduction function. Numerical experiments show that the refined approximation is accurate over a broad parameter range.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Random Features for Operator-Valued Kernels: Bridging Kernel Methods and Neural Operators

In this work, we investigate the generalization properties of random feature methods. Our analysis extends prior results for Tikhonov regularization to a broad class of spectral regularization techniques and further generalizes the setting to operator-valued kernels. This unified framework enables a rigorous theoretical analysis of neural operators and neural networks through the lens of the Neural Tangent Kernel (NTK). In particular, it allows us to establish optimal learning rates and provides a good understanding of how many neurons are required to achieve a given accuracy. Furthermore, we establish minimax rates in the well-specified case and also in the misspecified case, where the target is not contained in the reproducing kernel Hilbert space. These results sharpen and complete earlier findings for specific kernel algorithms.
Read the full abstract

Commutative Algebra

Relative Faithful Exact Functors and Their Applications to Homological Modules

The notions of faithfully projective, faithfully flat, and faithfully injective modules–defined as modules for which the three classical homological functors are both faithful and exact–play fundamental roles across various areas of algebra. In this paper, we extend these notions to the setting of $w$-operation theory. By introducing the concept of $w$-faithfully exact functors, we define and investigate the notions of $w$-faithfully projective, $w$-faithfully flat, and $w$-faithfully injective modules. We establish their fundamental properties and demonstrate their effectiveness in generalizing classical results.
Read the full abstract

Complex Variables

On boundary non-preserving mappings with integral constraints

This manuscript is devoted to the study of mappings, satisfying the upper weighted Poletsky inequality. We study the case where the boundary of the domain may not be preserved under the mapping and, besides that, the majorant from the above inequality satisfies constraints of the integral-type. Under certain additional conditions on the definition domain and the corresponding cluster sets, we prove that families of above mappings are equicontinuous in the closure of this domain.
Read the full abstract

Optimization and Control

A Penalty Method for Non-Self-Adjoint Topology Optimization

We propose a novel penalty method framework for the non-self-adjoint topology optimization problems, taking compliant mechanism problems as an example, by incorporating a convex nonlocal perimeter approximation scheme. We rigorously analyze the existence of solutions to the optimization problem derived from the penalty method. Furthermore, we establish that the discrete problem \(\Gamma\)-converges to the continuous problem, ensuring consistency across scales. To solve the discrete problem, we develop a projected gradient method that guarantees strict monotonic descent of the objective function. We also extend the framework to the heat dissipation problem and propose a generalized material interpolation function (GMIF), which allows for a targeted control of the topological connectivity in the resulting optimal design. Numerical experiments on the compliant mechanism and heat dissipation problems validate the effectiveness of the proposed method. This framework provides a robust approach to addressing complex optimization challenges in computational mathematics with potential applications in engineering design.
Read the full abstract

Analysis of PDEs

Global solutions of the 3D inhomogeneous incompressible viscoelastic system without structure assumptions

In this paper, we prove the global existence of strong solutions for the inhomogeneous incompressible viscoelastic system without any additional structure assumptions on $\mathbb{R}^{3}$. Unlike the time weighted energy method presented by Ai and Wang (Nonlinear Anal. 254 (2025), 113747.), by replacing $H^{-1}$ conditions with certain $L^{1}$ conditions on initial data, we need to develop some new transformation techniques for the system (1.1) and make use of elegant spectral analysis method to capture an enhanced time-decay rate of the velocity field $u$, which is essential to establish the uniform bounds of the density and deformation tensor.
Read the full abstract

Analysis of PDEs

Asymptotic profile of solutions to the Cauchy problem for the generalized Kadomtsev-Petviashvili equations with anisotropic dissipation in 2D

We consider the Cauchy problem for the generalized Kadomtsev-Petviashvili equations with the dissipation term $-\nu u_{xx}$ in 2D. This is one of the nonlinear dispersive-dissipative type equations, which has a spatial anisotropy. In this paper, we investigate the large time behavior of the solution to this problem. Especially, we show that the $L^{\infty}$-norm of the solution decays at the rate of $t^{-7/4}$ if the initial data $u_{0}(x, y)$ satisfies $(1+|x|)u_{0}\in L^{1}(\mathbb{R}^{2})$ with the zero-mass condition and some appropriate regularity assumptions. Moreover, combining techniques used for parabolic equations and the Schrödinger equation, we also derive the detailed asymptotic profile of the solution.
Read the full abstract

Analysis of PDEs

Global solutions of the 2D inhomogeneous incompressible viscoelastic system

In this paper, we investigate the global existence of strong solutions for the inhomogeneous incompressible viscoelastic system with only velocity dissipation on $\mathbb{R}^{2}$. Due to the criticality of the time-weight, the methods for the corresponding problem on $\mathbb{R}^{3}$ cannot be directly applied to the two-dimensional case. To overcome the main difficulties, we first transform the original system into a suitable dissipative system by introducing an effective tensor. Then we develop a new fractional time-weighted energy framework, combined with elegant commutator and bilinear estimates, to prove the global existence of strong solutions without the help of the common “div-curl" structure on the viscoelastic system.
Read the full abstract

Optimization and Control

Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values

We study non-rectangular robust Markov decision processes under the average-reward criterion, where the ambiguity set couples transition probabilities across states and the adversary commits to a stationary kernel for the entire horizon. We show that any history-dependent policy achieving sublinear expected regret uniformly over the ambiguity set is robust-optimal, and that the robust value admits a minimax representation as the infimum over the ambiguity set of the classical optimal gains, without requiring any form of rectangularity or robust dynamic programming principle. Under the weak communication assumption, we establish the existence of such policies by converting high-probability regret bounds from the average-reward reinforcement learning literature into the expected-regret criterion. We then introduce a transient-value framework to evaluate finite-time performance of robust optimal policies, proving that average-reward optimality alone can mask arbitrarily poor transients and deriving regret-based lower bounds on transient values. Finally, we construct an epoch-based policy that combines an optimal stationary policy for the worst-case model with an anytime-valid sequential test and an online learning fallback, achieving a constant-order transient value.
Read the full abstract

Information Theory

Physical Layer Security for Sensing-Communication-Computing-Control Closed Loop: A Systematic Security Perspective

In industrial automation or emergency rescue, sensors and robots work together with the help of an edge information hub (EIH) containing both communication and computing modules. Typically, the EIH collects the sensing data via the sensor-to-EIH link, processes data and then makes decisions on board before sending commands to the robot via the EIH-to-robot link. This forms a sensing-communication-computing-control (SC3) closed loop. In practice, the inherent openness of wireless links within the closed loop leads to susceptibility to eavesdropping. To this end, this paper refines the conventional physical layer security (PLS) approach with a systematic thinking to safeguard the SC3 closed loop. The closed-loop negentropy (CNE), a new metric for the performance of the whole SC3 closed loop, is maximized under the closed-loop security constraint. The transmit time, power, bandwidth of both wireless links, and the computing capability, are jointly designed. The optimization problem is non-convex. We leverage the Karush-Kuhn-Tucker (KKT) conditions and the monotonic optimization (MO) theory to derive its globally optimal solution. Simulation results show the performance gain of the proposed systematic approach, and reveal the advantage of exploiting the closed-loop structure-level PLS over the link-level or sum-link-level designs.
Read the full abstract

All authors Chengleyang Lei, Wei Feng, Yunfei Chen, Jue Wang, Ning Ge, Shi Jin, Tony Q. S. Quek

Differential Geometry

Weighted heat kernel comparison theorems and its applications in spectral geometry

In this paper, we firstly establish weighted heat kernel comparison theorems for the weighted heat equation on complete manifolds with radial curvatures bounded, and then by mainly using this conclusion, we can obtain two eigenvalue comparison theorems for the first Dirichlet eigenvalue of the Witten-Laplacian as applications in spectral geometry. Besides, as byproducts, eigenvalue comparisons for the first Dirichlet eigenvalue of the weighted $p$-Laplacian ($1<p<\infty$) have been established as well.
Read the full abstract

Mathematical Physics

Bispectrality and the ad conditions

At the beginning of the study of the bispectral problem, see [18], the ad-conditions played a crucial role in finding non-classical instances. The connection with the ad-conditions has reappeared in several different incarnations of the bispectral problem. Here we show that, properly adapted versions of these conditions, see [44], can play an important role in areas including, for instance, the study of exceptional orthogonal polynomials. This is also true in the non-commutative case. Even at this more advanced stage of the field one may hope that finding explicit solutions of these ad-conditions will provide an additional route to new examples.
Read the full abstract

Optimization and Control

Equilibrium Invariance, Proximality, and Surrogation: Moreau-Smoothed Best-Response Pathways in Stochastic Nonsmooth Games

Best-response (BR) schemes represent an important avenue for learning equilibria in noncooperative games. However, extant rate guarantees for BR schemes generally necessitate stringent smoothness requirements on player objectives and the availability of suitably defined eigenvalue bounds, significantly limiting the reach of such schemes, and few schemes if any exist for the efficient resolution of a broad class of nonsmooth and nonconvex games with expectation-valued objectives. This motivates our study of Moreau-smoothed BR schemes that allow for nonsmooth objectives. First, we consider a class of nonsmooth and strongly convex games (but potentially non-monotone) under uncertainty. By presenting an equilibrium invariance claim, we present synchronous and asynchronous schemes, equipped with linear and sublinear rate guarantees and associated complexity statements. Second, faced by weakly convex player objectives, we incorporate surrogation into the Moreau-smoothed best-response and show that the resulting smoothed quasi-Nash equilibrium (QNE) constitutes an $\mathcal{O}(\eta)$-QNE of the original weakly convex game, where $\eta > 0$ denotes the Moreau smoothing parameter. In this setting, we again present synchronous and asynchronous BR schemes, equipped with linear and sublinear rates and analogous complexity bounds. Preliminary numerics on a range of such games appear promising.
Read the full abstract

Analysis of PDEs

Gradient estimates for $p$-Laplacian equation with cubic polynomial nonlinearity on Riemannian manifolds

This paper studies a class of $p$-Laplace equations with cubic polynomial nonlinearity \[ \Delta_p v + (v-a_1)(v-a_2)(v-a_3) = 0 \] on complete Riemannian manifolds $M$ with lower Ricci curvature bounds, where $a_1 < a_2 < a_3$ are real constants and $\Delta_p v = \operatorname{div}(|\nabla v|^{p-2}\nabla v)$ denotes the $p$-Laplace operator. Depending on whether the solution lies in the intervals $(a_1,a_2), (a_2,a_3)$ or $(a_1,a_3)$, we employ, respectively, a logarithmic transformation or a hyperbolic tangent transformation to convert the original equation to another one for further analysis. Through a detailed analysis of the lower-bound estimate for the linearized operator of the new equation, and by combining Saloff-Coste's Sobolev inequality with a Moser iteration, we establish Cheng-Yau type gradient estimates under an additional assumption on $p$. As applications, the Liouville theorem and a Harnack inequality are further proved.
Read the full abstract

Information Theory

The Derivation Penalty in Premise-Erasure Caching: Capacity, Strong Converse, and Dispersion Dichotomy

We introduce an information-theoretic framework for caching in derivation-based reasoning engines under independent premise erasure. Two decoder models are compared: a coded scheme using an arbitrary bit-string cache with a general-purpose decoder, and a derivation-constrained scheme where the cache consists of logical facts and the decoder must produce a valid proof. Four coding theorems are established. The first proves that each derivation step carries a universal per-step information content determined by the base size. The second reveals an exponential capacity separation between linear-chain and balanced-merge Datalog architectures at equal depth. The third identifies a critical access frequency separating the regimes where caching and on-demand derivation are optimal. The fourth determines the minimum derivation-constrained cache under erasure, decomposing query information into reliable cache and noisy channel capacity. The central result is the derivation penalty: the ratio of the derivation-constrained cache to the coded cache converges to the reciprocal of the erasure rate, universally across query counts, overlap structures, and reliability targets. This penalty originates from a structural caching rigidity theorem showing that only cache facts within the target query's derivation DAG contribute to resilience, precluding cross-coordinate error correction. Beyond capacity, we prove a strong converse at the KL-divergence rate with Bahadur–Rao prefactors, a dispersion dichotomy (positive coded dispersion versus zero derivation-constrained dispersion), and a complete eight-regime phase diagram. The architecture-dependent depth-to-dependency mapping yields exponentially sharper phase transitions for the merge architecture. All results transfer across synonymous representations.
Read the full abstract

Probability

Quadratic Wiener functionals – transformations and quadratic forms

Quadratic Wiener functionals are investigated systematically through transformations of order one on the Wiener space with the help of Malliavin calculus. The bi-directional relationship between quadratic Wiener functionals and transformations of order one is established via change of variables formulas on the Wiener space. The relationship is applied to the investigation of Laplace transformations of quadratic Wiener functionals. This note is made due to establishing a systematic framework to study quadratic Wiener functionals and revisiting the past works by the author with the framework.
Read the full abstract

Algebraic Topology

Persistent Combinatorial Model of the Restricted Second Configuration Space of Metric Star Graphs

In this work, we present explicit constructions and computations of representative cycles for a nontrivial 2-parameter persistence module arising from the configuration space of metric star graphs. For all edge-length vector $\mathbf{L}=(L_1, L_2, \dots, L_k)\in(\mathbb{R}_{>0})^k$, we construct a bipartite weighted graph $(G_k)_{\mathbf{L}}$ and define filtering functions on the set of vertices and set of edges of $(G_k)_{\mathbf{L}}$ to obtain a filtration (denoted by $(G_k)_{-,\mathbf{L}}$) consisting of geometric realization of subgraphs of $(G_k)_{\mathbf{L}}$. We show that such a filtration is naturally isomorphic to the filtration of the restricted second configuration space of metric star graphs $(\mathsf{Star}_k)^2_{r,\mathbf{L}}$ concerning the restraint parameter $r$ and an (arbitrary but fixed) edge-length vector $\mathbf{L}$. Additionally, we show that the filtration $(G_k)_{-,\mathbf{L}}$ is compatible with the edge-length vector $\mathbf{L}$ up to isotopy, establishing an equivalence between the associated $(k+1)$-parameter persistence modules $PH_{i}((\mathsf{Star}_k)^2_{-,-};\mathbb{F})$ and $PH_{i}((G_k)_{-,-};\mathbb{F})$. We call the (multi-)filtration $(G_k)_{-,-}$ a persistent combinatorial model of the multifiltration $(\mathsf{Star}_k)^2_{-,-}$. Using this model, we construct explicit compatible cycle representatives for $PH_{1}((\mathsf{Star}_k)^2_{-,-};\mathbb{F})$ in the bifiltration obtained by fixing $L_2, \dots, L_k > 0$ and varying only $r$ and $L_1$.
Read the full abstract

Information Theory

Curvature-Weighted Capacity Allocation: A Minimum Description Length Framework for Layer-Adaptive Large Language Model Optimization

Layer-wise capacity in large language models is highly non-uniform: some layers contribute disproportionately to loss reduction, whereas others are nearly redundant. Existing layer-scoring methods provide sensitivity estimates but do not give a principled rule for converting those estimates into allocation or pruning decisions under a global hardware budget. We introduce a curvature-aware, MDL-inspired framework built around the layer gain $\zeta_k^2=g_k^\top\widetilde H_{kk}^{-1}g_k$. This quantity equals twice the maximal decrease predicted by the regularized layer-restricted quadratic model and incorporates inverse local curvature; it is therefore a local surrogate for reducible risk, not a universal dominance claim over gradient-norm scores. After normalizing the gains into scores $q_k$, we formulate two convex programs: one allocates expert slots under diminishing returns, and the other assigns layer-wise pruning ratios while protecting high-score layers. Both continuous programs have unique globally optimal solutions characterized by one dual variable and computable in $O(K\log(1/\varepsilon))$ time by bisection. We also prove a quadratic transfer-regret bound: when source and target score vectors differ by at most $\delta$, the target surrogate cost of the transferred decision is within $O(\delta^2)$ of the target optimum. Experiments on Mistral-7B and Gemma-7B show clear allocation gains in some settings and competitive, though mixed, pruning performance. The framework therefore replaces an empirical score-to-decision heuristic with a budget-feasible optimization procedure whose guarantees apply to the stated continuous surrogates. Code is available on github repo - [TKAI-LAB-Mali/Curvature-Weighted-Capacity-Allocation](https://github.com/TKAI-LAB-Mali/Curvature-Weighted-Capacity-Allocation.git)
Read the full abstract

All authors Theophilus Amaefuna, Hitesh Vaidya, Anshuman Chhabra, Ankur Mali

Numerical Analysis

From Frequency Bias to Spectral Balance: Operator-Aware Preconditioners for PINNs

When neural networks (NNs) are used as a type of nonlinear parametric representation to solve partial differential equations (PDEs), they often display frequency-dependent learning dynamics that can differ from those seen in direct function approximation tasks, resulting from a balance between the frequency bias of the NN representation and that of the underlying differential operator. Although many commonly used NNs exhibit a bias towards low-frequency modes in representation, the presence of differential operators in the loss function, which amplifies high-frequency components, can lead to high frequency bias. In this work, using second order elliptic PDEs as an example, we show how these two factors compete and lead to an overall frequency bias in different situations. Once the balance is determined, it is important to design computational strategies to counter the resulting bias to improve training efficiency. We propose a simple operator-aware preconditioning strategy that rebalances the optimization landscape and the learning dynamics by applying an auxiliary integral operator to the residual. The integral kernel can be the Green's function of a reference elliptic operator or an approximation, and integrates easily with common NN solvers for PDEs. Extensive experiments, including multiscale and variable-coefficient problems, show that the approach restores more balanced learning dynamics across modes and substantially improves both convergency and accuracy.
Read the full abstract

All authors Roy Y. He, Ying Liang, Hongkai Zhao, Yimin Zhong

Analysis of PDEs

The low mach number limit of global solutions to the full compressible Navier-Stokes system in critical Besov spaces with large initial data

We are concerned with global existence of regular solutions to full compressible Navier-Stokes equations and their asymptotic behavior when the Mach number is sufficiently small. We establish global existence in critical Besov spaces for arbitrary large initial date provided that the divergence-free component of initial velocity and the difference between initial temperature and density generate a global regular solution to incompressible Boussinesq systems. Moreover, we rigorously justify the convergence to the incompressible model as the Mach number tends to zero. The proof relies on a fine-grained analysis of the high-middle-low frequencies of density, velocity and temperature. Our result can be seen as an improvement on Danchin and He [Math. Ann., 366 (2016), no. 3-4, pp. 1365-1402], including the extension from small initial data to large initial data and new convergence results which hold at the level of critical regularity.
Read the full abstract

Combinatorics

A strong nullity parameter for rooted graphs

The inverse eigenvalue problem of a graph $G$ studies the possible spectra of matrices associated with $G$, including as an important subproblem the possible nullities of such a matrix. Much research in this area to date has focused only on the spectrum of the matrix itself, but there are applications of inverse eigenvalue problems that also involve the interaction between that spectrum and the spectrum of some maximal proper principal submatrix, or in other words the interlacing spectrum that results from crossing out any one row and the same column. Motivated by this refined information, given a graph $G$ on $n$ vertices with a designated root vertex, we investigate all possible nullity pairs where the first nullity is that of an $n \times n$ symmetric matrix associated to $G$ and the second nullity is that of the principal submatrix of size $(n - 1) \times (n - 1)$ that results from deleting the row and column associated to the root vertex. We define a new parameter $\xi\xi(G,i)$ for rooted graphs $(G,i)$ equipped with the strong nullity interlacing property that coordinates the two values of a nullity pair, and we show that this graph parameter is minor monotone. Moreover, we prove a bifurcation lemma for the strong nullity interlacing property. We use these new tools to characterize the rooted graphs with $\xi\xi(G,i) \geq s$ for $s \in \{ 0,1,2,3,4, 5\}$ by finding the minimal minors for each of these families. These families turn out to have strong connections to the minimal minors for $\xi(G) \geq k$.
Read the full abstract

All authors Aida Abiad, Mary Flagg, H. Tracy Hall, Jephian C.-H. Lin, Bryan Shader

Category Theory

Unbiasing symmetric monoidal categories in Lean

We present a formalization in Lean 4, within the framework of the mathematical library Mathlib, of the unbiasing process for symmetric monoidal categories. This is realized by extending the data of a symmetric monoidal category to a Cat-valued pseudofunctor from the (2,1)-category of spans of finite sets, encoding tensor products of higher arities and their coherences. The construction relies on a formalization of Mac Lane's coherence theorem using Piceghello's presentation of free symmetric monoidal categories as symmetric lists, and uses an encoding of universal formulas via an appropriate Kleisli bicategory.
Read the full abstract

Analysis of PDEs

Low Mach number limit of the compressible Navier-Stokes system for large initial date with critical regularity on the torus

We study the low Mach number limit of the compressible Navier-Stokes equations on the torus. For large initial data with critical regularity, we prove that solutions to the compressible Navier-Stokes system exist as long as the corresponding solutions to the incompressible Navier-Stokes system exist, provided that the Mach number is sufficiently small. Furthermore, we establish the convergence of solutions of the compressible system to those of the incompressible system as the Mach number tends to zero. Our approach combines high-medium-low frequency analysis of density and velocity with the solution filtering technique via acoustic wave groups. This work provides an affirmative answer to the problem posed by Danchin [Amer.J.Math.,124(2002),1153-1219]:"Does convergence hold for large data with critical regularity?"
Read the full abstract

Rings and Algebras

A finitely based finite semiring generates a variety with continuum many subvarieties

This paper establishes the existence of a finitely based finite semiring whose variety contains a continuum of subvarieties; such a variety is said to be of type \(2^{\aleph_0}\). Using the homomorphism theory of Kneser graphs, we prove that the 3-element semiring \(S_{53}\) is the first known example with this property. Moreover, \(S_{53}\) belongs to the variety of the max-plus semiring \((\mathbb{N},\max,+)\), which therefore is also of type \(2^{\aleph_0}\). For the finitely based 4-element semiring \(B_0\), we demonstrate that its variety contains infinitely many subvarieties and suggest that \(B_0\) could be another potential example of type \(2^{\aleph_0}\).
Read the full abstract