Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 23 April

Rings and Algebras

Three-periodic helices on elliptic curves and their associated regular algebras

Let $k$ denote an algebraically closed field of characteristic zero and let $X$ denote a smooth elliptic curve over $k$. Given a three-periodic elliptic helix $\underline{\mathcal{E}}$ of vector bundles over $X$ with endomorphism $\mathbb{Z}$-algebra $\operatorname{End} \underline{\mathcal{E}}$ and quadratic cover $\mathbb{S}^{nc}(\underline{\mathcal{E}})$, we prove that $\operatorname{End} \underline{\mathcal{E}}$ is the quotient of $\mathbb{S}^{nc}(\underline{\mathcal{E}})$ by a degree three family of normal elements, generalizing a result of the authors to the case in which $\operatorname{dim }(\operatorname{End} \underline{\mathcal{E}})_{i, i+1}$ isn't a constant function of $i$. We then show that $\operatorname{End} \underline{\mathcal{E}}$ is noetherian if and only if it has polynomial growth, and in this case, the ranks of any three consecutive bundles in the helix are a Markov triple. Furthermore, in this case $\mathbb{S}^{nc}(\underline{\mathcal{E}})$ is a noetherian GK-three $\mathbb{Z}$-algebra which is ${\sf Proj }$-equivalent to an elliptic algebra. We conclude the paper by constructing several new families of elliptic helices with exponential growth.
Read the full abstract

Numerical Analysis

Guaranteed inf-sup bounds and existence verification for semilinear elliptic problems via nonconforming finite elements

A Newton-Kantorovich-type argument enables the a posteriori existence verification of a locally unique regular root near a computed approximation. This framework allows for non-selfadjoint problems and extends the existing verification theory to nonconforming discretisations. A key ingredient is a guaranteed lower bound for the continuous inf-sup constant of the linearisation obtained with a novel approximation error bound for nonconforming schemes. All quantities are obtained from a postprocessing on the same discretisation within the adaptive loop. The theory is applied to a fourth-order formulation of the stationary 2D Navier-Stokes equations and illustrated by numerical experiments.
Read the full abstract

Probability

Color–Phase Separation for Mixed Random Operators in Two-Speed Stochastic Klein–Gordon Systems

We study a two-component stochastic fractional Klein–Gordon system on the three-dimensional torus with fractional dispersion exponent \(\alpha\), distinct propagation speeds, and a pure cross nonlinearity. The singular mixed terms combine a low–high paraproduct inside a Duhamel integral with an outer resonant product. Their structure is governed by two index pairs: the color pair determines the possible Gaussian contraction, whereas the propagator–input pair determines the Duhamel phase. In every same-color block generated by the interaction graph, the outer propagator has a different speed. The contracted term is therefore a Fourier-diagonal Volterra multiplier, and integration by parts in time yields a factor of order \(N^{-\alpha}\) at frequency scale \(N\). For the centered remainder we give a finite Hilbert-space kernel normal form that preserves the Fourier incidence relation and reduces the operator estimate to oriented Gaussian-tensor flattenings. For independent noises we construct the enhanced stochastic data, prove local well-posedness in the prescribed enhanced paracontrolled/Galerkin class, and establish pathwise convergence of the Fourier–Galerkin equations for \(12/13<\alpha\le1\). We also prove a logically separate perturbative extension to Fourier-diagonal color covariances with frequency-decaying off-diagonal entries.
Read the full abstract

Algebraic Geometry

A theory of generalized Lamé curves

