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)

Monday 16 February

Commutative Algebra

Partially ordered sets of distributive type and algebras with straightening laws

A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the join-meet toric ring on a finite distributive lattice is generalized to an ASL on a finite poset of distributive type. Our target is the questions when a finite poset of distributive lattice is Cohen–Macaulay and when the ASL on it is Gorenstein. We focus on a natural class of finite posets of distributive type and study various aspects of the above questions.
Read the full abstract

Numerical Analysis

Flux-Balanced Patankar-type Schemes for the Compressible Euler Equations

Positivity preservation of key physical quantities in the context of fluid flows, such as density and internal energy, is an essential property of a numerical scheme as otherwise the solution lacks physical relevance and has a not well-defined equation of state. One time integration technique that is capable of preserving the positivity of quantities for every time step size is the Patankar-trick and its variants. However, in the context of the Euler equations of gas dynamics, we wonder whether the Patankar-trick should be applied to the density and total energy equations or only to one of them. In this work, we discuss one drawback of the schemes when blindly applied to every positive conserved variable and additionally point out how to overcome the issue by balancing the involved numerical fluxes correctly. To illustrate our findings, we investigate modified Patankar–Runge–Kutta (MPRK) schemes in the context of the compressible Euler equations with and without stiff source terms. We discover that it is beneficial to only apply the Patankar-trick in the density equation and to balance the remaining numerical fluxes consistently rather than applying the trick also to the energy equation. This leads also to the preservation of contact discontinuities. We perform numerical experiments to demonstrate that the accuracy of the methods is maintained while the performance of our approach is superior to the traditional application of MPRK schemes.
Read the full abstract

All authors Thomas Izgin, Andreas Meister, Chi-Wang Shu, Davide Torlo

Combinatorics

Hamilton Cycles in Semisymmetric Graphs

In light of Lovász's longstanding question on the existence of Hamilton paths in vertex-transitive graphs, this paper considers a natural variant: what if vertex-transitivity is relaxed, yet a high degree of symmetry–specifically edge-transitivity–is retained? To investigate this, we focus on the class of semisymmetric graphs, which are regular, edge-transitive, but not vertex-transitive. In this paper, it will be shown that every connected semisymmetric graph of order $2pq$, where $p$ and $q$ are two distinct primes contains a Hamilton cycle and that every connected cubic semisymmetric graph of order less than 3000 contains a Hamilton cycle too. Based on these observations, the following question is posed: construct a connected semisymmetric graph which has no Hamilton cycle.
Read the full abstract

Representation Theory

Triangulated categories with a compact silting object, Brown-Comenetz duality and Brown representability theorems

The paper develops a Brown–Comenetz dual framework for Neeman's representability theorems for triangulated categories with a single compact generator (Invent. math., 244:531-616, 2026). Starting from a locally Hom-finite approximable triangulated category, we use the Brown–Comenetz duals of compact objects to construct a triangulated subcategory $\E$, which plays the role of an injective-side analogue of the compact subcategory $\T^c$. We introduce the intrinsic subcategory $\T_c^+$, dual to Neeman's subcategory $\T_c^-$, and characterize its objects by strong $\E$-coapproximating systems and homotopy inverse limits. Under the compact silting hypothesis, we prove Brown representability theorems identifying $(\T_c^+)^{\op}$ with locally finite $\E$-homological functors and $(\T_c^b)^{\op}$ with finite $\E$-homological functors. We also establish localization results for recollements on the Brown–Comenetz side and derive applications to derived categories of finite-dimensional algebras.
Read the full abstract

K-Theory and Homology

Syntomic cohomology of truncated Brown–Peterson spectra

