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 23 February

Analysis of PDEs

Uniform rectifiability of brittle fractures in linear elasticity

We prove the uniform rectifiability of brittle fractures in arbitrary dimension. The existing approach for the Mumford-Shah functional, which relies on separation-type properties of the singular set, faces serious obstacles in the Griffith setting due to the lack of coarea formula for the symmetric gradient. We present an alternative route to uniform rectifiability for free-discontinuity problems by proving that cracks have “plenty of big projections”.
Read the full abstract

Logic

Superamalgamation for modal lattices via non-distributive dualities

We show that the variety of modal lattices has the superamalgamation property. As a consequence, we obtain that the weak positive modal logic has the Craig interpolation property. Our proof employs the recent duality for modal lattices based on modal L-spaces. Moreover, we extend this result to a number of other weak positive modal logics axiomatized by modal axioms corresponding to universal Horn sentences.
Read the full abstract

Optimization and Control · Cross-listed from cs.DS

Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization

We study the problem of maximizing a complex-valued quadratic form over the $K^{\text{th}}$ roots of unity. We show that when the objective matrix $\mathbf{Q}^\star \in \mathbb{C}^{n \times n}$ of the quadratic has rank $r$, the global maximizer belongs to a candidate set of size $O(rn^{2r-1})$. This set can be constructed deterministically in $O(rn^{2r+1})$ time by enumerating the vertices of a hyperplane arrangement in $\mathbb{R}^{2r}.$ The algorithm is embarrassingly parallel; with~$P$ processors, the time complexity drops to $O(r n^{2r+1}/P)$. For approximately low-rank settings, where the objective matrix is a noise-perturbed variant of a rank-$r$ matrix, we prove that applying our framework to a spectral truncation yields a multiplicative $(1 - O(\left\|\mathbf{H}\right\|_2 / \delta^{\star}))$-approximation guarantee, where $\delta^{\star}$ denotes the eigengap of the underlying rank-$r$ matrix and $\mathbf{H}$ represents the perturbation. To scale to high-dimensional problems, we establish a randomized sampling variant. We prove that uniformly sampling $S \geq O(1/\varepsilon^{r-1})$ candidates achieves a $(1-\varepsilon)\cos^2(\pi / K)$-approximation of the optimal rank-$r$ solution with high probability. Crucially, this sample size is entirely independent of $n$, reducing the overall runtime to $O(S \cdot n^2)$. Computational experiments on synthetic benchmarks and large-scale graphs for Max-3-Cut confirm that our algorithms match or exceed semi-definite programming solution quality on structured instances while enabling massive parallelization across heterogeneous hardware and scaling seamlessly to problems where $n \geq 10^6$.
Read the full abstract

All authors Ria Stevens, Fangshuo Liao, Barbara Su, Thanasis Hadjidimoulas, Jianqiang Li, Anastasios Kyrillidis

Statistics Theory

Semi-parametric Bayesian inference under Neyman orthogonality

The validity of two-step or plug-in inference methods is questioned in the Bayesian framework. We study semi-parametric models where the plug-in of a non-parametrically modelled nuisance component is used. We show that when the nuisance and targeted parameters satisfy a Neyman orthogonal score property, the approach of cutting feedback through a two-step procedure is a valid way of conducting Bayesian inference. Our method relies on a non-parametric Bayesian formulation based on the Dirichlet process and the Bayesian bootstrap. We show that the marginal posterior of the targeted parameter exhibits good frequentist properties despite not accounting for the inferential uncertainty of the nuisance parameter. We adopt this approach in Bayesian causal inference problems where the nuisance propensity score model is estimated to obtain marginal inference for the treatment effect parameter, and demonstrate that a plug-in of the propensity score has a negligible effect on marginal posterior inference for the causal contrast. We investigate the absence of Neyman orthogonality and exploit our findings to show that in conventional two-step procedures, the posterior distribution converges under weaker restrictions than those needed in the frequentist sequel. For a simple family of useful scores, we demonstrate that even in the absence of Neyman orthogonality, the posterior distribution is asymptotically unchanged by the estimation of the nuisance parameter, merely provided the latter estimator is consistent.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Quantitative Approximation Rates for Group Equivariant Learning

