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)

Friday 20 February

Statistics Theory · Cross-listed from stat.ME

Design-based theory for covariate adjustment in generalized pairwise comparisons

Generalized pairwise comparisons summarize treatment effects in randomized experiments with ordinal, multivariate, or prioritized outcomes. We study optimal covariate adjustment under complete randomization, with potential outcomes and covariates fixed and treatment assignment as the sole source of randomness. We derive the exact randomization variance of the unadjusted estimator and characterize linear calibration adjustments using the between-arm difference in covariate means. The asymptotic variance is a strictly convex quadratic in the adjustment coefficient, yielding a closed-form optimum. The resulting estimator is asymptotically no less efficient than the unadjusted estimator, with an explicit precision gain that clarifies which covariates improve precision. However, natural pair-level and single-arm least squares adjustments generally use weights that differ from the allocation-dependent optimum and can substantially reduce efficiency. We also propose a within-arm variance estimator for asymptotically conservative inference, whose conservatism arises from unidentifiable joint variation in a unit's two potential scores, and show that residualizing each arm on its own projection coefficient saves the discrepancy that governs the efficiency loss of conventional adjustments. In the special case where the comparison function is the outcome difference, our proposed covariate-adjusted estimator is first-order equivalent to the fully interacted regression adjustment of Lin (Ann. Appl. Stat., 2013, 7, 295-318).
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Incremental Input-to-State Stability and Equilibrium Tracking for Stochastic Contracting Dynamics

In this paper, we study the contractivity of nonlinear stochastic differential equations (SDEs) driven by deterministic inputs and Brownian motions. Given a weighted $\ell_2$-norm for the state space, we show that an SDE is incrementally noise- and input-to-state stable if its vector field is uniformly contracting in the state and uniformly Lipschitz in the input. This result is applied to error estimation for time-varying equilibrium tracking in the presence of noise affecting both the system dynamics and the input signals. We consider both Ornstein-Uhlenbeck processes modeling unbounded noise and Jacobi diffusion processes modeling bounded noise. Finally, we turn our attention to the associated Fokker-Planck equation of an SDE. For this context, we prove incremental input-to-state stability with respect to an arbitrary $p$-Wasserstein metric when the drift vector field is uniformly contracting in the state and uniformly Lipschitz in the input with respect to an arbitrary norm.
Read the full abstract

All authors Yu Kawano, Simone Betteti, Alexander Davydov, Francesco Bullo

Differential Geometry

Magnetic Killing tensors and first integrals of the magnetic flow

In this work we introduce a new family of symmetric tensors generalizing Killing tensors, that we call magnetic Killing symmetric tensors. We make use of them to construct first integrals for the magnetic flow associated to a given magnetic field. We apply the results to prove integrability of some invariant magnetic flows (either exact or non-exact) on some 2-step nilmanifolds: the Kodaira-Thurston manifold and Heisenberg nilmanifolds of higher dimensions.
Read the full abstract

Analysis of PDEs

Application of uncertainty principles for decaying densities to the observability of the Schrödinger equation

In this article, we study the Schrödinger equation posed in the Euclidean space. We prove observability inequalities for measurable sets that are thick with respect to decaying densities. The proof relies on quantitative uncertainty principles adapted to decaying densities, notably those established by Shubin, Vakilian, Wolff, and Kovrijkine.
Read the full abstract

Dynamical Systems

Entropy Density of Ergodic Nonadapted Measures for Markov Interval Maps

Given a uniformly expanding transitive Markov interval map, we show that within the set of ergodic measures the set of nonadapted ergodic measures is residual in with respect to the topology induced by the $\overline{d}$-metric. This set of measures is also shown to be path connected in many cases.
Read the full abstract

Information Theory

Quantum Maximum Likelihood Prediction via Hilbert Space Embeddings