We study the generalized Lam'e equation (GLE) on an elliptic curve $E$ with multiple regular singularities $\mathbf{p} = (p_i)_{i = 1}^r$ of weights $\mathbf{n} = (n_i)_{i = 1}^r$. By analyzing the locus admitting quasi-periodic solutions, we construct two fundamental algebraic curves: (i) The generalized Lam'e curve (GLC), $\mathcal{Y}_{\mathbf{n}, \mathbf{p}}$, which lies in an affine bundle over $\operatorname{Sym}^n E$ for total weight $n:=\sum n_i \in \mathbb{Z}_{\geq 0}$ and parametrizes generalized Hermite–Halphen ansatz solutions. (ii) The log-free curve, $V_{\mathbf{n}, \mathbf{p}}$, a non-complete intersection variety arising when all $n_i \in \frac{1}{2}\mathbb{N}$, which we prove is a reduced curve, confirming a conjecture of Wang. We analyze the GLC as an algebraic family over the pole configuration space. By studying the addition map$$\sigma \colon \operatorname{Sym}^n E \longrightarrow E,$$where we establish a generically finite, universal degree formula, we show that the geometry of boundary degenerations under pole collisions perfectly mirrors the tensor algebra of $\mathfrak{sl}_2(\mathbb{C})$-modules within the BGG category $\mathcal{O}$. This provides the local structural limits needed to establish the global flatness of the GLC. Furthermore, we develop a framework of twisted isomonodromic deformations and construct $(\mathbf{n}, \mathbf{p})$-deformed pre-modular forms parameterized by twisted monodromy data $(t,s)$. Their vanishing solves the underlying monodromy problem and factorizes along boundary strata, allowing an arbitrary configuration to be continuously deformed down to the classical Lam'e equation. Finally, using an asymptotic scaling technique, we give a complete extension of Treibich's generic counting for $r=2$ symmetric pairs to all smooth elliptic curves.
Read the full abstract

Geometric Topology

One-dimensional non-Hausdorff manifolds and CW complexes

Say that a connected non-Hausdorff one-dimensional manifold $M$ is "graph-like", whenever the set $M_{br}$ of its non-Hausdorff (called "branch") points is locally finite and every connected component of its complement has a countable base. We prove that for every graph-like manifold $M$ there exists a one-dimensional CW complex $K$ with the set of vertices $K^{(0)}$, a vertex $v\in K^{(0)}$ and a (surjective) quotient map $\pi\colon M \to K\setminus\{v\}$ such that $\pi^{-1}(K^{(0)}\setminus \{v\}) = M_{br}\cup\partial M$. Conversely, existence of such quotient map $\pi$ and the assumption that $M_{br}$ is nowhere dense imply that $M$ is graph-like. Moreover, in this case $K\setminus\{v\}$ is the minimal Hausdorff factor of $M$, that is, for every continuous map $f\colon M \to N$ into a Hausdorff space $N$ there exists a unique continuous map $\hat{f}\colon K\setminus\{v\}\to N$ such that $f = \hat{f}\circ\pi$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Nonparametric f-Modeling for Empirical Bayes Inference with Unequal and Unknown Variances

Empirical Bayes methods are widely used for large-scale inference, yet most classical approaches assume homoscedastic observations and focus primarily on posterior mean estimation. We develop a nonparametric empirical Bayes framework for the heteroscedastic normal means problem with unequal and unknown variances. Our first contribution is a generalized Tweedie-type identity that expresses the Bayes estimator entirely in terms of the joint marginal density of the observed statistics and its partial derivatives, extending the classical Tweedie's formula to settings with heterogeneous and unknown variances. Our second contribution is to introduce a moment-generating-function representation that enables recovery of the full posterior distribution within the f-modeling paradigm without specifying or estimating the prior distribution. The resulting method provides a unified framework for point estimation, uncertainty quantification, and hypothesis testing while accommodating arbitrary dependence between means and variances. Simulation studies and real-data analysis demonstrate that the proposed approach achieves accurate shrinkage estimation and reliable posterior inference in heterogeneous data environments.
Read the full abstract

Numerical Analysis · Cross-listed from physics.flu-dyn

Meshless $h$-adaptive Solution for non-Newtonian Natural Convection in a Differentially Heated Cavity