The universal approximation theorem establishes that neural networks can approximate any continuous function on a compact set. Later works in approximation theory provide quantitative approximation rates for ReLU networks on the class of $\alpha$-Hölder functions $f: [0,1]^N \to \mathbb{R}$. The goal of this paper is to provide similar quantitative approximation results in the context of group equivariant learning, where the learned $\alpha$-Hölder function is known to obey certain group symmetries. While there has been much interest in the literature in understanding the universal approximation properties of equivariant models, very few quantitative approximation results are known for equivariant models. In this paper, we bridge this gap by deriving quantitative approximation rates for several prominent group-equivariant and invariant architectures. The architectures that we consider include: the permutation-invariant Deep Sets architecture; the permutation-equivariant Sumformer and Transformer architectures; joint invariance to permutations and rigid motions using invariant networks based on frame averaging; and general bi-Lipschitz invariant models. Overall, we show that equally-sized ReLU MLPs and equivariant architectures are equally expressive over equivariant functions. Thus, hard-coding equivariance does not result in a loss of expressivity or approximation power in these models.
Read the full abstract

All authors Jonathan W. Siegel, Snir Hordan, Hannah Lawrence, Ali Syed, Nadav Dym

Complex Variables

On Harmonic Univalent Functions Defined by Dziok-Srivastava Operator

The purpose of this work is to present a class of harmonic univalent functions defined by the Dziok-Srivastava operator. Some geometric properties like coefficients conditions, distortion theorem, convolution (Hadamard product), convex combination and extreme points are investigated.
Read the full abstract

Algebraic Topology

Equivariant real cycle class map and Witt-sheaf cohomology of classifying spaces

In this paper, we study equivariant real cycle class maps for group actions on real schemes, with a view toward Witt-sheaf characteristic classes. The cycle class maps take values in singular cohomology of the real points of the quotient stack, which are identified with the homotopy fixed-points of complex conjugation on the complex points. This provides a strong relation between Witt-sheaf cohomology of the geometric classifying space of a real algebraic group and the singular cohomology of the classifying spaces of its strong real forms, which we discuss in a number of examples. As a sample application, we compute the number of Witt-sheaf cohomological invariants of spin groups over the reals.
Read the full abstract

Information Theory

On the Height Profile of Analog Error-Correcting Codes

In recent work, it has been shown that maintaining reliability in analog vector–matrix multipliers can be modeled as the following coding problem. Vectors in $\mathbb{R}^k$ are encoded into codewords of a linear $[n,k,d]$ code $C$ over $\mathbb{R}$. For prescribed positive reals $\delta < \Delta$, additive errors of magnitude at most $\delta$ are tolerable and need no handling, yet outlying errors of magnitude greater than $\Delta$ are to be located or detected. The trade-off between the ratio $\Delta/\delta$ and the number of outlying errors that can be handled is determined by the height profile of $C$; as such, the height profile provides a finer description of the error handling capability of $C$, compared to the minimum distance $d$, which only determines the number of correctable errors. This work contains a further study of the notion of the height profile. Several characterizations of the height profile are presented, thereby yielding methods for computing it. The starting point is formulating this computation as an optimization problem that is solved by a set of linear programs. This, in turn, leads to a combinatorial characterization of the height profile as a maximum (or max–min) over a certain finite set of codewords of $C$. Moreover, this characterization is shown to have a simple geometric interpretation when the columns of the generator matrix of $C$ all have the same $L_2$ norm. Through examples of several code families, it is demonstrated how the results herein can be used to compute the height profile explicitly.
Read the full abstract

All authors Ron M. Roth, Ziyuan Zhu, Changcheng Yuan, Paul H. Siegel, Anxiao Jiang

Dynamical Systems

Memory reshapes stability landscapes: resilience-resistance tradeoffs and critical transitions

Regime shifts in biology, ecology, and other complex systems are often interpreted through stability landscapes and early warning signals that implicitly assume dynamics without memory effects. Yet many real systems exhibit these effects, thus present dynamics depend on past states and past forcing. Here, we study how memory reshapes bistable stability landscapes and regime shifts using a minimal bistable model with a fractional derivative that controls memory strength. We connect landscape geometry to classical notions of resilience and resistance by quantifying basin curvature and the perturbation magnitude required to cross the unstable threshold, and we track how these quantities evolve in time after perturbations. Memory typically flattens basin floors, slowing recovery, while often increasing the perturbation threshold for stability transitions, revealing a tradeoff between resilience and resistance. Because the landscape becomes history-dependent and time-evolving, memory generates qualitative behaviors that do not appear in memory-free models, including delayed collapse or recovery after stress ends, rebound after apparently successful transition, and broadened hysteresis under gradual parameter change. Finally, we show that fitting a memory-free model to memory-driven data can reproduce trajectories while systematically shifting equilibrium branches and tipping locations, risking incorrect diagnosis and management of regime shifts. These results motivate a moving landscape view and provide practical guidance for interpreting observed anomalies and distinguishing memory-driven effects from noise.
Read the full abstract

