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)

Friday 1 May

Probability

Spectral Duality and Reset-Neutral Distributions in Random Walks with Multi-Site Geometric Resetting

We study the gambler's ruin problem for a biased random walk on $\{0,1,\dots,a\}$ under multi-site geometric resetting: at each step the walker is reset with probability $\gamma\in(0,1)$ to a position drawn from a distribution $\pi$ over $m$ interior sites. Using renewal theory, we derive a closed-form expression for the ruin probability, showing that the whole effect of $\pi$ is encoded in a single scalar, the coupling constant $C(\pi,\gamma)$. A spectral analysis via the Doob symmetrization reveals its structure. Our central result is a general criterion, valid for any absorbed Markov chain with a spectral decomposition, for the existence of a reset-neutral distribution $\pi^*$ with $C(\pi^*,\gamma)$ independent of $\gamma$. The criterion is a spectral duality condition: an involution $\sigma$ on the reset sites and mode-independent weights $\kappa$ with $B_\nu(z)=\kappa(z)A_\nu(\sigma(z))$ for all modes $\nu$, and a common pair product $\kappa(z)\kappa(\sigma(z))=K$. The invariant value is then $C^*=1/(1+\sqrt{K})$. For the biased random walk the condition is equivalent to the geometric symmetry $z_i+z_i'=a$, and $C^*$ is the classical ruin probability from the midpoint, for any domain size, number of reset sites, bias and resetting rate. Since the duality holds step by step in time, the critical distributions are reset-neutral for every resetting mechanism independent of the walk under which absorption is almost sure. Algebraic and Monte Carlo verifications confirm the theory to machine and statistical precision, and numerical illustrations reveal a phase-like structure in the space of reset distributions, with $\pi^*$ acting as a separatrix between monotone regimes.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Reinforcement Learning with Markov Risk Measures and Multipattern Risk Approximation

For a risk-averse finite-horizon Markov Decision Process, we introduce a special class of Markov coherent risk measures, called mini-batch measures. We also define the class of multipattern risk-averse problems that reduce to linear MDPs in the risk-neutral case. We use both concepts in a feature-based $Q$-learning method with multipattern $Q$-factor approximation and we prove a high-probability regret bound of $\widetilde{\mathcal{O}}\big(d^{3/2}HN^{H-1}\sqrt{K}\big)$, where $d$ is the number of features, $H$ is the horizon, $N\ge2$ is the mini-batch size, $K$ is the number of episodes, and $\widetilde{\mathcal{O}}$ hides logarithmic factors. We also propose an economical version of the $Q$-learning method that streamlines the policy evaluation (backward) step. The theoretical results are illustrated on a stochastic assignment problem and a short-horizon multi-armed bandit problem.
Read the full abstract

Logic

Infinite-Exponent Partition Relations on Higher Analogues of the Real Line

We present a number of results concerning infinite-exponent partition relations on linear orders of the form $\langle {}^\alpha 2,<_{\text{lex}}\rangle$ for $\alpha$ an ordinal, generalising the setting of the real line, working throughout in ZF without the Axiom of Choice. As a particular consequence of our results, we obtain a full classification of the relation $\langle {}^\alpha 2,<_{\text{lex}}\rangle \rightarrow (\tau)^\tau$ for $\tau$ countable.
Read the full abstract

Analysis of PDEs

Nonlocal Approximation Principle for Entropy Solutions of Scalar Conservation Laws

We establish a general nonlocal approximation principle for the entropy solutions of scalar conservation laws on $\mathbb{R}$. More precisely, we show that the entropy solution to a nonnegative initial datum can be obtained as a weak-star limit of a corresponding scalar nonlocal conservation law. The flux function of the nonlocal conservation law depends on suitable spatial averages of the density. The proof is based on a reformulation on the Hamilton–Jacobi level: working with the primitives, we identify the limit via the stability properties of viscosity solutions; we then recover the entropy solution using the classical relation between Hamilton–Jacobi equations and scalar conservation laws. We further show that the approximation extends, after a suitable shift, to sign-changing initial data, and we prove a quantitative convergence estimate for convex fluxes in terms of the first moments of the nonlocal kernels. This result makes it possible to define entropy solutions for general fluxes using their nonlocal approximations, which satisfy the requirement for a finite speed of mass propagation, a key feature of hyperbolic conservation laws.
Read the full abstract