One of the main challenges in numerically solving partial differential equations is finding a discretisation for the computational domain that balances the accurate representation of the underlying field with computational efficiency. Meshless methods approximate differential operators based on the values of the field in computational nodes, offering a natural approach to adaptivity. The density of computational nodes can either be increased to enhance accuracy or decreased to reduce the number of numerical operations, depending on the properties of the intermediate solution. In this paper, we utilise an adaptive discretisation approach for the numerical simulation of natural convection in non-Newtonian fluid flow. The shear-thinning behaviour is interesting both due to its numerous occurrences in nature, blood being a prime example, and due to its properties, as the decreasing viscosity with increasing shear rate results in sharper flow structures. We focus on the de Vahl Davis test case, a natural convection driven flow in a differentially heated rectangular cavity. The thin boundary layer flow along the vertical boundaries makes this an ideal test case for refinement. We demonstrate that adaptively refining the node density enhances computational efficiency and examine how the parameters for adaptive refinement affect the solution.
Read the full abstract

Combinatorics

Counting sunflowers with restricted matching number

For $\mathcal H\subseteq\binom{[n]}k$, let $\nu(\mathcal H)$ denote its matching number and let $d_{\mathcal H}(E)$ denote the codegree of a $(k-1)$-set $E$. We study the codegree moments $ co_p(\mathcal H)=\sum_{E\in\binom{[n]}{k-1}}d_{\mathcal H}(E)^p $ and the number of copies of the $k$-uniform $l$-petal sunflower $S_{k,l}^{k-1}$ whose core has size $k-1$. For fixed $k,s,l$ and $p$, and all sufficiently large $n$, we prove that among all $k$-uniform families with matching number at most $s$, both quantities are uniquely maximized by \[ \mathcal H_{n,k,s}=\left\{F\in\binom{[n]}k:F\cap[s]\neq\emptyset\right\}. \] Thus the sunflower result is the generalized Turán problem $\operatorname{ex}_k(n,S_{k,l}^{k-1},M_{s+1})$. When $k=3$, we make the threshold effective: for every integer $p\geq1$, the codegree-moment conclusion holds for $n\geq6s+3$. The proof combines a Hilton–Milner-type stability theorem of Frankl and Kupavskii with a high-codegree-shadow reduction and a convex moment estimate.
Read the full abstract

Combinatorics

Straight polyomino tilings of rectangles and special rim-hook tableaux

We derive explicit rational generating functions for weighted tilings of $2k\times n$ rectangles by straight $k\times 1$ tiles. Our approach combines a decomposition by fault lines with a Hadamard-product framework. Tools from algebraic combinatorics are used together with an identity of Littlewood on Schur expansions of plethystic compositions of elementary symmetric functions. This translates the tiling problem into a combinatorial framework via special rim-hook tableaux. On the tiling side, Graham's theorem on fault-free tilings provides the key input needed to complete the analysis.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Betting on Bets: Anytime-Valid Tests for Stochastic Dominance

How can we monitor, in real time, whether one uncertain prospect has any upside over another? To answer this question, we develop a novel family of sequential, anytime-valid tests for stochastic dominance (SD), a classical and popular notion for comparing entire distribution functions. The problem is distinct from that of testing mean dominance, and it is particularly useful when comparing distributions with similar means or with ordinal outcomes. We first derive powerful, nonparametric e-processes that quantify evidence against the null hypothesis that one prospect is stochastically dominated by another. For first-order SD, these e-processes are based on mixtures of growth-rate optimal e-variables, yielding a test of power one that retains validity under continuous monitoring. We then generalize the approach to sequential testing for higher-order SD and other integral stochastic orders. Empirically, we find that the tests are competitive in power with classical, non-anytime-valid SD tests. Our real-world application examines a controversial phenomenon in baseball analytics, known as the "third-time-through-the-order (3TTO) penalty," viewed as a monitoring problem. We close by sketching the complementary problem of testing whether a prospect has a definite upside, formalizing conditions under which we can derive a powerful anytime-valid test.
Read the full abstract

All authors Sebastian Arnold, Yo Joong Choe, Marco Scarsini, Ilia Tsetlin

Numerical Analysis · Cross-listed from stat.ML

Beyond Expected Information Gain: Stable Bayesian Optimal Experimental Design with Integral Probability Metrics and Plug-and-Play Extensions