All authors Moein Khalighi, Chandler Ross, Ville Laitinen, Guilhem Sommeria-Klein, Leo Lahti

Functional Analysis

Non-Wiener groups with a Gelfand pair

Let $G$ be a non-amenable locally compact group and $K$ a compact subgroup of $G$ such that $(G,K)$ is a Gelfand pair. We show that if $G$ admits a suitable boundary representation which is topologically irreducible and not unitarizable, then $G$ is not a Wiener group in the sense that its Fourier transform does not satisfy the analogue of Wiener's Tauberian theorem. As an application, we show that if $G$ is a closed non-compact boundary transitive group of automorphisms of a connected locally finite graph with infinitely many ends, or a non-abelian split reductive algebraic group over a non-archimedean local field, then $G$ is not Wiener.
Read the full abstract

Information Theory

Learning During Detection: Continual Learning for Neural OFDM Receivers via DMRS

Deep neural networks (DNNs) have been increasingly explored for receiver design because they can handle complex environments without relying on explicit channel models. Nevertheless, because communication channels change rapidly, their distributions can shift over time, often making periodic retraining necessary. This paper proposes a zero-overhead online and continual learning framework for orthogonal frequency-division multiplexing (OFDM) neural receivers that directly detect the soft bits of received signals. Unlike conventional fine-tuning methods that rely on dedicated training intervals or full resource grids, our approach leverages existing demodulation reference signals (DMRS) to simultaneously enable signal demodulation and model adaptation. We introduce three pilot designs: fully randomized, hybrid, and additional pilots that flexibly support joint demodulation and learning. To accommodate these pilot designs, we develop two receiver architectures: (i) a parallel design that separates inference and fine-tuning for uninterrupted operation, and (ii) a forward-pass reusing design that reduces computational complexity. Simulation results show that the proposed method effectively tracks both slow and fast channel distribution variations without additional overhead, service interruption, or catastrophic performance degradation under distribution shift.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

StochasticBarrier.jl: A Toolbox for Stochastic Barrier Function Synthesis

We present StochasticBarrier.jl, an open-source Julia-based toolbox for generating Stochastic Barrier Functions (SBFs) for safety verification of discrete-time stochastic systems with additive Gaussian noise. StochasticBarrier.jl certifies linear, polynomial, and piecewise affine (PWA) systems. The latter enables verification for a wide range of system dynamics, including general nonlinear types. The toolbox implements a Sum-of-Squares (SOS) optimization approach, as well as methods based on piecewise constant (PWC) functions. For SOS-based SBFs, StochasticBarrier.jl leverages semi-definite programming solvers, while for PWC SBFs, it offers three engines: two using linear programming (LP) and one based on gradient descent (GD). Benchmarking StochasticBarrier.jl against the state-of-the-art shows that the tool outperforms existing tools in computation time, safety probability bounds, and scalability across over 30 case studies. Compared to its closest competitor, StochasticBarrier.jl is up to four orders of magnitude faster, achieves significant safety probability improvements, and supports higher-dimensional systems.
Read the full abstract

All authors Rayan Mazouz, Frederik Baymler Mathiesen, Luca Laurenti, Morteza Lahijanian

Optimization and Control

A variance reduced framework for (non)smooth nonconvex-nonconcave stochastic minimax problems with extended Kurdyka-Lojasiewicz property

