Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 11 March

Dynamical Systems

Zeros of complete elliptic integrals and its application to Melnikov functions

In this paper, we first discuss the linear independence of the complete elliptic integrals of the first, second and third kinds $K(k)$, $E(k)$ and $\Pi(\mu(k),k)$, and then obtain an upper bound for the number of zeros of a function of the form \begin{eqnarray*} p(k)K(k)+q(k)E(k)+r(k)\Pi(\mu(k),k),\ k\in(-1,1), \end{eqnarray*} where $p(k)$, $q(k)$ and $r(k)$ are real polynomials, $\mu(k)$ is a real polynomial or rational function. Finally, we apply it to a Hamiltonian triangle with three invariant straight lines under small real polynomials piecewise smooth perturbation.
Read the full abstract

Analysis of PDEs

Shape-Design Approximation for a Class of Degenerate Hyperbolic Equations with a Degenerate Boundary Point and Its Application to Observability

We study a class of degenerate hyperbolic equations in a bounded domain whose degeneracy occurs at a boundary point. We first develop the weighted functional framework, prove well-posedness of the degenerate problem, and establish regularity away from the degenerate point. We then introduce a shape-design approximation obtained by removing a small neighborhood of the degenerate boundary point, which yields uniformly non-degenerate hyperbolic problems on regularized domains. We prove that the regularized solutions converge to the solution of the original degenerate equation, including the convergence of the boundary normal derivatives away from the degenerate point. Finally, under a geometric condition on the observation boundary, we derive an observability inequality for the degenerate equation by combining the uniform observability of the regularized problems with the limit passage.
Read the full abstract

Information Theory

3-D Trajectory Optimization for Robust Direction Sensing in Movable Antenna Systems

This paper presents a novel wireless sensing system where a movable antenna (MA) continuously moves and receives sensing signals within a three-dimensional (3-D) region to enhance sensing performance compared with conventional fixed-position antenna (FPA)-based sensing. We show that the performance of direction vector estimation for a target is fundamentally related to the 3-D MA trajectory in terms of the mean square angular error lower-bound (MSAEB), which is adopted as a coordinate-invariant performance metric. In particular, the closed-form expression of the MSAEB is derived as a function of the trajectory covariance matrix. Theoretical analysis shows that two-dimensional (2-D) antenna movement suffers from performance divergence for target direction close to the endfire direction of the 2-D MA plane, whereas 3-D movement can achieve isotropic sensing performance over the entire angular region. To achieve robust sensing performance, we formulate a min-max optimization problem to minimize the maximum (worst-case) MSAEB over a given continuous angular region wherein the target is located. An efficient successive convex approximation (SCA) algorithm is developed to optimize the 3-D MA trajectory and obtain a locally optimal solution. Numerical results demonstrate that the proposed 3-D MA sensing scheme is able to significantly reduce the worst-case mean square angular error (MSAE) compared with conventional arrays with FPAs and MA systems with 2-D movement only, thus achieving more accurate and robust direction estimation over the entire angular region.
Read the full abstract

All authors Wenyan Ma, Lipeng Zhu, Xiaodan Shao, Rui Zhang

Metric Geometry

A new lower bound for the kissing number in 19 dimensions

We prove that the kissing number in 19 dimensions is at least 11948, improving the bound of Cohn and Li by 256. Their odd-sign construction reduces the problem to finding a binary code of length 19 and minimum distance 5 inside a 5-punctured extended binary Golay code. In an explicit model $D$ of this ambient code, the 21 words of weights 3 and 4 are exactly the pairwise differences that such a code must avoid. They span a 10-dimensional subcode $K$. We exhibit a 6-dimensional subcode $M\le K$ for which all 21 words lie in only five cosets of $M$. After identifying $K/M$ with $\mathbb F_2^4$, these five cosets are represented by $\Sigma=\{e_1,e_2,e_3,e_4,e_1+e_2+e_3+e_4\}$. In the graph on $\mathbb F_2^4$ in which $u$ and $v$ are adjacent when $u+v\in\Sigma$, the set $\Sigma$ itself is independent. Lifting its five vertices gives 320 words in $K$, and translating this set through the four cosets of $K$ in $D$ gives a nonlinear code of size 1280 and minimum distance 5.
Read the full abstract