We compute the $\mathrm{MU}$-based syntomic cohomologies, mod $(p,v_1,\cdots,v_n)$, of all $\mathbb{E}_1$ $\mathrm{MU}$-algebra forms of the truncated Brown–Peterson spectrum $\mathrm{BP}\langle n\rangle$. As qualitative consequences, we resolve the Lichtenbaum–Quillen, telescope, and redshift questions for the algebraic K-theories of all $\mathbb{E}_{1}$ $\mathrm{MU}$-algebra forms of $\mathrm{BP} \langle n\rangle$. This extends work of the Hahn and Wilson. We also explicitly compute the algebraic K-theory of arbitrary $\mathbb{E}_{1}$ $\mathrm{MU}$-algebra forms of $\mathrm{BP}\langle 2\rangle$ at all primes $p\ge 5$ extending previous work of the author, Ausoni, Culver, Höning, and Rognes.A dditionally, we present a new computation of mod $(p, v_1, v_2, v_3)$ algebraic K-theory of arbitrary $\mathbb{E}_1$ $\mathrm{MU}$-algebra forms of $\mathrm{BP}\langle 3\rangle$ at all primes $p\ge 7$, the first explicit computation of algebraic K-theory of an $\mathbb{E}_1$-ring of height $3$.
Read the full abstract

Logic

Square-bracket operations clubs

This paper continues the investigation of the three square-bracket operations $[\cdot\cdot]$ from chapter 5 of \cite{Walks}. \ We say that a square-bracket operation $[\cdot\cdot]$ has the Ramsey club property if for every club $C\subseteq\omega_{1}$, there is an uncountable subset $W$ $\subseteq \omega_{1}$ such that $\left[ \alpha\beta\right] \in C$ for every $\alpha,\beta\in W.$ \ The second author proved that the Proper Forcing Axiom implies that all the square-bracket operations induced by Aronszajn trees have this property. We extend this result to the other two classes. We conclude that each of the statements \textquotedblleft all square-bracket operations have the Ramsey club property\textquotedblright\ and \textquotedblleft No square-bracket operation has the Ramsey club property\textquotedblright\ are consistent with ZFC. In other words, ZFC is unable to decide the status of the Ramsey club property for any square-bracket operation. Furthermore, we analyze the status of the Ramsey club property for square-bracket operations under Martin's Axiom and the Continuum Hypothesis.
Read the full abstract

Information Theory

Diversity vs Degrees of Freedom in Gaussian Fading Channels

The classical definitions extract degrees of freedom (DOF) via $C(\snr)/\log\snr$ and diversity (DIV) via $-\log P_e(\snr)/\log\snr$, using $\log\snr$ as the common gauge for both. These ratios hide a two-step process: first, identify the gauge on which capacity or reliability actually grows; second, normalize the coefficient on that gauge by the appropriate atom. For coherent multiple-input multiple-output (MIMO) both gauges happen to be $\log\snr$ and both atom coefficients happen to be one. This paper shows that the two-step process is necessary outside this calibration case and makes it explicit using a Bhattacharyya-frontier construction. A capacity–packing sandwich theorem shows that fixed-resolution output-law packing and covering recover the capacity gauge, and a binary-endpoint theorem shows that the two-message Bhattacharyya frontier identifies the zero-rate diversity gauge. Endpoint DOF and endpoint DIV are obtained by dividing the raw coefficient on the identified gauge by the corresponding atom coefficient. For fixed deterministic channel matrix~$H$, the capacity gauge is $\log\snr$ with endpoint DOF $T\,\mathrm{rank}(H)$, while the zero-rate diversity gauge is $\snr$ with endpoint DIV $T\sigma_1^2(H)$, making fixed-$H$ a cross-gauge channel. For noncoherent scalar fast fading with $N$~receive antennas, the capacity gauge is $\log\log\snr$ with DOF~$1$, while the zero-rate diversity gauge is $\log\snr$ with endpoint DIV~$N$; the exact load-$r$ frontier gauge is $(\log\snr)^{1-r}$. The framework recovers the same-gauge cases, coherent Rayleigh MIMO and noncoherent block fading, with zero-rate DIV~$MN$. Audit tables separate exact results from lower bounds and open problems.
Read the full abstract

Numerical Analysis

Mixed precision and mixed accuracy explicit two-derivative Runge–Kutta methods