In this paper, we study stochastic constrained minimax optimization problems with nonconvex-nonconcave structure, a central problem in modern machine learning, for which reliable and efficient algorithms remain largely unexplored due to its inherent challenges. Prior approaches for nonconvex minimax optimization often require (strong) concavity on the maximization part, or certain restrictive geometric assumptions on the joint objective to have guaranteed convergence. In contrast, our method only assumes weak convexity in the primal variable and the extended Kurdyka-Lojasiewicz (KL) property, with exponent $\theta \in [0,1]$, in the dual variable, significantly broadening the class of tractable problems. To this end, we propose a variance reduced algorithm that provably handles this general setting and achieves an $\varepsilon$-stationary solution with state-of-the-art sample complexity: in the smooth finite-sum setting, the sample complexity is $\mathcal{O}\left(\sqrt{N}\,\varepsilon^{-\max\{4\theta,2\}}\right)$, where $N$ is the number of total samples, and in the online smooth setting, it is $\mathcal{O}\Big(\varepsilon^{-\max\{6\theta,3\}}\Big)$. For the structured nonsmooth problem, the sample complexity is $\mathcal{O}\left(\sqrt{N}\,\max\Big\{\varepsilon^{-3}, \varepsilon^{-5\theta}, \varepsilon^{-\frac{11\theta-3}{2\theta}}\Big\}\right)$ and $\mathcal{O}\left(\max\left\{\varepsilon^{-4}, \varepsilon^{-\frac{15\theta-1}{2}}, \varepsilon^{-\frac{31\theta-9}{4\theta}}\right\}\right)$ respectively for the two settings. To the best of our knowledge, this is the first unified framework that jointly accommodates weak convexity, the extended KL property, and variance-reduced stochastic updates, making it highly suitable for large-scale applications.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

A note on the conceptual problems on the Unruh effect

This brief note is written with a somewhat similar purpose to Earman's 2011 paper on the conceptual problems on the Unruh effect. However, we confine ourselves to Sewell's modular approach to the Unruh effect, which is based on the theorems of Tomita-Takesaki and Bisognano-Wichmann. This approach is rigorous, and has an advantage of being model-independent. However, we will see that a number of conceptual problems remain unsolved on this approach.
Read the full abstract

Algebraic Geometry

The $G$-Noncommutative Minimal Model Program

In this paper, we study the $G$-equivariant noncommutative minimal model program ($G$-NMMP), as an equivariant generalization of the framework introduced in arXiv:2301.13168. The aim of this program is to construct quasi-convergent paths in the spaces of Bridgeland stability conditions on derived categories of $G$-equivariant coherent sheaves. For finite groups, we employ induction techniques to construct such paths from the non-equivariant setting. In the setting of algebraic group actions, we introduce the notion of $\mathbb T$-stability conditions to reformulate the proposal, and then we construct quasi-convergent paths for equivariant projective spaces from small quantum cohomology.
Read the full abstract

Optimization and Control · Cross-listed from cs.CV

GSNR: Graph Smooth Null-Space Representation for Inverse Problems

Inverse problems in imaging are ill-posed, leading to infinitely many solutions consistent with the measurements due to the non-trivial null-space of the sensing matrix. Common image priors promote solutions on the general image manifold, such as sparsity, smoothness, or score function. However, as these priors do not constrain the null-space component, they can bias the reconstruction. Thus, we aim to incorporate meaningful null-space information in the reconstruction framework. Inspired by smooth image representation on graphs, we propose Graph-Smooth Null-Space Representation (GSNR), a mechanism that imposes structure only into the invisible component. Particularly, given a graph Laplacian, we construct a null-restricted Laplacian that encodes similarity between neighboring pixels in the null-space signal, and we design a low-dimensional projection matrix from the $p$-smoothest spectral graph modes (lowest graph frequencies). This approach has strong theoretical and practical implications: i) improved convergence via a null-only graph regularizer, ii) better coverage, how much null-space variance is captured by $p$ modes, and iii) high predictability, how well these modes can be inferred from the measurements. GSNR is incorporated into well-known inverse problem solvers, e.g., PnP, DIP, and diffusion solvers, in four scenarios: image deblurring, compressed sensing, demosaicing, and image super-resolution, providing consistent improvement of up to 4.3 dB over baseline formulations and up to 1 dB compared with end-to-end learned models in terms of PSNR.
Read the full abstract

All authors Romario Gualdrón-Hurtado, Roman Jacome, Rafael S. Suarez, Henry Arguello

Optimization and Control

Poisson Hamiltonian Pontryagin Dynamics and Optimal Control of Mechanical Systems on Lie Groupoids

We develop a Poisson Hamiltonian formulation of Pontryagin dynamics for optimal control of mechanical systems on Lie groupoids. The reduced dynamics is formulated intrinsically on the dual Lie algebroid endowed with its canonical linear Poisson structure and evolves on its symplectic leaves. The main result of this work shows that symplectic leaves, rather than coadjoint orbits, provide the natural reduced phase spaces for Pontryagin dynamics on Lie groupoids. Under suitable regularity assumptions, we prove the equivalence between the variational formulation of the optimal control problem and the associated Poisson Hamiltonian Pontryagin system, and we show that groupoid invariant Lagrangians lead to reduced optimality conditions of Euler Poincare type. Several mechanical examples, including systems with configuration dependent inertia and local symmetries, are presented to illustrate the theory.
Read the full abstract