Bayesian Optimal Experimental Design (BOED) provides a rigorous framework for decision-making tasks in which data acquisition is often the critical bottleneck, especially in resource-constrained settings. Traditionally, BOED typically selects designs by maximizing expected information gain (EIG), commonly defined through the Kullback-Leibler (KL) divergence. However, classical evaluation of EIG often involves challenging nested expectations, and even advanced variational methods leave the underlying log-density-ratio objective unchanged. As a result, support mismatch, tail underestimation, and rare-event sensitivity remain intrinsic concerns for KL-based BOED. To address these fundamental bottlenecks, we introduce an IPM-based BOED framework that replaces density-based divergences with integral probability metrics (IPMs), including the Wasserstein distance, Maximum Mean Discrepancy, and Energy Distance, resulting in a highly flexible plug-and-play BOED framework. We establish theoretical guarantees showing that IPM-based utilities provide stronger geometry-aware stability under surrogate-model error and prior misspecification than classical EIG-based utilities. We also validate the proposed framework empirically, demonstrating that IPM-based designs yield highly concentrated credible sets. Furthermore, by extending the same sample-based BOED template in a plug-and-play manner to geometry-aware discrepancies beyond the IPM class, illustrated by a neural optimal transport estimator, we achieve accurate optimal designs in high-dimensional settings where conventional nested Monte Carlo estimators and advanced variational methods fail.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Does PCA Work for Rough Functional Data?

Functional data analysis is concerned with the analysis of infinite-dimensional data functions. Functional principal component analysis (FPCA) is a key method to obtain finite-dimensional summaries. Consistency of FPCA has been theoretically established for sufficiently regular data functions. However, empirical evidence shows that FPCA can become severely inconsistent when the underlying functions are too rough. This paper provides the first theoretical explanation for this phenomenon. We propose a model that explicitly captures the roughness of functional data and allows us to quantify the resulting bias of FPCA, depending on the functional roughness. The model undergoes a phase transition marking the point at which FPCA becomes entirely uninformative. Based on these probabilistic results, we discuss diagnostic tests for informative principal components. As an additional contribution, we derive results on spectral statistics that may serve as a foundation for goodness-of-fit tests for rough functional data. Mathematically, our approach combines recent advances in random matrix theory and generic chaining with tools from FDA. We illustrate the effects of roughness on FPCA using simulations, as well as climate and environmental datasets.
Read the full abstract

Combinatorics

Anti-Ramsey numbers for cancellative configurations in p-graphs

We study edge-colorings of the complete $p$-graph on $n$ vertices that contain no three edges $A,B,C$ of distinct colors such that the symmetric difference of $A$ and $B$ is contained in $C$. For $p\ge3$ and $n\ge p+1$, we show that every such coloring contains at most $1+\floor{n/p}$ colors and characterize the extremal colorings, generalizing a theorem of Erdős, Simonovits and Sós. %\cite{erdos1975}. When $p=3$, the condition $A\triangle B\subseteq C$ implies $|A\triangle B|=2$, and the three edges necessarily form a copy of $F_4\coloneqq\{abc,abd,bcd\}$ or $F_5\coloneqq\{abc,abd,cde\}$. For $n\ge5$, we show that every rainbow $F_5$-free edge-coloring is rainbow cancellative. For rainbow $F_4$-free colorings, we construct colorings with $m(n)+1$ colors for all $n\ge4$, where $m(n)$ is the size of a maximum partial Steiner triple system of order $n$ and satisfies $m(n)=n^2/6+O(n)$, improving the linear lower bound by Budden and Stiles. %\cite{budden}. Moreover, for $n=2^s-1$, we obtain $\ar(n,F_4)\ge m(n)+n^2/42+o(n^2)=4n^2/21+o(n^2)$ via a construction based on independent sets in the Grassmann graph. We also prove that $\ar(n,F_4)\le (5n^2-8n)/21$ for $n\ge4$, improving the quadratic coefficient in the upper bound of Budden and Stiles from $1/4$ to $5/21$.
Read the full abstract

Operator Algebras

Gauging the Categorical Connes' $\tilde{\chi}(M)$

