Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 27 February

Optimization and Control

Copositive and completely positive cones over symmetric cones of rank at least 5

We study copositive and completely positive cones over symmetric cones of rank at least $5$, with particular emphasis on whether these cones are spectrahedral shadows and on the behavior of a sum-of-squares inner-approximation hierarchy. We examine to what extent known results for nonnegative orthants of dimension at least $5$ carry over to general symmetric cones of rank at least $5$. We first prove that neither the copositive nor the completely positive cone over such a symmetric cone is a spectrahedral shadow. We then generalize the Horn matrix to this setting by introducing Horn transformations and analyzing their geometric and algebraic properties. We show that Horn transformations generate exposed rays of copositive cones over symmetric cones and that they evade the zeroth level of the sum-of-squares inner-approximation hierarchy. Finally, we examine the asymptotic exactness of this hierarchy over positive semidefinite cones. In contrast to the $5$-dimensional nonnegative orthant, where the hierarchy is known to recover the entire copositive cone in the limit, we construct instances over positive semidefinite cones of order at least $5$ certifying that the union of all levels remains strictly included in the copositive cone.
Read the full abstract

Analysis of PDEs

On $L^{\infty }$-estimates and the structure of the global attractor for weak solutions of reaction-diffusion equations

In this paper, we study the structure of the global attractor for weak and regular solutions of a problem governed by a scalar semilinear reaction-diffusion equation with a non-regular nonlinearity, such that uniquness of solutions can fail to happen. First, using the Moser–Alikakos iterations we obtain the estimates of the weak solutions in the space $L^{\infty }(\Omega)$. After that, using these estimates we improve the existing results on the structure of the attractor. Finally, estimates of the Hausdorff and fractal dimension of the attractor are obtained.
Read the full abstract

Combinatorics

Eccentricity energy change of coalescence of graphs due to edge deletion

The eccentricity matrix of a graph is obtained from the distance matrix by keeping the largest entries in their row or column, and the remaining entries are replaced by zeros. The eccentricity energy of a graph is the sum of the absolute values of the eigenvalues of its eccentricity matrix. In this paper, we investigate the effect of edge deletion on the eccentricity energy of graphs of the form $$G=K_{2n}\circ_{n} K_{2n}\circ_{n}\cdots \circ_{n} K_{2n}, (\text{\textit{l} copies of } K_{2n}),$$ where $n\geq 3,$ $l\geq 2,$ and $\circ_{n}$ denotes the $n-$coalescence of graphs, and prove that the eccentricity energy increases whenever an edge is removed. This result identifies a class of graphs whose eccentricity energy exhibits monotonic growth under edge deletion.
Read the full abstract

Combinatorics

Combinatorial sufficient conditions for graph rigidity and applications to random graphs

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well. In this paper, we present several new results on the rigidity of random graphs. In particular, we show that there exists $c>0$ such that, for $p\ge 2 \log{n}/n$, the binomial random graph $G(n,p)$ is with high probability (whp) $\lfloor c n p\rfloor$-rigid. This is sharp up to the constant $c$, and complements recent results of Peled and Peleg (in the regime $p= o(n^{-1/2})$), and of Jordán, Liu, and Villányi (in the constant $p$ regime). Moreover, we show that for every fixed $d\ge 2$ and $r\ge 501d$, a random $r$-regular graph is whp $d$-rigid, and that for $100/n\le p\le 2\log{n}/n$, the binomial random graph $G(n,p)$ contains whp an $\lfloor np/251\rfloor$-rigid subgraph with at least $(1-e^{-np/2})n$ vertices. Both results are sharp up to the multiplicative constant. In addition, we present a new sufficient condition for rigidity in terms of the minimum codegree of the graph (the minimum number of common neighbours of a pair of vertices in the graph). A main tool in our arguments is a new combinatorial sufficient condition for rigidity, which provides a common generalization to Whiteley's vertex-splitting lemmas, and to the "rigid partitions" method, developed in works by Crapo, Lindemann, Lew, Nevo, Peled and Raz, and by the present authors.
Read the full abstract