Maximum likelihood prediction (MLP) is a core task at the heart of modern large language models. Here, we study a quantum version of this task for a simplified data model consisting of independent and identically distributed samples, as a first step. The quantum maximum likelihood predictor (QMLP) is obtained by embedding of empirical probability distributions into quantum states and performing a minimization of quantum relative entropy over a given class of states. We derive non-asymptotic performance guarantees for QMLP in terms of convergence rates and concentration inequalities, both in trace norm and quantum relative entropy. Our approach provides a unified framework to handle MLP within both classical and quantum LLMs. We also consider the related problem of quantum information projection and generalize the quantum Pythagorean theorem to mixture families specified by possibly non-self-adjoint linear constraints. We further show that the Pythagorean inequality continues to hold in the infinite-dimensional setting whenever the convex information-projection problem attains a finite minimum.
Read the full abstract

Combinatorics

Generating minimal redundant and maximal irredundant sets in incidence graphs

It has been proved by Boros and Makino that there is no output-polynomial-time algorithm enumerating the minimal redundant sets or the maximal irredundant sets of a hypergraph, unless P=NP. The same question was left open for graphs, with only a few tractable cases known to date. In this paper, we focus on graph classes that capture incidence relations such as bipartite, co-bipartite, and split graphs. Concerning maximal irredundant sets, we show that the problem on co-bipartite graphs is as hard as in general graphs and tractable in split and strongly orderable graphs, the latter being a generalization of chordal bipartite graphs. As for minimal redundant sets enumeration, we first show that the problem is intractable in split and co-bipartite graphs, answering the aforementioned open question, and that it is tractable on $(C_3,C_5,C_6,C_8)$-free graphs, a class of graphs incomparable to strongly orderable graphs, and which also generalizes chordal bipartite graphs.
Read the full abstract

All authors Emanuel Castelo, Jérémie Chalopin, Oscar Defrain, Simon Vilmin

Operator Algebras

Quantum relations in the general setting: composition and adjacency operators

Quantum relations in the sense of Weaver are $M'$-bimodules, for a von Neumann algebra $M$, these generalising actual relations on a set $X$ when $M=\ell^\infty(X)$. Similarly, relations between two sets can be generalised as bimodules over the commutants of two algebras. We make an explicit study of this idea, developing some tools to check that constructions are well-defined. Motivation comes from Kornell's concept of a Quantum Set (for algebras which are sums of matrix algebras), and we find that $*$-homomorphisms correspond to certain quantum relations, extending unpublished work of Kornell. We find a functor from completely positive maps to quantum relations, related to the idea of taking a noisy communication channel and reducing it to its underlying “relation”. As with Quantum Graphs, at least in finite-dimensions, quantum relations correspond to “adjacency operators”, certain CP maps depending on a choices of faithful functional on the algebras. We develop some tools to deal with the non-Schur-idempotent case, and show links with our functor from CP maps, and work of Verdon. We explicitly compute the adjacency operator of a $*$-homomorphism.
Read the full abstract

Classical Analysis and ODEs

Helical maximal function and weighted estimates

In this article, we characterize the range of $\alpha$ for which the helical maximal function is bounded from $L^p(|x|^\alpha)$ to itself for $3<p<\infty$. Our result is optimal for $4\leq p<\infty,$ except possibly at end-points.

Differential Geometry

A Sharp Lower Bound for the Spectrum of the Hodge Laplacian on Kähler Hyperbolic Manifolds and its Applications

In this paper, we establish a sharp lower bound for the spectrum of the Hodge Laplacian on Kähler hyperbolic manifolds. This bound is expressed explicitly in terms of the supremum norm of the 1-form associated with the Kähler hyperbolic structure. As an application, we obtain explicit spectral lower bounds for bounded symmetric domains.
Read the full abstract

Representation Theory

Torsion pairs via cosilting mutation

For a left artinian ring A, we study the lattice torsA of torsion pairs in the category of finitely generated A-modules by considering an isomorphic lattice formed by certain closed sets in a topological space associated to A, the Ziegler spectrum of the unbounded derived category of ModA. Torsion pairs in torsA turn out to be adjacent if and only if the associated closed sets are related by an operation which is induced by mutation of cosilting complexes. We describe this operation from several perspectives and present a number of applications in the case when A is a finite dimensional algebra.
Read the full abstract