Dynamical Systems

On the Global Curve Attractor for polynomial gluing

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [2], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials along the boundaries of their finite superattracting basins. Adapting the idea of [19], we show that a suitably defined intersection number with a finite family of separating arcs eventually decays under pullback, yielding a finite collection of homotopy classes that attracts all non-peripheral curves under iteration.
Read the full abstract

Combinatorics

A lower bound of toughness of regular graphs: in terms of second largest eigenvalue

Let $G$ be a connected (non-complete) $d$-regular graph with $d\geq3$. Let $c(G-S)$ denote the number of components of $G-S$ for any cut $S$ of $G$. The toughness $t(G)$ of $G$ is defined as $\min\left\{\frac{|S|}{c(G-S)}\right\}$, where the minimum is taken over all proper cuts $S$ of $G$. Let $\lambda_{2}(G)$ denote the second largest eigenvalue of $G$. In this paper, we prove $$t(G)\geq\min\left\{\frac{d+1}{d}(d-\lambda_{2}(G)),1\right\}.$$
Read the full abstract

Combinatorics

Sizes of witnesses in Covtree

Given a set $\Gamma$ of $k$ unlabelled posets, each of size $n$, we say that a poset $Q$ is a witness to $\Gamma$ if $\Gamma$ is the set of downsets of size $n$ of $Q$. We say that $Q$ is a minimal witness if it does not contain a proper downset that is itself a witness to $\Gamma$. Motivated by the causal set approach to quantum gravity, we study the upper bound on the size of minimal witnesses as a function of $n$ and $k$. We show that there is no linear upper bound of the form $n+k+c$ for any constant $c$. We introduce the exchange graph of downsets as a new tool to study this scenario, and use it to show that all minimal witnesses $Q$ satisfy the bound $|Q|\leq nk-n$, and that when $k=3$ there is at least one minimal witness $Q$ that satisfies the bound $|Q|\leq \frac{3}{2}(n+1)$.
Read the full abstract

All authors Jette Gutzeit, Kimia Shaban, Karen Yeats, Stav Zalel

Numerical Analysis

Continuous 3D Finite Element Subgrid Basis Functions for Discontinuous Galerkin Methods on Polyhedral Meshes

We present a novel high-order accurate nodal discontinuous Galerkin (DG) method for solving nonlinear hyperbolic systems of partial differential equations (PDEs) on fully unstructured three-dimensional polyhedral meshes. A mesh generator is firstly discussed in detail, which ensures the generation of admissible control volumes. For the first time, we then extend the concept of agglomerated finite element (AFE) basis functions to polyhedral grids. In this context, the discrete solution is represented within each polyhedral element using piecewise continuous polynomials of degree N, defined on an internal tetrahedral subgrid. The AFE basis functions are therefore constructed by agglomerating standard finite element basis functions on each sub-tetrahedron of the computational cell. This allows for the precomputation of universal local matrices (mass and stiffness) on the reference element given by the unit tetrahedron, enabling a quadrature-free implementation that remains efficient even on highly irregular polyhedral meshes. High-order of accuracy in time is achieved using a local spacetime Galerkin predictor as part of the ADER approach, applied independently within each polyhedral element. To ensure robustness in the presence of discontinuities such as shocks, an artificial viscosity limiter is embedded into the numerical scheme, allowing for controlled dissipation and stabilization without compromising the overall accuracy in smooth regions. To demonstrate the robustness and accuracy of the method, we validate it through different three-dimensional benchmark problems for the compressible Euler and Navier-Stokes equations.
Read the full abstract

Analysis of PDEs

Robin nullity and asymptotic geometry of the critical hyperbolic catenoid