Number Theory

4-rank distribution of Picard groups of hyperelliptic curves via $C$-symmetric matrices

We determine the large-genus limiting distribution of the 4-rank of the Picard group of hyperelliptic curves over a fixed finite field $\mathbb F_q$ of odd characteristic. This is a function field analogue of a result of Fouvry and Klüners. Our computation agrees with (the Picard group analogue of) the Cohen–Lenstra–Gerth heuristics in the case $q \equiv 3\pmod{4}$, i.e., in the absence of roots of unity in the base field. When roots of unity are present, the result is of the same form as conjectured distribution for class groups of quadratic extensions of number fields containing roots of unity. The limiting distribution does not change when imposing finitely many conditions on the ramification behavior of the curves. In the process, we determine the rank distribution of a certain class of random matrix ensembles over finite fields determined by symmetry conditions.
Read the full abstract

Differential Geometry

Singularity removal rigidity theorems for minimal hypersurfaces in manifolds with nonnegative scalar curvature

We prove two "Singularity removal rigidity theorems" for minimal hypersurfaces with isolated singularities in manifolds of nonnegative scalar curvature (Theorems \ref{thm: rigidity for minimal surface} and \ref{thm: georch free of singularity}). In particular, we observe a new phenomenon that the extremal scalar curvature condition forces smoothness, which reveals a kind of positive effect of minimal hypersurface singularities in scalar curvature geometry. As an application, we obtain a direct proof of the positive mass theorem (PMT) for asymptotically flat $8$-manifolds with arbitrary ends (Theorem \ref{thm: pmt8dim}), without using N. Smale's generic regularity theorem. A key ingredient is a new spectral version of PMT for AF manifolds with arbitrary ends, whose proof relies on PMT for asymptotically locally flat (ALF) manifolds with $\mathbf{S}^1$-symmetry.
Read the full abstract

Optimization and Control

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions

In this paper, we introduce and explore the concepts of strongly LU-E-preinvex (SLUEP), pseudo strongly LU-E-preinvex (PSLUEP) and strongly LU-E-invex (SLUEI) functions. To illustrate and validate these definitions, we provide several non-trivial examples. Additionally, we extend the idea of strongly-G invex sets to the context of interval-valued functions. The epigraph of a SLUEP function is derived, and a relationship between SLUEP and PSLUEP functions have been explored. A key contribution of this work is the identification of a significant connection between weakly-strongly E-invex functions and SLUEP functions. As an application, we consider a nonlinear programming problem involving SLUEP functions. Under certain conditions, we prove that a local minimum of the problem is also a global minimum. Moreover, the sufficiency of Karush-Kuhn-Tucker (KKT) optimality conditions by considering the objective and constraint functions are SLUEI and SEI respectively. The theoretical results are validated through illustrative examples and counterexamples.
Read the full abstract

Numerical Analysis

A Boundary Integral-based Neural Operator for Mesh Deformation

This paper presents an efficient mesh deformation method based on boundary integration and neural operators, formulating the problem as a linear elasticity boundary value problem (BVP). To overcome the high computational cost of traditional finite element methods and the limitations of existing neural operators in handling Dirichlet boundary conditions for vector fields, we introduce a direct boundary integral representation using a Dirichlet-type Green's tensor. This formulation expresses the internal displacement field solely as a function of boundary displacements, eliminating the need to solve for unknown tractions. Building on this, we design a Boundary-Integral-based Neural Operator (BINO) that learns the geometry- and material-aware Green's traction kernel. A key technical advantage of our framework is the mathematical decoupling of the physical integration process from the geometric representation via geometric descriptors. While this study primarily demonstrates robust generalization across diverse boundary conditions, the architecture inherently possesses potential for cross-geometry adaptation. Numerical experiments, including large deformations of flexible beams and rigid-body motions of NACA airfoils, confirm the model's high accuracy and strict adherence to the principles of linearity and superposition. The results demonstrate that the proposed framework ensures mesh quality and computational efficiency, providing a reliable new paradigm for parametric mesh generation and shape optimization in engineering.
Read the full abstract

Optimization and Control

Quantitatively hyper-positive real rational functions III

Hyper-Positive Real, matrix-valued, rational functions are associated with absolute stability (the Lurie problem). Here, quantitative subsets of Hyper-positive functions, related through nested inclusions, are introduced. Structurally, this family of functions turns out to be matrix-convex and closed under inversion. A state-space characterization of these functions through a corresponding Kalman-Yakubovich-Popov Lemma, is given. Technically, the classical Linear Matrix Inclusions, associated with passive systems, are here substituted by Quadratic Matrix Inclusions.
Read the full abstract

Combinatorics

On the construction of large local arcs

Motivated by the construction of optimal locally repairable codes, we introduce the new finite geometric concept of a local arc which is defined as a collection $\mathcal{S}$ of disjoint point sets $S_{i}$ in $\mathrm{PG}(2,q)$ such that $S_{i} \cup S_{j}$ is an arc for any $S_{i}, S_{j} \in \mathcal{S}$. We focus on the upper and lower bounds on the sizes of maximum $k$-uniform local arcs. For $q=p^m$ with $p$ prime, we construct $k$-uniform local arcs in $\mathrm{PG}(2,q)$ of size $\Omega(q^{d})$ where $d$ is between $1.1167$ and $1.25$ depending only on $m$. For $k=4$, this implies the existence of optimal locally repairable codes (LRCs) with minimum distance 6, locality 3, and disjoint repair groups, whose length is superlinear in $q$–a significant improvement over the previously known $O(q)$ constructions for such LRCs.
Read the full abstract

Optimization and Control

Vehicle Routing Problem with Resource-Constrained Pickup and Delivery

We introduce the Vehicle Routing Problem with Resource-Constrained Pickup and Delivery (VRP-RPD), where vehicles transport finite identical resources to customer locations for autonomous processing before retrieval and redeployment. Unlike classical pickup-and-delivery problems where the same vehicle must perform both operations for each customer, VRP-RPD permits different vehicles to handle dropoff and pickup at the same location, creating inter-route dependencies absent from standard formulations. This decoupling reflects practical scenarios in autonomous robotics deployment, portable medical equipment distribution, disaster relief operations, construction tool rental, and agricultural sensor networks, where transport vehicles are the scarce resource and need not wait during processing. The objective is to minimize makespan, defined as the time when the last vehicle returns after all resources are deployed, processed, and retrieved. Although makespan objectives are typical in scheduling problems, the significant transportation times relative to processing durations and the resource capacity constraints fundamentally alter optimization considerations. We demonstrate that exact methods are computationally intractable for instances beyond 16 customers. We develop a sequential two-stage metaheuristic pipeline: a GPU-accelerated Adaptive Large Neighborhood Search (ALNS) is run first to obtain a high-quality incumbent, which is then encoded as a warm-start seed for a Biased Random-Key Genetic Algorithm (BRKGA) that refines the solution through evolutionary search. Evaluated on TSPlib-derived benchmarks (17-1000 nodes) across multiple processing time variants (base, 2x, 5x, 1R10, 1R20), the pipeline consistently achieves the best solutions across all instance sizes, reducing makespan by up to 74% over baseline heuristics.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

General Bayesian Policy Learning

This study proposes a General Bayes framework for policy learning. We consider decision problems in which a decision-maker chooses an action from a given set to maximize expected welfare. Typical examples include treatment choice and portfolio optimization. In such problems, the statistical target is a decision rule, and predicting each potential outcome is not necessarily of primary interest. We formulate this policy-learning problem through loss-based Bayesian updating. Our main technical device is a squared-loss surrogate for welfare maximization. We show that maximizing empirical welfare over a policy class with a quadratic penalty controlled by a tuning parameter $\zeta>0$ is equivalent to minimizing a scaled squared error in the outcome difference. The resulting General Bayes posterior over decision rules admits two equivalent characterizations: a Gaussian pseudo-likelihood representation and a decision-theoretic loss-based characterization. As one implementation, we introduce GBPLNet, a neural network implementation with a tanh-squashed output. Finally, we establish PAC-Bayes-type guarantees for the surrogate risk and the corresponding penalized welfare.
Read the full abstract

Information Theory

The Distance Spectrum of IEEE 802.11 Binary Convolutional Codes

Binary convolutional coding (BCC) has been a cornerstone of the IEEE 802.11 wireless LAN standard since its inception, and it remains relevant today across the full generational arc from the legacy 802.11a/g through Wi-Fi 6 (802.11ax) and into the forthcoming Wi-Fi 8 (802.11bn). Although low-density parity-check (LDPC) codes now dominate high-throughput applications, BCC is mandatory for backward compatibility and continues to serve as the default forward-error-correction scheme in bandwidth-constrained and cost-sensitive deployments: 20 MHz-only devices, Internet-of-Things nodes, and other implementations where LDPC's decoder complexity is prohibitive. Critically, BCC at rate 1/2 is the coding scheme used throughout the packet preamble in every IEEE 802.11-compliant frame, making it indispensable regardless of which data-field code is selected. Furthermore, the new Enhanced Long Range (ELR) packet format introduced in the 802.11bn/UHR amendment mandates rate-1/2 BCC for the data portion of the frame, reinforcing the continued importance of this code in next-generation deployments. The performance of BCC under Viterbi decoding is governed by the distance spectrum of the convolutional code. This note explains how to compute that spectrum exactly for the IEEE 802.11 mother code (rate 1/2, K=7, generators octal 133 / octal 171) and its three standard punctured derivatives (rates 2/3, 3/4, 5/6) obtained via rate-compatible puncturing. Union-bound BEP and FER curves are derived for AWGN with BPSK/QPSK and Gray-coded M-QAM modulation and validated against Monte Carlo simulation. Python, Julia, and C++ implementations are openly available at https://github.com/geekymode/bcc_spectrum.
Read the full abstract

Algebraic Topology

On invariants of representations of Weyl groups associated with the cohomology of toric varieties

For a Weyl group $W$ and a $W$-permutohedron $P$, there are associated toric varieties $X_P$ and $X_{P/W_K}$ for any parabolic subgroup $W_K$ of $W$, since the quotient $P/W_K$ can be identified with a polytope inside $P$. We construct an explicit algebra isomorphism between $H^*(X_{P/W_K};\mathbb{Q})$ and $H^*(X_P;\mathbb{Q})^{W_K}$. We further generalize this isomorphism to intermediate lattices, to finite Coxeter groups, and to non-degenerate $W$-symmetric polytopes. Our results give affirmative answers to two open questions of Horiguchi–Masuda–Shareshain–Song.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Multivariate Spatio-Temporal Neural Hawkes Processes

We propose a Multivariate Spatio-Temporal Neural Hawkes Process for modeling complex multivariate event data with spatio-temporal dynamics. The proposed model extends continuous-time neural Hawkes processes by integrating spatial information into latent state evolution through learned temporal and spatial decay dynamics, enabling flexible modeling of excitation and inhibition without predefined triggering kernels. By analyzing fitted intensity functions of deep learning-based temporal Hawkes process models, we identify a modeling gap in how fitted intensity behavior is captured beyond likelihood-based performance, which motivates the proposed spatio-temporal approach. Simulation studies show that the proposed method successfully recovers sensible temporal and spatial intensity structure in multivariate spatio-temporal point patterns, while existing temporal neural Hawkes process approach fails to do so. An application to terrorism data from Pakistan further demonstrates the proposed model's ability to capture complex spatio-temporal interaction across multiple event types.
Read the full abstract

Complex Variables

A problem of Heittokangas-Ishizaki-Tohge-Wen concerning a certain differential-difference equation

All the finite order entire solutions of \begin{equation*} f^n(z)+q(z)e^{Q(z)}f^{(k)}(z+c)=P(z) \end{equation*} are given, where $ q(z) $, $ Q(z), P(z) $ are polynomials, $ k $ and $ n \geq 2 $ are integers, and $ c \in \mathbb{C} \setminus \{0\} $.This solves an open problem of Heittokangas-Ishizaki-Tohge-Wen [Bull. Lond. Math. Soc. 55, 1-77 (2023)].
Read the full abstract

Optimization and Control

On the efficient computation of proximal operators of affine-constrained nonconvex functions

Proximal operators with affine constraints arise in numerous models in nonconvex projection, composite optimization, and structured regularization. However, their efficient computation remains challenging due to the simultaneous presence of affine constraints and nonsmooth, possibly nonconvex objectives. In this work, we develop a unified dual-representability framework for analyzing and computing affine-constrained proximal mappings. Specifically, we introduce a multiplier inclusion formulation that connects the primal affine-constrained proximal problem to an unconstrained convex dual problem. Based on this formulation, we prove that, whenever the associated dual inclusion problem admits a solution, strong duality holds. For convex functions and a broad class of prox-regular nonconvex functions, we establish that dual representability holds under a simple subdifferential sum rule, and further develop a hierarchy of verifiable regularity conditions that guarantee this sum rule. In addition, we analyze the smoothness and strong convexity properties of the dual objective, providing a rigorous foundation that guarantees fast local convergence rates for efficient first- and second-order methods. Numerical experiments demonstrate that the proposed dual reformulation enables the reliable computation of globally optimal solutions for a range of large-scale nonconvex proximal and projection problems using existing convex optimization solvers.
Read the full abstract

All authors Di Hou, Tianyun Tang, Kim-Chuan Toh, Shiwei Wang

Number Theory

Counting number fields using multiple Dirichlet series

We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new (concentrated and semiconcentrated) groups that were not approachable by previous methods. Conditional on subconvexity bounds bounds for certain Dirichlet series (e.g. the generalized Lindelöf hypothesis), we use these techniques to prove the existence of an asymptotic growth rate for $G$-extensions for infinitely many new groups $G$ for which the minimum index elements of $G$ are contained in a union of proper abelian normal subgroups. In particular, our conditional results include all groups with nilpotency class $2$. Additionally, when $G$ is nilpotent our results give a power saving error term.
Read the full abstract

Numerical Analysis

Nodal Coarsening and Approximate Ideal Interpolation for H(curl) in Algebraic Multigrid

We propose an approximate interpolation construction and a practical coarsening algorithm for algebraic multigrid (AMG) method when applied to H(curl) problems. Building on the generalized AMG framework, we introduce an interior/exterior splitting that yields both a refinement-based and a fully algebraic construction of the interpolation. The refinement-based approach follows a geometric hierarchy, while the purely algebraic interpolation is constructed through a coarsening process that first coarsens a nodal dual problem and then builds coarse and fine variables using a matching algorithm. Under a uniform fine-space smoothing assumption, we prove a jump-independent two-grid convergence bound for canonical finite-element spaces. We also establish an exact commuting relation for the unshifted construction. Two-dimensional numerical experiments demonstrate sparse multilevel hierarchies and robust convergence under strong coefficient jumps in the curl–curl term. Three-dimensional experiments provide a two-level proof of concept, although the interpolation operators remain dense. Developing a practical sparse three-dimensional multilevel method is left to future work.
Read the full abstract

All authors Taoli Shen, James Brannick, Robert Falgout, Karsten Kahl, Jacob Schroder