Metric Geometry

On Ball's conjectured Santaló type inequality

We prove that if $K$ is a symmetric and isotropic convex body in $\mathbb{R}^n$, then $$\int_K\langle x,u\rangle^2\,dx\int_{K^\circ}\langle x,u\rangle^2\,dx\leq \left(\int_{B_2^n}\langle x,u\rangle^2\,dx\right)^2,\qquad\forall u\in\mathbb{R}^n,$$with equality for some $u\neq o$, if and only if $K$ is a Euclidean ball. This confirms a conjecture by Keith Ball (1986), stating that for any symmetric convex body $K$ in $\mathbb{R}^n$, it holds $$\int_K\int_{K^\circ}\langle x,y\rangle^2\,dx\,dy\leq \int_{B_2^n}\int_{B_2^n}\langle x,y\rangle^2\,dx\,dy,$$with equality if and only if $K$ is an ellipsoid. Fortunately, our method for proving Ball's conjectured inequality admits a quantitative stability refinement, which in turn yields an asymptotically optimal stability version of the Blaschke-Santaló inequality for origin symmetric convex bodies in terms of the symmetric difference metric. This resolves another well known open problem.
Read the full abstract

Classical Analysis and ODEs

On the Pólya Frequency Order of the de Bruijn–Newman Kernel: Certified Failure at Order Five

We prove that the classical de Bruijn–Newman kernel $K(u)=\Phi(|u|)$ is not a Pólya frequency function of order $5$ (PF$_5$). At $(u_0,h)=(0.01,0.05)$ we exhibit an explicit $5\times5$ Toeplitz minor whose determinant is rigorously enclosed in $[-1.8472496\times10^{-9},-1.8472225\times10^{-9}]$. The certificate uses 80-digit outward-rounded interval arithmetic and a proved truncation bound for the theta series. Eight further configurations are certified by both an explicit Leibniz expansion and an independent interval determinant computation. At the central configuration the determinants $D_2,D_3,D_4$ are positive, but this local sign pattern does not establish that the kernel is PF$_4$ globally. We also derive an exact finite formula for the first coefficient permitted by Vandermonde divisibility in the small-spacing expansion of $D_r(u_0,h)$. High-precision observations concerning the sign change of $C_5(u_0)$ and a Gaussian deformation are reported only as non-certified numerics. Version 2 withdraws the certified global sign and unique-threshold claims for $C_5$ made in version 1 because the derivative-tail enclosure was unsound; the direct PF$_5$ counterexample and its interval certificates are unaffected. The result concerns total positivity of this kernel and does not resolve the Riemann Hypothesis.
Read the full abstract

2602.20313 · 23 Feb · 12 pages, 4 tables. v2 withdraws the asymptotic-threshold theorem of v1 because its derivative-tail certificate was unsound; the central certified PF$_5$ counterexample is unchanged. Eight additional configurations are now certified independently by the Leibniz formula and by mpmath.iv. Ancillary verification scripts included

Optimization and Control

A unified solution framework for truck-and-drone routing problems

Coordinated truck-and-drone routing integrates the high capacity and range of ground vehicles with the flexible routing and speed of drones, enabling simultaneous service. Increasingly applied in last-mile delivery, this synchronization helps reduce completion time and operational costs. To improve its efficiency, various coordination modes between trucks and drones have been proposed. Each mode accommodates diverse operational constraints tailored to particular delivery requirements. In existing work, a slight change in the structural framework or operational characteristics could generate a totally different problem variant, which often requires the design of specialized algorithms. Consequently, under the requirement of maintaining structural validation and adapting to multiple operational features, this paper presents a unified three-phase solution framework based on the Lin-Kernighan-Helsgaun algorithm to solve a wide family of truck-and-drone routing problems. To validate its flexibility and effectiveness, we carry out numerical experiments on three problem variants: the Flying Sidekick Traveling Salesman Problem (FSTSP), the Traveling Salesman Problem with Multiple Drones (TSP-mD), and the Vehicle Routing Problem with Drones (VRP-D), benchmarking each against an effective algorithm. Computational results show that the framework can closely match optimal solutions on small-size instances and even improve the best-known solutions for several medium-size instances. Moreover, additional extensions are discussed to further highlight its versatility.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Shape-informed cardiac mechanics surrogates in data-scarce regimes via geometric encoding and generative augmentation