Algebraic Topology · Cross-listed from cs.CV

G-LoG Bi-filtration for Medical Image Classification

Building practical filtrations on objects to detect topological and geometric features is an important task in the field of Topological Data Analysis (TDA). In this paper, leveraging the ability of the Laplacian of Gaussian operator to enhance the boundaries of medical images, we define the G-LoG (Gaussian-Laplacian of Gaussian) bi-filtration to generate the features more suitable for multi-parameter persistence module. By modeling volumetric images as bounded functions, then we prove the interleaving distance on the persistence modules obtained from our bi-filtrations on the bounded functions is stable with respect to the maximum norm of the bounded functions. Finally, we conduct experiments on the MedMNIST dataset, comparing our bi-filtration against single-parameter filtration and the established deep learning baselines, including Google AutoML Vision, ResNet, AutoKeras and auto-sklearn. Experiments results demonstrate that our bi-filtration significantly outperforms single-parameter filtration. Notably, a simple Multi-Layer Perceptron (MLP) trained on the topological features generated by our bi-filtration achieves performance comparable to complex deep learning models trained on the original dataset.
Read the full abstract

All authors Qingsong Wang, Jiaxing He, Bingzhe Hou, Tieru Wu, Yang Cao, Cailing Yao

Combinatorics

On constructing small subgraphs in the budget-constrained random graph process

Consider the budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli, where each time an edge is offered through the (standard) random graph process we must irrevocably decide whether to "purchase" this edge or not, with our goal being to construct a graph which satisfies some property within a given time $t$ and while purchasing at most $b$ edges. We consider the problem of constructing graphs containing certain fixed small subgraphs. We provide an optimal strategy for building a graph which contains a copy of $K_4$, showing that budget $b=\omega(\max\{n^8/t^5,n^2/t\})$ suffices and that if $b=o(\max\{n^8/t^5,n^2/t\})$ then no strategy can a.a.s. produce a graph containing a copy of $K_4$. This resolves a problem raised by Iľkovič, León and Shu. More generally, we obtain analogously tight results for containing a wheel of any fixed size, or a graph consisting of a tree plus one additional universal vertex. We also tackle the problem of constructing graphs containing a copy of $K_5$, obtaining both lower and upper bounds on the optimal budget, though a gap remains in this case.
Read the full abstract

All authors Sylwia Antoniuk, Alberto Espuny Díaz, Kalina Petrova, Miloš Stojaković

Combinatorics

Ramsey theory of low-degree semialgebraic relations

We prove that hypergraphs defined by low-degree polynomial inequalities contain large homogeneous subsets. Formally, let $H$ be an $r$-uniform hypergraph on $N$ vertices that is semialgebraic of constant description complexity, and each defining polynomial has degree at most $D$. Then $H$ contains a clique or an independent set of size $n$, where $N\leq \mbox{tw}_{3D^3}(n)$.
Read the full abstract

Combinatorics

The maximal hard-core model on the triangular lattice

The well-known hard-core model on the triangular lattice $\mathbb A$ is an interaction model defined on the independent sets of the lattice, parameterized by an activity parameter $\lambda > 0$. In this work, we consider an extension of this model to maximal independent sets, which we call the maximal hard-core model. We show that in the high-activity regime ($\lambda > 10^6$), the model admits at least two Gibbs measures on maximal independent sets in $\mathbb A$. In the low-activity regime ($\lambda$ close to $0$), we apply Pirogov-Sinai theory to characterize extremal periodic Gibbs measures of the model. Finally, we derive bounds on the capacity of a recoverable system on the lattice associated with the maximal hard-core model.
Read the full abstract

2602.18310 · 20 Feb · v2: Improved bound on the activity above which multiple phases occur in the high-activity regime. Extended abstract of this paper appears in Proc. 2026 IEEE International Symposium on Information Theory; v3: Rewritten for journal submission, main results unchanged