Mixed precision Runge–Kutta methods have been recently developed and used for the time-evolution of partial differential equations. Two-derivative Runge–Kutta schemes may offer enhanced stability and accuracy properties compared to classical one-derivative methods, making them attractive in a wide variety of problems. However, their computational cost can be significant, motivating the use of a mixed-precision paradigm that employs different floating-point precisions for different function evaluations to balance efficiency and accuracy. To ensure that the perturbations introduced by the low precision computations do not destroy the accuracy of the solution, we need to understand how these perturbation errors propagate. We extend the numerical analysis mixed precision framework previously developed for Runge–Kutta methods to characterize the propagation of the perturbation errors arising from mixed precision computations in explicit and implicit two-derivative Runge–Kutta methods. We use this framework for analyzing the order of the perturbation errors, and for designing new methods that are less sensitive to the effect of the low precision computations. Numerical experiments on linear and nonlinear representative PDEs, demonstrate that appropriately designed mixed-precision two-derivative Runge–Kutta methods achieve the predicted accuracy.
Read the full abstract

Number Theory

Short intervals for the Romanoff-type sumset

Let $X$ be large and let $\mathcal{P}$ denote the set of primes. Fix positive real parameters $r_1,\dots,r_s$ and a parameter $\lambda\geqslant 1$ determined by a balancing relation, and let $\mathcal{A}_{\lambda}(X)\subset[1,2X]$ be the associated lacunary set generated by sums of powers of $2$ with polynomially growing exponents. Set $\mathcal{S}_{\lambda}:=\mathcal{P}+\mathcal{A}_{\lambda}(X)$. Fix $\varepsilon>0$, choose $\theta$ with $2/15+\varepsilon<\theta<0.99$, and set $h=X^{\theta}$. We prove that for all but $O_{\varepsilon}\left(X\exp\left(-c_{\varepsilon}(\log X)^{1/4}\right)\right)$ values of $x\in[X,2X]$, the short interval $(x,x+h]$ contains $\asymp_{\varepsilon} h$ integers of the form $p+a$, where $p$ is prime and $a\in\mathcal{A}_{\lambda}(X)$.
Read the full abstract

Group Theory

Galois action on the principal block and generation of Sylow 3-subgroups

In this paper, we prove one direction of a conjecture of Navarro-Rizo-Schaeffer Fry-Vallejo positing an algorithm to determine from the character table whether a finite group has $2$-generated Sylow $3$-subgroups. This gives further evidence of the blockwise version of the Galois-McKay conjecture (also known as the Alperin-McKay-Navarro conjecture). A key step involves proving the Isaacs-Navarro Galois conjecture for principal blocks for finite groups with a certain structure.
Read the full abstract

All authors Eden Ketchum, J. Miquel Martínez, Noelia Rizo, A. A. Schaeffer Fry

Functional Analysis

Matrix-Weighted Poincaré-Type Inequalities with Applications to Logarithmic Hajłasz–Besov Spaces on Spaces of Homogeneous Type

Let ${\mathcal {X}}$ be a space of homogeneous type. In this article, based on the reducing operators of matrix $A_p$-weights, the authors introduce the vector-valued Hajłasz gradient sequences and establish some related matrix-weighted Poincaré-type inequalities on ${\mathcal {X}}$. As an application, the authors introduce the matrix-weighted logarithmic Besov spaces on ${\mathcal {X}}$ and establish their pointwise characterization via Hajłasz gradient sequences. The novelty of this article lies in that, by means of both the $A_p$ dimension and its properties of matrix $A_p$-weights and the wavelet reproducing formula with exponential decay of P. Auscher and T. Hytönen, all the main results get rid of the dependence on the reverse doubling conditions of both weights and ${\mathcal {X}}$ under consideration and these results are also completely new even for unweighted logarithmic Besov spaces on ${\mathcal {X}}$.
Read the full abstract

Sunday 15 February

Analysis of PDEs

Existence and nonexistence of solutions for fractional elliptic equations arising from closed MEMS model