High-fidelity computational models of cardiac mechanics provide mechanistic insight into the heart function but are computationally prohibitive for routine clinical use. Surrogate models can accelerate simulations, but generalization across diverse anatomies is challenging, particularly in data-scarce settings. We propose a two-step framework that decouples geometric representation from learning the physics response, to enable shape-informed surrogate modeling under data-scarce conditions. First, a shape model learns a compact latent representation of left ventricular geometries. The learned latent space effectively encodes anatomies and enables synthetic geometries generation for data augmentation. Second, a neural field-based surrogate model, conditioned on this geometric encoding, is trained to predict ventricular displacement under external loading. The proposed architecture performs positional encoding by using universal ventricular coordinates, which improves generalization across diverse anatomies. Geometric variability is encoded using two alternative strategies, which are systematically compared: a PCA-based approach suitable for working with point cloud representations of geometries, and a DeepSDF-based implicit neural representation learned directly from point clouds. Overall, our results, obtained on idealized and patient-specific datasets, show that the proposed approaches allow for accurate predictions and generalization to unseen geometries, and robustness to noisy or sparsely sampled inputs.
Read the full abstract

All authors Davide Carrara, Marc Hirschvogel, Francesca Bonizzoni, Stefano Pagani, Simone Pezzuto, Francesco Regazzoni

Classical Analysis and ODEs

A coherent theory of tent spaces and homogeneous Triebel-Lizorkin spaces

We introduce and systematically investigate a scale of tent spaces that characterizes homogeneous Triebel-Lizorkin spaces $\mathrm{\dot F}^{\beta}_{p,q}$. These spaces generalize the classical spaces of Coifman, Meyer, and Stein, and are shown to be equivalent to the weighted tent spaces with Whitney averages developed by Huang. We show that these tent spaces follow a functional analytic theory that mirrors that of Triebel-Lizorkin spaces, including duality, embeddings, discrete characterizations, John-Nirenberg-type properties, as well as real and complex interpolation. Furthermore, we provide a novel characterization of the endpoint spaces $\mathrm{\dot F}^\beta_{\infty,q}$, completing earlier work by Auscher, Bechtel, and the author.
Read the full abstract

Differential Geometry

On Weighted Twisted K-Energy and Its Applications

We establish the convexity of the weighted twisted Mabuchi K-energy functional along geodesics in the finite energy space $\mathcal{E}^{1,T}(X,\omega)$, covering the case of divisors with mixed cusp and conic singularities. We then prove that coercivity (relative to the complex torus) of this functional is an open condition under cone angle perturbations. This is obtained from a general result of independent interest, which shows the stability of the coercivity under perturbations by certain twist currents. In particular, this yields the openness for the existence for cscK cone metrics and proves that coercivity at the cusp limit implies existence of cscK cone metrics for small cone angles.
Read the full abstract

Metric Geometry

A note on the affine plank conjecture

In 1951, Bang posed the affine plank conjecture, which remains open: If a convex body in $\mathbb{R}^d$ is covered by planks, then the total relative width of the planks is at least one. We prove a lower bound of $2/(1+\sqrt{d})$ for this total relative width. The best previously known lower bound was $2/(1+d)$.
Read the full abstract

Logic

Regular non-normal modal classicalities

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically reinterpreting $\circ$ as an operator that distinguishes top and bottom values from other values in the algebra, we extend its applicability beyond paraconsistency into classical and modal logics. We introduce the logic $\mathcal{B}_4^\circ$, a four-valued Boolean logic augmented with the consistency operator, and provide a sound and complete axiomatization. Building on this foundation, we extend the semantics to the modal domain using the many-logics modal logic (MLML) framework. Specifically, we construct Kripke frames based on an eight-valued Boolean algebra that contains three distinct four-valued subalgebras, each representing a different world type. Our analysis reveals that the resulting modal logic exhibits a normal local consequence relation alongside a non-normal global consequence relation. Consequently, the characterization of frame properties –such as transitivity, reflexivity, and Euclideanness –deviates from modal logic $K$, requiring novel semantic tools. We further identify new modal formulas in an extended language that capture previously unavailable kinds of accessibility, leading to frame characterizations unattainable in traditional modal frameworks.
Read the full abstract