Combinatorics · Cross-listed from cs.FL

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the question of finding polynomial algorithm verifying the inclusion of context-free languages in group languages naturally arises. The article focuses on this open problem. For the purpose, the paper describes an unconventional method of description of context-free languages, namely a representation with the help of a finite digraph whose arcs are labelled with a specially defined monoid $\mathcal{U}$. Also, we define a semiring $\mathcal{S}_\mathcal{U}$ whose elements are the set $2^\mathcal{U}$ of all subsets of $\mathcal{U}$ and with operations - product and union of the elements of $2^\mathcal{U}$. The described algorithm executes no more than $O(n^3)$ operations in $\mathcal{S}_\mathcal{U}$.
Read the full abstract

Number Theory

Dynamical GCD Problems and a Variant of the Dynamical Mordell-Lang Conjecture

In \cite{NZ25}, the authors resolved the rational function analogue of the finiteness results for greatest common divisors of iterates of polynomials established in \cite{HT17}. These results may be viewed as dynamical generalizations of a classical problem concerning upper bounds for the greatest common divisors (GCDs) of two integer sequences studied by Bugeaud, Corvaja, and Zannier. The most delicate case arises when the maps involved are automorphisms, where the methods of \cite{NZ25} and \cite{HT17} rely heavily on Diophantine approximation and asymptotic analysis. In the present paper, we develop an alternative approach to the automorphism case. This method is more powerful, allowing us to give complete answers to the further questions posed in \cite{HT17}. In particular, we strengthen the main theorem of \cite{HT17} and provide an alternative proof of the main theorem of \cite{NZ25} in the automorphism setting. Moreover, we relate this dynamical GCD problem to a special case of a higher-dimensional generalization of the Dynamical Mordell–Lang Conjecture proposed by Junyi Xie. We establish this generalized conjecture when the dynamics arise from algebraic group actions. In addition, we resolve the corresponding special case associated with dynamical GCD questions when the maps involved are polynomials.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Analyzing and Improving Chain-of-Thought Monitorability Through Information Theory

Chain-of-thought (CoT) monitors are LLM-based systems that analyze reasoning traces to detect when outputs may exhibit attributes of interest, such as test-hacking behavior during code generation. In this paper, we use information-theoretic analysis to show that non-zero mutual information between CoT and output is a necessary but not sufficient condition for CoT monitorability. We identify two sources of approximation error that may undermine the performance of CoT monitors in practice: information gap, which measures the extent to which the monitor can extract the information available in CoT, and elicitation error, which measures the extent to which the monitor approximates the optimal monitoring function. Empirically, we show that CoT obfuscation can arise even in the absence of any optimization pressure against CoT. We further demonstrate that the fragility of CoT monitorability can be systematically mitigated through targeted training objectives. To this end, we propose a practical, label-free objective based on mutual information between outputs and CoTs, and benchmark it against an oracle-based method that directly rewards the monitored model for CoTs that maximize monitor accuracy. Across multiple environments, we show that our objective is effective at preventing CoT obfuscation even when training against a monitor, and helps mitigate reward hacking when the task reward is imperfectly specified.
Read the full abstract

All authors Usman Anwar, Tim Bakker, Dana Kianfar, Cristina Pinneri, Christos Louizos

Optimization and Control

On the $q$-integrability of $p$-Wasserstein barycenters

We study the $L^q$-regularity of the density of barycenters of $N$ probability measures on $\mathbb{R}^d$ with respect to the $p$-Wasserstein metric ($1<p<\infty$). According to a previous result by the first author and collaborators, if one marginal is absolutely continuous, so is the $W_p$-barycenter. The next natural question is whether the $L^q$- regularity on the marginals is also preserved for any $q > 1$, as in the classical case ($p=2$) of Agueh–Carlier, or for $W_p$-geodesics ($N=2$). Here we prove that this is the case if one marginal belongs to $L^q$ and the supports of all the marginals satisfy suitable geometric assumptions. However, we show that, as soon as $N>2$, it is possible to find examples of $W_p$-barycenters which are not $q$-integrable, even if one marginal is compactly supported and bounded, thus highlighting the role played by the geometry of the supports. Furthermore, we provide a general estimate of the $L^q$-norm, including a detailed study of the sources of singularities, and a characterization of the $W_p$-barycenters à la Agueh–Carlier in terms of the associated Kantorovich potentials. Finally, we explicitly compute the $W_p$-barycenters of measures obtained as push-forward of special affine transformations. In this case, regularity holds without any additional requirement on the supports.
Read the full abstract

