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)

Thursday 7 May

Combinatorics

Point sets avoiding near-integer distances

Let $d \in \mathbb{N}$, $\delta \in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, \delta)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least $\delta$ away from any integer. In the planar case, Sárközy proved that for every $\varepsilon > 0$, $N_2(X, \delta) = \Omega_\delta(X^{1/2-\varepsilon})$ as $X \rightarrow \infty$ whenever $\delta$ is sufficiently small in terms of $\varepsilon$, while Konyagin proved the almost matching upper bound $N_2(X,\delta) = O_\delta(X^{1/2})$. We study this problem in higher dimensions, addressing a question of Erdős and Sárközy. Extending Sárközy's construction, we show that for every $\varepsilon > 0$, $N_3(X, \delta) = \Omega_\delta(X^{1-\varepsilon})$ for $\delta$ sufficiently small in terms of $\varepsilon$. We also provide a lifting lemma from integer distance sets to sets avoiding near-integer distances via bilipschitz embeddings of snowflaked Euclidean spaces. This allows us to prove a linear lower bound $N_4(X,\delta) = \Omega_\delta(X)$ for all sufficiently small $\delta$. Finally, adapting Konyagin's approach, we prove the upper bound $N_d(X, \delta) = O_{d, \delta}(X^{d/2})$ for all $d \in \mathbb{N}$.
Read the full abstract

Symplectic Geometry

Bulk-deformations, Floer complex bordism, and Grothendieck-Riemann-Roch

Given a Liouville manifold, we compute a Floer-homotopical invariant – the complexification of the lift of symplectic cohomology to complex cobordism – in terms of a classical Floer-theoretic invariant, namely, symplectic cohomology bulk-deformed by the Chern character. We do this by giving an explicit model for the complexified homotopy groups of the MU-module spectrum associated to a complex-oriented flow category and proving a “homotopy coherent” version of the classical Grothedieck-Riemann-Roch theorem. Using the aforementioned relation, we establish a computable cohomological criterion, in terms of the pair-of-pants product and the BV operator on symplectic cohomology, for when this MU lift cannot be obtained via base change from the sphere spectrum; moreover, we give examples where this holds. Finally, we use this non-base change criterion to detect examples of non-trivial higher-dimensional complex cobordism classes of relative Gromov-Witten type moduli spaces in the context of a smooth complex projective variety relative to an ample smooth divisor.
Read the full abstract

Optimization and Control

MTRBO: Multiple trust-region based Bayesian optimization

Bayesian Optimization (BO) is a popular framework for optimizing black-box functions. Despite its effectiveness, BO is often inefficient for high-dimensional problems due to the exponential growth of the search space, heterogeneity of the objective function, and low sampling budget. To overcome these issues, this work proposes a multiple trust region-based Bayesian optimization technique(MTRBO). A trust region is a localized region within which an optimization model is trusted to approximate the objective function accurately. Assuming a Gaussian process (GP) as a prior belief about the objective function and based on the posterior mean and variance functions, the method adaptively exploits near the promising current solution inside a trust region. Also explores the most uncertain region in the search space inside another trust region. The theoretical global convergence property of the proposed method is established. Then the work is benchmarked against other state-of-the-art trust-region-based Bayesian optimization algorithms, demonstrating superior performance on a variety of non-convex and high-dimensional test functions. The proposed method outperforms others in terms of solution quality within the sampling budget (the number of function evaluations). The proposed method is applied to the portfolio optimization problem to verify its applicability in real-world scenarios.
Read the full abstract

Commutative Algebra

Connectedness in Codimension One and the Non-$S_2$ Locus