Functional Analysis

Uniform discretization of continuous frames

Let $H$ be an infinite-dimensional separable Hilbert space and let $(X,d,\mu)$ be a metric measure space satisfying the doubling and upper Alhfors regularity conditions at small scale. We prove that every bounded continuous tight frame $\Psi\colon X\rightarrow H$ can be sampled to obtain a frame for $H$, which is uniformly discrete and nearly tight. That is, for every $0<\epsilon<1$, there exist a sampling sequence $\{x_n\}_{n\in\mathbb{N}}$ in $X$ and $r>0$ such that $\inf_{n\neq m}d(x_n,x_m)\geq r$ and $\{\Psi(x_n)\}_{n\in\mathbb{N}}$ is a frame whose ratio of frame bounds is less than $1+\epsilon$. We apply our main result to show that for every nonzero function $g$ in $L^2(\mathbb{R}^d)$ there exists a uniformly discrete set $\Lambda$ such that the corresponding Gabor system $\{e^{2\pi ibx}g(x-a)\}_{(a,b)\in \Lambda}$ is a nearly tight frame. We also prove that if $\psi\in L^2(\mathbb{R})$ satisfies the Calderón admissibility condition, then there exists a uniformly discrete set $\Gamma$ such that wavelet system $\{a^{1/2}\psi(ax-b)\}_{(a,b)\in \Gamma}$ is a nearly tight frame. Analogous discretization results for exponential frames and spectral subspaces of elliptic differential operators are presented as well.
Read the full abstract

Functional Analysis

Brown-Halmos type theorems for generalized Cauchy singular integral operators and applications

We investigate the commutativity and semi-commutativity of generalized singular integral operators of the form $P_{+} f P_{+} + P_{-} g P_{+} + P_{+} u P_{-} + P_{-} v P_{-}$ on $L^{2}$, where $P_{+}$ denotes the Riesz projection and $P_{-}=I-P_{+}$. Building on this analysis, we develop a unified approach to studying the algebraic properties of operator classes on $L^{2}$ generated by multiplication operators together with the Riesz projection. These classes include, but are not limited to, Toeplitz+Hankel operators, singular integral operators, Foguel–Hankel operators, and asymmetric dual truncated Toeplitz operators. We provide complete characterizations of (i) the quasinormality of singular integral operators, and (ii) the necessary and sufficient conditions under which the product of two asymmetric dual truncated Toeplitz operators is again an asymmetric dual truncated Toeplitz operator. In addition, our methods provide new proofs of several known results, including the classical Brown-Halmos theorems and the commutativity of Hankel operators, singular integral operators, and dual truncated Toeplitz operators. We also improve the conditions for the normality of singular integral operators.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Tight Quantum Speed Limit for Ergotropy Charging in the N-Qubit Dicke Battery