For each parameter $a>1$, the critical hyperbolic catenoid $\Sigma_a$ is a rotationally symmetric, free boundary minimal annulus in a geodesic ball $B^3(r(a))\subset\mathbb{H}^3$. The Morse index of $\Sigma_a$ is at least $4$ by Medvedev [7], who conjectures equality. In this paper we identify a new geometric and spectral phenomenon for the family $\{\Sigma_a\}_{a>1}$, which we call "parameter-criticality", and study its consequences for the Robin spectrum. Specifically, we prove two main results: (I) Parameter-criticality (Theorem 1.5). The boundary radius $r(a)$ is non-monotone on $(1,\infty)$: it satisfies $r'(1^+)<0$ and $r(a)=\frac{3}{2}\log a+d_\infty+o(1)$ as $a\to\infty$ with $d_\infty=\log[\Gamma(1/4)/\Gamma(3/4)]-\frac{1}{2}\log(2\pi)$ (Theorem 1.4). Hence there exists a parameter-critical value $a^\sharp\in(1,\infty)$ with $r'(a^\sharp)=0$. (II) Robin nullity jump (Theorem 1.6). At every such $a^\sharp$, the Robin nullity of $\Sigma_{a^\sharp}$ satisfies $\text{nul}(L_{\Sigma_{a^\sharp}})\geq 3$, with an additional kernel element in mode $k=0$ generated by the parametric variation field $j_a=\langle\partial_a\Phi_a,\nu\rangle_L|_{a=a^\sharp}$, which we show is non-vanishing at the catenoid neck via the closed-form $j_a(0)=1/(2\sqrt{a^2-1})$. The argument requires the limit $r_0:=\lim_{a\to 1^+}r(a)$ characterized as the unique positive solution of the transcendental equation $\tanh(r_0)\,\tanh(2r_0/\sqrt{3})=\sqrt{3}/2$ (Theorem 1.3), giving a clean parametrization of the degeneration $\Sigma_a\to\Sigma_1$. The Robin nullity of $\Sigma_a$ in mode $|k|=1$ is shown to equal $2$ (Proposition 1.1); this extends to the hyperbolic setting the mode-by-mode Fourier decomposition technique of Devyver [2] for the Euclidean critical catenoid, and is used in the proof of (II) to identify the extra kernel as a mode-$k=0$ phenomenon.
Read the full abstract

Optimization and Control

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank

We analyze the sum-of-squares rank of unweighted instances of the Minimum Knapsack (MK) problem, i.e., minimization of $\sum_{i=1}^n x_i$ for 0/1 variables under the constraint $\sum_{i=1}^n x_i \geq q$, with $q \in \mathbb{R}$. Such instances have long served as a testbed for understanding the limitations of lift-and-project methods in Boolean optimization. For example, both the Lovász-Schrijver and Sherali-Adams hierarchies require (maximal) rank $n$ to solve them, already when $q=1/2$ is constant. The SOS hierarchy requires only sublinear rank $O(\sqrt{n})$ to solve unweighted MK when $q=1/2$. On the other hand, when $q$ is allowed to vary with~$n$, the SOS rank of the problem may become linear. Interestingly, this is known to happen both when $q$ is large, and when $q$ is very small ($0<q \leq 2^{-n}$). This raises the question of whether we should think of hard instances of unweighted MK as being typical for the SOS hierarchy, or as a consequence of very specific choices of the threshold parameter $q$. In this paper, we address this question by showing new upper and lower bounds on the SOS rank of unweighted MK in the whole regime of the parameter $q$. For $n-q \leq O(1)$, we show that the SOS rank is constant. In contrast, when $q \leq O(1)$, a linear rank is needed if $q$ is exponentially close to an integer. As our main positive result, we show that linear rank is very rare for $q \leq O(1)$. This can be expressed in the language of smoothed analysis: after perturbing $q$ by a Gaussian with mean $0$ and variance $\sigma^2$, the expected SOS rank of MK is $O(\sqrt{n} \log (n/\sigma))$.
Read the full abstract

Number Theory

The Hurwitz sum-of-squares problem depends on the base field

We show that the Hurwitz problem for sums of squares can depend on the base field. More precisely, we construct an explicit formula of type $[12,12,18]$ over every field of characteristic different from $2$ in which $-1$ is a square, whereas no such formula exists over any formally real field. In particular, a formula of this type exists over $\mathbb Q(i)$ and over $\mathbb C$, but not over $\mathbb Q$ or over $\mathbb R$. This settles, in the negative, a longstanding conjecture of Shapiro from 1984, a conjecture of Adem from 1975, and answers a signed-formula problem raised by Shapiro in 2000.
Read the full abstract

Mathematical Physics

Reflection Symmetry, APS Boundary Conditions, and Equivariant Spectral Flow on a Warped Cylinder

We study reflection symmetry and Atiyah-Patodi-Singer (APS) boundary conditions for twisted Dirac operators on a finite warped cylinder. For a complex line twist with holonomy parameter $A$, we show that the reflection lifts to a unitary symmetry of the twisted Dirac setting if and only if $2A\in\mathbb Z$. In the resulting reflection-compatible fixed-holonomy case, reflection pairs opposite shifted angular modes, and the paired APS blocks are unitarily equivalent. The reflection trace on the APS harmonic space localizes to the unique self-paired zero-mode sector. We then turn to parameter-dependent versions of the model. For fixed gauge-trivial holonomy, the family remains pointwise \(O(2)\)-equivariant, and its spectral flow admits an \(RO(O(2))\)-valued decomposition. For genuinely varying holonomy, pointwise \(O(2)\)-equivariance is lost along the path. The representation-ring-valued invariant is then replaced by a residual sign-level invariant: the mod-two parity of the APS crossing events.
Read the full abstract

Optimization and Control

Learning-Based Stackelberg Equilibrium Seeking with Application to Demand-Side Energy Management

Demand-side management (DSM) enables distribution system operators (DSOs) to steer electricity consumption through dynamic price signals or incentive mechanisms, thereby leveraging end-users' flexibility potential for delivering grid services. The resulting hierarchical interaction between the DSO and the end-users can be formulated as a Stackelberg game, where the operator dynamically sets the prices and the end-users optimally respond to them. Efficiently designing these price signals is challenging, as the users' response models are unknown or difficult to estimate. In this paper, we propose a learning-based zeroth-order algorithm for incentive design, in which the iterative update of the incentive signals is efficiently assisted by a data-driven online estimation of the users' responses. The proposed method is then proven to converge to an equilibrium tariff while allowing the DSO to estimate the decision-making problems at the user level. Moreover, the method preserves users' privacy, as the update rule of the DSO is solely based on observations of communicated end-user actions. Numerical simulations employing real-world data illustrate the efficient convergence of our learning-based proposed method, while significantly reducing the number of required interactions between the DSO and the end-users with respect to the state-of-the-art approach.
Read the full abstract

All authors Silvia Cianchi, Reza Rahimi Baghbadorani, Anibal Sanjab, Sergio Grammatico

Numerical Analysis · Cross-listed from eess.SP

Local Geometry of Least Squares for Unmixing Signals with Parameter-Dependent Dictionaries

Modeling signals as linear combinations of atoms from a dictionary is ubiquitous in modern signal processing. In the finite-dimensional setting, whenever atoms depend nonlinearly upon unknown parameters, the signal model is said to be separable. In this work, we study least-squares reconstruction of separable signals and establish a unified theoretical framework for their analysis. We introduce the unmixing metric, a distance that captures the distinct roles and sensitivities of linear and nonlinear parameters, and establish local convergence and stability guarantees under its topology. We then analyze variable projection from a geometric perspective, showing that it corresponds to restricting the optimization to the manifold of optimal linear parameters. This viewpoint provides a principled explanation for the improved algorithmic behavior of variable projection observed in practice, and produces sharp theoretical guarantees. The generic theory for separable problems is specialized to the case of point spread function (PSF) unmixing. We introduce a parametric notion of coherence and show that support separation directly controls both the size of the convergence region and the stability of recovery. Numerical experiments corroborate the theoretical predictions and demonstrate the practical relevance of the proposed framework.
Read the full abstract

Algebraic Geometry

A new family of weighted double Hurwitz numbers and a new ELSV-type formula with $\Omega$-classes

We analyze a new family of weighted double Hurwitz numbers that was introduced as a notable example in the context of the $x-y$ duality for logarithmic topological recursion. We use this family to systematically demonstrate, refine and develop techniques that play a crucial role in the interaction of hypergeometric (Orlov–Scherbin) KP tau functions and intersection theory of moduli spaces of curves. In particular, we discuss the subtleties related to the derivation of the ELSV-type formulas in this context and derive a new, explicit ELSV-type formula in terms of the so-called $\Omega$-classes.
Read the full abstract

All authors Alexander Alexandrov, Boris Bychkov, Petr Dunin-Barkowski, Maxim Kazarian, Sergey Shadrin

Optimization and Control · Cross-listed from stat.ML

Gradient Regularized Newton Boosting Trees with Global Convergence

Gradient Boosting Decision Trees (GBDTs) dominate tabular machine learning, with modern implementations like XGBoost, LightGBM, and CatBoost being based on Newton boosting: a second-order descent step in the space of decision trees. Despite its empirical success, the global convergence of Newton boosting is poorly understood compared to first-order boosting. In this paper, we introduce Restricted Newton Descent, which studies convex optimization with Newton's method on Hilbert spaces with inexact iterates, based on the concepts of cosine angle and weak gradient edge. Within this framework, we recover Newton boosting with GBDTs and classical finite-dimensional theory as special cases. We first prove that vanilla Newton boosting achieves a linear rate of convergence for smooth, strongly convex losses that satisfy a Hessian-dominance condition. To handle general convex losses with Lipschitz Hessians, we extend a recent gradient regularized Newton scheme to the restricted weak learner setting. This scheme minimally modifies the classical algorithm by introducing an adaptive $\ell_2$-regularization term proportional to the square root of the gradient norm at each iteration. We establish a $\mathcal{O}(\frac{1}{k^2})$ rate for this scheme, thereby obtaining a globally convergent second-order GBDT algorithm with a rate matching that of first-order boosting with Nesterov momentum. In numerical experiments, we show that our scheme converges while vanilla Newton boosting may diverge.
Read the full abstract

All authors Nikita Zozoulenko, Daniel Falkowski, Thomas Cass, Lukas Gonon

Information Theory

Linear KL-Optimal Frequency Normalisation

Fast implementations of range coding and asymmetric numeral systems (ANS) owe their excellent performance to replacing slow division instructions by bit-shifts in their encoding and decoding algorithms. This is possible when the frequency distribution of symbols is normalised such that it sums to a power of two. However, such normalisation typically introduces a marginal increase in the Kullback-Leibler divergence between the original and the normalised distribution, leading to a worse compression ratio. We show that the currently used methods for frequency normalisation are suboptimal in both their running time and the achieved Kullback-Leibler divergence. We propose a new method for frequency normalisation that is asymptotically linear in the number of symbols and achieves the smallest possible Kullback-Leibler divergence between the original and the normalised distribution. The method is based on a solution to a separable concave optimisation problem, which may be of independent interest.
Read the full abstract

Number Theory

Exponent-one blockers and a Mordell-Weil construction of Euler bricks

A body cuboid is a rectangular parallelepiped with integer edges and integer face diagonals; if its space diagonal is also integer, it is a perfect cuboid, whose existence is a long-standing open problem. We make two contributions to the study of body cuboids parametrised by two coprime Pythagorean pairs $(a,b)$ and $(m,n)$ in Euclid form (Master-Hits). The first is a verified exponent-one blocker phenomenon: for every Master-Hit, the space-diagonal norm $f_1 := (W_1 U_2)^2 + (U_1 V_2)^2$ admits a prime divisor $\ell$ of exponent exactly one which is coprime to a fixed list of $29$ canonical expressions in the parameters. This is strictly stronger than the existence of any odd-exponent prime divisor: a prime of exponent $3, 5, \ldots$ would obstruct $f_1$ from being a square but carry an extra square factor; the observed obstruction is always primitive. The phenomenon is verified on all $151{,}575$ Master-Hits whose $f_1$ has been fully factorised. Two natural strengthenings fail: the largest outside-parameter prime need not be a blocker, and the smallest outside-parameter blocker need not have exponent one. The second contribution uses the elliptic fibration of the Master-Hit variety over the $(m,n)$-plane. For coprime $(m,n)$ the Master-Hit equation defines a genus-one quartic $H_{m,n}$; a quartic-to-Weierstrass normalisation gives an elliptic model $E_{m,n}$ with a rational function $\tau$ returning $t^2$. Our generator enumerates bounded Mordell-Weil combinations on $E_{m,n}(\mathbb{Q})$, lifts the points satisfying $\tau(P) \in \mathbb{Q}_{>0}^{\square}$ to admissible Euclid pairs $(a,b)$, and certifies each via exact integer arithmetic. From $61{,}829$ classical Master-Hits we generate $1{,}222{,}841$ further ones über $411$ fibres. None of the resulting $1{,}284{,}670$ Master-Hits is a perfect cuboid; all fully factored records satisfy the exponent-one blocker phenomenon.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

Instance-Aware Parameter Configuration in Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem

Algorithm performance in combinatorial optimization is highly sensitive to parameter settings, while a single globally tuned configuration often fails to exploit the heterogeneity of instances. This limitation is particularly evident in the Electric Capacitated Vehicle Routing Problem, where instances differ in structure, demand patterns, and energy constraints. This paper investigates instance-aware parameter configuration for Bilevel Late Acceptance Hill Climbing, a state-of-the-art metaheuristic for the Electric Capacitated Vehicle Routing Problem. An offline tuning procedure is used to obtain instance-specific parameter labels, which are then mapped from instance features via a regression model to enable parameter prediction for unseen instances prior to execution. Experimental results on the IEEE WCCI 2020 benchmark and its extensions show that the proposed approach achieves an average objective value reduction of $0.28\%$ across eight held-out test instances relative to a globally tuned configuration. This corresponds to a significant cost reduction in multimillion-dollar transportation operations.
Read the full abstract

All authors Yinghao Qin, Xinwei Wang, Mosab Bazargani, Jun Chen

Analysis of PDEs

Asymptotic profiles for the Cauchy problem of semilinear beam equation with two variable coefficients in the subcritical case

In this article, we investigate the asymptotic profile of solutions to the Cauchy problem for a nonlinear beam equation with two variable coefficients in the subcritical nonlinear case. In contrast to our previous result [6], in which the asymptotic profile is governed by the linear heat kernel and the nonlinear effect is asymptotically negligible, the asymptotic profile in the present setting is described by a self-similar solution to the associated nonlinear parabolic equation (constructed in Brezis-Peletier-Terman [1]). The proof relies on delicate energy estimates in weighted spaces formulated in parabolic self-similar variables.
Read the full abstract

Mathematical Physics · Cross-listed from cs.LG

Beyond Continuity: Simulation-free Reconstruction of Discrete Branching Dynamics from Single-cell Snapshots

Inferring cellular trajectories from destructive snapshots is complicated by the challenges of stochasticity and non-conservative mass dynamics such as cell proliferation and apoptosis. Existing unbalanced Optimal Transport (OT) methods treat mass as a continuous fluid, performing inference at the population level. However, this macroscopic view often fails to capture the discrete, jump-like nature of birth-death events at single-cell resolution, which is essential for understanding lineage branching and fate decisions. We present Unbalanced Schrödinger Bridge (USB), a simulation-free framework for learning underlying dynamics that effectively integrates both stochastic and unbalanced effects which also models the discrete, jump-like birth-death dynamics at single-cell resolution. Theoretically, USB provides a tractable solution to the Branching Schrödinger Bridge (BSB) problem, offering a rigorous microscopic interpretation where individual cells undergo both Brownian motion and discrete birth-death jumps. Technically, the method implements an efficient solver by introducing a simulation-free training objective that effectively scales to high-dimensional omics data. Empirically, we demonstrate on both simulated and real-world datasets that USB not only achieves trajectory reconstruction performance better than or comparable to deterministic baselines but also uniquely enables realistic discrete simulation of birth-death dynamics at single-cell resolution.
Read the full abstract

All authors Junda Ying, Yuxuan Wang, Bowen Yang, Peijie Zhou, Lei Zhang

Probability

Convergence of the Condensing Symmetric Inclusion Process on the Torus in the Thermodynamical Limit to Coalescing Brownian Motions

We investigate the saturation regime of the condensing symmetric inclusion process on the discrete one-dimensional torus in the thermodynamical limit. In this regime, the total mass concentrates on a finite number of sites, forming condensates. Our main result establishes that, under appropriate scaling, the positions of the condensates converge to a system of coalescing Brownian motions on the continuum torus. In particular, condensates perform diffusive motion until they meet, at which point they merge and their masses coagulate. This provides a rigorous derivation of a macroscopic coalescing diffusion from an underlying interacting particle system with condensation. The main technical difficulty arises from the complicated coalescence mechanism of two condensates of particles, whose trajectories are very difficult to track completely. The key idea is to control the coalescing time instead and prove that it is negligible compared to the time-scale of condensate movement. By combining this with precise estimates of movements without coalescence, we can prove its convergence to coalescing Brownian motions.
Read the full abstract

Algebraic Topology

Scissors automorphism groups II: Solomon-Tits theorems

The Solomon-Tits theorem says that the poset of proper non-trivial subspaces of a finite-dimensional vector space has realisation equivalent to a wedge of spheres. In this paper we prove a variant of this result for collections of geodesic subspaces of Euclidean, hyperbolic, or spherical geometry, assuming the collection is generated either by points or by hyperplanes. In the third paper of this series of papers, we will combine this with the homological stability theorems from the first paper to compute the homology of groups of scissors automorphisms in these geometries.
Read the full abstract

All authors Alexander Kupers, Ezekiel Lemann, Cary Malkiewich, Jeremy Miller, Robin J. Sroka

Probability

Royen's proof of the Gaussian correlation inequality as a supersymmetric dimensional reduction

We revisit Royen's proof of the Gaussian correlation inequality from a supersymmetric point of view. Many key elements in Royen's proof of this inequality have natural geometric interpretations in terms of supersymmetric dimensional reduction from $\mathbb{R}^{3|2}$ to $\mathbb{R}^{1|0}$. In particular, the auxiliary multivariate Gamma distributions appearing in Royen's Laplace-transform argument arise naturally as the body of a supersymmetric radial variable on $\mathbb{R}^{3|2}$. The generalization to the half-integer multivariate Gamma case also follows naturally as a dimensional reduction from $\mathbb{R}^{k+2|2}$ to $\mathbb{R}^{k|0}$, and we derive an exact interpolation identity for general smooth test functions. This provides an example in which the supersymmetric localization method is applied to prove correlation inequalities with continuous interpolation.
Read the full abstract

Optimization and Control

Linking PageRank, Time Reversal, and Policy Evaluation

We establish a connection between policy evaluation in Markov decision processes and PageRank in network analysis. For a fixed policy, we show that the value function of a discounted Markov decision process can be obtained, up to an explicit rescaling, from the PageRank vector of a suitably defined time-reversed Markov chain. In this correspondence, the discount factor plays the role of the teleportation parameter, while rewards induce the restart distribution. Beyond the irreducible case, invoking quasi-stationary distributions and Doob $h$-transforms, we prove a general decomposition theorem showing that policy evaluation for arbitrary finite MDPs reduces to a collection of PageRank problems on the recurrent and transient components of the policy-induced Markov chain. This framework naturally extends to undiscounted MDPs with terminal states and to transition-dependent rewards. We conclude by showing efficiency of our approach on a numerical example of a sticky random walk on large deterministic and random graphs.
Read the full abstract

Functional Analysis

A new approach to interpolation of compact linear operators

We prove an abstract theorem on keeping the compactness property of a linear operator after interpolation in Banach spaces. Our approach consists of two features. Applying the principle "reductio ad absurdum," we obtain a possibility to carry out all proofs only for some specially constructed subspaces of the given spaces, e.g., having a common Schauder basis. As a second feature, we consider in all assertions only embedding operators obtaining the full result just at the end of the paper. No analytical presentation of operators, spaces and interpolation functors is required and the complex method is admissible as a particular case.
Read the full abstract

Differential Geometry

Horocyclic evolutes, parallels and involutes of spacelike frontals in hyperbolic 2-space

The horocyclic evolutes of spacelike frontals in hyperbolic 2-space have already been defined. Using enveloid theorem, we now define the horocyclic parallel and involute of a spacelike frontal in hyperbolic 2-space as the normal envelopes of its normal and tangent horocycles, respectively. Meanwhile, we investigate the relations among horocyclic evolutes, parallels and involutes.
Read the full abstract

Combinatorics

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers

The inertia bound, introduced by Cvetković in 1971, is a fundamental result in spectral graph theory that provides an upper bound for the independence number of a graph in terms of spectral information about a weighted adjacency matrix of the graph. Recently, this bound has been extended to the so-called inertia-type bounds for estimating the independence and chromatic numbers of graph powers ($k$-independence number and distance-$k$ chromatic number of a graph). These bounds have recently found applications in coding theory and quantum information theory. The inertia-type bounds depend on the choice of a polynomial of degree $k$ and on the eigenvalues of the graph. Currently, optimizing these bounds requires solving several MILPs, which quickly becomes computationally demanding as the graph size or $k$ grows. This computational barrier is a major obstacle to the practical use of these bounds. Moreover, we have a limited theoretical understanding of their performance, even for small $k$. In this paper, we investigate their optimization and complexity. In particular, we improve the MILP formulations, reducing their computational burden and significantly decreasing the running time. Furthermore, we show that the optimization problems associated with the bounds are solvable in polynomial arithmetic time for every fixed $k$, given exact spectral input.
Read the full abstract

Logic

Intuitionistic Common Knowledge

We study an intuitionistic version of common knowledge logic (CK), called ICK, which was introduced by Jäger and Marti. ICK extends intuitionistic propositional logic (IPL) by multiple box modalities interpreted as knowledge operators for various agents and a common knowledge operator. Formulae are interpreted over birelational Kripke models satisfying a simple interaction principle between the intuitionistic order and the modal accessibility relations. Furthermore, we consider the restriction to reflexive, S4 and S5 models. We present axiomatizations as well as analytic cyclic sequent calculi for all considered logics and prove them to be sound and complete. Furthermore, we establish the finite model property and decidability, show that proof-search in the cyclic calculi can be automated, provide a translation of CK over S5 into ICK over S5 and establish that the proof-search and validity problems of all considered logics can be solved in exponential time.
Read the full abstract

Quantum Algebra · Cross-listed from gr-qc

Time-slicing quantum spacetimes

For quantum field theory on curved spacetimes, a critical role is played by their foliation into spacelike time-slices at each value $t$ of a coordinate time, with corresponding metric in ADM form. We provide a general construction for the spacetime quantum Levi-Civita connection when each spatial slice is replaced by a quantum Riemannian geometry. This is then fully solved for a class of spatial algebras including fuzzy spheres and for any time-dependent spatial quantum metric, shift 1-form and lapse function. The result takes a particularly simple form if the spatial metric evolves in time according to a first order ODE which, in the case of a fuzzy sphere, requires the spatial metric to rotate in time according to the value at each $t$ of the shift vector. As an application, our results provide in principle fuzzy versions of most (pseudo)-Riemannian manifolds. We also fully solve the case of rotationally invariant spacetimes with angular directions replaced by a discrete circle, including a new $\Bbb Z_n$-FLRW model.
Read the full abstract