Number Theory

Arithmetic properties of arguments of algebraic numbers on the unit circle

An irrational number $\theta$ is called Diophantine if there exist $c>0$ and $\tau < \infty$ such that $\left| \theta - \frac{p}{q} \right| \ge \frac{c}{q^\tau}$ holds for every $(p,q) \in \mathbb{Z} \times \mathbb{N}$. In this paper, we study Diophantine and transcendence properties of some real numbers. Using lower bounds for linear forms in logarithms, we show that if $\beta \in \mathbb{C}$ is an algebraic number with $|\beta|=1$ that is not a root of unity, then $\frac{\operatorname{Arg}(\beta)}{2\pi}$ is Diophantine. We also prove that if $\beta = e^{i\alpha}$ is algebraic, then $\frac{\alpha}{\pi}$ is either rational or transcendental. As a consequence, we obtain that if $n \ge 2$ is an integer and $\alpha \in \left(0,\frac{\pi}{2}\right)$ satisfies $n \tan \alpha = \tan(n \alpha)$, then $\frac{\alpha}{2\pi}$ is both Diophantine and transcendental, and $\alpha$ is transcendental. This extends a result of [V. Cyr, A number theoretic question arising in the geometry of plane curves and in billiard dynamics, Proc. Amer. Math. Soc. 140 (2012), no. 9, 3035–3040], which establishes that $\frac{\alpha}{2\pi}$ is irrational.
Read the full abstract

Optimization and Control

Disturbance-Adaptive Finite-Time Control of Three-Phase Rectifiers

Three-phase AC-DC rectifiers are fundamental components in modern power electronics systems, yet achieving rapid voltage regulation and precise current tracking under load and grid disturbances remains challenging due to nonlinear dynamics and measurement uncertainties. This paper presents a finite-time control method for three-phase AC-DC rectifiers that achieves millisecond-scale regulation of DC-link voltage and grid currents under varying conditions. The proposed design employs a transformed augmented error-state dynamics model, extending the voltage dynamics to a two-state system to construct an adaptive sliding surface that guarantees fast finite-time convergence. A nonlinear sliding-mode voltage regulator with an online disturbance estimator ensures rapid and robust voltage tracking, while a fast current controller achieves finite-time dq-axis current tracking with minimal chattering. Theoretical results establish finite-time stability and provide explicit gain selection conditions. Simulation results demonstrate up to 99.40 per cent and 87.5 per cent reductions in voltage and current convergence times, respectively, compared to conventional robust controllers. Laboratory experiments further validate the approach, showing 33.33 per cent lower voltage ripple, 33.33 per cent faster rise time, and 32.43 per cent reduced steady-state error relative to a recent method. These results confirm improvements in transient performance, convergence, and overall system stability, highlighting the method's practical applicability for high-performance rectifier control.
Read the full abstract

All authors Koto Omiloli, Satish Vedula, Ayobami Olajube, Olugbenga Moses Anubi

Analysis of PDEs

A completion of our earlier work on the Cauchy problem for non-effectively hyperbolic operators

For hyperbolic differential operators $P$ with non-effectively hyperbolic double characteristics, we study the relationship between the Gevrey well-posedness threshold for strong well-posedness and the associated Hamilton map and flow. In our previous work, we showed that if the Hamilton map has a Jordan block of size $4$ on the double characteristic manifold $\Sigma$ of codimension $3$, then the Cauchy problem for $P$ is well-posed in the Gevrey class $1<s<3$ for all lower-order terms, and that this result is optimal. Moreover, if there are no bicharacterisitcs tangent to $\Sigma$, then the Cauchy problem is well-posed in the Gevrey class $1<s<3$ for all lower-order terms, and this result is also optimal. In the present paper, we remove the restriction on the codimension of $\Sigma$, thereby completing the result.
Read the full abstract

Algebraic Geometry

Cluster type varieties