We prove that if a finite group $G$ acts outerly on a McDuff $\rm II_1$ factor $M$, then $\mathsf{Rep}(G/KL)$ is a braided monoidal full subcategory of the categorical Connes' $\tilde{\chi}(M\rtimes G)$ defined in arXiv:2111.06378, where $K$ and $L$ are the centrally trivial and approximately inner parts in $G$ respectively. When $L$ is trivial, we give an explicit formula for the $G/K$-gauging procedure on $\tilde{\chi}(M\rtimes G)$. This is the categorical generalization of Connes' short exact sequence on $\chi(M\rtimes G)$. Using this machinery, for any finite group $G$, we construct a McDuff $\rm II_1$ factor $M$, whose $\tilde{\chi}(M)$ is braided equivalent to $\mathsf{Rep}(G)$. This is the first example of a braided fusion category which is not modular as $\tilde\chi$.
Read the full abstract

Dynamical Systems

On the algebra of Koopman eigenfunctions and on some of their infinities

For continuous-time dynamical systems with reversible trajectories, the nowhere-vanishing eigenfunctions of the Koopman operator of the system form a multiplicative group. Here, we exploit this property to accelerate the systematic numerical computation of the eigenspaces of the operator. Given a small set of (so-called “principal”) eigenfunctions that are approximated conventionally, we can obtain a much larger set by constructing polynomials of the principal eigenfunctions. This enriches the set, and thus allows us to more accurately represent application-specific observables. Often, eigenfunctions exhibit localized singularities (e.g. in simple, one-dimensional problems with multiple steady states) or extended ones (e.g. in simple, two-dimensional problems possessing a limit cycle, or a separatrix); we discuss eigenfunction matching/continuation across such singularities. By handling eigenfunction singularities and enabling their continuation, our approach supports learning consistent global representations from locally sampled data. This is particularly relevant for multistable systems and applications with sparse or fragmented measurements.
Read the full abstract

All authors Zahra Monfared, Saksham Malhotra, Sekiya Hajime, Ioannis Kevrekidis, Felix Dietrich

Numerical Analysis

Direct Problem for Gas Diffusion in Polar Firn with Variable Coefficients

We consider the mathematical model of gas trapping in deep polar ice (firns), which consists of a parabolic partial differential equation, that can degenerate at one boundary extreme. In [1], we considered all the coefficients to be constants, except the diffusion coefficient D(z) that is to be reconstructed. In this paper, we assume both the diffusion coefficient D(z) and the volume fraction f(z) are functions. The difficulty in this problem, both theoretically and computationally, arises from the fact that D(z) and f(z) may be zero at bottom of the firn. To handle such degeneracy, we defined appropriate weighted Sobolev spaces and used Lion's theorem to prove existence and uniqueness of the semi-variational formulation of the Firn PDE. A full discrete system is obtained through a P1 Finite element Galerkin procedure in space and an Euler-Implicit scheme in time. Sufficient conditions for the existence and uniqueness of the solution for the discrete system are obtained.
Read the full abstract

Numerical Analysis

Formulae for the Drazin inverse of Modified Tensors via the Einstein Product

This paper establishes exact expressions for the Drazin inverse of the modified tensor $\mathcal A-\mathcal C*_N\mathcal D^D*_N\mathcal B$ via the Einstein product, formulated using the Drazin inverse of $\mathcal A$ and the generalized Schur complement $\mathcal D-\mathcal B*_N\mathcal A^{D}*_N\mathcal C$, providing a comprehensive generalization and unification of existing results in the literature for the case when the tensors are of order two. Furthermore, the findings reduce to the classical Sherman-Morrison-Woodbury formula in the special case of second-order tensors. Finally, we give an example to illustrate our new explicit expression.
Read the full abstract

Numerical Analysis

Norm-based convergence bounds for nonsymmetric algebraic V-cycle multigrid methods

