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)

Thursday 26 February

Combinatorics

On pseudo-arcs from normal rational curve and additive MDS codes

Let $\mathrm{PG}(k-1,q)$ be the $(k-1)$-dimensional projective space over the finite field $\mathbb{F}_q$. An arc in $\mathrm{PG}(k-1,q)$ is a set of points with the property that any $k$ of them span the entire space. The notion of pseudo-arc generalizes that of an arc by replacing points with higher-dimensional subspaces. Constructions of pseudo-arcs can be obtained from arcs defined over extension fields; such pseudo-arcs are necessarily Desarguesian, in the sense that all their elements belong to a Desarguesian spread. In contrast, genuinely non-Desarguesian pseudo-arcs are far less understood and have previously been known only in a few sporadic cases. In this paper, we introduce a new infinite family of non-Desarguesian pseudo-arcs consisting of $(h-1)$-dimensional subspaces of $\mathrm{PG}(k-1,q)$ based on the imaginary spaces of a normal rational curve. We determine the size of the constructed pseudo-arcs explicitly and show that, by adding suitable osculating spaces of a normal rational curve defined over a subgeometry, we obtain pseudo-arcs of size $O(q^h)$. As $q$ grows, these sizes asymptotically attain the classical upper bound for pseudo-arcs established in 1971 by J.~A.~Thas, thereby showing that this bound is essentially sharp also in the non-Desarguesian setting. We further investigate the interaction between these new pseudo-arcs and quadrics. While Desarguesian pseudo-arcs from normal rational curve are complete intersections of quadrics, we prove that the new pseudo-arcs are not contained in any quadric of the ambient projective space. Finally, we translate our geometric results into coding theory. We show that the new pseudo-arcs correspond precisely to recent families of additive MDS codes introduced via a polynomial framework. As a consequence of their non-Desarguesian nature, we prove that these codes are not equivalent to linear MDS codes.
Read the full abstract

Algebraic Geometry

Approximating parametric suprema for constructible and power-constructible functions

We prove that one may approximate parametric suprema of constructible and power-constructible functions using functions within the same class. This resolves a conjecture by Adiceam and Cluckers, which was posited after studying a question posed by Sarnak. We apply our result to prove that a certain subclass of Cexp-class distributions is tempered and to make uniform a bound concerning pushforward measures.
Read the full abstract

Probability

Necessary and Sufficient Conditions for the Lacunary/Hereditary Laws of Large Numbers

The celebrated theorem of Komlos asserts that L1-boundedness is sufficient for a given sequence of functions to contain a subsequence along which (in a "lacunary" manner), and along whose every further subsequence ("hereditarily"), a strong law of large numbers holds. We identify here slightly weaker, Egorov-type conditions, as not only sufficient in this context, but necessary as well. Necessary and sufficient conditions are developed also for the lacunary/hereditary version of the weak law of large numbers for general sequences, as well as for the weak law of large numbers in the context of exchangeable sequences, both long-open questions.
Read the full abstract

Combinatorics

Reconstructing a giant component of a point set in $\mathbb{R}$

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a subset of size $\Omega_{\epsilon}(n)$, up to translation and reflection, with high probability. This confirms a conjecture posed by Girão, Illingworth, Michel, Powierski, and Scott. We also study a deterministic variant proposed by Benjamini and Tzalik. We show that if we are given $m$ distinct pairwise distances of a point set $V \subset \mathbb{R}$ with $|V|=n$, then we can reconstruct a subset of size $\Omega(m/ (n \log n)) $, up to translation and reflection. Moreover, we show that this is optimal, which also disproves a conjecture posed by Benjamini and Tzalik.
Read the full abstract

Probability

Asymptotics of randomly weighted sums without moment conditions of random weights

In the paper, we investigate the asymptotics of randomly weighted sums with upper tail asymptotically independent and quasi-upper tail asymptotically independent primary random variables without requiring moment assumptions on random weights. For the case of primary random variables with regularly varying tails, we obtain more explicit results via an extension of Breiman's theorem. Then an application of the obtained results is established to asymptotically estimate for the finite-time and infinite-time ruin probabilities in a discrete-time risk model.
Read the full abstract

All authors Qingwu Gao, Dimitrios G. Konstantinides, Charalampos D. Passalidis, Yuebao Wang, Hui Xu

Group Theory