The objective of our paper is to investigate fractional elliptic equations of the form $(-\Delta)^s u=\frac{\lambda }{(a-u)^2}$ within a bounded domain $\Omega$, subject to zero Dirichlet boundary conditions. Here, $s\in(0,1)$, $\lambda>0$, and the function $a$ vanishes at the boundary while satisfying additional conditions. This problem originates from Micro-Electromechanical Systems (MEMS) devices, particularly when the elastic membrane makes contact with the ground plate at the boundary. We establish both existence and nonexistence results, illustrating how the boundary decay of the membrane influences the solutions and pull-in voltage.
Read the full abstract

Statistics Theory

High-accuracy log-concave sampling with stochastic queries

We show that high-accuracy guarantees for log-concave sampling – that is, iteration and query complexities which scale as $\mathrm{poly}\log(1/\delta)$, where $\delta$ is the desired target accuracy – are achievable using stochastic gradients with subexponential tails. Notably, this exhibits a separation with the problem of convex optimization, where stochasticity (even additive Gaussian noise) in the gradient oracle incurs $\mathrm{poly}(1/\delta)$ queries. We also give an information-theoretic argument that light-tailed stochastic gradients are necessary for high accuracy: for example, in the bounded variance case, we show that the minimax-optimal query complexity scales as $\Theta(1/\delta)$. Our framework also provides similar high accuracy guarantees under stochastic zeroth order (value) queries, and an improved complexity result for sampling from finite-sum potentials.
Read the full abstract

All authors Fan Chen, Sinho Chewi, Constantinos Daskalakis, Alexander Rakhlin

Differential Geometry

Polynomial degeneration and the Poisson geometry of truncated polynomials

We develop a formalism for studying geometric structures that degenerate to polynomial order along a hypersurface $W \subset M$. We then demonstrate it in the study of Poisson geometry, where it leads to methods for constructing generically symplectic Poisson structures with non-trivial symplectic variation along their degeneracy locus. This is in contrast to $b/\log$-symplectic and $b^k$-symplectic structures, where this variation always vanishes. Our main insight is that the higher residue data along the hypersurface is controlled by a group of transverse diffeomorphisms, which in our case is the group $G_k$ of degree-$k$ truncated polynomials. We show that the symplectic variation of our Poisson structures is determined by the obstruction to lifting a $G_k$-representation of the fundamental group $\pi_1(W)$ to $G_{k+1}$, and we construct maps from a $G_k$-character variety into the moduli space of Poisson structures, with the variation detecting the non-triviality of the resulting families.
Read the full abstract

Number Theory

Minimal zero-free regions for results on primes between consecutive perfect $k$th powers