Recently a new approach to analyze and create algebraic multigrid methods (AMG) for nonsymmetric and indefinite matrices was established. Convergence is measured in general norms induced by a certain HPD matrix $B$ and $B$-orthogonal projections built by compatible transfer operators are used. Here we continue our theoretical framework, started in Nabben and Rooch (2026), for nonsymmetric algebraic multigrid methods using any HPD matrix $B$ to induce a norm. Our framework not only includes all recent results but also provides many new results. We consider two, slightly different, multigrid operators. The first one is the natural generalization of the error operator in the HPD case. The second operator is simpler to apply and has been studied before. However, an additional condition for the smoother $M^{-1}A$ is needed, which is in our terminology the $B$-normality. We explain the differences and similarities of both operators in detail and show, why the extra condition is needed. We consider arbitrary interpolation and restriction operators that result in $B$-orthogonal coarse-grid corrections and give sharp estimates for the norm of the error propagation matrices for the two-grid methods. We also show, that the norms are decreasing if we increase the size of the coarse space. Moreover, we are able to extend the landmark $V$-cycle bound by McCormick to the nonsymmetric case.
Read the full abstract

Logic

Projective Chromatic Numbers

We extend classical notions of definable colourability of graphs to the general projective setting and investigate whether known results, mainly about the $G_0$ dichotomy and the $2n + 1$ conjecture, hold in the context of higher projective pointclasses. We establish that for $n \ge 2$, the presence of a $\mathbf{\Delta}^1_n$-definable well-order of the reals implies $\chi_{\mathbf{\Delta^1_n}}(G) = \chi(G)$ for all locally countable $\mathbf{\Delta^1_n}$-definable graphs $G$, and that the presence of a $\mathbf{\Delta^1_2}$-definable well-order of the reals implies $\chi_{\mathbf{\Delta^1_2}}(G) = \chi(G)$ for all locally countable Borel graphs $G$.
Read the full abstract

Information Theory

Generalized Two-Dimensional Index Modulation in the Code-Spatial Domain for LPWAN

Low-power wide-area networks (LPWANs) are crucial for large-scale Internet of Things (IoT) applications, yet they face increasing demands for higher data rates, improved reliability, and enhanced energy efficiency under stringent hardware constraints. To address these challenges, this paper introduces a generalized code-index modulation (CIM) transceiver that employs multiple-antenna index modulation (IM). The transmitter integrates spatial modulation (SM), space-time block coding (STBC), and CIM into a unified two-dimensional (2D) coding structure, where the spreading sequences – realized via continuous phase modulation with spread spectrum (CPM-SS), chirp spread spectrum, or Zadoff-Chu sequences – serve as spreading codes. Three specific schemes are proposed: SM-CIM, STBC-SM-CIM, and an enhanced STBC-SM-CIM (ESTBC-SM-CIM), designed to jointly improve data rate and energy efficiency. Closed-form expressions for the average bit error probability are derived, and system performance is analyzed in terms of data rate, energy efficiency, and computational complexity. Simulation results show that the proposed designs consistently outperform benchmark schemes, demonstrating their potential for enabling high-data-rate, energy-efficient LPWAN and IoT communications.
Read the full abstract

All authors Long Yuan, Wenkun Wen, Junlin Liu, Peiran Wu, Minghua Xia

Information Theory

Recursive Structure of Hulls of PRM Codes

For a nonnegative integer $r$ and a positive integer $v$ satisfying \[ \frac{r(q-1)}{2}<v<\frac{(r+1)(q-1)}{2}, \] we define the combinatorial numbers \[ A_r(v)= \begin{cases} \displaystyle \sum_{t=r(q-1)-v}^{v}\ \sum_{j=0}^{r}(-1)^j\binom{r}{j}\binom{t-jq+r-1}{r-1}, & r>0,\\[1.2ex] 1, & r=0. \end{cases} \] For the projective Reed-Muller code $\PRM(q,m,v)$, we determine its hull dimension: \[ \dim \Hull\bigl(\PRM(q,m,v)\bigr) = \dim \PRM(q,m,v) - \sum_{i=0}^{\ell}A_{2i+\epsilon}\bigl(v-(\ell-i)(q-1)\bigr), \] where \[ \ell=\Bigl\lfloor\frac r2\Bigr\rfloor,\qquad \epsilon= \begin{cases} 0, & r\ \text{is even}, 1, & r\ \text{is odd}. \end{cases} \] This formula applies in the open lower-half range $ 0<v<\frac{m\Qm}{2}, $ equivalently for $v\in I_r$ with $m\ge r+1$; the range $ \frac{m\Qm}{2}<v<m\Qm $ is then obtained by Sørensen's duality theorem \cite{Sorensen}.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Variance Geometry of Exact Pauli-Detecting Codes: Continuous Landscapes Beyond Stabilizers