We formulate a structural principle for finite $S_2$-objects: coherent $S_2$-sheaves and finitely generated graded $S_2$-modules decompose canonically according to the connected components in codimension $1$ of their support. This gives criteria relating indecomposability of $S_2$-objects to connectedness in codimension $1$ of their supports, and extends the Hochster–Huneke correspondences for complete local rings between connectedness in codimension $1$, indecomposability of canonical modules, and localness of the $S_2$-ifications. As a consequence, if $A$ is a local ring admitting a canonical module $\omega_A$, there are canonical decompositions of both $\omega_A$ and the $S_2$-ification $\operatorname{End}_A(\omega_A)$ whose indecomposable summands are the canonical modules and $S_2$-ifications of the quotient rings associated to the connected components in codimension $1$. We then apply this viewpoint to the non-$S_2$ locus. For $A$ equidimensional and unmixed, this locus is naturally realized as $\operatorname{Supp}_A C$ via the $S_2$-ification sequence $0 \to A \to \operatorname{End}_A(\omega_A) \to C \to 0$. The natural map between deficiency modules $K^{\dim C+1}(A)\to K^{\dim C}(C)$ identifies the canonical module $K^{\dim C}(C)$ with the $S_2$-hull of $K^{\dim C+1}(A)$. Under suitable conditions, this allows codimension-$1$ connectedness of the non-$S_2$ locus to be detected by the deficiency module $K^{\dim C+1}(A)$. We illustrate the theory with examples and apply it to codimension $2$ lattice ideals, obtaining connectedness-in-codimension-$1$ results for the non-$S_2$ loci of certain toric and lattice rings.
Read the full abstract

Combinatorics · Cross-listed from cs.DM

Adjacency labelling for proper minor-closed graph classes

We show that every proper minor-closed class of graphs admits a $(1+o(1))\log_2 n$-bit adjacency labelling scheme. Equivalently, for every proper minor-closed class $\mathcal{G}$ and every positive integer $n$ there exists an $n^{1+o(1)}$-vertex graph $U$ such that every $n$-vertex graph in $\mathcal{G}$ is isomorphic to an induced subgraph of $U$. Both results are optimal up to the lower order term. They generalize the corresponding results for planar graphs and apex-minor-free classes (Dujmović et al., J.~ACM 2021) to all proper minor-closed classes, answering the open question raised in that paper and anticipated earlier by Bonamy, Gavoille, and Pilipczuk (SODA 2020).
Read the full abstract

All authors Vida Dujmović, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood

Optimization and Control · Cross-listed from cs.LG

When and Why SignSGD Outperforms SGD: A Theoretical Study Based on $\ell_1$-norm Lower Bounds

Sign-based optimization algorithms, such as SignSGD and Muon, have garnered significant attention for their remarkable performance in training large foundation models. Despite this empirical success, we still lack a theoretical understanding of when and why these sign-based methods outperform vanilla SGD. The core obstacle is that under standard smoothness and finite variance conditions, SGD is known to be minimax optimal for finding stationary points measured by $\ell_2$-norms, thereby fundamentally precluding any complexity gains for sign-based methods in standard settings. To overcome this barrier, we analyze sign-based optimizers leveraging $\ell_1$-norm stationarity, $\ell_\infty$-smoothness, and a separable noise model, which can better capture the coordinate-wise nature of signed updates. Under this distinct problem geometry, we derive matched upper and lower bounds for SignSGD and explicitly characterize the problem class in which SignSGD provably dominates SGD. Specifically, we compare the upper bound of SignSGD with the lower bound of SGD, illustrating that SignSGD effectively reduces the complexity by a factor of $d$ under sparse noise, where $d$ is the problem dimension. Furthermore, we elevate this framework to the matrix domain, providing an equivalent optimal lower bound for the Muon optimizer, proving that extending the sign operator to matrices preserves this optimal scaling with dimensionality. Finally, we bridge our theoretical bounds to practice, demonstrating that the theoretical superiority of SignSGD accurately predicts its faster convergence during the pretraining of a 124M parameter GPT-2 model.
Read the full abstract

Analysis of PDEs

Master equations with an individual noise on finite state graphs

We develop a classical well-posedness and regularity theory on a finite connected weighted graph for an extended mean field game system, its associated master equation, and a Hamilton-Jacobi- Bellman equation on the probability simplex, all in the presence of an individual noise operator. The geometric structure is inherited from the logarithmic-mean activation functional of discrete optimal transport, under which the entropic Fokker-Planck equation appears as a gradient flow on the graph and the individual noise operator is a bilinear form in the probability vector and the Wasserstein gradient. A central technical step is a quantitative preservation-of-positivity estimate for the discrete continuity equation, which rules out finite-time boundary degeneracy and yields a classical solution theory for the master equation on the open simplex without imposing any boundary condition. As an application, we recover a Nash equilibrium interpretation of the discrete system in terms of Markov chains on the graph. Our setup is inspired by the computational algorithms for optimal mass transport of [10, 11] and provides a rigorous well-posedness theory for several of the equations derived in [25].
Read the full abstract