We compute minimal zero-free regions for the Riemann zeta-function of the Littlewood form which ensure there is always a prime between consecutive perfect $k$th powers. Our computations cover powers $k\geq 65$ and quantify how far we are away from proving certain milestones toward an infamous open problem (Legendre's conjecture). In addition, we prove there is always a prime between consecutive perfect $86$th powers, and identify an integer sequence (that is a subset of the positive integers) for which there is always a prime between consecutive $70$th powers.
Read the full abstract

Category Theory

2-dimensional Lawvere theories, commutativity, and higher Day convolution

The aim of this paper is to study categorified algebraic structures and their pseudo- and lax homomorphisms using the framework of Lawvere $2$-theories, and more generally, (enhanced) $2$-dimensional sketches. The key notion we focus on is that of $2$-dimensional commutativity. As one of the main results, we prove that if a Lawvere $2$-theory $\mathbb{T}$ is equipped with such a structure, then the $2$-category $\mathsf{Mod}_l(\mathbb{T},\mathbf{Cat})$ of $\mathbb{T}$-models, lax homomorphisms, and modifications admits a natural structure of a closed $2$-multicategory. From this, we deduce a generalization of Fox's theorem. We also discuss the analogue in the higher setting for Lawvere $(\infty,2)$-theories. As a result of independent interest, we construct a multicategory (or $\infty$-operad) structure on the hom-category $\mathsf{Hom}_{\mathbb{V}}(\mathcal{M},\mathcal{N})$, where $\mathbb{V}$ is a monoidal $(\infty,2)$-category and $\mathcal{M},\mathcal{N}$ are monoids therein.
Read the full abstract

Combinatorics

Two Dimensional Subtraction – Transfer Games

We generalize the results and conjectures of Tamás Lengyel, showing that the nim-values of a large class of two-dimensional subtraction-transfer games are periodic. These are impartial, normal-play games with two piles of tokens, where players alternate either taking some tokens from a pile or transferring tokens from one pile to the other. In many cases, we calculate the exact period. We also develop several new notions of periodicitiy.
Read the full abstract

Number Theory

Constructing genus 2 curves with given refined Humbert invariants

In 1994, Kani introduced an algebraic version of the Humbert invariant, known as the refined Humbert invariant. This invariant q_C is a positive definite quadratic form attached to a smooth curve C of genus 2. It serves as a vital tool, as many geometric properties of C are reflected in the arithmetic properties of q_C. When the Jacobian J_C of a genus 2 curve C is isogenous to a product of an elliptic curve with complex multiplication, the forms q_C have been completely classified recently. In this paper, building upon this classification, we present a constructive algorithm that produces J_C and a divisorial representative of a curve C of genus 2 such that its refined Humbert invariant q_C is equivalent to a given integral ternary quadratic form.
Read the full abstract

Functional Analysis

Characterizations of Asplund and Tame Functionals using Arens Products

We investigate the interaction between Arens products on the bidual of a Banach algebra and structural regularity properties of functionals on the algebra. Building on the classical characterization of weakly almost periodic functionals via Arens regularity, we prove new analogous criteria for Asplund and tame functionals. We establish a systematic correspondence between geometric properties of orbit sets in the dual – namely weak compactness, fragmentability, and absence of $\ell^1$-sequences – and structural properties of the corresponding bidual orbits under the Arens products, such as weak compactness, separability, and co-tameness. In particular, we obtain bidual characterizations of right Asplund and right tame functionals analogous to the classical weakly almost periodic theory. We then apply the theory to the group algebra $L^{1}(G)$ of a locally compact group $G$. In this setting, we derive concrete characterizations of Asplund and tame elements of $L^{\infty}(G)$ using orbits of finitely additive $\{0, 1\}$-valued measures. For characteristic functions over countable discrete groups, this yields a simple criterion based on countability of the orbit, generalizing a result of Glasner and Megrelishvili for $\ell^1(\mathbb{Z})$.
Read the full abstract

Analysis of PDEs

Observability and Semiclassical Control for Schrödinger Equations on Non-compact Hyperbolic Surfaces

We study the observability of the Schrödinger equation on $X$, a non-compact covering space of a compact hyperbolic surface $M$. Using a generalized Bloch theory, functions on $X$ are identified as sections of flat Hilbert bundles over $M$. We develop a semiclassical analysis framework for such bundles and generalize the result of semiclassical control estimates in [Dyatlov and Jin, Acta Math., 220 (2018), pp. 297-339] to all flat Hilbert bundles over $M$, with uniform constants with respect to the choice of bundle. Furthermore, when the Riemannian cover $X \to M$ is a normal cover with a virtually Abelian deck transformation group $\Gamma$, we combine the uniform semiclassical control estimates on flat Hilbert bundles with the generalized Bloch theory to derive observability from any $\Gamma$-periodic open subsets of $X$. We also discuss applications of the uniform semiclassical control estimates in spectral geometry.
Read the full abstract

Numerical Analysis · Cross-listed from physics.med-ph

Complex Wavelet-Based Sinogram Segmentation for Metal Artifact Reduction in Cone-Beam CT

Metal objects pose a significant challenge in cone-beam computed tomography, as their strong and energy-dependent X-ray attenuation leads to inconsistent projections and severe streaking and shading artifacts in reconstructed images. These artifacts degrade image quality and limit the reliability of subsequent medical analysis. We propose a projection-domain metal artifact reduction method based on analytical metal segmentation in the three-dimensional sinogram using the three-dimensional Dual-Tree Complex Wavelet Transform, where directional wavelet coefficients are exploited to extract the wavefront set and singular support of metal structures. The resulting segmentation enables projection-domain inpainting and artifact-reduced reconstruction by combining metal-free and metal-only reconstructions. The proposed approach is evaluated on both simulated and clinical cone-beam computed tomography data and consistently reduces metal artifacts compared to conventional image-domain hard-thresholding methods. The results demonstrate improved visual quality and robustness in clinically realistic scenarios, highlighting the potential of analytically grounded, non-learned projection-domain segmentation for metal artifact reduction.
Read the full abstract

All authors Siiri Rautio, Alexander Meaney, Salla-Maaria Latva-Äijö, Harshit Agrawal, Mikael Brix, Dinidu Jayakody, Samuli Siltanen

Combinatorics

The construction of $q$-analogues via $_3\phi_2$-series and $q$-difference equations

We apply the EKHAD-normalization method given in our recent work to obtain, via the $q$-version of Zeilberger's algorithm, $q$-WZ pairs $(F, G)$ such that $\sum_{k = 0}^{\infty} F(0, k)$ may be expressed as a basic hypergeometric series of the form ${}_{3}\phi_2$ with multiple free parameters, and in such a way so that $\sum_{k=0}^{\infty} F(0, k) = \sum_{n=0}^{\infty} G(n, 0)$. In contrast to how previous applications of EKHAD-normalization relied on $q$-analogues for specific WZ pairs introduced by Guillera, our multiparameter approach provides a broad framework in the construction of $q$-analogues for accelerated series for universal constants such as $\pi$. We apply this multiparameter version of EKHAD-normalization to obtain and prove new $q$-analogues for accelerated hypergeometric series attributed to many authors, including (alphabetically) Adamchik and Wagon, Apéry, Chu, Chu and Zhang, Fabry, Guillera, Ramanujan, and Zeilberger.
Read the full abstract

Probability

Robust Filtering of Lévy-driven Stochastic Models

We study robust nonlinear filtering for stochastic models driven by Lévy processes, where the signal and observation processes are coupled through common Brownian and jump noise. Robustness, defined as the continuous dependence of the filter on the observation path, is essential whenever the observation process deviates from the idealized model, for instance when a path must be reconstructed from discrete-time samples. This question is well understood for continuous semimartingale systems but largely open in the presence of jumps. We construct a version of the filter and establish its continuity in two regimes. For processes with finitely many jumps on compact intervals, we prove continuity in both the rough $p$-variation and $p$-variation topologies on cadlag path space, without requiring a separability condition on the jump coefficients. For processes with infinitely many jumps, we prove continuity in a modified rough $p$-variation topology adapted to cadlag geometric rough paths, under an additional separability assumption. In both cases, our approach relies on Stratonovich and Marcus flow decompositions rather than the Itô-based methods of recent work. The resulting geometric rough-path lifts yield pathwise convergence guarantees and can be constructed directly from discrete observations without knowledge of the underlying probability law.
Read the full abstract

Numerical Analysis

Nonconforming virtual element methods for fourth-order nonlinear reaction-diffusion systems: a unified framework and analysis

We develop a unified framework for the design and analysis of high-order nonconforming virtual element methods for nonlinear fourth-order reaction–diffusion problems in two dimensions, with emphasis on clamped, Navier, and Cahn–Hilliard-type boundary conditions. Time discretization is performed using the backward Euler scheme, while the spatial approximation relies on nonconforming virtual element spaces of arbitrary order $k \ge 2$, encompassing both $C^0$-nonconforming and Morley-type methods. A key contribution of this work is the development of a novel and rigorous unified error analysis for these numerical schemes, applicable to domains that are not necessarily convex, differing from the existing literature. By introducing a class of Companion operators, we construct novel Ritz-type projections and derive a new error equation that enables us to obtain optimal error estimates for the scheme under a minimal spatial regularity assumption on the weak solution. Finally, we present numerical experiments on polygonal meshes as applications of the proposed framework, including the extended Fisher–Kolmogorov equation, and a fourth-order model with Cahn–Hilliard-type boundary conditions, which validate the theoretical results and illustrate the performance of the method for the three classes of boundary conditions.
Read the full abstract

Analysis of PDEs

Partial regularity of the gradient for subsolutions

We prove that the gradient of any bounded subharmonic function is upper semi-continuous, provided that its super-level sets can be touched from the exterior by uniform $C^{1,\text{Dini}}$ domains at every point. This idea extends to a class of general operators, as well as to the boundary behaviour of the gradient of solutions of the Dirichlet problem in a domain whose boundary satisfy this geometric condition.
Read the full abstract

Numerical Analysis · Cross-listed from cs.MS

Parallel Sparse and Data-Sparse Factorization-based Linear Solvers

Efficient solutions of large-scale, ill-conditioned and indefinite algebraic equations are ubiquitously needed in numerous computational fields, including multiphysics simulations, machine learning, and data science. Because of their robustness and accuracy, direct solvers are crucial components in building a scalable solver toolchain. In this chapter, we will review recent advances of sparse direct solvers along two axes: 1) reducing communication and latency costs in both task- and data-parallel settings, and 2) reducing computational complexity via low-rank and other compression techniques such as hierarchical matrix algebra. In addition to algorithmic principles, we also illustrate the key parallelization challenges and best practices to deliver high speed and reliability on modern heterogeneous parallel machines.
Read the full abstract