Algebraic Geometry

A guide to wall crossing for moduli of varieties

There have been major developments in the theory of moduli of varieties in the past decade, essentially settling the construction of moduli spaces of log canonically polarized slc pairs and moduli spaces of K-polystable log Fano pairs. Given the construction of these moduli spaces of pairs $(X, D)$, it is natural to ask how the moduli spaces vary as the coefficients of $D$ are perturbed. This phenomenon is known as wall crossing, the theory of which has been developed in several important cases in the past five years. This semi-expository article is an introduction to moduli of varieties and wall crossing, capturing a portion of the theory developed in the past several years. It also introduces tools and techniques used in explicit computations and examples, applying them in new examples.
Read the full abstract

Numerical Analysis

Two approaches to low-parametric SimRank computation

In this work, we discuss low-parametric approaches for approximating SimRank matrices, which estimate the similarity between pairs of nodes in a graph. Although SimRank matrices and their computation require a significant amount of memory, common approaches mostly address the problem of algorithmic complexity. We propose two major formats for the economical embedding of target data. The first approach adopts a non-symmetric form that can be computed using a specialized alternating optimization algorithm. The second is based on a symmetric representation and Newton-type iterations. We propose numerical implementations for both methodologies that avoid working with dense matrices and maintain low memory consumption. Furthermore, we study both types of embeddings numerically using real data from publicly available datasets. The results show that our algorithms yield a good approximation of the SimRank matrices, both in terms of the error norm (particularly the Chebyshev norm) and in preserving the average number of the most similar elements for each given node.
Read the full abstract

All authors Egor P. Berezin, Robert T. Zaks, German Z. Alekhin, Stanislav V. Morozov, Sergey A. Matveev

Algebraic Geometry

On moduli of Fano varieties: an introduction to K-stability and K-moduli

This survey article is an accompaniment to the 2025 Summer Research Institute in Algebraic Geometry Bootcamp on K-stability and K-moduli. It is aimed at graduate students and intended to provide the necessary background to begin research on explicit K-moduli problems.

Algebraic Geometry · Cross-listed from hep-th

Universal Functions for Topological Correlators

We consider correlation functions of topologically twisted, $\mathcal{N}=2$ supersymmetric Yang-Mills theory with gauge group ${\rm SU}(2)$ and $N_f\leq 3$ massive hypermultiplets in the fundamental representation. For a smooth, compact, oriented four-manifold $X$ with $b_2^+>1$, the correlation functions are expressed in terms of a finite set of universal functions. The mass dependence of these functions encodes intersection numbers of the moduli space of instantons. We determine closed expressions for the universal functions by combining techniques of the Seiberg-Witten geometry, $u$-plane integral and the blowup formula. If $X$ is specialised to a complex algebraic surface $S$, the correlation functions can be identified with generating functions of Segre invariants for moduli spaces of sheaves on $S$. We verify that our results agree with the results by Göttsche and Kool for these generating functions.
Read the full abstract

Information Theory

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes

Locally Decodable Codes (LDCs) are error-correcting codes $C\colon\Sigma^n\rightarrow \Sigma^m,$ encoding messages in $\Sigma^n$ to codewords in $\Sigma^m$, with super-fast decoding algorithms. They are important mathematical objects in many areas of theoretical computer science, yet the best constructions so far have codeword length $m$ that is super-polynomial in $n$, for codes with constant query complexity and constant alphabet size, while tolerating a constant-fraction of errors. In a very surprising result, Ben-Sasson, Goldreich, Harsha, Sudan, and Vadhan (SICOMP 2006) show how to construct a relaxed version of LDCs (RLDCs) with constant query complexity and slightly super-linear codeword length over the binary alphabet, and used them to obtain significantly-improved constructions of Probabilistically Checkable Proofs. In this work, we prove an exponential lower bound on the length of Hamming RLDCs making $2$ queries (even adaptively) over the binary alphabet. This answers a question explicitly raised by Gur and Lachish (SICOMP 2021) and is the first exponential lower bound for RLDCs. Combined with the results of Ben-Sasson et al., our result exhibits a "phase-transition"-type behavior on the codeword length for some constant-query complexity. We achieve these lower bounds via a transformation of RLDCs to LDCs, using a careful analysis of restrictions of message bits that fix codeword bits.
Read the full abstract

All authors Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu