Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 6 May

Number Theory

A Structure Sheaf for Kirch Topology

Kirch topology on $\mathbb N$ goes back to 1969, and is remarkable for being Hausdorff, connected, and locally connected. In this sense, it is analogous to the usual topology on $\mathbb C,$ yet, to the author's knowledge, there have been no Kirch topology analogs of the sheaf of complex-analytic functions until very recently. In our latest paper we constructed such natural sheaf of rings, the sheaf of locally LIP functions. In this paper we investigate some of its basic properties, primarily regarding zeroth and first cohomology and Cech cohomology with respect to covers by basic open sets.
Read the full abstract

Information Theory

When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization

Semantic communication (SemCom) with learned encoder-decoder architectures enables end-to-end learning of compact task-oriented representations optimized for the wireless channel, reducing channel resources needed to convey task-relevant information and improving spectrum efficiency. This paper studies semantic image transmission over block Rayleigh fading with AWGN using a multi-task semantic autoencoder that jointly reconstructs images and predicts labels from the received waveform. The latent dimension (complex channel uses per source sample) serves as a cross-layer control variable governing semantic fidelity and channel resource usage. We characterize the resulting latency-task fidelity tradeoff: larger latent representations improve inference accuracy but increase service time, channel uses, and queueing delay. Building on this insight, we develop online semantic-rate controllers that adapt the latent dimension per update under a long-term semantic error constraint. A queue-aware drift-plus-penalty policy minimizes delay subject to an average semantic error cap, while a complementary age-aware policy minimizes time-average Age of Information (AoI). By adapting the semantic rate to congestion and fidelity requirements, the proposed framework improves spectrum utilization and enables timely semantic updates with significantly lower delay and AoI than fixed-rate baselines.
Read the full abstract

Optimization and Control

An Exact Algorithm for Load-Dependent Traveling Salesman Problem for Unmanned Aerial Vehicle Package Delivery

In this article, we present a novel formulation for the load-dependent traveling salesman problem (LD-TSP), in which travel cost (or energy expended) depends on the vehicle's current load. This problem is relevant for package delivery and urban air mobility, where vehicles must transport and drop cargo at specified locations. The challenge lies in modeling the cost, which varies with both route sequence and onboard load. Our key contributions are: (i) formulating an energy dissipation model and proving energy expenditure depends linearly on vehicle mass and distance; and (ii) formulating a mixed-integer nonlinear programming formulation and providing a novel relaxation to obtain a mixed-integer linear program. Extensive numerical results show that optimal solutions for most instances with up to 50 targets are obtained within one minute. For unsolved instances within a 10-minute limit, optimality gaps are under 13%, highlighting the formulation's tightness. We further benchmark our approach against three proposed baseline formulations and another algorithm from a related problem, and demonstrate that our formulation outperforms all baselines.
Read the full abstract

All authors Deepak Prakash Kumar, Saurabh Belgaonkar, Sivakumar Rathinam, Swaroop Darbha, David W. Casbeer

Metric Geometry

Closed polylines with fixed self-intersection index

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial geometry asks for all pairs $(n, k)$ such that there exists a closed polyline with $n$ edges, each intersecting the same polyline exactly $k$ times. For $k = 1$ and $k = 2$, this is a very simple question answered several decades ago. In this article, we present a complete solution for $k = 3, 4, 6$, as well as the proof of some non-existence theorems. In conclusion, we show that, for an arbitrary positive integer $k$, a polyline of the required type exists for any sufficiently large integer $n$ such that $nk$ is even.
Read the full abstract

Optimization and Control

A Computationally Tractable Path-Planning Method for Airborne Wind Energy Systems

Airborne Wind Energy Systems (AWES) have emerged as a promising renewable energy technology that exploits stronger, more consistent high-altitude winds via tethered airborne devices. Among the various concepts, crosswind systems, where efficient flight control is essential to maximise energy output, offer significant potential. This paper addresses the problem of reference selection for crosswind flight control, focusing on the design of power-maximising geometric flight paths for the reel-out phase of Groundgen systems. To overcome the computational challenges associated with optimal control approaches, a computationally tractable framework is proposed in which a path-planning problem is formulated as a nonlinear program. The method optimises the parameters of a Lissajous curve to maximise the average power production over the reel-out phase, while incorporating curvature constraints. The proposed approach provides an efficient alternative to existing optimal control and learning-based methods.
Read the full abstract

Combinatorics

Sets with Few Subset Sums

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of this inverse theorem in two regimes. First, for any parameter $M \leq n-4$, we precisely characterize the $n$-element sets of positive reals with at most $\binom{n+1}{2}+1+M$ subset sums. Second, for any constant $C$, we provide a characterization, sharp up to constants, of the $n$-element sets of positive reals with at most $Cn^2$ distinct subset sums. Along the way, we constrain (for any fixed $d \geq 2$) the structure of $n$-element subsets of $\mathbb{R}^d$ with $o(n^{d+1})$ subset sums.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

A renormalization-group inspired lattice-based framework for piecewise generalized linear models

We formally introduce a class of models inspired by renormalization group (RG) theory, built on additive hierarchical expansions analogous to those appearing in functional ANOVA and mixed-effects models. Like ReLU convolutional neural networks, they are almost everywhere locally linear; unlike ReLU networks, their partition structure is explicit, interpretable, and easy to modify or constrain. In these models, one defines a multidimensional lattice partition of the input space and uses it to scaffold variations in regression parameters. Each dimension of the lattice corresponds to an attribute by which the statistics of the problem may vary. The parameters are themselves expressed in the form of an expansion, where each term captures variations relative to a lower (coarser) interaction scale. These models admit multiple equivalent interpretations: as piecewise GLMs, as hierarchical mixed-effects regressions, or as regression trees with structured parameter sharing. Since RG motivates the design of these models, we use techniques from statistical physics – specifically replica analysis – to study their generalization properties. Specifically, we analyze the behavior of the Watanabe-Akaike Information Criterion (WAIC) as a proxy for generalization loss. This analysis yields two practical results: (i) guidance on the lattice design as a function of dataset size and predictor dimensionality; and (ii) a principled scaling law for the regularization prior when adding higher-order terms to the expansion so that one can increase model complexity without an expected increase in generalization loss. We evaluate the methodology on public datasets and find performance competitive against both blackbox methods and other intrinsically interpretable approaches.
Read the full abstract

Analysis of PDEs

Hölder continuity for non-coercive Hamilton-Jacobi equations associated to linear control systems

In this paper we establish Hölder continuity estimates for viscosity solutions to first order Hamilton-Jacobi equations linked to linear control systems satisfying the Kalman rank condition. Our model Hamiltonians are non-convex in the generalised momentum variable and - more importantly - they lack coercivity in certain directions. Therefore, all previously available results from the literature cannot be applied to these degenerate settings. In order to overcome these obstructions, we design a geometric argument, dictated by the linear control system. As a result of this, the obtained Hölder estimates are quantified in an anisotropic way within this geometric framework. The estimates hold true for unbounded source terms, for which one part of our analysis is inspired by a recent result on De Giorgi type methods for hypoelliptic operators.
Read the full abstract

Dynamical Systems

Multifractal analysis of power means for the Schneider map on $p\mathbb{Z}_p$

We study the asymptotic power means of the coefficients associated with the Schneider continued fraction map on $p\mathbb{Z}_p$. Using tools from thermodynamic formalism, we compute the Hausdorff dimension of the corresponding level sets and obtain explicit formulas for the associated multifractal spectra. The locally constant nature of the geometric potential enables a precise description in terms of polylogarithm functions, in sharp contrast with the classical real setting.
Read the full abstract

Optimization and Control

Bayesian Algorithm for Collaborative Optimization with Application to Aircraft Design

Collaborative Optimization (CO) is a multidisciplinary design optimization (MDO) framework that decomposes large-scale engineering problems into parallel, independently solvable subsystems coordinated by a system-level optimizer. Its practical utility is limited by the high frequency of expensive black-box disciplinary evaluations arising from the bi-level consistency constraints. This paper introduces BACO, a Bayesian Algorithm for Collaborative Optimization, which replaces the direct black-box calls at both levels with Gaussian process (GP) surrogates and acquisition function maximization. At the subsystem level, an acquisition function subject to GP-predicted feasibility constraints identifies the next evaluation point. At the system level, the same surrogate framework enforces consistency through predicted discrepancy constraints. This architecture reduces the number of true black-box evaluations required per major iteration. BACO is benchmarked against state-of-the-art CO variants on a Scalable MDO problem over 50 randomized instances. On this problem, BACO consistently achieves lower objective values and drives both constraint violation and interdisciplinary discrepancy to near-zero within the evaluation budget, outperforming all three CO variants across all tested DoE sizes. Further validation is conducted on a coupled aero-structural wing optimization problem based on the Common Research Model (CRM) geometry, where BACO identifies a feasible solution within 886 of 1000 allocated evaluations, recovering results physically consistent with active bending stress and tip deflection constraints. The BACO software, the state-of-the-art CO solvers, as well as standard MDO benchmarking problems are open-source and publicly available at https://moebehfn.github.io/mdotoolbox/.
Read the full abstract

Differential Geometry

On Generalized Quasi-Einstein Manifolds

In this paper, we study generalized $m$-quasi-Einstein $(M^n,g,X,\lambda)$ under natural conditions on the potential vector field. We show that, under suitable integral assumptions, the potential vector field is Killing, extending earlier results of Sharma to the generalized setting. Moreover, we show that divergence-free vector fields are Killing in this context, and we derive consequences under sign conditions on $m$ and $\lambda$, including triviality results. We also revisit a recent theorem of Ghosh \cite{ghosh}, discuss a subtle issue in the argument, and provide a new formulation and proof. Finally, we establish rigidity results for manifolds with geodesic potential vector fields.
Read the full abstract

2605.05473 · 6 May · The revised version improves the manuscript by clarifying the main rigidity results, correcting the discussion surrounding Ghosh's theorem, and providing a counterexample showing that a previous generalized statement is false in full generality. We are grateful to Ghosh for clarify several points in his recent paper, which improve the presentation and a precise formulation our results

Logic

A note on the modal logic of symmetric extensions

Taking symmetric extensions can be considered as a generalisation of forcing, which produces a richer multiverse of models with and without the axiom of choice. We can study the structure of this multiverse using modal logic. In particular, we define the concept of of choice-switches, and show any independent system of choice-switches is not itself independent from any standard example of an independent system of buttons.
Read the full abstract

Combinatorics

Spectrum of the Unit-Graph on $\mathrm{Mat}_3(\mathbb{F}_q)$

In this paper, we investigate the spectrum of the unit-graph of the ring of $3 \times 3$ matrices over a finite field $\mathbb{F}_q$, which is equivalently the Cayley digraph $ \mathrm{Cay}\!\left((\mathrm{Mat}_3(\mathbb{F}_q),+), \mathrm{GL}_3(\mathbb{F}_q)\right)$. This unit-graph has a vertex set $\mathrm{Mat}_3(\mathbb{F}_q)$ with a directed edge from $A$ to $B$ whenever $B - A \in \mathrm{GL}_3(\mathbb{F}_q)$. Then, two vertices are adjacent precisely when their difference is invertible. With relevant character theory, we consequently demonstrate that the adjacency spectrum of $ \mathrm{Cay}\!\left((\mathrm{Mat}_3(\mathbb{F}_q),+), \mathrm{GL}_3(\mathbb{F}_q)\right) $ consists of four distinct eigenvalues together with their multiplicities. Using the Spectral Gap Theorem for Cayley digraphs, we show that if two subsets of vertices in $\mathrm{Mat}_3(\mathbb{F}_q)$ are sufficiently large, then there are matrices in the two subsets whose difference lies in $\mathrm{GL}_3(\mathbb{F}_q)$. In particular, any sufficiently large subset of $\mathrm{Mat}_3(\mathbb{F}_q)$ contains two distinct matrices whose difference has nonzero determinant. This spectral gap implies that large vertex sets cannot avoid each other and must be connected by at least one edge.
Read the full abstract

Combinatorics

Thresholds for Tic-Tac-Toe on Finite Affine Spaces

We introduce an affine version of Tic-Tac-Toe played on the finite affine space $\mathbb{F}_q^m$. Two players alternately claim points, and the first player to occupy all points of an affine subspace of dimension $n$ wins. We call this the $(m,n)_q$-game. For fixed $n$ and $q$, we study how the outcome depends on the ambient dimension $m$. Using strategy stealing and a blocking-set interpretation, we show that every $(m,n)_q$-game is either a first-player win or a draw, and that the property of being a first-player win is monotone in $m$. This yields a threshold $T(n,q)$: the game is a draw for $m<T(n,q)$ and a first-player win for $m\ge T(n,q)$. We prove that this threshold is finite by applying the affine/vector-space Ramsey theorem of Graham, Leeb and Rothschild, and we obtain general lower bounds from the Erdős-Selfridge criterion for Maker-Breaker games. In the binary case, we give a direct Fourier-analytic argument, combined with an inductive lifting method, which shows that \[ T(n,2)\le 2^{n+1}. \] We also determine several small cases, including $T(1,q)=2$ for $q\in\{2,3,4\}$ and $T(2,2)=4$, and we prove geometric lower bounds from explicit pairing strategies, such as $T(n,q)\ge n+2$ for every $n\ge 2$. Our results place affine Tic-Tac-Toe at the interface of strong positional games, finite geometry and Ramsey theory for finite affine spaces.
Read the full abstract

Numerical Analysis

Hybridizable discontinuous Galerkin methods for poroelastic wave propagation with symmetric stress approximation

In this paper, we develop hybridized discontinuous Galerkin (HDG) methods for poroelastic wave equations. We first rewrite the governing equations to a first-order symmetric hyperbolic system in order to use dual mixed formulations for discretization. Subsequently, we combine two HDG approaches in the discretization of the system, the $\text{HDG}+$ method for the linear elasticity equations and the $\text{LDG-H}$ method for the diffusion equations, with adjustments for the poroelastic wave equations. In our proposed HDG methods, the numerical approximation of the stress tensor is strongly symmetric and the convergence of the errors are robust for nearly incompressible materials. Upon performing static condensation, the system retains numerical trace variables solely for the solid displacement and the fluid pressure. We provide comprehensive error analyses for both the semidiscrete formulation and the Crank–Nicolson time-stepping scheme. Finally, extensive numerical examples illustrate optimal convergence results and simulate different poroelastic wave propagation scenarios relevant in the literature.
Read the full abstract

Algebraic Geometry

On Brauer groups of known Enriques manifolds

We compute the Brauer group of some of the known Enriques manifolds. We then build special Brauer-Severi varieties on these manifolds and study the pull-back map from the Brauer group of an Enriques manifold to that of its hyper-Kähler universal cover, from both a geometric and an algebraic perspective.
Read the full abstract

All authors Alessandro Frassineti, Francesca Rizzo, Federico Tufo, Matteo Verni

Information Theory · Cross-listed from stat.ML

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation

Nonconvex methods have emerged as a dominant approach for low-rank matrix estimation, a problem that arises widely in machine learning and AI for learning and representing high-dimensional data. Existing analyses for these methods often require additional regularization to mitigate nonconvexity, even though such regularization is often unnecessary in practice. Moreover, most analyses rely on problem-specific arguments that are difficult to generalize to more complex settings. In this paper, we develop a theoretical framework for studying nonconvex procedures across a broad class of low-rank matrix estimation problems. Rather than focusing on a specific model, we reveal a fundamental mechanism that explains why nonconvex procedures can behave well in low-rank estimation. Our key device is a benign regularizer that does not alter the original update rule, but yields an equivalent locally strongly convex formulation of the algorithm. This perspective uncovers a disguised convexity inherent in the nonconvex procedure and provides a new route to theoretical guarantees for nonconvex low-rank matrix estimation.
Read the full abstract

Probability

Wick Renormalized Parabolic Stochastic Quantization Equations on Rough Metric Measure Spaces

On metric measure spaces with sub-Gaussian heat kernel behavior in small time, we obtain a sufficient condition to solve Wick renormalized stochastic quantization equations with polynomial interaction. Given the power of the nonlinearity, the local solution condition depends on the Hausdorff dimension $d_h$, the walk dimension $d_w$, and the maximal spatial Hölder regularity of the heat kernel $\Theta$. A slightly more restrictive condition based on the same parameters is required for a global solution. For all global solutions, we construct an invariant measure for the Markov process defined by the solution. Our results apply to many rough spaces such as Barlow–Kigami type fractals as well as their Cartesian products and open up the possibility of making rigorous various structures in quantum field theory and statistical mechanics in non-integer dimensions. In the process, we build entirely from the short-time heat semigroup the necessary analytic framework that accommodates the issues which come with allowing rough local geometry.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Active Learning for Conditional Generative Compressed Sensing

Generative compressed sensing uses the range of a pretrained generator as a nonlinear model for recovering structured signals from limited measurements. We study a conditional version of this problem for image recovery from subsampled Fourier measurements using prompt-conditioned generative models. Our framework separates two roles of conditioning: the prompt used to design the sampling distribution and the prompt used to define the recovery model. For ReLU and Lipschitz conditional generators, we prove stable recovery bounds showing that prompt-matched Christoffel sampling retains the same Christoffel complexity constant as existing near-optimal generative compressed sensing theory, while prompt mismatch incurs an explicit compatibility penalty. Experiments with Stable Diffusion show that prompts meaningfully reshape Christoffel sampling distributions and influence image recovery. Overall, our results suggest treating prompts as design variables for sensing, approximation, and recovery, opening new directions for the practical use of conditional generative models in compressed sensing, where conditioning, sampling, and optimization must be considered jointly.
Read the full abstract

Statistics Theory

Direct Estimation of Schrödinger Bridge Time-Series Drifts: Finite-Sample, Asymptotic, and Adaptive Guarantees

We study nonparametric estimation of Schrödinger bridge (SB) drifts from i.i.d.\ data observed on a single time interval. Starting from the conditional-ratio form of the Schrödinger bridge time-series (SBTS) drift formula, we analyze a direct Nadaraya–Watson plug-in estimator built from kernelized numerator and denominator terms. Unlike recent SB analyses based on entropic-OT potentials, Sinkhorn iterations, or iterative bridge solvers, our approach works directly at the drift level and isolates statistical error from optimization, approximation, and discretization error. Under Hölder regularity, a marginal-density floor, and bounded support, we prove a uniform non-asymptotic bound for admissible bandwidth pairs, a pointwise CLT under genuine undersmoothing, and an adaptive bandwidth selector satisfying an oracle inequality. We also prove a pivot-local minimax lower bound which, through an explicit uniform pivot, yields a global minimax lower bound under transparent compatibility conditions; hence the adaptive selector is minimax-rate optimal up to logarithmic factors. Synthetic experiments provide theorem-targeted diagnostics for finite-sample scaling, Gaussian approximation, and adaptive behavior.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

A transition in the hole probability at finite temperature for free fermions in $d$ dimensions

In a free Fermi gas at temperature $T$ much higher than the Fermi temperature one expects that the fluctuations of the number of particles in a given region has Poissonian/classical statistics. On the other hand at low temperature the Pauli exclusion principle leads to non trivial counting statistics. It is of great interest from a theoretical and experimental point of view to characterize the crossover between these two limits. Here we focus on the hole probability $P(R,T)$, i.e. the probability that a region of size $R$ is devoid of particles, in dimension $d$, and on the case of a spherical region of large radius $R$. We show that at low temperature it takes the scaling form $P(R,T)\sim \exp\big[-(k_F R)^{d+1}\Phi_d(u=2R\,T/k_F)\big],$ where $k_F$ is the Fermi momentum. By mapping the problem to an effective Coulomb gas, we compute exactly the scaling function $\Phi_d(u)$ in any dimension. Remarkably, it exhibits a transition of order $\tfrac{3}{2}(d+1)$ at the universal critical value $u_c=2/\pi$, signaling a sharp change in the mechanism of rare fluctuations, associated with the emergence of a macroscopic gap in the optimal density of the associated Coulomb gas. Our analytical predictions are supported by precise numerical evaluations of the corresponding Fredholm determinants.
Read the full abstract

Probability

Dirichlet problems and exit distributions for the telegraph process and its planar extensions

In this paper, we study boundary-value problems describing the exit distribution of finite-velocity random motions from prescribed domains. For the standard telegraph process, with and without drift, we derive the Dirichlet problems governing the exit point and mean exit time from a closed interval. We then extend the analysis to a planar finite-velocity model with orthogonal directions, for which we obtain the associated Laplace and Poisson-type equations for the exit distribution and mean exit time. In the special case of an infinite strip, explicit solutions are obtained. In all cases, we show that our equations and results converge, in the hydrodynamic limit, to the corresponding ones for Brownian motion.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.mtrl-sci

Band Unfolding via the Quadratic Pseudospectrum

Band theory provides the foundation for understanding electronic structure in crystalline materials, but its reliance on exact translational symmetry limits its applicability to systems with defects, disorder, incommensurate modulations, or large unit cells. Here, we introduce a band unfolding framework that directly generalizes traditional band theory to systems where exact periodicity is absent, and which remains well-defined for both aperiodic and finite systems. To do so, we employ a pseudospectral approach to identify approximate joint eigenvectors of a system's Hamiltonian and translation operators, thereby yielding an unfolded band structure whose features are directly connected to the manifestation of approximate extended states simultaneously localized in energy and crystalline momentum. To reveal bulk-only spectral phenomena in finite systems, we further show that this pseudospectral framework naturally accommodates additional operators that suppress contributions from boundary-localized states, enabling the systematic isolation of intrinsic bulk behavior. We benchmark the scheme on several representative systems in one and two dimensions, including a Fibonacci chain, where our approach is able to both reveal a dispersive envelope while preserving the underlying hierarchy of spectral gaps. Looking forward, this pseudospectral approach may yield a broad framework for predicting momentum-resolved material responses in aperiodic, disordered, and finite systems where conventional band-theoretic methods are not applicable.
Read the full abstract

All authors Christopher A. Bairnsfather, Ralph M. Kaufmann, Terry A. Loring, Alexander Cerjan

Analysis of PDEs

An optimal trace estimate for microlocal square functions on quadratic surfaces

We study a local trace estimate for the microlocal angular square function \[ G_R f := \left(\sum_\Theta |f_\Theta|^2\right)^{1/2} \] associated with a parabolic decomposition of the frequency annulus of radius $R$ in $\mathbb{R}^3$. The measure under consideration is \[ \mu_Q=\chi\, H^2\lfloor S_Q, \] where $\chi\in L^\infty(S_Q)$ is a measurable nonnegative density compactly supported in the patch, and \[ S_Q=\{(u_1,u_2,Q(u_1,u_2)):u\in U\}, \qquad Q(u_1,u_2)=\frac12(\lambda_1u_1^2+\lambda_2u_2^2), \qquad \lambda_1\lambda_2 >0. \] Writing $\rho=R^{-1/2}$, we prove \[ \| G_R f\|_{L^2(\mathrm d\mu_Q)} \lesssim R^{1/8}\|f\|_{L^2(\mathbb R^3)}. \] Under local positivity of the density near the tangency point, the factor $R^{1/8}$ is attained by a tangent wave packet test and hence cannot be improved within this elliptic quadratic model, at this parabolic scale and for this angular square function. In particular, it measures the failure of a trace bound uniform in $R$ within this class. Its source is the extreme tangential interaction between a tube of radius $\rho$ and $S_Q$: the relevant surface measure is $\sim\rho^{3/2}$, whereas an $L^2$-normalized wave packet has quadratic size $\sim\rho^{-2}$. Thus the optimal quadratic cost is $\rho^{-1/2}$, producing the norm factor $\rho^{-1/4}=R^{1/8}$.
Read the full abstract

Optimization and Control

Policies for the Operation of an Ambulance Fleet under Uncertainty based on a New Preparedness Metric

Two important decisions in the management of an ambulance fleet are ambulance selection decisions and ambulance reassignment decisions. Ambulance selection decisions determine what to do when an emergency call arrives (such as choosing what ambulance to dispatch to the emergency or putting the emergency in a queue of emergencies waiting for an ambulance to be dispatched). Ambulance reassignment decisions determine where to send an ambulance next when it has finished service for an emergency. Making good ambulance selection decisions and ambulance reassignment decisions is challenging because a decision made at a point in time affects the ability of the emergency medical service to respond to future emergencies (that are typically not known when the decision is made). We propose a new preparedness metric that quantifies the ability of the emergency medical service to respond to future emergencies. The preparedness metric can be used to make ambulance selection decisions and ambulance reassignment decisions by solving a tractable optimization problem each time that a decision has to be made. We compare the performance of the resulting method with 9 methods that have been proposed in the literature, based on data from a real emergency medical service for a large city.
Read the full abstract

Probability

A Unified Approach to Beta Moments, Combinatorial Identities, and Random Walks

The study of random walks has increasingly been popular across diverse disciplines such as statistics, mathematics, quantum physics, where they are used to model paths consisting of successive random steps in a mathematical space. A fundamental quantity of interest is the probability that a simple symmetric random walk returns to the origin after 2n steps. In this paper, we develop a unified probabilistic approach that connects the return probabilities in arbitrary dimensions with moment representations. Using this framework, we provide probabilistic proofs of several combinatorial identities involving beta and gamma functions, and derive new combinatorial identities in general dimensions.
Read the full abstract

Differential Geometry

The $\sigma_k$-Yamabe problem revisited

In this paper we revisit the $\sigma_k$-Yamabe problem on $M^n$, namely, finding a conformal metric with constant $\sigma_k$-scalar curvature. We prove that on a closed manifold $\left(M,\left[g_0\right]\right)$ with positive Yamabe constant $Y_1\left(M,\left[g_0\right]\right)>0$, the $\sigma_2$-Yamabe constant $$ Y_2\left(M,\left[g_0\right]\right):=\inf _{g \in\left[g_0\right], R_g>0} \frac{\int_M \sigma_2(g) d \operatorname{vol}(g)}{\operatorname{vol}(g)^{\frac{n-4}{n}}} $$ is achieved by a conformal metric $g \in\left[g_0\right]$, which in particular solves the $\sigma_2$-Yamabe problem, assuming $Y_2\left(M,\left[g_0\right]\right)>0$. As a consequence, for any $\left(M, g_0\right)$ with $Y_1\left(M,\left[g_0\right]\right)>$ 0 and $Y_2\left(M,\left[g_0\right]\right)>0$ one has $$ \inf _{g \in\left[g_0\right], R_g>0} \frac{\int_M \sigma_2(g) d \operatorname{vol}(g)}{\operatorname{vol}(g)^{\frac{n-4}{n}}}=\inf _{g \in\left[g_0\right], R_g>0, \sigma_2(g)>0} \frac{\int_M \sigma_2(g) d \operatorname{vol}(g)}{\operatorname{vol}(g)^{\frac{n-4}{n}}} . $$ We also show that these conclusions can fail if the condition $R_g>0$ is removed.
Read the full abstract

Differential Geometry

Hodge Laplacian on $1$-forms of homogeneous $3$-spheres

We study the spectrum of the Hodge-Laplacian on $1$-forms for left-invariant metrics on the Lie group $\operatorname{SU}(2) \cong S^3$ and its quotient $\operatorname{SO}(3)\cong P^3(\mathbb{R})$. To the best of our knowledge, we provide the first explicit computation of the full spectrum of the Hodge-Laplacian for a canonical variation by determining the eigenvalues of Berger 3-spheres and analyzing their resulting splitting behavior. Furthermore, we propose and rigorously prove an explicit formula for the first eigenvalue of general homogeneous metrics on $\operatorname{SU}(2)$ and $\operatorname{SO}(3)$. The formal proof of this result was autonomously discovered by an advanced AI model, providing a notable case study for AI-driven mathematical research. Finally, leveraging this explicit formula, we apply these spectral results to the inverse problem, showing that the spectrum on $1$-forms determines the metric up to isometry. The source code for the symbolic computations, visualizations, and a Monte Carlo stress test is provided in the electronic supplementary material [He26].
Read the full abstract

Mathematical Physics

Equivariant Poisson 2-Algebra Bundles over Configuration Spaces

We study equivariant vector bundles over configuration spaces with diagonals included, viewed as orbifold quotients $M^n/\mathfrak{S}_n$ by permutation groups. Working in the equivalent language of equivariant vector bundles, we construct an induced-equivariance functor and prove its adjunction with restriction. We then define Hadamard and Cauchy tensor products and show that they form a symmetric $2$-monoidal structure. We construct the corresponding tensor and symmetric algebra bundles and prove that, for a local vector bundle $V \rightarrow M$, the bundle $\mathbf{S}^{\boxtimes} \big( \mathbf{S}^{\otimes}(V) \big)$ is the free commutative $2$-algebra generated by $V$. Finally, we show that any skew-symmetric bundle map $k : V \boxtimes V \rightarrow \mathbf{I}_{\otimes}$ induces a compatible Poisson bracket on this $2$-algebra bundle.
Read the full abstract

Functional Analysis

Differentiation and Ordered Optimization in Banach Spaces

In this paper, we will define generalized critical point, ordered extreme and order monotone property of single-valued mappings in partially ordered Banach spaces. In particular, we will find the explicit formulas of Gateaux and Frechet derivatives of some single-valued mappings on the Banach spaces lp, for and C[0, 1], such as polynomial type operators and trigonometric type operators. By these concepts, we will investigate the connection between generalized critical points and ordered extrema of single-valued mappings in partially ordered Banach spaces that extends the connection between critical points and extrema of real valued functions in calculus. We will prove that in partially ordered Banach spaces, the order monotone of single-valued mappings can be described by its Gateaux derivatives or Frechet derivatives.
Read the full abstract