All authors Wilfrid Gangbo, Sebastian Munoz, Jeremy Wu, Zhaoyu Zhang

Optimization and Control · Cross-listed from cs.LG

Learning Distributionally Robust First-Order Methods for Convex Optimization

We propose a distributionally robust approach to learning hyperparameters (e.g., step sizes and momentum coefficients) for first-order methods in convex optimization. Given a dataset of problem instances, we minimize a Wasserstein distributionally robust version of the performance estimation problem (PEP). Our framework unifies two extremes. As the robustness radius vanishes, we recover classical learning to optimize (L2O), and as it grows we recover the PEP worst-case algorithm design problem. We solve the resulting problem with stochastic gradient descent, differentiating through the solution of an inner semidefinite program at each step. We prove high-probability bounds showing that the true risk of the learned algorithm is at most the in-sample L2O optimum plus a slack that shrinks with the sample size, and is no worse than the worst-case PEP bound. On logistic regression, LASSO, and linear programming examples, our learned algorithms achieve strong out-of-sample performance with certifiable robustness, outperforming both worst-case optimal and vanilla L2O baselines.
Read the full abstract

Information Theory

Generalized Skew Multivariate Goppa Codes

We introduce Generalized Skew Multivariate Goppa codes relying on the theory of multivariate Ore polynomials. These codes contain Generalized Skew Goppa codes as a special case. By providing a new parity-check matrix for the latter, we show that they are subfield subcodes of duals of Generalized Skew Reed–Solomon codes, up to the inverse field automorphism. This result is then used to study the parameters of Skew Multivariate Goppa codes, for which we provide bounds on their dimension and minimum distance.
Read the full abstract

Functional Analysis

Common frequently hypercyclic random vectors

We study common frequently hypercyclic vectors for countable families of weighted backward shifts acting on $\ell_p$ spaces, $1\leq p<\infty$. Using probabilistic techniques, we develop a general existence criterion, complemented by a non-existence result. These insights are then applied to the specific setting of countable families of polynomials of weighted backward shifts, providing conditions under which they share a common frequently hypercyclic vector.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CV

Solving Minimal Problems Without Matrix Inversion Using FFT-Based Interpolation

Estimating camera geometry typically involves solving minimal problems formulated as systems of multivariate polynomial equations, which often pose computational challenges when using existing Gröbner-basis or resultant-based methods due to matrix inversion needed in the online solver. Here we propose a sampling-based, matrix inversion-free method that constructs the solvers using sparse hidden-variable resultants. The determinant polynomial in the hidden variable is efficiently reconstructed via inverse fast Fourier transform interpolation from sampled evaluations, avoiding symbolic expansion. Solving this polynomial yields the hidden variable, and the remaining unknowns are recovered by identifying rank-1 deficient submatrices and applying Cramer's rule. A greatest common divisor-based criterion ensures robust submatrix identification under noise. Experiments on diverse minimal problems demonstrate that the proposed solver achieves strong numerical stability and competitive runtime, particularly for small-scale problems, providing a practical alternative to traditional Gröbner-basis and resultant-based solvers.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

SNAPO: Smooth Neural Adjoint Policy Optimization for Optimal Control via Differentiable Simulation

Many real-world problems require sequential decisions under uncertainty: when to inject or withdraw gas from storage, how to rebalance a pension portfolio each month, what temperature profile to run through a pharmaceutical reactor chain. Dynamic programming solves small instances exactly but scales exponentially in state dimensions. Black-box reinforcement learning handles high-dimensional states but trains slowly and produces no sensitivities. We introduce SNAPO (Smooth Neural Adjoint Policy Optimization), a framework that embeds a neural policy inside a known, differentiable simulator, replaces hard constraints with smooth approximations, and computes exact gradients of the objective with respect to all policy parameters and all inputs in a single adjoint pass. We demonstrate SNAPO on three domains: natural gas storage (training in under a minute, 365 forward curve sensitivities at no additional cost per sensitivity), pension fund asset-liability management (6.5x-200x sensitivity speedup over bump-and-revalue, scaling with the number of risk factors), and pharmaceutical manufacturing (cross-unit sensitivities through a 4-unit process chain, with 20 ICH Q8 regulatory sensitivities from 5 adjoint passes in 74.5 milliseconds). All sensitivities are produced by the same backward pass that trains the policy, at a cost proportional to one reverse pass regardless of how many sensitivities are computed.
Read the full abstract

Analysis of PDEs

Equidistribution of Eigenfunctions of Quantum Cat Maps

We prove that the short-period eigenfunctions of quantum cat maps constructed by Kim and the author equidistribute on $\mathbb{T}^2$ in the sense of semiclassical measures. We also show that their logarithmically large $\ell^\infty$-norm is asymptotically concentrated on a bounded number of coordinates. Thus, for this explicit family, strong coordinate localization coexists with semiclassical equidistribution. These results confirm the behavior suggested by earlier numerical evidence of Kim and the author, and contrast with the scarring phenomena for short-period eigenfunctions observed by Faure, Nonnenmacher, and De Bièvre.
Read the full abstract

Geometric Topology

Minimal Homotopies in Three Dimensions: A Cable System Approach

We study null homotopies of immersed spheres in $\mathbb{R}^3$ and the volume they sweep during contraction. For a smooth immersion with finitely many transverse self-intersections, we introduce a cable system that connects each bounded region of the complement to the exterior. From this construction we define the cable index and prove that it agrees with the Brouwer degree on each complementary region. Using this identification, we derive a degree-weighted lower bound for the swept volume of any Lipschitz null homotopy. We show that the bound is attained whenever the homotopy is sense-preserving, meaning the surface moves in a consistent direction, and the index evolves monotonically along the homotopy. In addition, in the case where the immersion arises as the boundary of an immersed ball, we construct an explicit homotopy that realizes this lower bound via a deformation of the ball. Finally, we present a linear-time algorithm that computes all cable indices from a finite cable system, providing a concrete and computable method for evaluating the lower bound.
Read the full abstract

Probability

Probability of Quota Violations in Divisor Apportionment Methods with Nonzero Allocations

Apportionment assigns indivisible items among groups. By the Balinski-Young theorem, no method can satisfy both house monotonicity and the quota rule. This paper investigates quota violations caused by nonzero allocation constraints, and derives exact probability formulas for their frequency. Such violations occur in systems like the U.S. House of Representatives, where each state is guaranteed at least one seat. We analyze the three-state case, introduce the $\tau$ statistic to parametrize population distributions, and prove an Asymptotic Quota Stabilization theorem: for fixed $\tau$, quota behavior stabilizes as populations grow, yielding probability results for quota violations determined by the set of ultimately violatory $\tau$ values. Applying this framework to the five classical divisor methods, we derive exact probability formulas. Additionally, we show that as the number of seats $M \to \infty$, these probabilities converge to method-specific constants. These results provide a precise, quantitative foundation for evaluating the fairness and frequency of quota violations in constrained apportionment systems.
Read the full abstract

Optimization and Control

Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions

We study stochastic zeroth-order optimization with decision-dependent distributions, where the sampling law depends on the current decision and only noisy function values are available. For the non-smooth non-convex setting, we establish an explicit convergence guarantee for finding a $(\delta,\epsilon)$-Goldstein stationary point with stochastic zeroth-order oracle (SZO) complexity of $\mathcal{O}(d^2\delta^{-3}\epsilon^{-3})$. In addition, we show that the above complexity can be achieved with single SZO feedback per iteration. We further extend the analysis to smooth and Hessian-Lipschitz objectives, obtaining complexities $\mathcal{O}(d^2\epsilon^{-6})$ and $\mathcal{O}(d^2\epsilon^{-9/2})$, respectively. In the Hessian-Lipschitz case, this improves the best-known dependence on $\epsilon$ for decision-dependent zeroth-order methods by a factor of $\epsilon^{-1/2}$.
Read the full abstract

All authors Chengchang Liu, Zongqi Wan, Haishan Ye, John C.S. Lui

Information Theory

Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction

Quantum low-density parity-check codes are promising candidates for low-overhead fault-tolerant quantum computing, but degeneracy is known to impair the convergence of belief-propagation (BP) decoding of these codes. In this work, we show that appending linearly independent rows to a check matrix of a stabilizer code can reduce the search space for a valid degenerate solution. Motivated by this, we extend the recently proposed affine subcode ensemble decoding technique from the classical to the quantum setting. Moreover, we employ overcomplete matrices for each decoding path. Monte-Carlo simulations on toric and generalized bicycle codes demonstrate improved convergence and reduced logical error rate.
Read the full abstract