We derive a quantum speed limit for ergotropy charging in the $N$-qubit Dicke battery. With the qubits initially in their ground state and the charger in a coherent state of mean photon number $\bar{n}$, the charging time to a target fraction $\varepsilon$ of the maximum extractable work obeys, in the classical-field limit, $\Gamma_N \tau^{*}(\varepsilon) \geq \arcsin\sqrt{\varepsilon}$, where $\Gamma_N = 2\lambda\sqrt{\bar{n}/N}$ is a single rate combining the light-matter coupling, the charger amplitude and the system size. The bound is geometric: although the ergotropy is defined by an optimisation over unitaries, it reduces to a fixed function of the angle swept by the collective spin on the Bloch sphere, and the drive bounds the rate at which that angle can grow, so the charging time is at least the required arc divided by the maximum angular velocity. The reduction rests on an exact statement about work extraction: only the coherent component of the drive delivers extractable work, while its vacuum fluctuations deposit energy that remains locked in the passive state. This makes the short-time coefficient independent of the charger occupation, and it is what separates a bound on extractable work from a bound on stored energy, which no instantaneous-power argument can supply. At finite charger occupation the inequality is tested rather than proved: numerical integration of the full Dicke Hamiltonian, with a dynamical charger and a mixed battery state, finds the bound respected at every admitted charging time for two to five qubits, and approached most closely in the limit of small target work. The familiar square-root estimate is the chord to this arc, recovered in the small-angle limit and weaker whenever a large fraction of the maximum work is required.
Read the full abstract

Combinatorics

Additive Subtraction Games

We determine the full nim-value structure of additive subtraction games in the primitive quadratic regime. The problem appears in Winning Ways by Berlekamp et al. in 1982; it includes a closed formula, involving Beatty-type bracket expressions on rational moduli, for determining the {\mathscr P}-positions, but to the best of our knowledge, a complete proof of this claim has not yet appeared in the literature; Miklós and Post (2024) established outcome-periodicity, but without reference to that closed formula. The primitive quadratic case captures the source of the quadratic complexity of the problem, a claim supported by recent research in the dual setting of sink subtraction by Bhagat et al. This study focuses on a number theoretic solution involving the classical closed formula, and we establish that each nim-value sequence resides on a linear shift of the classical {\mathscr P}-positions.
Read the full abstract

Analysis of PDEs

Remarks on the heat flow of harmonic maps into CAT(0)-spaces

In this paper, we present an alternate, elementary proof of the local Lipschitz regularity of the suitable weak solution of heat flow of harmonic maps into CAT(0)-metric spaces, whose existence was established by Lin, Segatti, Sire, and Wang through an elliptic regularization approach. The ideas of the proof are inspired by Korevaar and Schoen, and they work for any CAT(0)-metric space $(X,d)$ as the target and any complete Riemanan manifold $(M,g)$, with positive injectivity radius and bounded curvature, as the domain.
Read the full abstract

Combinatorics

Aldous property for full-flag Johnson graphs

We show that the full-flag Johnson graph has spectral gap equal to that of its Schreier quotient arising from the point-stabiliser equitable partition. Our results confirm two conjectures posed by Huang, Huang, and Cioabă, which imply an Aldous-type spectral-gap phenomenon for full-flag Johnson graphs.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Surrogate-Assisted Estimation of Exposure-Time Effects in Stepped-Wedge Trials with Administratively Censored Outcomes

In stepped-wedge trials, effects often change with the time since a cluster crossed over, and a delayed primary outcome is administratively censored for clusters that cross over late. The design couples them: long exposure times occur only in the last periods, where censoring is heaviest. We study exposure-time-specific effects when a short-term surrogate is always recorded and censoring is ignorable given the surrogate, exposure time, covariates and calendar time. The usual immediate-treatment estimandgives more weight to short exposures. Each exposure-time effect is identified through a surrogate bridge, and because the rollout fixes the exposure law, neither the surrogate distribution nor the bridge regression enters theremainder of the efficient influence function. The efficiency bound is a full-data part plus a censoring burden whose share grows with exposure time; as a function of the allocation of clusters to waves, it becomes a design criterion that can favor the heavily censored last wave. We propose a cross-fitted surrogate-assisted augmented estimator, prove joint asymptotic normality, show that with a consistent bridge its variance is the same for independent and fixed-wave crossover times, and justify a fixed-partition cluster jackknife and a heterogeneity test. Treating each crossover as a sequential randomization gives a sharper bound that uses a cluster's pre-crossover history; under a random-intercept working structure the optimal correction is a one-dimensional index of the cluster's own surrogate and outcome history, and the resulting estimator attains the bound with 30 clusters in simulations.
Read the full abstract