Analysis of PDEs

Overdetermined problems for the rotationally invariant Poisson equation in model manifolds

We present rigidity results for overdetermined problems associated to the rotationally invariant Poisson equation $-\Delta_{g_\mathcal{M}} u = f(r)$ in a model manifold $\mathcal{M} = [0,S) \times_h \mathbb S^{N-1}$ with warping function $h$. The variable $r$ ranges in the interval $[0,S)$, whose endpoint $S$ is positive and possibly infinite. The first part of the paper deals with the problem \[ \begin{array}{ll} -\Delta_{g_\mathcal{M}} {u}=f(r) &\mbox{in $\Omega$}, u=\varphi(r) &\mbox{on $\partial \Omega$}, \frac{\partial u}{\partial \nu} = \kappa(r) &\mbox{on $\partial \Omega$}, \end{array} \] where $\Omega \subset \mathcal{M}$ is a bounded domain containing the point $O \in \mathcal{M}$ corresponding to $r = 0$, $\nu$ is the exterior unit normal vector on $\partial \Omega$, and $f$, $\varphi$, $\kappa$ are three prescribed functions. In the second part of the paper, we consider a similar overdetermined problem for the exterior Bernoulli problem in a domain $\Omega \setminus \overline B_{R_0}(O)$, where $B_{R_0}(O)$ denotes the geodesic ball centered at $O$ with radius $R_0$, within the class of functions that vanish on $\partial B_{R_0}(O)$. In both cases, we give conditions on $f$, $\varphi$ and $\kappa$ implying that the solution $u$ is radial and $\Omega$ is a geodesic ball centered at $O$. Our results apply in particular to the three space forms $\mathbb{R}^N$, $\mathbb{H}^N$ and $\mathbb{S}^N$.
Read the full abstract

Quantum Algebra

$(\mathfrak{gl}_{n},\mathfrak{gl}_{m})$-duality and Olshanski homomorphism

We show that the images of the Bethe subalgebras of the Yangians $Y(\mathfrak{gl}_{n})$ and $Y(\mathfrak{gl}_{m})$ under the homomorphisms to $U(\mathfrak{gl}_{n+m})$ given by the Olshanski centralizer construction coincide. We use this result to obtain the $(\mathfrak{gl}_{n},\mathfrak{gl}_{m})$-duality of the trigonometric Gaudin model and the XXX-spin chain. The duality is obtained in an explicit way relating the generating differential operator on one side and the generating difference operator on the other, thus agreeing with the result of Mukhin, Tarasov and Varchenko arXiv:math/0605172.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Channel Estimation for Double-BD-RIS-Assisted Multi-User MIMO Communication

Deploying multiple beyond diagonal reconfigurable intelligent surfaces (BD-RISs) can potentially improve the communication performance thanks to inter-element connections of each BD-RIS and inter-surface cooperative beamforming gain among BD-RISs. However, a major issue for multi-BD-RISassisted communication lies in the channel estimation overhead - the channel coefficients associated with the off-diagonal elements in each BD-RIS's scattering matrix as well as those associated with the reflection links among BD-RISs have to be estimated. In this paper, we propose an efficient channel estimation framework for double-BD-RIS-assisted multi-user multipleinput multiple-output (MIMO) systems. Specifically, we reveal that high-dimensional cascaded channels are characterized by five low-dimensional matrices by exploiting channel correlation properties. Based on this novel observation, in the ideal noiseless case, we develop a channel estimation scheme to recover these matrices sequentially and characterize the closed-form overhead required for perfect estimation as a function of the numbers of users and each BD-RIS's elements and channel ranks, which is with the same order as that in double-diagonal-RIS-aided communication systems. This exciting result implies the superiority of cooperative BD-RIS-aided communication over the diagonal- RIS counterpart even when channel estimation overhead is considered. We further extend the proposed scheme to practical noisy scenarios and provide extensive numerical simulations to validate its effectiveness.
Read the full abstract