Structure Theorems for locally compact modules over localizations of the integers

Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given such a module $M$, there exists a unique set of prime numbers $\Sigma$ (purely dependent on $S$) for which $M \cong \mathbb{R}^n \times \sideset{}{'}\prod_{q \in \Sigma} \mathbb{Q}_p^{n_p} \times N$, where $(n, (n_p)_{p \in \Sigma})$ is a sequence of nonnegative integers and $N$ contains a compact open submodule $K$ such that $K/K_0$ is a topological module over $\prod_{ q \in \mathbb{P}\setminus{\Sigma}} \mathbb{Z}_q$. Just like for $LCA$ groups, it is also possible to characterize the locally compact, compactly generated modules over $\mathbb{Z}S^{-1}$, as well as their Pontryagin Duals (which then allows to conclude that any locally compact $\mathbb{Z}S^{-1}$-module is an inverse limit of modules within a specific family). These characterizations are given in the 2nd and 3rd Structure Theorems respectively. Furthermore, as an elementary consequence of the 1st Structure Theorem, one can obtain a full classification of locally compact vector spaces over $\mathbb{Q}$.
Read the full abstract

Number Theory

Distribution of sums involving Dirichlet characters over the $k$-free integers

Assuming the generalized Riemann hypothesis and a bound for the negative discrete moments of the Riemann zeta function (resp. Dirichlet $L$-functions), we prove the existence of a logarithmic limiting distribution for the normalized partial sums $x^{-\frac{1}{2k}}\sum_{n\leq x}f(n)$, where $f$ is either a quadratic Dirichlet character or a modified Dirichlet character, restricted to the $k$-free integers. Moreover, we strengthen a conjecture made by Aymone, Medeiros and the author (cf. Ramanujan J. 59(3):713-728, 2022) concerning the precise order of magnitude for these partial sums.
Read the full abstract

Combinatorics

Simultaneous separation in bounded degree trees

It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge (n-1)/r$. Motivated by the tree dissimilarity problem in phylogenetics, we consider the case of separating vertex sets of several trees: Given $k$ trees with maximum degree at most $r$, containing a common vertex set labeled by $[n]$, we ask for a single-edge cut in each tree which maximizes $min\{|A|,|B|\}$ where $A,B \subset [n]$ are separated by the corresponding cut at each tree. Denoting this maximum by $f(r,k,n)$ and considering the limit $f(r,k) = \lim_{n \rightarrow \infty} f(r,k,n)/n$ (which is shown to always exist) we determine that $f(r,2)=\frac{1}{2r}$ and determine that $f(3,3)=\frac{2}{27}$, which is already quite intricate. The case $r=3$ is especially interesting in phylogenetics and our result implies that any two (three) binary phylogenetic trees over $n$ taxa have a split at each tree which separates two taxa sets of order at least $n/6$ (resp. $2n/27$), and these bounds are asymptotically tight.
Read the full abstract

Category Theory · Cross-listed from cs.LO

Effectful Toposes and Their Lawvere-Tierney Topologies

This paper introduces effectful toposes as an extension of the effective topos and investigates their structure relative to Lawvere-Tierney topologies. First, we formulate effectful toposes by lifting the evidenced frame, which is a recently proposed model for effectful computation. Next, we define Lawvere-Tierney topologies on effectful toposes and characterize the sheaves on them. In the effective topos, Lawvere-Tierney topologies are known to correspond to computational oracles. Finally, to demonstrate that our result contributes to the connection between realizability relativized by oracles and effects, we show that the sheaf topos for the double negation topology is isomorphic to the effectful topos with the Continuation-Passing-Style effect; these toposes serve as a model of classical realizability.
Read the full abstract

Numerical Analysis

A Hyperbolic Transport Model for Passenger Flow on Tram Networks

We introduce a modeling framework for an urban tram network based on a hyperbolic partial differential equation describing the transport of passengers along the network, coupled with a family of stochastic processes representing passenger boarding. Solutions are considered in a measure-valued sense. The system is further extended and subjected to uncertainties such as delays and service interruptions through a numerical study. Its robustness is assessed using appropriate risk measures.
Read the full abstract

Operator Algebras

Noncommutative coarse metric geometry

Motivated by coarse geometry and the classical role of Roe algebras as large-scale invariants of proper metric spaces, we show that proper quantum metric spaces as introduced by Latrémolière are noncommutative coarse spaces. This further allows us to develop a bridge between Latrémolière's framework and the W*-metric approach to quantum metric spaces. Furthermore, we construct Roe algebras for locally compact quantum metric spaces and verify that they recover the classical Roe algebras in the commutative case. We furthermore apply this framework to some examples of locally compact quantum metric spaces and show that it leads to the natural conclusion. Finally we use this framework to introduce notions of higher index theory for locally compact quantum metric spaces.
Read the full abstract

Optimization and Control

Iteration Complexity of Frank-Wolfe and Its Variants for Bilevel Optimization

We study Frank-Wolfe (FW) methods for constrained bilevel optimization when the lower-level problem is solved only approximately, yielding biased and inexact hypergradients. We analyze inexact variants of vanilla FW as well as away-step and pairwise FW, and provide convergence rates in the nonconvex setting under gradient errors. By combining these results with recent bounds on hypergradient errors from iterative and approximate implicit differentiation, we derive overall iteration complexity guarantees for bilevel FW. Experiments on two real-world applications validate the theory and demonstrate practical effectiveness.
Read the full abstract

All authors Anthony Palmieri, Francesco Rinaldi, Saverio Salzo, Sara Venturini

Statistics Theory

Accelerated Online Risk-Averse Policy Evaluation in POMDPs with Theoretical Guarantees and Novel CVaR Bounds

Risk-averse decision-making under uncertainty in partially observable domains is a central challenge in artificial intelligence and is essential for developing reliable autonomous agents. The formal framework for such problems is the partially observable Markov decision process (POMDP), where risk sensitivity is introduced through a risk measure applied to the value function, with Conditional Value-at-Risk (CVaR) being a particularly significant criterion. However, solving POMDPs is computationally intractable in general, and approximate methods rely on computationally expensive simulations of future agent trajectories. This work introduces a theoretical framework for accelerating CVaR value function evaluation in POMDPs with formal performance guarantees. We derive new bounds on the CVaR of a random variable X using an auxiliary random variable Y, under assumptions relating their cumulative distribution and density functions; these bounds yield interpretable concentration inequalities and converge as the distributional discrepancy vanishes. Building on this, we establish upper and lower bounds on the CVaR value function computable from a simplified belief-MDP, accommodating general simplifications of the transition dynamics. We develop estimators for these bounds within a particle-belief MDP framework with probabilistic guarantees, and employ them for acceleration via action elimination: actions whose bounds indicate suboptimality under the simplified model are safely discarded while ensuring consistency with the original POMDP. Empirical evaluation across multiple POMDP domains confirms that the bounds reliably separate safe from dangerous policies while achieving substantial computational speedups under the simplified model.
Read the full abstract

Combinatorics

Matroids from gain graphs over quotient groups

We present a new construction for matroids from gain graphs that simultaneously generalizes several existing constructions. The construction takes as input a gain graph over a Frobenius group $\Gamma$ with Frobenius kernel $\Gamma_1$ and outputs an elementary lift of the frame matroid of the underlying gain graph over the quotient group $\Gamma/\Gamma_1$. While the hypothesis that $\Gamma$ is a Frobenius group may seem unusual, we prove that it is in some sense necessary: if $\Gamma$ is any finite group with a nontrivial proper normal subgroup $\Gamma_1$ and there is a construction that takes in a complete $\Gamma$-gain graph and outputs an elementary lift $M$ of the frame matroid of the underlying $(\Gamma/\Gamma_1)$-gain graph so that a cycle of the graph is a circuit of $M$ if and only if it is $\Gamma$-balanced, then $\Gamma$ is a Frobenius group with Frobenius kernel $\Gamma_1$.
Read the full abstract

Analysis of PDEs

Local Invariant Structures in the Dynamics of Capillary Water Jet

Physical experiments show that a capillary water jet is exponentially unstable under long wave perturbations, while remaining stable under short wave perturbations. Measurements indicate that the exponential growth rate in the long wave regime agrees quantitatively with the classical predictions of Rayleigh and Plateau, known as Rayleigh-Plateau instability. In this paper, we provide a mathematical justification of these experimental observations. The motion of the water jet is modeled by an axisymmetric irrotational Eulerian free-boundary system governed by surface tension. We prove that the (un)stable directions in the linearized system, corresponding to long wave perturbations, are indeed tangent to a (un)stable invariant manifold of the full nonlinear system. On the other hand, the elliptic directions, corresponding to short wave perturbations, are indeed tangent to a center invariant set in a generalized sense. These results give a positive answer to the question raised by Lin-Zeng concerning the existence of invariant manifolds for Eulerian free-boundary systems. A notable finding is the existence of infinite dimensional hyperbolic invariant manifolds in the dynamics of infinitely long capillary water jet, in absence of spectral gap. The major methodological contribution is the construction of “paradifferential propagator" corresponding to linear paradifferential hyperbolic systems, effectively balancing the loss of regularity due to quasilinearity. The method can be generalized to a broad class of quasilinear problems.
Read the full abstract

Numerical Analysis

Nearest Reversible Markov Chains with Sparsity Constraints: An Optimization Approach

Reversibility is a key property of Markov chains, central to algorithms such as Metropolis-Hastings and other MCMC methods. Yet many applications yield non-reversible chains, motivating the problem of approximating them by reversible ones with minimal modification. We formulate this task as a matrix nearness problem and focus on the practically relevant case of sparse transition matrices. The resulting optimization problem is a quadratic programming problem, and numerical experiments illustrate the effectiveness of the approach. This framework provides a principled way to enforce reversibility and sparsity patterns in Markov chains with applications in MCMC, computational chemistry, and data-driven modeling.
Read the full abstract

All authors Stefano Cipolla, Fabio Durastante, Miryam Gnazzo, Beatrice Meini

Probability

Non-Markovian chains with long-range dependence and their scaling limits

There is a well-established theory linking certain semi-Markov chains and continuous-time random walks to time-fractional equations and anomalous diffusion. In this work, we go beyond the semi-Markov framework by considering some non-Markovian chains, which exhibit long-memory behaviour, due to stochastic dependence among their waiting times. Particular attention is devoted to the so-called para-Markov chains. Their waiting times share the same marginal distributions as those of the above mentioned semi-Markov chains, but they are dependent; their joint distribution is of Schur-constant type and is closely related to complete Bernstein functions and De Finetti's theorems. A second model that we focus on is given by time-changed Markov chains, where the random time is the inverse of an increasing stable process. This generalizes well-known semi-Markov models available in the literature, which typically focus solely on the inverse of the Levy stable subordinator. The above mentioned models are unified by a general theory of time change of Markov chains.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Semiparametric Joint Inference for Sensitivity and Specificity at the Youden-Optimal Cut-Off

Sensitivity and specificity evaluated at an optimal diagnostic cut-off are fundamental measures of classification accuracy when continuous biomarkers are used for disease diagnosis. Joint inference for these quantities is challenging because their estimators are evaluated at a common, data-driven threshold estimated from both diseased and healthy samples, inducing statistical dependence. Existing approaches are largely based on parametric assumptions or fully nonparametric procedures, which may be sensitive to model misspecification or lack efficiency in moderate samples. We propose a semiparametric framework for joint inference on sensitivity and specificity at the Youden-optimal cut-off under the density ratio model. Using maximum empirical likelihood, we derive estimators of the optimal threshold and the corresponding sensitivity and specificity, and establish their joint asymptotic normality. This leads to Wald-type and range-preserving logit-transformed confidence regions. Simulation studies show that the proposed method achieves accurate coverage with improved efficiency relative to existing parametric and nonparametric alternatives across a variety of distributional settings. An analysis of COVID-19 antibody data demonstrates the practical advantages of the proposed approach for diagnostic decision-making.
Read the full abstract

All authors Siyan Liu, Qinglong Tian, Chunlin Wang, Pengfei Li

Analysis of PDEs

A Single Equation Explains Go-or-Grow Dynamics in Cyclic Hypoxia

We propose a minimal mathematical framework to describe the go-or-grow dynamics of tumor cells comprising two phenotypically distinct populations. One population is migratory and undergoes linear diffusion, while the other proliferates in an oxygen-dependent manner. The local oxygen concentration governs transitions between these phenotypes. We then ask whether these two coupled phenotype-specific equations can be reduced to a single mixed-phenotype equation under cyclic hypoxia. We establish a connection between the minimal go-or-grow model with distinct phenotypic populations and a reduced model describing a single-cell population with oxygen-dependent diffusion and proliferation in the fast-phenotypic-switching regime. This theoretical reduction is validated through numerical simulations.
Read the full abstract

Analysis of PDEs

Unique Determination of Variable Order in Subdiffusion from a Single Measurement

We study the inverse problem of recovering a spatially dependent variable order in a time-fractional diffusion model from the boundary flux measurement generated by a single boundary excitation. It arises in the identification of heterogeneous media in anomalous diffusion processes. In this work, we establish several new uniqueness results for the inverse problem in the case of piecewise constant variable orders, without any monotonicity condition. The analysis follows a new approach that combines properties of harmonic functions, a linearization technique in the Laplace domain, and tools from complex, asymptotic, and geometrical analysis. In addition, we weaken the regularity assumptions on the problem data and extend the analysis of previous contributions to higher-dimensional settings.
Read the full abstract

Functional Analysis

Hardness of approximation of centered convex bodies by polytopes

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all invertible linear operators \(T: \R^n \to \R^n\). If both bodies are centrally symmetric, then the shifts $x$ and $y$ can be chosen to be $0$. In this case, any convex symmetric body $K$ can be approximated by a polytope $P$ with at most $N \in (n, e^{cn})$ vertices so that \[ P \subseteq K \subseteq \lambda P \] where \(\lambda= O \left(\sqrt{\frac{n}{\log N}} \right)\) up to logarithmic factors. We prove that approximating a general centered convex body by a polytope requires a significantly larger number of vertices compared to the symmetric case. More precisely, there exists a convex body \(K \subseteq \R^n\) whose barycenter coincides with the origin, such that any polytope $P$ satisfying \[ P \subseteq K \subseteq c \, \frac{n}{\log N} P \] must have at least \(N\) vertices, provided that \(N \in (Cn^2, e^{cn})\). Moreover, we prove that the same bound holds for approximating a centered convex body with a polytope having $N$ facets instead of $N$ vertices.
Read the full abstract

Classical Analysis and ODEs

Repeated principal indefinite summation

Under suitable asymptotic and convexity conditions on a function $g\colon\mathbb{R}_+\to\mathbb{R}$, the solution to $\Delta f=g$, where $\Delta$ is the forward difference operator, is unique up to an additive constant and is called the principal indefinite sum of $g$, generalizing the additive form of Bohr-Mollerup's theorem. We consider the map $\Sigma$, which assigns to each admissible function $g$ its principal indefinite sum that vanishes at $1$, and we naturally explore its iterates, which produce repeated principal indefinite sums, in analogy with the concept of repeated indefinite integrals. Explicit formulas and convergence results are established, highlighting connections with classical combinatorial and special functions, including the multiple gamma functions, for which we also provide integral representations.
Read the full abstract

Statistics Theory

Low-degree Lower bounds for clustering in moderate dimension

We study the fundamental problem of clustering $n$ points into $K$ groups drawn from a mixture of isotropic Gaussians in $\mathbb{R}^d$. Specifically, we investigate the requisite minimal distance $\Delta$ between mean vectors to partially recover the underlying partition. While the minimax-optimal threshold for $\Delta$ is well-established, a significant gap exists between this information-theoretic limit and the performance of known polynomial-time procedures. Although this gap was recently characterized in the high-dimensional regime ($n \leq dK$), it remains largely unexplored in the moderate-dimensional regime ($n \geq dK$). In this manuscript, we address this regime by establishing a new low-degree polynomial lower bound for the moderate-dimensional case when $d \geq K$. We show that while the difficulty of clustering for $n \leq dK$ is primarily driven by dimension reduction and spectral methods, the moderate-dimensional regime involves more delicate phenomena leading to a "non-parametric rate". We provide a novel non-spectral algorithm matching this rate, shedding new light on the computational limits of the clustering problem in moderate dimension.
Read the full abstract

Statistics Theory

On the errors committed by sequences of estimator functionals

Consider a sequence of estimators $\hat \theta_n$ which converges almost surely to $\theta_0$ as the sample size $n$ tends to infinity. Under weak smoothness conditions, we identify the asymptotic limit of the last time $\hat \theta_n$ is further than $\eps$ away from $\theta_0$ when $\eps \rightarrow 0^+$. These limits lead to the construction of sequentially fixed width confidence regions for which we find analytic approximations. The smoothness conditions we impose is that $\hat \theta_n$ is to be close to a Hadamard-differentiable functional of the empirical distribution, an assumption valid for a large class of widely used statistical estimators. Similar results were derived in Hjort and Fenstad (1992, Annals of Statistics) for the case of Euclidean parameter spaces; part of the present contribution is to lift these results to situations involving parameter functionals. The apparatus we develop is also used to derive appropriate limit distributions of other quantities related to the far tail of an almost surely convergent sequence of estimators, like the number of times the estimator is more than $\eps$ away from its target. We illustrate our results by giving a new sequential simultaneous confidence set for the cumulative hazard function based on the Nelson–Aalen estimator and investigate a problem in stochastic programming related to computational complexity.
Read the full abstract

2602.23021 · 26 Feb · 27 pages, 1 figure. Statistical Research Report, Department of Mathematics, University of Oslo, from March 2010, now arXiv'd February 2026. The paper is published, essentially in this form, in Mathematical Methods of Statistics, 2012, vol. 20, pages 327-346, at this url: link.springer.com/article/10.3103/S106653071104003X

Statistics Theory · Cross-listed from stat.ME

Testing Partially-Identifiable Causal Queries Using Ternary Tests

We consider hypothesis testing of binary causal queries using observational data. Since the mapping of causal models to the observational distribution that they induce is not one-to-one, in general, causal queries are often only partially identifiable. When binary statistical tests are used for testing partially-identifiable causal queries, their results do not translate in a straightforward manner to the causal hypothesis testing problem. We propose using ternary (three-outcome) statistical tests to test partially-identifiable causal queries. We establish testability requirements that ternary tests must satisfy in terms of uniform consistency and present equivalent topological conditions on the hypotheses. To leverage the existing toolbox of binary tests, we prove that obtaining ternary tests by combining binary tests is complete. Finally, we demonstrate how topological conditions serve as a guide to construct ternary tests for two concrete causal hypothesis testing problems, namely testing the instrumental variable (IV) inequalities and comparing treatment efficacy.
Read the full abstract

All authors Sourbh Bhadane, Joris M. Mooij, Philip Boeken, Onno Zoeter

Combinatorics

A uniform version of a theorem by Lindström

We prove the following uniform version of a theorem by Lindström: Let $\mbox{$\cal F$}:=\{F_i:~ i\in I\}$ be a $k$-uniform set family of $[n]$, where $k\geq 1$. If $|\mbox{$\cal F$}|\geq n+1$, then there exist two disjoint subsets $I_1$ and $I_2$ of $I$ for which $$ \bigcup\limits_{i\in I_1} M_i=\bigcup\limits_{i\in I_2} M_i $$ and $$ \bigcap\limits_{i\in I_1} M_i=\bigcap\limits_{i\in I_2} M_i. $$ Our proof uses basic linear algebra.
Read the full abstract

Numerical Analysis

A Reduced Magnetic Vector Potential Approach with Higher-Order Splines

This work presents a high-order isogeometric formulation for magnetoquasistatic eddy-current problems based on a decomposition into Biot-Savart-driven source fields and finite-element reaction fields. Building upon a recently proposed surface-only Biot-Savart evaluation, we generalize the reduced magnetic vector potential framework to the quasistatic regime and introduce a consistent high-order spline discretization. The resulting method avoids coil meshing, supports arbitrary winding paths, and enables high-order field approximation within a reduced computational domain. Beyond establishing optimal convergence rates, the numerical investigation identifies the requirements necessary to recover high-order accuracy in practice, including geometric regularity of the enclosing interface, accurate kernel quadrature, and compatible trace spaces for the source-reaction coupling.
Read the full abstract

All authors Merle Backmeyer, Laura A. M. D'Angelo, Brahim Ramdane, Sebastian Schöps

Representation Theory

Relative $Q$-shaped homological algebra

Exact categories are a natural generalisation of abelian categories and provide a fertile ground to develop relative homological algebra. In this paper, starting from a class of relative Gorenstein projective objects in an exact category $(\mathcal{A},\mathscr{E})$, we define exact model structures on $\mathcal{A}$ and cohomology functors that detect trivial objects and weak equivalences. Moreover, we show that varying the exact structure on $\mathcal{A}$ induces Bousfield (co)localisation sequences between the corresponding homotopy categories. We use these techniques to study the category ${}_{Q,A}\operatorname{Mod}$ of ${}_{A}\operatorname{Mod}$-valued representations, for a ring $A$, of a suitable $\Bbbk$-linear small category $Q$, where we apply our results to a range of objectwise exact structures, ranging from the split exact structure to the abelian one. In particular, we recover the $Q$-shaped derived category of Holm and Jorgensen and construct an intermediate $Q$-shaped homotopy category, analogous to the homotopy category of complexes. Finally, we show that the $Q$-shaped derived category is a Verdier quotient of the $Q$-shaped homotopy category, and that this quotient functor is part of recollement - generalising results of Verdier, Krause, and Iyama-Kato-Miyachi for complexes and $N$-complexes, respectively.
Read the full abstract