Cluster type varieties are compactifications of algebraic tori on which the volume form has no zeros. These form a natural class of varieties that generalizes both toric varieties and cluster varieties. The aim of this article is to introduce the reader to the concept of cluster type varieties and explain some recent results towards the understanding of these varieties. At the same time, we will pose some problems for further research.
Read the full abstract

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

Random batch sum-of-Gaussians method for molecular dynamics simulation of particle systems in the NPT ensemble

In this work, we develop a random batch sum-of-Gaussians (RBSOG) method for molecular dynamics simulations of charged systems in the isothermal-isobaric (NPT) ensemble. We introduce an SOG splitting of the pressure-related $1/r^3$ kernel, yielding a smooth short-/long-range decomposition for instantaneous pressure evaluation. The long-range part is treated in Fourier space by random-batch importance sampling. Because the radial and non-radial pressure components favor different proposals, direct sampling either increases structure-factor evaluations and communication or leads to substantial variance inflation. To address this tradeoff, we introduce a measure-recalibration strategy that reuses Fourier modes drawn from the radial proposal and corrects them for the non-radial target, producing an unbiased pressure estimator with significantly reduced variance and negligible extra cost. The resulting method mitigates pressure artifacts caused by cutoff discontinuities in traditional Ewald-based treatments while preserving near-optimal $O(N)$ complexity. We provide theoretical evidence on pressure decomposition error, consistency of stochastic approximation, and convergence of RBSOG-based MD. Numerical experiments on bulk water, LiTFSI ionic liquids, and DPPC membranes show that RBSOG accurately reproduces key structural and dynamical observables with small batch sizes ($P\sim 100$). In large-scale benchmarks up to $10^7$ atoms on $2048$ CPU cores, RBSOG achieves about an order-of-magnitude speedup over particle-particle particle-mesh in electrostatic calculations for NPT simulations, together with a consistent $4\times$ variance reduction relative to random batch Ewald and excellent weak/strong scalability. Overall, RBSOG provides a practical and scalable route to reduce time-to-solution and communication cost in large-scale NPT simulations.
Read the full abstract

Logic

Characterising SJT reducibility

SJT reducibility between sets $A,B \subseteq \mathbb N$ is defined by $A \le_{SJT} B$ if for each computable function $h$ that is unbounded and nondecreasing, there is an $h$-bounded uniformly $B$-c.e.\ trace $(T_n)_{n \in \mathbb N} $ such that for each $n$, the value $J^A(n)$ of the jump is in $T_n$, if defined. This reducibility is slightly weaker than Turing reducibility. We study SJT reducibility, and as a main result give several characterisations of it on the $K$-trivial sets. This is the first case of extending the three lowness paradigms, weak as an oracle, computed by many, and inert, to the setting of weak reducibilities.
Read the full abstract

Logic

Sequent calculi for first-order ST

Strict-Tolerant Logic (ST) underpins naive theories of truth and vagueness (respectively including a fully disquotational truth predicate and an unrestricted tolerance principle) without jettisoning any classically valid laws. The classical sequent calculus without Cut is sometimes advocated as an appropriate proof-theoretic presentation of ST. Unfortunately, there is only a partial correspondence between its derivability relation and the relation of local metainferential ST-validity - these relations coincide only upon the addition of elimination rules and only within the propositional fragment of the calculus, due to the non-invertibility of the quantifier rules. In this paper, we present two calculi for first-order ST with an eye to recapturing this correspondence in full. The first calculus is close in spirit to the Epsilon calculus. The other calculus includes rules for the discharge of sequent-assumptions; moreover, it is normalisable and admits interpolation.
Read the full abstract

Thursday 26 February

Optimization and Control

On the Entropy in Last-Mile Logistics