All authors Leo Wursthorn, Jonathan Mandelbaum, Sisi Miao, Hedongliang Liu, Holger Jäkel, Stergios Koutsioumpas, Laurent Schmalen

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

A Rayleigh criterion for mechanical instability: inducing activity by chemo-mechanical coupling

Instabilities in thermodynamic systems are often undesirable, as they can lead to loss of control or even catastrophic behavior. Yet, the same mechanisms can also generate rich nonequilibrium behavior and may play a constructive role in living systems. We introduce a theoretical framework, inspired by Rayleigh's analysis of thermoacoustic instabilities, to study the emergence of mechanical activity. In particular, we derive Rayleigh-like criteria governing the onset of activity and the generation of rotational motion in a slow Newtonian probe coupled to driven chemical processes, described by Markov jump processes. These criteria are expressed in terms of the phase relation between entropic and frenetic contributions, providing a transparent condition for when chemical driving results in sustained rotational or active mechanical motion.
Read the full abstract

Numerical Analysis · Cross-listed from physics.flu-dyn

Reduced-Order Modeling of Parameterized Visco-Plastic Shallow Flows

We propose a non-intrusive reduced-order modeling framework for parametrized visco-plastic free-surface flows governed by a shallow-water formulation of Herschel–Bulkley fluids. These flows exhibit strong nonlinearities, non-smooth rheology, moving fronts, and yield surfaces, making efficient surrogate modeling particularly challenging. To address this challenge, we employ a tensor-based approach in which the solution manifold is approximated using a low-rank representation obtained via higher-order singular value decomposition of snapshot data over a structured parameter space. The resulting tensorial reduced-order model (TROM) enables rapid online evaluation by directly reconstructing solution trajectories from the compressed representation, thereby avoiding the need to perform time integration of a reduced dynamical system. The proposed non-intrusive framework can be interpreted as an encoder–decoder architecture with a compressed latent representation and efficient multilinear decoding. Numerical experiments demonstrate that the proposed approach accurately captures key flow features, including front propagation, plug and shear regions, and near-stopping dynamics, while achieving substantial computational speedups relative to full-order simulations.
Read the full abstract

Statistics Theory

Time-sensitive anytime-valid testing

Anytime-valid tests allow evidence to be checked during data collection: one can either continue testing or stop and reject the null while still controlling type-I error. Yet, in many applications rejection is useful only if it comes soon enough. We introduce a time-sensitive testing-by-betting framework that favours early rejection by assigning rewards to rejection times and maximising their expected value under a given alternative. This encompasses hard deadlines and softer time preferences. The resulting optimal control problem admits a Bellman representation in terms only of time and evidence against the null, rather than the full history. For hard deadlines, the simple-vs-simple case reduces to a finite-horizon Neyman–Pearson problem and identify the corresponding optimal e-process. Furthermore, we show that exponentially decaying rewards admit a stationary approximation, yielding the exponential-decay-optimal (EDO) criterion: a finite-time-scale counterpart to the classical growth-rate-optimal (GRO) viewpoint in anytime-valid statistics, with the GRO criterion recovered in the large-time-scale limit.
Read the full abstract

All authors Eugenio Clerico, Tobias Wegel, Iskander Azangulov, Patrick Rebeschini

Differential Geometry

Absolute continuity of generalized Wasserstein barycenters of finitely many measures

Consider a complete Riemannian manifold $(M, g)$ and optimal transport problems on it with cost functions of the form $c(x,y) = h(d_{{g}}(x,y))$. We study the absolute continuity of the corresponding generalized Wasserstein barycenters of finitely many marginal measures. For general strictly convex profiles $h$ lacking $\mathcal{C}^2$-smoothness, such as $h(d)= d^p / p$ with $1 < p < 2$ that defines the $p$-Wasserstein space, the singularity at $d=0$ prevents the barycenter from inheriting absolute continuity from a single marginal measure as the quadratic case. To overcome this singularity, recent Euclidean results necessitate the absolute continuity of all marginals. Building upon the approximation framework toward absolute continuity in arXiv:2310.13832, we extend the Euclidean advancements to the manifold setting. Stripping away the implicit reliance on flat translational symmetry and local coordinate calculations of their Euclidean proofs, our work handles the singularity in a geometrically transparent way, revealing the precise analytic condition on the cost profile that governs the necessary assumptions.
Read the full abstract