All authors Lin Li, Tuo Lin, Yiwen Chen, Xin M. Tu

Analysis of PDEs

Mixed order conformally invariant system with exponential growth and nonlocal nonlinear terms in critical dimensions

In this paper, under the extremely mild assumption $u(x)= O(|x|^{K})$ as $|x|\rightarrow+\infty$ for some $K\gg1$ arbitrarily large, we classify solutions of the following mixed order conformally invariant system with exponentially increasing and nonlocal nonlinearities in $\mathbb{R}^{n}$: $$ \left\{ \begin{aligned} (-\Delta)^{\frac{1}{2}}u & = e^{pv} \\ (-\Delta)^{\frac{n}{2}}v & = \left(\frac{1}{|x|^2}*u^2\right)u^2 \end{aligned} \right. \quad \text{in}\; \mathbb{R}^n, $$ where $n=3,\,4$, $p>0$, $u\geqslant0$, $v(x)=o(|x|^2)$ as $|x|\to\infty$ and $u$ satisfies the finite total mass condition. The finite total mass condition can be deduced from either $u \in L^\frac{2n}{n-1}(\mathbb{R}^n)$ or $u \in \dot{H}^\frac{1}{2}(\mathbb{R}^n)$. This system is closely related to the conformally invariant equations $(-\Delta)^{\frac{1}{2}}u=\left(\frac{1}{|x|^{2}}*u^2\right)u$ and $(-\Delta)^{\frac{n}{2}}u=(n-1)!e^{nu}$ in $\mathbb{R}^{n}$ with $n=3,4$, which have been quite extensively studied.
Read the full abstract

Analysis of PDEs

Supersonic flow of a Chaplygin gas past a conical wing with $\Lambda$-shaped cross sections

In this paper, by considering the anhedral angle, we for the first time study the problem of supersonic flow of a Chaplygin gas over a conical wing with $\Lambda$-shaped cross sections, where the flow is governed by the three-dimensional steady isentropic irrotational compressible Euler equations. This work is motivated by the design of the Nonweiler wing, which is one of the simplest waveriders. Mathematically, the problem reduces to a boundary value problem for a nonlinear mixed-type equation in conical coordinates. By introducing a viscosity parameter to treat the degenerate boundary, we use the continuity method to establish the existence of a piecewise smooth self-similar solution to the problem, in the case that the shock is attached to the leading edge of the conical wing. Our results verify part of Küchemann's speculation on the conical flow field structures of this type, and also find a new conical flow field structure.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Designing Service Systems from Textual Evidence

Designing service systems requires selecting among alternative configurations – choosing the best chatbot variant, the optimal routing policy, or the most effective quality control procedure. In many service systems, the primary evidence of performance quality is textual – customer support transcripts, complaint narratives, compliance review reports – rather than the scalar measurements assumed by classical optimization methods. Large language models (LLMs) can read such textual evidence and produce standardized quality scores, but these automated judges exhibit systematic biases that vary across alternatives and evaluation instances. Human expert review remains accurate but costly. We study how to identify the best service configuration with high confidence while minimizing expensive human audits, given that automated evaluation is cheap but biased. We formalize this as a sequential decision problem where a biased proxy score is observed for every evaluation, and a verified outcome can be acquired selectively at additional cost. We prove that LLM-only selection fails under arm-dependent bias, and that naive selective-audit estimators can be asymptotically biased. We develop an estimator combining proxy scores with inverse-propensity-weighted residuals and construct anytime-valid confidence sequences. Our algorithm, PP-LUCB, jointly decides which alternatives to evaluate and whether to request human audits, concentrating reviews where the LLM judge is least reliable. We prove correctness and establish instance-dependent cost bounds showing near-optimal efficiency. On a customer support ticket classification task, our algorithm correctly identifies the best model in 40/40 trials while achieving 90% audit cost reduction.
Read the full abstract

All authors Ruicheng Ao, Hongyu Chen, Siyang Gao, Hanwei Li, David Simchi-Levi

2603.10400 · 11 Mar · This submission is withdrawn because it duplicates arXiv:2601.21471 by the same authors. The expanded manuscript was submitted as a new entry instead of as a replacement, so the same paper is now indexed twice. No results, proofs, or data are retracted. The current version is maintained as a replacement of arXiv:2601.21471, which readers should cite

Algebraic Geometry · Cross-listed from nlin.SI

The $\mathrm{al}_{ab}$ functions of hyperelliptic curves: a generalization of Jacobi's elliptic functions and explicit solutions of a degenerate Krichever-Novikov equation

The Jacobi elliptic functions $\mathrm{sn}$, $\mathrm{cn}$, $\mathrm{dn}$ and their ratios are expressed by Weierstrass's functions $\mathrm{al}_a=\sqrt{x-b_a}$ of an elliptic curve. For a hyperelliptic curve of genus $g$, Weierstrass's $\mathrm{al}_a$ functions generalize $\mathrm{sn}$, $\mathrm{cn}$ and $\mathrm{dn}$, and the modified Korteweg-de Vries and sine-Gordon equations stand behind them. In this paper we study the $\mathrm{al}_{ab}$ functions, which are defined by the sigma function shifted by the sum of two half-periods and which, together with the ratios of the $\mathrm{al}_a$ functions, generalize the remaining Jacobi elliptic functions. We determine the exact lattice of periods of $\mathrm{al}_{12}$ and show that it is single-valued on the unramified double covering of the Jacobian corresponding to the double covering $\hat{w}^2=(x-b_1)(x-b_2)$ of the curve. We show that $\mathrm{al}_{12}$ is the Wronskian of the band-edge eigenfunctions $\mathrm{al}_1$ and $\mathrm{al}_2$, so that the half-period translations realize Darboux transformations. As the main result, $\mathrm{al}_{12}$, $\mathrm{al}_2/\mathrm{al}_1$ and $1/\mathrm{al}_{12}$ satisfy one and the same degenerate Krichever-Novikov equation, whose polynomial has the double roots $0$ and $\infty$, and the half-periods act on these solutions as the Möbius symmetries of the equation. Thus the Krichever-Novikov equation stands behind the $\mathrm{al}_{ab}$ functions. In genus one these functions reduce to $\mathrm{sn}$, $\mathrm{ns}$ and $\mathrm{dc}$.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Optimal Movable Antenna Placement for Near-Field Wireless Sensing

Movable antennas (MAs) have emerged as a promising technology for wireless sensing by reconfiguring antenna positions to exploit additional spatial degrees of freedom (DoFs). This paper investigates a robust movable antenna placement strategy for near-field wireless sensing to minimize the worst-case squared position error bound (SPEB). By temporarily relaxing the minimum inter-element spacing constraint, we first establish the optimality of centro-symmetric antenna position distribution, which simplifies the identification of the worst-case source, locating it at the array broadside on the Rayleigh boundary. Moreover, by leveraging moment-based analysis with the Richter-Tchakaloff theorem, we derive a closed-form optimal solution with three points supported on the center and two edges of the array. Guided by this structural insight, we finally develop an efficient three-point discrete deployment strategy to ensure the minimum inter-element spacing. Simulations demonstrate that the proposed design consistently outperforms conventional fixed antenna arrays and matches the exhaustive search benchmark at negligible computational complexity.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

The moduli space of dynamical spherically symmetric black hole spacetimes and the extremal threshold

In this paper, we give a complete description of the black hole threshold, locally near the Reissner-Nordström family, in the infinite-dimensional moduli space $\mathfrak M$ of dynamical spherically symmetric solutions to the Einstein-Maxwell-neutral scalar field system. In a neighborhood of the full Reissner-Nordström family in $\mathfrak M$, we prove the following: (i) Any solution that forms a black hole eventually decays to a Reissner-Nordström black hole. (ii) Any solution that fails to collapse into a black hole eventually becomes superextremal along null infinity and exists globally in the domain of dependence of the bifurcate characteristic initial data. (iii) The subset of this neighborhood consisting of black hole solutions admits a $C^1$ foliation by hypersurfaces of constant final charge-to-mass ratio, up to and including extremality. (iv) The mutual boundary between the set of black hole solutions and noncollapsing solutions, i.e., the black hole threshold, is the extremal leaf of the foliation. Black holes which are not on the threshold are asymptotically subextremal. Our quantitative control of near-threshold solutions allows us to prove "universal" scaling laws for the location of the event horizon and its final area and temperature (surface gravity), with critical exponent $\frac 12$. Moreover, we show that the celebrated Aretakis instability is activated for an open and dense set of threshold solutions and that generic near-threshold subextremal black holes experience a transient horizon instability on the timescale of their inverse final temperature.
Read the full abstract

Number Theory

Algebra Structures of Multiple Eisenstein Series in Positive Characteristic

In [CCHT25], the authors introduced multiple Eisenstein series of arbitrary rank in positive characteristic and the $q$-shuffle algebra $\mathcal{E}$ associated with them. In the present paper, we establish a class of linear independence results for multiple Eisenstein series. We also prove that the $q$-shuffle algebra $\mathcal{R}$ of multiple zeta values embeds into the inverse limit of the spaces of multiple Eisenstein series with respect to the rank $r$, and that $\mathcal{E}$ is isomorphic to the tensor square of $\mathcal{R}$. As an application, we show that $\mathcal{E}$ is an associative algebra, thereby verifying the conjecture proposed in [CCHT25]
Read the full abstract

All authors Ting-Wei Chang, Song-Yun Chen, Fei-Jun Huang, Hung-Chun Tsui

Algebraic Geometry

Kalinin Effectivity and Wonderful Compactifications

We review the definition and main properties of Kalinin effectivity and describe methods for constructing effective spaces together with several examples. We analyze the Kalinin effectivity of wonderful compactifications and prove that the wonderful compactifications of hyperplane arrangements and of configuration spaces associated to Kalinin effective compact complex manifolds are themselves Kalinin effective. As an application, we show that the Deligne-Mumford space of real rational curves with marked points is effective. Finally, we apply Kalinin effectivity to study Smith-Thom maximality for Hilbert squares.
Read the full abstract

Algebraic Geometry

Classification of Poor Manifolds in Low dimensions

The notion of poor manifolds was introduced by Bandman and Zarhin, who asked for their classification. In this paper, we answer this question completely in dimensions at most 3. We also classify poor compact Kähler manifolds of arbitrary dimension under the additional assumption that Kodaira dimension is not $-\infty$. We classify all poor $K3$ surfaces. Finally, give a sufficient condition for a compact Kähle manifold to have Kodaira dimension greater than or equal to zero.
Read the full abstract

Commutative Algebra

Curves in ${\mathbb P}^n$ of analytic spread at most $n$

We study closed subschemes $X$ in ${\mathbb P}^n$ of dimension one, locally defined at any point by at most $n$ equations such that the analytic spread of $I_{\mathfrak{m}}$ is at most $n$, where $I \subseteq \Bbbk[x_0, \ldots, x_n] $ is the defining ideal of $X$ and ${\mathfrak{m}} = (x_0, \ldots, x_n)$. In this situation, we show that, under mild conditions, all the powers of $I_{\mathfrak{m}}$ have positive depth, hence the limit depth of $I_{\mathfrak{m}}$ is $1$ unless $I$ is a complete intersection. Moreover, the regularity of the Rees ring is at most one and the fiber cone is Cohen-Macaulay. This applies to every ideal defining a monomial curve in ${\mathbb P}^3$.
Read the full abstract

Number Theory

On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares

We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the previous best result of Dudek and Johnston, who showed that every such interval contains an integer with at most $4$ prime factors. The proof is divided into two ranges. For $n^2 \leq 10^{31}$, we use prior computational results on primes in short intervals between consecutive squares, together with explicit bounds on maximal prime gaps. For $n^2 > 10^{31}$, we give a sieve-theoretic argument with explicit constants, adapting Richert's logarithmic weights to intervals between consecutive squares and employing an explicit linear sieve of Bordignon, Johnston, and Starichkova.
Read the full abstract

Dynamical Systems

Group evolving dynamics in biased condition: modeling and analysis

We propose a dynamical model for group formation and switching behavior in systems where each group competes for members through attraction functions that are inversely proportional to their current sizes. This attraction is modulated by group-specific bias terms, which can reflect social, economic, or reputational advantages. New entrants choose groups probabilistically based on these weighted attraction scores. We derive the conditions under which the system converges to a stationary equilibrium, where group proportions remain stable over time. The model exhibits rich nonlinear behavior, especially under varying bias strengths and inverse preference intensities. We analyze equilibrium conditions both theoretically and via simulations.
Read the full abstract

Analysis of PDEs

The uniqueness of the ground state and the dynamics of nonlinear Schrödinger equation with inverse square potential

In this paper, we first provide an alternative proof of the uniqueness of the ground state solution for NLS with inverse square potential and power nonlinearity $|u|^pu$ for all $0<p<\frac 4{d-2}$ in dimensions $d\ge 3$. While the uniqueness result was previously obtained by Mukherjee-Nam-Nguyen using a functional analytic approach, our method successfully adapts the classical “shooting method” to the case with the singular potential, accompanied by a more detailed analysis on the ground state equation. Based upon this result and a comprehensive spectral analysis, we construct the stable/unstable manifolds of the ground state standing wave solutions and classify solutions on the mass-energy level surface of the ground state in dimensions $d=3, 4, 5$.
Read the full abstract

Optimization and Control

A Globally Convergent Flow for Time-Dependent Mean Field Games and a Solver-Agnostic Framework for Inverse Problems

Mean field games (MFGs) describe the limiting behavior of large populations of strategically interacting agents. This paper addresses two numerical challenges for MFGs: globally convergent forward solvers and solver-agnostic methods for inverse problems. For the forward problem, we extend the Hessian–Riemannian flow (HRF), previously developed for stationary MFGs, to time-dependent MFGs. We first discretize the system in space and time and then construct the flow directly on the resulting finite-dimensional problem. The proposed flow exploits Lasry–Lions monotonicity, preserves the initial density and terminal value function, and maintains positivity and mass of the density. Under standard assumptions, we prove global convergence of the HRF and show how to recover a solution of the full discretized time-dependent MFG system from its limit. For the inverse problem, we formulate parameter estimation as a bilevel problem in which the outer problem updates unknown coefficients and the inner problem solves the discretized MFG system. Gradients of the outer objective are obtained by differentiating the discretized MFG system at the inner solution, rather than differentiating through the iterations of a particular forward solver. This yields a solver-agnostic framework with adjoint-based gradient descent and Gauss–Newton acceleration. Numerical experiments on stationary and time-dependent MFGs demonstrate the effectiveness of the proposed methods.
Read the full abstract

Combinatorics

Spectral Bounds for Antipodal Graphs

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of “neighbors” (ordered pairs of points with distance $\leq \varepsilon$) to the number of “antipodes” (ordered pairs of points with distance $\geq 1 - \varepsilon$) is $\gtrsim\varepsilon^{1/2 + o(1)}$, attaining the conjectured correct asymptotic within a polylog factor and improving the $\gtrsim\varepsilon^{3/4+o(1)}$ bound of Steinerberger (2025). In dimensions $d\ge3$ we prove a similar result with exponent $3(d - 1)/4$.
Read the full abstract

Dynamical Systems

Refracting Filippov systems: sliding dynamics without sliding regions

This paper develops fundamental mathematical theory for refracting Filippov systems. These are discontinuous ordinary differential equations with solutions defined in the sense of Filippov, and whose first Lie derivatives vary continuously across discontinuity surfaces. Unlike generic Filippov systems, discontinuity surfaces consist only of crossing regions and their boundaries where both adjacent vector fields are tangent to the discontinuity surface. Crossing orbits spiral around invisible-invisible tangency surfaces, and we derive a formula for the attractive or repulsive strength of these surfaces. We prove crossing orbits cannot converge to tangency surfaces in finite time (no Zeno), and that the limiting dynamics consists of Filippov solutions on the tangency surfaces (second-order sliding motion). We derive a vector field that governs this motion, and characterise the stability of equilibria on tangency surfaces. The methodology is applied to a model of a mechanical oscillator with compliant impacts, and a model of ant colony migration. We also relate refracting Filippov systems to second-order sliding mode control, and show that for two-dimensional systems the results reduce to known theory.
Read the full abstract

Information Theory · Cross-listed from stat.ME

Combining e-values using demi-supermartingales

We present a new method for combining e-variables through demi-supermartingales, which settles an old conjecture in the literature on nonparametric mean testing. It also provides an explicit concentration bound for a certain Kullback–Leibler-type statistic arising in the stochastic multi-armed bandit literature. All of these combination results hold for independent e-variables as well as for the class of co-valid e-variables, whose dependence structure lies somewhere between independence and sequential validity. The results are further generalized to compound e-variables. The proofs proceed by analyzing elementary symmetric polynomials and their behavior as nonnegative demi-supermartingales.
Read the full abstract

All authors Jiahao Ming, Aaditya Ramdas, Yi Shen, Ruodu Wang, Ian Waudby-Smith

Numerical Analysis · Cross-listed from quant-ph

Geo-ADAPT-VQE: Quantum Information Metric-Aware Circuit Optimization for Quantum Chemistry

Adaptive ansatz construction has emerged as a powerful technique for reducing circuit depth and improving optimization efficiency in variational quantum eigensolvers. However, existing adaptive methods, including ADAPT-VQE, rely solely on first-order gradients and therefore ignore the underlying geometry of the quantum state space, limiting both convergence behavior and operator-selection efficiency. We introduce Geo-ADAPT-VQE, a geometry-aware adaptive VQE algorithm that selects operators from a pool using the natural gradient rule. The geometric operator-selection rule enables the ansatz to grow along directions aligned with the underlying quantum-state geometry, thereby improving convergence and reducing the algorithm's susceptibility to shallow local minima and saddle-point regions. We further provide an asymptotic convergence result. We present numerical simulations involving five molecules, which demonstrate that Geo-ADAPT-VQE achieves faster and more stable convergence compared to existing methods, while producing significantly shorter ansatz. In particular, Geo-ADAPT achieves up to 100-fold reduction in energy error compared to existing methods.
Read the full abstract

Optimization and Control

Linear complementarity properties of some classes of banded matrices

A banded matrix is a real square matrix where nonzero entries appear around the main diagonal. In this article, we consider linear complementarity properties of (variants) of banded matrices. Focusing on triangular matrices and the newly defined bidiagonal southwest matrices, we describe several results characterizing the Q-property in terms of the sign patterns and determinant of the given matrix. As a byproduct, we describe all Q-matrices of size 2 by 2. Extending these results to Euclidean Jordan algebras, we consider matrix-based linear transformations and study the Q-property. In particular, we show that a rank-one linear transformation of the form a\otimes b has the Q-property if and only if either a>0,b>0, or a<0, b<0.
Read the full abstract