Rings and Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 22 February
We survey theory developed over the past 10 years of semirings which need not be additively cancellative. The main features are a specified “null ideal” $\mcA_0$ of a semiring $\mcA,$ taking the place of a zero element, and a “surpassing relation,” taking the place of equality, which permit generalizations of the classical algebraic theory to polynomials and their roots, algebraic geometry, matrices, linear algebra, varieties, categories, and module theory. The “pair” $(\mcA,\mcA_0)$ is studied along the lines of universal algebra.
Optimization and Control
CBO algorithm with average drift and applications to portfolio optimization
We propose a consensus based optimization algorithm with average drift (in short Ad-CBO) and provide a theoretical framework for it. In the theoretical analysis, we show that particle solutions to Ad-CBO converge to a global minimizer. In numerical simulations, we examine Ad-CBO's performance in optimizing static and dynamic objective functions. As a real-time application, we test the efficiency of Ad-CBO to find the optimal portfolio given stochastically evolving multi-asset prices in a financial market. The proposed Ad-CBO exhibits higher searching speed, lower tracking errors and regret bound than the CBO without stochastic diffusion
Read the full abstract
Number Theory
Proofs of Lupu's conjectures for multiple zeta values and multiple $t$-values
Let $r\ge 1$ be an integer. For any multiple index $\mathbf{s}=(s_1,s_2,\cdots,s_r) \in\mathbb{Z}_{\geq 1}^r$ with $s_r>1$, the multiple zeta value (MZV for short) is defined by \begin{align*} \zeta(s_1,s_2,\cdots,s_r):=\sum_{1\leq k_1<k_2<\cdots<k_r} \frac{1}{k_1^{s_1}k_2^{s_2}\cdots k_r^{s_r}} \end{align*} and the multiple $t$-value is defined by \begin{align*} t(s_1,s_2,...,s_r):=\sum_{1\leq k_1<k_2<...<k_r} \frac{1}{(2k_1-1)^{s_1}(2k_2-1)^{s_2}...(2k_r-1)^{s_r}}, \end{align*} where if the index is empty, then we define the value $t(\emptyset):=1$. We denote by $\{a_1,\cdots,a_k\}^d$ the sequence formed by repeating the sequence $\{a_1,\cdots,a_k\}$ exactly $d$ times. Let $H(a,b)=\zeta(\{2\}^a,3,\{2\}^b)$ and $T(a,b):=t(\{2\}^a,3,\{2\}^b)$. In this paper, by using the Lai-Lupu-Orr integral expressions for $H(a,b)$ and $T(a,b)$ and the properties of Beta function and Gamma function, we show that for any nonnegative integers $a$ and $b$, we have \begin{align*} H(a,b):=\frac{-4\pi^{2a+2b+2}}{(2a+2)!}\sum_{n=0}^{\infty} \frac{\zeta(2n)}{(2n+2a+2)(2n+2a+3)\cdots(2n+2a+2b+3)2^{2n}} \end{align*} and \begin{align*} T(a,b)=\frac{-2}{(2a+1)!}\left(\frac{\pi}{2}\right)^{2a+2b+2} \sum_{n=0}^{\infty}\frac{\zeta(2n)}{(2n+2a+1)(2n+2a+2)\cdots(2n+2a+2b+2)2^{2n}}. \end{align*} This confirms two conjectures of Lupu proposed in [C. Lupu, Another look at Zagier's formula for multiple zeta values involving Hoffman elements, Math. Z. 301 (2022), 3127-3140].
Read the full abstract
Probability
Bakry-Emery Curvature of the Fractional Laplacian via Fractional Brownian Covariance
We study Bakry-Emery curvature for fractional Laplacian generators using a Fourier representation of the carré du champ operator. For the stable generator of order gamma, the associated kernel on same-sign frequencies coincides with the covariance kernel of fractional Brownian motion with Hurst parameter equal to gamma divided by two. This observation allows the curvature inequality to be reformulated as a generalized eigenvalue problem for covariance matrices. On the one dimensional torus we analyze this matrix formulation for trigonometric polynomials. In the Cauchy case (gamma equal to one), corresponding to Brownian covariance, the eigenstructure can be computed explicitly and yields a Bakry-Emery curvature bound on the corresponding Fourier subspaces. We also study the effect of adding a confining drift to the Cauchy generator and show that the curvature spectrum undergoes a simple scalar shift. These results provide a matrix formulation of Bakry-Emery curvature for certain nonlocal operators and highlight a structural connection between fractional Laplacians and fractional Brownian covariance kernels.
Read the full abstract
Analysis of PDEs
An attractive analytic solution of the Maxwell's equation
In this paper, we aim to develop a closed-form solution of the standard Maxwell's equations that describe the propagation of electromagnetic waves in an isotropic homogeneous medium such as a vacuum. The proposed solution has a simple analytic structure that explains how initial conditions characterize the underlying electromagnetic wave. As such, it can be used as a tool to generate suitable electromagnetic waves in practice. The clean structure of the solution can also help us to derive closed-form solutions in a general medium with a non-zero current term. In this paper, we enhance the solution to cover a special case where the current comes from the contribution of an independent generator. We shall leverage the tools developed in this paper to derive similar closed-form solutions of Maxwell's equations in general mediums with non-zero currents in a separate paper.
Read the full abstract
Combinatorics · Cross-listed from cs.DS
An efficient recursive decomposition algorithm for undirected graphs
The decomposition of undirected graphs simplifies complex problems by breaking them into solvable subgraphs, following the philosophy of divide and conquer. This paper investigates the relationship between atom decomposition and the maximum cardinality search (MCS) ordering in general undirected graphs. Specifically, we prove that applying a convex extension to the node numbered $1$ and its neighborhood in an MCS ordering yields an atom in the graph. Furthermore, based on the MCS ordering, we introduce a recursive algorithm for decomposing an undirected graph into its atoms. This approach closely aligns with the results of chordal graph decomposition. As a result, minimal triangulation of the graph is no longer required, and the identification of clique minimal separators is avoided. In the experimental section, we combine the proposed decomposition algorithm with two existing convex expansion methods. The results show that both combinations significantly outperform the existing algorithms in terms of efficiency.
Read the full abstract
Mathematical Physics
Some effective operators for graphene monolayer superlattices, from variational perturbation theory
Our goal is to provide precise effective operators for monolayer graphene at Fermi energy. We consider the microscopic potential created by a lattice, and add a macroscopic potential with the same periodicity but varying at a scale $\varepsilon^{-1} \in \mathbb{N}$, creating a superlattice. Our approach combines a variational approximation with perturbation theory and a multiscale method. At the effective level the usual massless Dirac operator is enriched by other operators. We provide simulations for graphene to show the increased accuracy, and a theoretical result proving the improved validity time scale in the dynamical case.
Read the full abstract
Geometric Topology
Combinatorial Structure of Inert and Ambiguous Classes in Modular Group
We study inert, and ambiguous conjugacy classes in the modular group $\mathrm{PSL}(2,\mathbb{Z})$ from a purely combinatorial perspective. Using word length in the free product representation $\mathbb{Z}_2 * \mathbb{Z}_3$ of the modular group, we obtain exact counting formulas and asymptotic growth rates for inert and ambiguous classes. Our results provide the first counting formulas for inert classes obtained independently of Sarnak's analytic trace-based methods, while also establishing a combinatorial framework for ambiguous classes.
Read the full abstract
Metric Geometry
Stability of optimal transport on metric measure spaces
We prove a quantitative stability of Kantorovich potentials on metric measure spaces with lower Ricci curvature bound, thereby confirming a recent conjecture of Kitagawa, Letrouit and Mérigot. Our proof, which employs the heat kernel-regularized $c$-transform, does not rely on linear structure or sectional curvature bounds. As a corollary, we get a quantitative stability of optimal transport maps on Alexandrov spaces with lower curvature bound.
Read the full abstract
Combinatorics
Structure of sets with small product sets in torsion-free groups, cyclic groups of prime orders and abelian groups
Let $\ell$ and $m$ be positive integers with $\ell \leq m$, and let $\mathcal{A} = (A_1, \ldots, A_m)$ be a finite sequence of finite subsets of a group $G$ (not necessarily abelian), written multiplicatively. The generalized product set $\Pi^{\ell}(\mathcal{A})$ is the set of all elements of $G$ which can be represented as a product of exactly $\ell$ elements from $\ell$ distinct sets from $\mathcal{A}$ taken in any order. DeVos, Goddyn and Mohar obtained the nontrivial lower bound for the size of this product set when $G$ is abelian. The DeVos-Goddyn-Mohar Theorem is a fundamental result in additive combinatorics which unifies various results from zero-sum combinatorics and has connections with subsequence sums and sumsets. In this paper, we obtain an optimal lower bound for the size of generalized product set ${\Pi}^{\ell}(\mathcal{A})$ in torsion-free groups (not necessarily abelian), and characterize the structure of underlying sets in the sequence $\mathcal{A} = (A_1, \ldots, A_m)$ for which ${\Pi}^{\ell}(\mathcal{A})$ achieves the optimal lower bound. By slightly modifying the arguments of the proofs in the case of torsion-free groups, we derive such inverse theorems in cyclic groups of prime orders also. Our proof of these result also yields a new proof of DeVos-Goddyn-Mohar Theorem in $\mathbb{Z}_p$. Moreover, we extend these inverse results to arbitrary abelian groups. Furthermore, as an application, we generalize a theorem for subsequence sums due to Hamidoune in torsion-free groups, and obtain several other results for subsequence sums in arbitrary groups.
Read the full abstract
Functional Analysis
Orlicz Space Interpolation and Its Applications to Operator Convolution
We prove a strong-type interpolation result for noncommutative Orlicz spaces over semifinite von Neumann algebras. Based on this result, we obtain Young-type convolution estimates for the Weyl pseudodifferential symbols of operators in appropriate Orlicz-Schatten spaces. Equivalently, we prove convolution estimates of Young type for Werner's function-operator convolutions in quantum harmonic analysis.
Read the full abstract
Combinatorics
Some Families of Greedy Numerical Semigroups
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy representation of an element is optimal with respect to the number of summands. In this paper we identify some new families of greedy numerical semigroups.
Read the full abstract
Numerical Analysis
A weighted quantile filter based framework for interface optimal design problems
We present a robust and efficient numerical framework based on a median filter scheme for solving a broad class of interface optimal design problems, from image segmentation to topology optimization. A key innovation of our work is the extension of the binary scheme into a level-set scheme via a weighted quantile interpretation. Unlike traditional binary iterative convolution-thresholding method (ICTM), this continuous weighted quantile filter scheme effectively overcomes the pinning effect caused by spatial discretization, achieving interface evolution even with small time steps. We also provide a rigorous theoretical analysis, proving the unconditional energy stability of the iterative scheme. Furthermore, we prove that for a wide class of data fidelity terms, the convex relaxation inherently enforces a binary solution, justifying the effectiveness of the method without explicit penalization. Numerical experiments on the Chan–Vese model, the local intensity fitting (LIF) model, and topology optimization in Stokes flow demonstrate that the proposed efficient continuous framework effectively eliminates the pinning effect, guarantees unconditional energy stability, and accurately converges to binary solutions.
Read the full abstract
Algebraic Geometry
Picard bundles and Twisted Picard bundles on the Jacobian of a curve
Let $Y$ denote an irreducible projective curve with at most nodes as singularities and defined over an algebraically closed field of characteristic zero. We study the restriction of the twisted Picard bundles on the compactified Jacobian $\overline{J}(Y)$ of $Y$ to the embedded curve in $\overline{J}(Y)$. As an application, we show that for $g =2$ and each integer $r \ge 3$, there is a two-dimensional family of stable ACM bundles on the compactified Jacobian which has the Picard bundle in its limit. We define an embedding $\alpha_Y$ of the (generalised) Jacobian $J(Y)$ in the moduli space $U^s_Y(n,d)$ of stable vector bundles on $Y$ using a twisted restriction $E_Y$ of a Picard bundle to $Y \subset J(Y)$. We show that (under suitable conditions) the restriction of the universal bundle $\mathcal{U}$ to $Y \times J(Y)$ is stable for suitable polarisation. For the embedding of a smooth curve $Y$ given by $E_Y \otimes B, B$ a line bundle of degree $b$, we show that the restriction of the Picard bundle on $U^s_Y(n, d+nb)$ to $J(Y)$ is $\theta$-semistable for $b \ge 2g-1$ and $\theta$-stable for $b \ge 2g$. We also determine the relation between the restriction of the theta divisor on $U^s_Y(n,d+nb)$ to $J(Y)$ and the theta divisor $\theta$ on $\overline{J}(Y)$.
Read the full abstract
Analysis of PDEs
Local well-posedness for the Boltzmann equation with hard potentials
We consider the spatially inhomogeneous non-cutoff Boltzmann equation with hard potentials in the non-perturbative setting. For initial data with polynomial decay in the velocity variable, we establish the local-in-time existence and uniqueness of weak solutions, conditional to pointwise bounds on the hydrodynamic quantities (mass, energy, and entropy). Compared to the soft potential case, the key challenge for full-range hard potentials lies in the more severe loss of velocity moments. The proof combines a hypoelliptic estimate with interpolation inequalities to handle the moment-loss terms.
Read the full abstract
Representation Theory
Algebras in fusion categories: species and hereditary algebras
We initiate the study of non-semisimple algebras in fusion categories by establishing the framework of $\mathcal{C}$-species – analogous to the framework of species and quivers used in the study of Artin algebras. Under the (necessary) assumption that the fusion category is separable, we show that any algebra is Morita equivalent to an admissible quotient of the path algebra of a $\mathcal{C}$-species. Moreover, we show that an algebra is hereditary if and only if no further quotient is required. These results generalise that of Gabriel's for finite-dimensional algebras.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Incremental Learning of Sparse Attention Patterns in Transformers
Transformers integrate information from multiple past positions through sparse attention patterns that copy from specific locations. We study how these patterns form during training in a high-order Markov-chain setting, where the next token depends on several groups of past positions with differing statistical importance. Learning proceeds in discrete stages, each marked by the emergence of a sparse attention pattern for the next most important group. The dynamics are initially competitive, with all attention heads focusing on the dominant pattern, but later become cooperative, with different heads specializing in distinct patterns. For a tractable surrogate, the dynamics reduce to those of a tensor factorization problem, enabling us to prove stagewise convergence. Empirically, the number of stages completed depends on training set size, suggesting a form of implicit complexity control through early stopping. Overall, we give a theoretical account of how structured attention patterns and head specialization emerge without an explicit curriculum.
Read the full abstract
Information Theory
Derivation Depth as an Information Metric: Axioms, Coding Theorems, and Storage–Computation Tradeoffs
We introduce derivation depth-a computable metric of the reasoning effort needed to answer a query based on a given set of premises. We model information as a two-layered structure linking abstract knowledge with physical carriers, and separate essential core facts from operational shortcuts. For any finite premise base, we define and prove the computability of derivation depth. By encoding reasoning traces and applying information-theoretic incompressibility arguments, we establish fundamental bounds linking depth to the descriptive complexity of queries. For frequently asked, information-rich queries, the minimal description length grows proportionally to depth times the logarithm of the knowledge base size. This leads to a practical storage-computation tradeoff: queries accessed beyond a critical threshold become cheaper to cache than recompute. We formulate optimal cache allocation as a mathematical optimization problem solvable with approximation guarantees and extend the framework to handle noisy or incomplete knowledge bases.
Read the full abstract
Complex Variables
Reciprocal Polynomials with Zeros on the Unit Circle and Derivatives of Chebyshev Polynomials of the Second Kind
In this article, we consider the reciprocal antisymmetric polynomial \[P(z) = \sum_{j = 0}^{s}(-1)^j\gamma_j\left(z^j - z^{N + s + 1 - j}\right), \ \gamma_0 = 1.\] It is shown that if all the zeros of $P(z)$ are located on the unit circle, that $\displaystyle\left|\gamma_j\right| \leq {s \choose j}\left({N + s + 1 \choose j}\right)^{-1}$, $j = 1,\ldots,s$; moreover, these estimates cannot be improved in the general case. Factorization formulas for extremal polynomials are given: \[ \begin{align} \phantom{a} & \sum_{j = 0}^{s}(-1)^j{s \choose j}\left({N + s + 1 \choose j}\right)^{-1}\left(z^j - z^{N + s + 1 - j}\right) \\ &= (1 - z)^{2s + 1} \prod_{j = 1}^{\left[\frac{N - s}{2}\right]} \left[z^2 + 1 + 2z(1 - 2(\nu_j)^2)\right] \begin{cases} (1 + z), & N - s \mbox{ is odd} \\ 1, & N - s \mbox{ is even} \end{cases} \end{align} \] where $\left\{\nu_j\right\}_{j = 1}^{\left[\frac{N - s}{2}\right]}$ is the set of positive zeros of the polynomial $U_N^{(s)}(z)$ given $\displaystyle U_N(z) = \sum_{j = 0}^{\left[\frac{N}{2}\right]} (-1)^j \frac{(N - j)!}{j!(N - 2j)!}(2z)^{N - 2j}$ are the Chebyshev Polynomials of the Second Kind and $U_N^{(s)}(z)$ is the $s$th derivative of $U_N(z)$. As an application of the results, formulas were obtained expressing the derivatives of Chebyshev polynomials of the second kind through linear combinations of Chebyshev polynomials of the second kind: \[\frac{2^s}{s!}(1 - z^2)^sU_N^{(s)}(z) = (-1)^s \sum_{j = 0}^{s}(-1)^j{N-j \choose N-s} {N+s+1 \choose j} U_{N + s - 2j}(z). \]
Read the full abstract
Probability · Cross-listed from cs.LG
Robust Predictive Uncertainty and Double Descent in Contaminated Bayesian Random Features
We propose a robust Bayesian formulation of random feature (RF) regression that accounts explicitly for prior and likelihood misspecification via Huber-style contamination sets. Starting from the classical equivalence between ridge-regularized RF training and Bayesian inference with Gaussian priors and likelihoods, we replace the single prior and likelihood with $\epsilon$- and $\eta$-contaminated credal sets, respectively, and perform inference using pessimistic generalized Bayesian updating. We derive explicit and tractable bounds for the resulting lower and upper posterior predictive densities. These bounds show that, when contamination is moderate, prior and likelihood ambiguity effectively acts as a direct contamination of the posterior predictive distribution, yielding uncertainty envelopes around the classical Gaussian predictive. We introduce an Imprecise Highest Density Region (IHDR) for robust predictive uncertainty quantification and show that it admits an efficient approximation via an adjusted Gaussian credible interval. We further obtain predictive variance bounds (under a mild truncation approximation for the upper bound) and prove that they preserve the leading-order proportional-growth asymptotics known for RF models. Together, these results establish a robustness theory for Bayesian random features: predictive uncertainty remains computationally tractable, inherits the classical double-descent phase structure, and is improved by explicit worst-case guarantees under bounded prior and likelihood misspecification.
Read the full abstract
Mathematical Physics
Causal Architecture in Hidden Quantum Markov Models
We introduce a class of causal hidden quantum Markov models (cHQMMs) that reverse the usual order of hidden updates and emissions compared to conventional HQMMs. Using a simple qubit model with a rotating hidden state and sharp measurements, we show that these two architectures-emission then transition versus transition then emission-generally produce different quantum processes. They can be distinguished by measurements at arbitrarily late times, no matter how the hidden system is initialized, and even when the two models start from different initial states. This means that the two orders of operations lead to genuinely different observable behaviors that cannot be reconciled by waiting longer or by choosing special initial conditions. At the same time, we prove that the two architectures become equivalent when they arise from entangled liftings of classical hidden Markov models, sharing the same classical statistics. This identifies a clear dividing line between classical and genuinely quantum hidden memory. Our findings highlight causal HQMMs as a useful tool for studying and distinguishing quantum memory effects in sequential processes.
Read the full abstract
Probability
Solving Poisson's equation for Wasserstein contractive Markov chains
We study Poisson's equation in the context of general state space Markov chains. For chains satisfying a contraction assumption w.r.t. a Wasserstein distance, we show that a solution exists for Lipschitz functions and investigate its regularity properties. If the kernel is additionally reversible we are also able to show that solutions for $L^p$ functions exist. Combining our findings with Doob's inequalities for martingales we derive maximal inequalities for contractive Markov chains. A number of examples is provided to demonstrate the applicability of our results, in particular in the context of Markov chain Monte Carlo methods.
Read the full abstract
General Topology
Soft Uniform Spaces and Soft Uniform Continuity: Induced Topologies, Separation, and Compactness-Type Results
Soft uniform structures provide a way to describe uniform closeness in a parameterized setting. Over a fixed parameter set, entourages are treated as soft relations, and a soft uniformity is defined by axioms parallel to the classical entourage axioms. Each soft uniformity induces two related topologies: a sectionwise soft topology \(\tau_{\sU}\) on \(F\), and an ordinary soft-element topology \(\TU\) on \(\SE(F)\). Both constructions are described. The space \((\SE(F),\TU)\) is Hausdorff, equivalently \(T_1\), exactly when the soft uniformity is separated, and it is regular for every soft uniformity. Soft uniformly continuous mappings are then studied, and a Heine–Cantor type theorem is proved when the soft-element topology of the domain is compact. Finally, total boundedness and completeness are formulated for the canonical soft-element uniform space \((\SE(F),\sU_{\SE})\), and compactness of \((\SE(F),\TU)\) is shown to imply both properties. Examples relate the theory to uniformities generated by classical structures and illustrate the role of the parameter set.
Read the full abstract
Functional Analysis
Weighted conditional expectation operators and nuclearity
We provide a characterisations of nuclear weighted conditional expectation operators on $L^p(\mu)$-spaces, for $1\leq p<\infty$. As a consequence, when the underlying measure space is non-atomic, the only nuclear weighted conditional expectation operator on $L^p(\mu)$-spaces is the zero operator.
Read the full abstract
Analysis of PDEs
Weighted well-posedness and kernel stability for coercive evolution equations with measure-valued delays
We consider coercive evolution equations with measure-valued delay on a Gelfand triple. The delayed feedback is induced by a bounded form on $V$ and may contain principal spatial derivatives, so it is naturally $V^*$-valued rather than bounded on the pivot space. For every finite signed Borel kernel with no atom at the origin, an exponential weight makes the causal history operator contractive relative to the coercive parabolic solution operator. This yields finite-time well-posedness without a smallness condition on the total variation and without any positivity assumption on the delayed form. An asymmetric residual identity gives a total-variation Lipschitz estimate for signed kernels and strong stability for non-negative retarded kernels under narrow, equivalently weak, convergence of finite measures. A delayed-diffusion realisation shows that the framework genuinely covers principal-part delays, and narrow stability yields qualitative distributed-to-discrete convergence at every fixed positive lag.
Read the full abstract
Combinatorics
Structural similarity between polyhedral embeddings and their duals and its application to self-duality of pathwidth
Let $G$ be a graph embedded on a closed surface. We call $G$ a polyhedral embedding if all facial walks are cycles, and any two of them are either disjoint or intersect in a single vertex or a single edge. In this paper, we present a new bound on the relation between the pathwidth of a polyhedral embedding and its dual. More precisely, we prove that for a polyhedral embedding $G$ on a closed surface with Euler characteristic $\chi$, $\mathsf{pw}(G^*) \leq 3\ \mathsf{pw}(G)+c$, where $c$ is a constant depending only on $\chi$. This result improves the coefficient of $\mathsf{pw}(G)$ in the previously known bound by Fomin and Thilikos (2007) and extends that of Amini, Huc, and Pérennes (2009) for plane graphs. Furthermore, we obtain analogous bounds on the treewidth and pathwidth of the face subdivision of a polyhedral embedding. Our approach is based on a new quantitative estimate which demonstrates the structural similarity between a polyhedral embedding and its dual.
Read the full abstract
Numerical Analysis
Forward Error-Oriented Iterative Refinement for Eigenvectors of a Real Symmetric Matrix
In this paper, we discuss numerical methods for the eigenvalue decomposition of real symmetric matrices. While many existing methods can compute approximate eigenpairs with sufficiently small backward errors, the magnitude of the resulting forward errors is often unknown. Consequently, when high-precision numerical solutions are required, the computational cost tends to increase significantly because backward errors must be reduced to an excessive degree. To address this issue, we propose an efficient approximation algorithm that aims to achieve a prescribed forward error, together with a high-accuracy numerical algorithm based on the Ozaki scheme – an emulation technique for matrix multiplication – adapted to this problem. Since the proposed method is not primarily focused on reducing backward errors, the computational cost can be significantly reduced. Finally, we present numerical experiments to evaluate the efficiency of the proposed method.
Read the full abstract
Combinatorics
$2$-limited broadcast domination in cubic graphs
For a graph $G$, a function $f:V(G) \to \{0,1,2\}$ is called a $2$-limited dominating broadcast on $G$ if for every vertex $u$, there exists a vertex $v$ such that $f(v)>0$ and the distance between $u$ and $v$ in $G$ is at most $f(v)$. The cost of $f$ means the value $\sum_{v\in V(G)}f(v)$, and the {\it $2$-limited broadcast domination number} of $G$, denoted by $\gamma_{b,2}(G)$, is the cost of a $2$-limited dominating broadcast on $G$ with minimum cost. Henning, MacGillivray, and Yang (2020) conjectured that $\gamma_{b,2}(G)\leq \frac{|V(G)|}{3}$ for every cubic graph $G$. In this paper, we confirm the conjecture.
Read the full abstract
Functional Analysis
A compensated compactness theorem for pseudodifferential operators on vector bundles
We establish a compensated compactness theorem in the microlocal and geometric analytic framework. For a weakly $L^2_{\rm loc}$-convergent sequence of sections of a vector bundle over a semi-Riemannian manifold whose image under a pseudo-differential operator $\mathscr{A}$ of order $s>0$ is precompact in $H^{-s}_{\rm loc}$, we show that a quadratic form $Q$ acting on this sequence converges in the distributional sense, provided that $Q$ vanishes on the operator cone of $\mathscr{A}$. This extends the classical Murat–Tartar theory of compensated compactness from constant-coefficient first-order differential constraints on Euclidean spaces to variable-coefficient pseudo-differential constraints of arbitrary order on semi-Riemannian manifolds.
Read the full abstract
Analysis of PDEs
Non-uniqueness of smooth solutions to the Navier-Stokes equations on torus $\TTT^2$
The local well-posedness theory for the incompressible Navier-Stokes equations in $\BMO^{-1}$ has attracted considerable attention over the past two decades. In a recent breakthrough, Coiculescu and Palasek (Invent. Math., 2025) settled the three-dimensional case by demonstrating the existence of two distinct global solutions, both smooth for $t>0$, evolving from a common initial datum in ${\rm BMO}^{-1}(\mathbb{T}^3)$. However, the two-dimensional case remains open. In this paper, we solve the two-dimensional problem. Unlike its three-dimensional counterpart, the two-dimensional setting presents additional difficulties stemming from the geometric intersections of two-dimensional Mikado flows. To overcome these difficulties, we develop a heat-dominated Fourier mode flow built upon steady two-dimensional Euler flows, and present the proof using a new iterative scheme.