Optimization and Control

Learning to Cut: Reinforcement Learning for Benders Decomposition

Benders decomposition (BD) is a widely used solution approach for solving two-stage stochastic programs arising in real-world decision-making under uncertainty. However, it often suffers from slow convergence as the master problem grows with an increasing number of cuts. In this paper, we propose Reinforcement Learning for BD (RLBD), a framework that adaptively selects cuts using a neural network-based stochastic policy. The policy is trained using a policy gradient method via the REINFORCE algorithm. We evaluate the proposed approach on a two-stage stochastic electric vehicle charging station location problem and compare it with vanilla BD and LearnBD, a supervised learning approach that classifies cuts using a support vector machine. Numerical results demonstrate that RLBD achieves substantial improvements in computational efficiency and exhibits strong generalization to problems with similar structures but varying data inputs and decision variable dimensions.
Read the full abstract

Algebraic Topology

An algebraic model for rational ultracommutative rings

Given a global equivariant ultracommutative ring spectrum $E$ and inclusion $H\hookrightarrow G$ of finite groups, one may apply geometric fixed points to the norm $N_H^G E_H \to E_G$ to obtain what we call a geometric norm $\Phi^H E \to \Phi^G E$. We prove that, together with inflations, these assemble into a functor $\Phi\colon\mathrm{UCom}_{\mathrm{fin}} \to \mathrm{Fun}(\mathrm{Span}(\mathcal{G},\mathcal{E},\mathcal{O}),\mathrm{CAlg})$, where $\mathrm{Span}(\mathcal{G},\mathcal{E},\mathcal{O})$ is the span category of finite connected groupoids with full backwards maps and faithful forwards maps, and that $\Phi$ restricts to an equivalence between full subcategories of rational objects. Central to our construction is a refinement of geometric fixed points to a natural transformation $\Phi\colon \mathrm{Sp}_\bullet\to\mathrm{Fun}(\mathrm{Orb}_\bullet^\simeq,\mathrm{Sp})$ which is compatible with restrictions and norms, and which restricts to an equivalence on full subcategories of rational objects. We explain how this may also be used to recover theorems of Barrero–Barthel–Pol–Strickland–Williamson and Wimmer on algebraic models for rational global spectra and normed $G$-commutative ring spectra respectively.
Read the full abstract

Probability

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models

We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recently introduced framework of Lelli and Stauffer, we consider a random walk interacting with a dynamical random-cluster environment, in which edges are updated with rate $\mu>0$ according to Glauber dynamics with parameters $p$ and $q$, and the walker moves at rate 1 but may only traverse edges that are present at the time of the move. This setting introduces strong dependencies between the walk and the environment, as edge-update probabilities depend on the global connectivity structure. We focus on the case where the underlying graph is a random $d$-regular graph and the parameters lie in the subcritical regime $p < p_{\mathrm{u}}(q, d)$ where it is known that the Glauber dynamics mixes quickly. Our main result is to show that for any $\varepsilon >0$ and all $q \ge 1$, for all $p$ in the subcritical regime, the mixing time of the joint process is $\Theta(\log n)$ (in continuous time) whenever $\mu\geq \varepsilon \log n$. This matches the mixing time of the simple random walk on a static random regular graph, showing that in this regime the evolving environment does not slow down mixing. Our proof is based on a coupling argument that uses path-count techniques to overcome the dependencies in the edge dynamics by controlling the structure of the environment along typical trajectories.
Read the full abstract

Mathematical Physics

Eigenstates with Infinite Position Moments

We prove necessary and sufficient conditions for the Schrödinger operators to have zero-energy bound states at the threshold of the essential spectrum such that they have bounded $k$-th moment. This result is the extension of the results published in D. Hundertmark, M. Jex, and M. Lange [Forum Mathematics, Sigma 11(2023)].
Read the full abstract

Analysis of PDEs

Sharp local well-posedness for the Hirota-Satsuma system

We establish sharp local existence results for the Hirota-Satsuma system in $H^k(\mathbb{R}) \times H^s(\mathbb{R})$, depending on the ratio between the dispersion of the components. These theorems significantly generalize previous works, which were restricted to the diagonal case of equal regularity $s=k$. Furthermore, we extend the known global well-posedness theory to the off-diagonal regime. The argument relies on the Fourier restriction norm method coupled with the concept of integrated-by-parts strong solution - a framework that generalizes the classical notion of strong solution.
Read the full abstract