Information Theory

Construction of Cyclic Codes over a Class of Matrix Rings

Let $ \mathbb F_2[u]/ \langle u^k \rangle= \mathbb F_2+u\mathbb F_2+u^2\mathbb F_2+\cdots+u^{k-1}\mathbb F_2 ,$ where $u^k=0$ for a positive integer $k$, and $\mathcal{R}=M_4 (\mathbb F_2( u)/ \langle u^k \rangle)$ be the finite noncommutative non-chain matrix ring of order $4\times4$. This paper presents the construction of cyclic codes over the finite field $\mathbb F_{16}$ via the considered matrix ring $\mathcal{R}$. In this connection, first, we discuss the structure of the ring $\mathcal{R}$ and show that $\mathcal{R}$ is isomorphic to the ring $( \mathbb F_{16}+ v\mathbb F_{16} + v^2\mathbb F_{16} + v^3\mathbb F_{16}) + u(\mathbb F_{16} + v\mathbb F_{16} + v^2\mathbb F_{16} + v^3\mathbb F_{16}) + u^2(\mathbb F_{16} + v\mathbb F_{16} + v^2\mathbb F_{16}+ v^3\mathbb F_{16}) + \cdots + u^{k-1}(\mathbb F_{16} + v\mathbb F_{16} + v^2\mathbb F_{16} + v^3\mathbb F_{16})$ where $v^4=0, u^k=0, u^iv^j=v^ju^i$ for $i \in \{1,\dots, k-1\}$ and $j \in \{1, 2, 3\}$. Then, we establish the form of ideals of the ring $\mathcal{R}$ and related cyclic codes over $\mathcal{R}$. Further, we show that these cyclic codes can be written as the direct sums of $\mathcal{R}$-submodules of $\frac{\mathcal{R}[x]}{<x^n-1>}$, and derive the formula for the cardinality of cyclic codes over $\mathcal{R}$. Then, we consider the Euclidean and Hermitian duals of the derived cyclic codes over $\mathcal{R}$. Under the module isometry for $\mathcal{R}$, we use the Bachoc map and the Gray map, which takes a derived cyclic code over $\mathcal{R}$ to $\mathbb F_{16}$. Finally, we provide some non-trivial examples of linear codes over $\mathbb F_{16}$ with good parameters that support our derived results and compare a few codes with existing codes in the literature.
Read the full abstract

Information Theory · Cross-listed from eess.SP

m^3TrackFormer: Transformer-based mmWave Multi-Target Tracking with Lost Target Re-Acquisition Capability

This paper considers a millimeter wave (mmWave) integrated sensing and communication (ISAC) system, where a base station (BS) equipped with a large number of antennas but a small number of radio-frequency (RF) chains emits pencillike narrow beams for persistent tracking of multiple moving targets. Under this model, the tracking lost issue arising from the misalignment between the pencil-like beams and the true target positions is inevitable, especially when the trajectories of the targets are complex, and the conventional Kalman filter-based scheme does not work well. To deal with this issue, we propose a Transformer-based mmWave multi-target tracking framework, namely m3TrackFormer, with a novel re-acquisition mechanism, such that even if the echo signals from some targets are too weak to extract sensing information, we are able to re-acquire their locations quickly with small beam sweeping overhead. Specifically, the proposed framework can operate in two modes of normal tracking and target re-acquisition during the tracking procedure, depending on whether the tracking lost occurs. When all targets are hit by the swept beams, the framework works in the Normal Tracking Mode (N-Mode) with a Transformer encoder-based Normal Tracking Network (N-Net) to accurately estimate the positions of these targets and predict the swept beams in the next time block. While the tracking lost happens, the framework will switch to the Re-Acquisition Mode (R-Mode) with a Transformer decoder-based Re-Acquisition Network (RNet) to adjust the beam sweeping strategy for getting back the lost targets and maintaining the tracking of the remaining targets. Thanks to the ability of global trajectory feature extraction, the m3TrackFormer can achieve high beam prediction accuracy and quickly re-acquire the lost targets, compared with other tracking methods.
Read the full abstract