Exact quantum codes detecting a prescribed set of Pauli errors are approached through algebraic constructions–stabilizer, codeword-stabilized, permutation-invariant, topological, and related families. Geometrically, exact Pauli detection is governed by joint higher-rank numerical ranges of these Pauli operators, whose structure for rank $\geq 2$ is largely uncharted. From this viewpoint, we show that such codes often form connected continuous families rather than collections of disjoint solution regions. These families are characterized by a single scalar derived from the Knill-Laflamme conditions: denoted $\lambda^*$, it is the Euclidean norm of the signature vector of Pauli expectation values on the maximally mixed code state, and provides a one-parameter summary of the code's joint Pauli variance profile. Within these continuous landscapes, stabilizer codes occupy only discrete, measure-zero subsets of the attainable $\lambda^*$-spectrum, exposing a largely unexplored continuum of genuinely nonadditive exact codes. We establish this picture by analyzing the geometry of higher-rank operator compressions, and extend it to symmetry-restricted settings where cyclic and permutation symmetries are imposed on both the error model and the code projector. Small-system cases reveal interval, singleton, and empty regimes through eigenvalue interlacing and symmetry-sector decompositions; larger systems are treated numerically via Stiefel-manifold optimization and symmetry-adapted parameterizations. In every unrestricted and symmetry-compatible case analyzed, the attainable $\lambda^*$-spectrum forms a single closed interval whenever nonempty–although a general proof remains open. These results place stabilizer, symmetric, and nonadditive code families within a unified higher-rank variance framework, suggesting a continuous geometric perspective on the landscape of exact quantum codes.
Read the full abstract

All authors Arunaday Gupta, Baisong Sun, Xi He, Bei Zeng

Optimization and Control

$H_2/H_{\infty}$ Control for Stochastic Differential Systems with Partial Observation

This paper investigates the $H_{2}/H_{\infty}$ control problem for linear stochastic differential systems under partial observation. Unlike existing studies that assume full state accessibility, we consider the scenario where the controller has access only to an observation process. The objective is to design a controller that balances the $H_2$ performance criterion with the $H_\infty$ robustness requirement under worst-case disturbances, formulated as a nonzero-sum differential game. Using the Kalman filtering method, we derive the corresponding optimal filtering equation. Furthermore, a Stochastic Bounded Real Lemma under the partial observation framework is established, providing necessary and sufficient conditions for the $H_\infty$ robustness constraint. We also show the connection between the existence of a Nash equilibrium and the solvability of the cross-coupled Riccati equations, and illustrate the effectiveness of the proposed approach through a numerical example involving an unmanned aerial vehicle (UAV).
Read the full abstract

Geometric Topology

Eclipses on Zippers

Calegari and Loukidou introduced zippers, consisting of a disjoint pair of invariant real trees in the boundary of a closed hyperbolic 3-manifold group $\pi_1(M)$, which ensure the existence of a universal circle. We study the action of $\pi_1(M)$ on a minimal zipper and prove a fixed point dichotomy: every nontrivial element either fixes a unique point in each tree or acts freely on both. This answers a question of Calegari and Loukidou. As a consequence, there exists an element with exactly one fixed point in each tree.
Read the full abstract

Representation Theory

Orthosymplectic Quantum Groups Revisited

We present the RLL-realization of extended orthosymplectic quantum supergroups for any parity sequence, with R-matrices evaluated in the earlier work [Lett. Math. Phys. 116 (2026), 55, 97 pages, arXiv:2408.16720]. Our isomorphism is compatible with the internal structure of generalized doubles. We also relate different sign conventions through 2-cocycle twists.
Read the full abstract