Algebraic Topology

A projective resolution of the symplectic Steinberg module

Borel–Serre proved that for a number ring $R$ with fraction field $K$, the symplectic group $\text{Sp}_{2n}(R)$ is a virtual duality group of degree quadratic in $n$, and that the symplectic Steinberg module $\text{St}^\omega_{2n}(K)$ is its dualizing module. We construct a projective resolution of this symplectic Steinberg module as an $\text{Sp}_{2n}(R)$-representation, that is similar in form to a resolution of Lee–Szczarba for the special linear group, but whose construction is more involved. When $R$ is a Euclidean number ring, we use this resolution to compute the top degree cohomology of principal level-$p$ congruence subgroups of $\text{Sp}_{2n}(R)$, for primes $p \in R$ such that the natural map $R^\times \to (R/(p))^\times$ is surjective.
Read the full abstract

Optimization and Control

Global self-optimizing control of batch processes

This work considers to achieve near-optimal operation for a class of batch processes by employing self-optimizing control (SOC). Comparing with a continuous one, a batch process exhibits stronger nonlinearity with dynamics because of the non-steady operation condition. This necessitates a global version of SOC to achieve satisfactory performance. Meanwhile, it also makes the existing global SOC (gSOC) not directly applicable to batch processes due to the causality amongst variables. Therefore, it is necessary to extend the original gSOC to batch processes. In addition to the nonconvexity challenge of the original gSOC problem, the new extension for batch processes has to face even more challenges. Particularly, the causality due to dynamics of batch processes brings in structural constraints on controlled variables (CVs), making a CV selection problem even more difficult. To address these challenges, the gSOC problem is recast in a vectorized formulation and it is proved that the structural constraints considered are linear in the vectorized formulation. Moreover, a novel shortcut method is proposed to efficiently find sub-optimal but more transparent solutions for this problem. The effectiveness of the new approach is validated through a case study of a fed-batch reactor, where CVs are constructed through a combination matrix with a repetitive structure, resulting in a simple SOC scheme. This simplicity facilitates the implementation of the SOC approach and enhances its practical applicability and robustness.
Read the full abstract

All authors Chenchen Zhou, Hongxin Su, Xinhui Tang, Yi Cao, Shuang-hua Yang

Optimization and Control

Confidentiality of Linear Control Systems with Quadratic Output Under Sensor Attacks [Extended Version]

We study the state estimation problem for linear control systems with quadratic outputs which are locally unobservable at the equilibrium. We show that, despite this inherent lack of observability, an adversary with sensor read and write capability can induce observability by injecting an appropriate signal into the measurement channel. Taking the role of an adversary, we characterize when an injected signal can or cannot induce observability and, in the successful case, construct an observer that achieves local exponential convergence of state estimates to the true states of the system. A simulation study demonstrates our results.
Read the full abstract

Probability

Continuous-state branching processes with Lévy-Khintchine drift-interaction: Laplace duality and Fellerian extensions

We investigate the class of continuous-state branching processes with interaction driven by a Lévy-Khintchine type drift (CBDI). These $[0,\infty]$-valued processes capture both dynamics of branching and density-dependence, allowing for cooperation at low population sizes and competition at high densities. Although the interaction breaks the branching property, the Lévy–Khintchine form of the drift induces a Laplace duality. This duality expresses the Laplace transform of a CBDI process in terms of that of another CBDI process, in which the branching and drift-interaction mechanisms are exchanged. The process, stopped upon hitting either boundary $0$ or $\infty$, is uniquely characterized in law by these mechanisms. A Fellerian extension is constructed when the drift is non-Lipschitz and sufficiently strong at a boundary, allowing the process to leave this boundary continuously and possibly re-enter it. We identify parameters, defined in terms of the mechanisms and their associated scale function and potential measure, that determine the boundary behavior at $0$ and $\infty$ (entrance, exit or regular). Settings exhibiting all regimes, including regular-for-itself and non-sticky boundaries, arise when the mechanisms are assumed to be regularly varying. Our approach combines Laplace duality and comparison principles. The duality facilitates the analysis of semigroups and the construction of sharp Lyapunov functions. Comparisons ensure monotonicity and convergence properties of first-passage times.
Read the full abstract