Last-mile logistics (LML) is characterized by high fragmentation, yet existing research treats this as an exogenous constraint rather than a quantifiable and optimizable system property. This paper introduces a framework for measuring LML complexity using structural entropy, derived from Boltzmann's statistical mechanics. Unlike traditional KPIs such as distance or cost, structural entropy quantifies the cardinality of the configuration space, providing a diagnostic of inherent system disorder. We establish a formal duality with Shannon entropy, linking absolute complexity burden to distributional balance. We apply our entropy framework to 6,112 Amazon last-mile routes across five U.S. cities. Current operations exhibit persistently high normalized entropy, indicating near-maximal fragmentation. A stable non-linear scaling relationship between entropy and route distance validates the metric as a predictive indicator of operational difficulty. To evaluate spatial consolidation, we develop a system-wide entropy measure accounting for all movements by both carriers and customers. We establish a theoretical conservation principle: under idealized conditions, spatial consolidation merely redistributes entropy from carrier to customer. Both idealizing conditions are violated in practice, thereby increasing total system entropy. Our system-wide measure reveals that spatial consolidation reduces carrier entropy by up to 40% under aggressive adoption but increases total system entropy by activating customer collection trips, though trip chaining can diminish this effect. Temporal consolidation, by contrast, genuinely reduces entropy by decreasing delivery events without creating new movements. By formalizing fragmentation as a measurable structural property, this research provides a new lens for network design, consolidation policy, and evaluation last-mile system performance.
Read the full abstract

Rings and Algebras

Generalized Eigenvectors and Rayleigh bounds for tropical algebraic eigenvalues

In this paper, we review the eigenpair problem in the context of tropical algebra. An important fact that has been largely overlooked in spectral theory of tropical algebra is that the tropical algebraic eigenvalues, which are obtained from the characteristic polynomial, may not correspond to any tropical eigenvector satisfying the standard eigenvalue-eigenvector equation. To resolve this, we use the tropical numerical range and define a generalized tropical eigenvalue-eigenvector relation. We define any non-zero vector satisfying this equation as a generalized tropical eigenvector. We show that a generalized tropical eigenvector always exists for any given tropical algebraic eigenvalue. We propose a computationally inexpensive method for the construction of these vectors. Additionally, we prove an upper bound for the algebraic eigenvalues of a tropical matrix, using the tropical Rayleigh quotients.
Read the full abstract

Probability · Cross-listed from quant-ph

Eve's forgery probability from her false acceptance probability: interactive authentication, Holevo information and the min-entropy

We obtain estimates for Eve's forgery probability, namely the probability that she is able to forge a message which Alice or Bob mistakenly accept over a noisy Quantum channel for generating a shared Quantum secret key. This probability is related to Eve's success probability obtained in a previous work due to Renner and Wolf, which was obtained from assumptions on the min-entropy for characterizing asymmetric security. To demonstrate that protocols over noisy Quantum channels are dependent upon a single, unified security threshold in comparison to multiple security parameters in the Renner-Wolf interactive authentication protocol framework we upper bound Eve's forgery probability with a Holevo-type quantity that can be made negligibly small. By leveraging estimates for Eve's false acceptance probability that have previously been obtained by the author, we obtain the desired security threshold by bounding the false acceptance probability with a suitably chosen two-universal function which serves as a counterpart to two-universal hashing functions that have previously been examined for cryptographic protocols in Quantum key distribution. As a result the protocol is not only $\epsilon$-secure, for some $\epsilon>0$, but also composable against forgery and key leakage.
Read the full abstract

2603.06645 · 26 Feb · Template (29 pages). Discussion of this work is at: https://www.youtube.com/watch?v=jgPXdD0iEms. Related topics of discussion: https://www.youtube.com/playlist?list=PL3rTBtU0TK_DYTpmZAHcAMFMBj9ov1oPf, https://www.youtube.com/playlist?list=PL3rTBtU0TK_Cy35rrbIBmeNiBsWkhfvCe, https://www.youtube.com/playlist?list=PL3rTBtU0TK_C05u3pbB8fOLI2XFwWPorX