All authors Tongkai Li, Weifeng Zhu, Shuowen Zhang, Jiannong Cao, Shuguang Cui, Liang Liu

Probability

Invariance properties of Brownian motion via Lie's symmetries

The invariance properties of Brownian motion are investigated and revisited within a recent Lie symmetry approach to stochastic differential equations. Some notable properties of the process can be recovered by a related integration by parts formula developed in the same research area.
Read the full abstract

All authors Susanna Dehò, Francesco C. De Vecchi, Paola Morando, Stefania Ugolini

Numerical Analysis · Cross-listed from cs.LG

Neural-HSS: Hierarchical Semi-Separable Neural PDE Solver

Deep learning-based methods have shown remarkable effectiveness in solving PDEs, largely due to their ability to enable fast simulations once trained. However, despite the availability of high-performance computing infrastructure, many critical applications remain constrained by the substantial computational costs associated with generating large-scale, high-quality datasets and training models. In this work, inspired by studies on the structure of Green's functions for elliptic PDEs, we introduce Neural-HSS, a parameter-efficient architecture built upon the Hierarchical Semi-Separable (HSS) matrix structure that is provably data-efficient for a broad class of PDEs. We theoretically analyze the proposed architecture, proving that it satisfies exactness properties even in very low-data regimes. We also investigate its connections with other architectural primitives, such as the Fourier neural operator layer and convolutional layers. We experimentally validate the data efficiency of Neural-HSS on the three-dimensional Poisson equation over a grid of two million points, demonstrating its superior ability to learn from data generated by elliptic PDEs in the low-data regime while outperforming baseline methods. Finally, we demonstrate its capability to learn from data arising from a broad class of PDEs in diverse domains, including electromagnetism, fluid dynamics, and biology.
Read the full abstract

All authors Pietro Sittoni, Emanuele Zangrando, Angelo A. Casulli, Nicola Guglielmi, Francesco Tudisco

Optimization and Control · Cross-listed from eess.SY

Hybrid Control of ADT Switched Linear Systems subject to Actuator Saturation

This paper develops a hybrid output-feedback control framework for average dwell-time (ADT) switched linear systems subject to actuator saturation. The considered subsystems may be exponentially unstable, and the saturation nonlinearity is explicitly handled through a deadzone-based representation. The proposed hybrid controller combines mode-dependent full-order dynamic output-feedback controllers with a supervisory reset mechanism that updates controller states at switching instants. By incorporating the reset rule directly into the synthesis conditions, switching boundary constraints and performance requirements are addressed in a unified convex formulation. Sufficient conditions are derived in terms of linear matrix inequalities (LMIs) to guarantee exponential stability under ADT switching and a prescribed weighted ${\cal L}_2$-gain disturbance attenuation level for energy-bounded disturbances. An explicit controller construction algorithm is provided based on feasible LMI solutions. Simulation results demonstrate the effectiveness and computational tractability of the proposed approach and highlight its advantages over existing output-feedback saturation control methods.
Read the full abstract

History and Overview of Mathematics

Graph Colouring: A Visual Tour

Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a standard subject in university-level courses on graph theory, algorithms, and combinatorics. In this paper, we consider the topics of node, edge, and face colouring along with their associated algorithms. Theoretical results are reviewed and brought to life through a collection of detailed, visually engaging figures designed to enhance understanding and appeal.
Read the full abstract

K-Theory and Homology

Algebraic $K$-theory of stably compact spaces

We compute the value of finitary localizing invariants, including algebraic $K$-theory, on categories of sheaves over stably locally compact spaces $X$. Our formula simultaneously generalizes the cases of locally compact Hausdorff and coherent (spectral) spaces and recovers several smaller $K$-theory calculations as special instances.
Read the full abstract