Logic

Universality of Infinite Chess

We prove that chess played on the infinite chessboard $\mathbb{Z}^2$ with infinitely many pieces is as powerful as it could possibly be, by showing that every open Gale-Stewart game with draws is strategically equivalent to some infinite chess position and vice versa. As our construction is computable and open Gale-Stewart games are well understood, this allows us to resolve many open questions about the complexity of infinite chess with infinitely many pieces. In particular, all countable ordinals arise as the game value of some such chess position. We also give an alternate construction that realizes all countable ordinals as game values, with the pleasing property that it consists only of the king pair and pawns.
Read the full abstract

Numerical Analysis

A Higher Order Discretization for the Stochastic Navier–Stokes equations with additive Noise

We propose a new higher-order time discretization scheme for the stochastic Navier–Stokes equations with additive noise, where its velocity and pressure approximates converge at strong rate $1.5$ in probability. The construction rests on its reformulation as a random PDE for the transform $y = u- \Phi W$, and different higher order numerical quadrature rules for the diffusion and the drift part. The theoretical findings are supported by numerical simulations.
Read the full abstract

All authors L. Banas, D. Breit, A. Chaudhary, A. Prohl

Algebraic Geometry

Resolution Except for the Normal-Crossing Locus and Galois actions

In characteristic zero, we construct a canonical, functorial resolution algorithm by weighted blow-ups that strictly preserves the normal crossings (nc) locus, effectively answering Kollar's problem. Operating in full generality, our approach handles both reduced and non-reduced nc singularities alongside the simple normal crossings (snc) exceptional divisor setup, terminating with a normal crossings Deligne-Mumford stack. The resolution is governed by two fundamental geometric properties: the openness of the nc locus and the topological rigidity of canonical maximal admissible weighted centers (the Center Theorem). We establish these via a direct Galois-theoretic analysis of splitting forms. By viewing general nc singularities as quotients of 'etale-local snc singularities by finite Galois groups permuting their branches, we reveal the intrinsic necessity of weighted blow-ups and stack structures. Building on the weighted blow-up framework of Abramovich, Temkin, and Wlodarczyk and our logarithmic refinement, this structural mechanism yields a robust resolution algorithm. Applications include a canonical compactification of nc Deligne-Mumford stacks and a functorial nc-preserving resolution of subvarieties and stacks.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.supr-con

Topology optimization of low-temperature type-II superconductors with superconductor-dielectric/vacuum interfaces based on Ginzburg-Landau theory under Weyl gauge

Geometrical design is a crucial and challenging strategy for improving the performance of type-II superconductors, because the proper placement of intended defects in the current path contribute to flux pinning, a reduction in dissipation, and an increase in achievable current density. Topology optimization is currently one of the most powerful approaches used to determine consistent structural geometries. Therefore, a topology optimization approach is presented to inversely design structural geometries of low-temperature type-II superconductors with superconductor-dielectric/vacuum interfaces.
Read the full abstract