Numerical Analysis

Fast Algorithm For Solving Time-dependent Multiscale radiative transport Equation

When solving the time-dependent radiative transport equation (RTE), implicit time discretization is often employed for its robustness and stability. This results in a sequence of steady-state RTEs with identical cross-sections but varying source terms, whose repeated solution is computationally costly. To address this, we first apply the adaptive tailored finite point scheme (TFPS) for spatial discretization. This scheme exploits prior knowledge of the background media's optical properties to adaptively compress the angular domain, constructing a compressed linear system. A key feature is its ability to reconstruct the layer structure after compression, faithfully capturing the variance at the layer. We then use the Recursive Skeleton Method (RSM) to obtain an explicit multilevel decomposition of the inverse discrete operator, which is reused for all steady-state solutions. Numerical experiments show that our framework achieves high accuracy and significant efficiency across diverse scenarios.
Read the full abstract

Numerical Analysis

Local error estimates for a finite element method combining linear and nonlinear stabilization for the linear hyperbolic transport equation

In this paper, we investigate the combination of a linear continuous interior penalty type and a non-linear artificial diffusion stabilisation applied to the transport problem, based on continuous Galerkin finite elements in space. This method was recently introduced and analysed for globally smooth solutions in [Burman 2023, SIAM J. Sci. Comput., 45, 1, A96-A122]. We provide a rigorous proof of a localisation principle in terms of weighted stability and a priori error bound results, which follow the widely known $\mathcal{O}(h^{k+1/2})$ scaling in the $L^2(\Omega; t=T)$ norm, where $k$ denotes the polynomial order of the finite element space and $h$ the mesh size. The analysis is semi-discrete in space and assumes sufficient local regularity of the continuous solution on the smooth part of the domain, where the continuous interior penalty stabilisation is active, whilst artificial diffusion operates on the remaining rough parts of the domain. Thereby, the analysis demonstrates that typical numerical errors in the rough part stay localised relative to the convection velocity and do not negatively affect the smooth parts of the solution, if the stabilisation combination is set up accordingly.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Accelerating scaling solutions from dark matter particle creation

This article opens new window to obtain accelerating scaling attractors without any need of dark energy. We study cosmological dynamics in a two-fluid system where pressureless dark matter (DM) undergoes adiabatic particle creation and exchanges energy with a barotropic fluid. Considering six widely used interaction prescriptions, we formulate the corresponding autonomous systems in a compact phase space and perform a unified dynamical analysis. We find that accelerating scaling attractors, namely late-time states where both fluids coexist with fixed energy fractions, arise only when the interaction is controlled by the DM density and energy flows from DM to the second fluid. Such attractors appear in the global and local DM-based interactions, and in the global mixed case, but are entirely absent when the interaction depends on the second fluid or on local mixed terms, which instead drive the universe to a DM-dominated accelerating phase. These results clarify the unique conditions under which matter creation can mimic dark-energy-like behaviour without introducing a dark-energy component.
Read the full abstract

All authors Sudip Halder, Jaume de Haro, Supriya Pan, Emmanuel N. Saridakis, Tapan Saha, Subenoy Chakraborty

Analysis of PDEs

Maximum principle and local stability for a class of coupled nonlinear thermo–reaction–phase systems

We study a nonlinear coupled system of partial differential equations arising from thermo–reaction–phase models. The system combines a heat diffusion equation, temperature-dependent chemical reactions of Arrhenius type, and a phase variable, and is formulated as a strongly coupled parabolic problem with homogeneous Neumann boundary conditions. We first establish a maximum principle ensuring the positivity of the temperature on a suitable time interval, as well as the invariance of the physically admissible domain. In particular, we prove that the internal variables remain in the interval [0,1]. We then analyse the asymptotic behaviour of the system in the free regime, that is, in the absence of external forcing. By introducing a relative energy functional and exploiting the structure of the coupling terms, we obtain local asymptotic stability of a homogeneous stationary state. The model belongs to a broader class of coupled diffusion–reaction–phase systems.
Read the full abstract