Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 6 May

Number Theory

The Logarithmic Asymptotic Phenomenon for Generalized Markov-Hurwitz Equations

The purpose of this paper is twofold. First, we introduce a family of generalized Markov-Hurwitz equations, extending classical Markov-Hurwitz equations with additional degree n-1 interaction terms, Gyoda and Matsushita's generalized Markov equations from 3 variables to n variables. Second, we prove a logarithmic asymptotic phenomenon for the positive integer solutions of these equations.
Read the full abstract

Optimization and Control

Nonconvex optimization methods for ground states in disordered continuous-spin models

This work explores the global optimization problem of finding lowest-energy configurations in disordered continuous-spin models from statistical physics, with a particular focus on the random field XY model. Due to an extremely non-convex nature of the associated energy landscape, this problem remains highly challenging. From an optimization perspective, we reformulate the traditional angular Hamiltonian as a constrained problem on the Cartesian product of spheres, allowing the application of Riemannian optimization techniques, which show better computational performance. We design a family of Basin Hopping algorithms whose perturbation mechanisms are specifically designed to exploit the structure of the underlying physical model, and further extend them within a Population Basin Hopping framework. The proposed methods are evaluated against optimization algorithms widely used in computational physics. The proposed variants turn out to be the most effective method in the comparison, consistently attaining lower-energy configurations within the same computational budget. This work establishes a robust link between continuous-spin systems and continuous global optimization, providing a high-performance benchmark for exploring complex energy landscapes.
Read the full abstract

All authors Ramgopal Agrawal, Lorenzo Ciarpaglini, Pierluigi Mansueto, Enzo Marinari, Marco Sciandrone, Diego Scuppa, Elisa Trasatti

Information Theory

A Comparison Between Co-Located and Distributed MIMO Deployments in OFDM-ISAC Networks

This paper investigates network-level integrated sensing and communication (ISAC) under two fundamentally different topology configurations: cell-free massive MIMO (CF-mMIMO) and multi-cell massive MIMO (MC-mMIMO). A unified OFDM-based waveform is adopted for both architectures as the key enabler for ISAC functionalities. The CF system exploits distributed access points (APs) and a scalable user-target-centric operation, whereas the MC system relies on co-located transmit-receive arrays with conventional cell-centric deployment. For both architectures, we derive a GLRT-based sensing detector and the corresponding sensing SNR expressions. We then examine a series of case studies investigating how the number of OFDM subcarriers, the transceiver allocation strategy, and the antenna/node distribution across the network affect the sensing performance. The results consistently demonstrate that CF-mMIMO provides more robust and higher sensing performance across most tested scenarios, particularly when transmit resources or antenna elements are spatially distributed. These findings highlight the inherent advantages of CF deployments for next-generation ISAC networks.
Read the full abstract

All authors Maryam Darabi, Sergi Liesegang, Emanuele Grossi, Stefano Buzzi

Combinatorics

On spectral Turán theorems: confirming a conjecture of Guiduli and two problems of Nikiforov

Let $G$ be an $n$-vertex graph, and let $\lambda(G)$ and $\lambda_n(G)$ denote the largest and smallest eigenvalues of its adjacency matrix. Write $e(G)$ for the number of edges of $G$, $d(G)=2e(G)/n$ for its average degree, and $T_r(n)$ for the $r$-partite Turán graph on $n$ vertices. We prove four sharp results in spectral Turán theory. First, we confirm Guiduli's spectral dense-neighborhood conjecture (1996) in a stronger form: if $\lambda(G)\ge \lambda(T_r(n))$, then either $G\cong T_r(n)$, or there exists a vertex $v$ such that $\lambda(G[N(v)]) > \lambda(T_{r-1}(d(v)))$. Moreover, when $\lambda(G)>\lambda(T_r(n))$, every vertex attaining the maximum entry in any nonnegative Perron eigenvector of $G$ has this property. Second, we answer a problem of Nikiforov (2009) by showing that the exact Turán edge threshold is detected by the exact spectral threshold: for every $r\ge 2$ and every $n$, $\lambda(G)<\lambda(T_r(n))$, implying $e(G)<e(T_r(n)).$ Our proof also determines the equality cases. Third, we answer another question of Nikiforov (2009) by showing that his least-eigenvalue clique bound \[ \omega(G)\ge 1+\frac{2e(G)}{(n-d(G))(d(G)-\lambda_n(G))} \] does imply the concise form of Turán's theorem. Finally, we discuss an open problem proposed by Ai et al. (2026) in \cite{ALNS26+}.
Read the full abstract

Combinatorics · Cross-listed from cs.CC

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete

We propose a local transformation on bicolored graphs, which we call local homophily, inspired by adaptive networks and based on majority dynamics and homophily. In this transformation, a vertex updates its color to match the majority of its neighbors, while neighbors of the same color become connected and neighbors of the opposite color become disconnected. We show how to simulate Boolean circuits using local homophily and establish that determining whether a given pair of vertices becomes connected under iterative applications of local homophily is $\mathbf{P}$-complete under logspace reductions.
Read the full abstract

Probability · Cross-listed from cs.DM

Sampling Simultaneous Edge-Colorings

We study the sampling problem for simultaneous edge colorings. Given a pair of graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ which are on the same vertex set $V$, a simultaneous edge coloring is an edge coloring of $G_1\cup G_2$ so that each of the individual graphs is properly colored. When each of $G_1$ and $G_2$ are of maximum degree $\Delta$, then it is conjectured that $\Delta+2$ colors suffice, and recent work asymptotically establishes the conjecture. We study Markov chains for randomly sampling from the uniform distribution over simultaneous edge colorings. Straightforward applications of Jerrum's classical coupling argument establish rapid mixing of the Glauber dynamics on the corresponding line graph when $k>8\Delta$. We present a simple weighted Hamming distance for which Jerrum's coupling yields optimal mixing time (up to constant factors) of $O(m\log{n})$ when $k>(6+\delta)\Delta$ for any fixed $\delta>0$. Moreover, utilizing the flip dynamics with our new metric, we obtain $O(m\log{n})$ mixing of the flip dynamics when $k\geq 5.948\Delta$, using a local choice of flip parameters which only flips bounded-size components. The proof adapts previous coupling analyses for the flip dynamics to the setting of simultaneous edge colorings.
Read the full abstract

Numerical Analysis

Finding accurate eigenvalues and eigenvectors of positive semi-definite matrices given a subspace

We revisit a classical problem in numerical linear algebra: given an $k$-dimensional subspace $\mathcal{Q}$ that approximates the leading eigenspace of an $n\times n$ positive semi-definite matrix $A$, the goal is to extract high-accuracy eigenvalues. The Rayleigh-Ritz (RR) method is the standard algorithm for the task, which has been shown to be optimal in several ways (when $A$ is symmetric, not necessarily positive semi-definite $A\succeq 0$). In this paper, we show that when $A \succeq 0$, alternative methods can outperform RR, while having the same computational complexity, that is, the main cost is in computing $AQ$, plus an $O(nk^2)$ term. In particular, we advocate the use of Nyström's method, showing that the approximate eigenvalues always have higher accuracy than RR, and the improvement can be arbitrarily large. The difference is significant, especially when $A$ has a fast-decaying spectrum. A similar improvement is numerically observed for the purpose of approximating the leading eigenvectors. In contrast, when the target eigenvalues are the trailing ones, the situation is reversed, and the Nyström method performs poorly; we suggest a remedy for this situation.
Read the full abstract

Differential Geometry

An Optimal Regularity Theory for Immersed Stable Minimal Hypersurfaces with Small Singular Set

We show that if $M^n$ is a properly immersed, two-sided, stable minimal hypersurface in $B^{n+1}_1(0)\setminus S$, where $S$ is closed with $\mathcal{H}^{n-2}(S)=0$, then $\text{dim}_{\mathcal{H}}\text{sing}(M)\leq n-7$, namely $\overline{M}\cap B^{n+1}_1(0)$ is represented by a smooth minimal immersion outside a closed set of generally unavoidable singularities which has Hausdorff dimension at most $n-7$. This provides the optimal a priori size assumption on the non-immersed singular set in order to guarantee optimal regularity. Consequently, such objects form a compact class under mass upper bounds.
Read the full abstract

Number Theory

Multiplicative $f$-ic forms on algebraic varieties arising from Thaine's generalized Jacobi sums

We study generalized Jacobi sums, cyclotomic numbers, and $d$-compositions in Thaine's framework, and prove new multiplicative identities extending Davenport and Hasse's lifting theorem from the classical prime-power setting to products of prime powers. As applications, we construct multiplicative forms of degree $f\ge2$, i.e. $f$-ic forms, on complete intersections of $f$-ics. This places Pfister's theory of multiplicative quadratic forms over fields within the broader setting of multiplicative $f$-ic forms on affine algebraic varieties, where new phenomena arise. Moreover, a dense open subset $W \subset V$ carries the structure of an algebraic torus, and the multiplicative form is compatible with the induced group law on $W$.
Read the full abstract

Analysis of PDEs

Ill-posedness in the critical Sobolev space for the $b$-Novikov equation

This article proves norm inflation in the critical Sobolev space $H^{3/2}(\mathbb{R})$ for the $b$-Novikov equation, which is a $1$-parameter family of Camassa-Holm-type equations with cubic nonlinearities. This result completes the well-posedness theory for this equation, which was previously known to be locally well-posed in $H^{s}(\mathbb{R})$ for $s>3/2$ and ill-posed in $H^{s}(\mathbb{R})$ for $s<3/2$.
Read the full abstract

Optimization and Control

Projected Evolutionary Lifting and Well-Posedness of Stationary Hamilton-Jacobi-Bellman Equations in Infinite Dimensions

This paper establishes the existence and uniqueness of mild solutions to stationary Hamilton-Jacobi-Bellman (HJB) equations associated with infinite-horizon stochastic optimal control problems in separable Hilbert spaces. Our framework includes settings with a lack of global smoothing properties of the transition semigroup, singular dynamics involving unbounded control operators, and state-dependent running costs. We overcome these challenges by lifting the state space using the Projected Evolutionary Lifting technique. This work is an extension of G. Bolli and F. Gozzi, Lifting and partial smoothing for stationary HJB equations and related control problems in infinite dimensions, 2025, in which existence and uniqueness is proved via a contraction mapping argument and is consequently restricted to sufficiently large discount factors. We remove this restriction, proving existence and uniqueness for any discount rate $\lambda > 0$ using tools from the theory of maximally monotone operators.
Read the full abstract

Differential Geometry

Existence of rotationally symmetric embedded f-minimal tori

Let $n\geq2$, and let $f:[0,+\infty)\to\mathbb{R}$ be a smooth function satisfying $f''\geq0$ and $0<m\leq f'\leq M$ for some constants $m$ and $M$. We prove that $\mathbb{R}^{n+1}$, endowed with the conformal metric \begin{equation*} ds^2=e^{-\frac{f(|x|^2)}{2n}}\sum_{i=1}^{n+1}dx_i^2, \end{equation*} admits a compact, embedded, rotationally symmetric minimal hypersurface diffeomorphic to $S^1\times S^{n-1}$. This extends Angenent's existence theorem for self-shrinking tori, which is recovered when $f(s)=s$.
Read the full abstract

Analysis of PDEs

Reconstruction of non-self-adjoint anisotropic and complex inclusions in the Calderón problem

We generalize recent results on the monotonicity method, for inclusion detection in the partial data anisotropic Calderón problem, to very general non-self-adjoint perturbations. This involves a forward model that accounts for both the anisotropic real conductivity and the anisotropic permittivity, and the results hold in any spatial dimension $d \geq 2$. We assume that the inclusion boundaries can be reached from the domain boundary via a set on which the background conductivity is self-adjoint, and that a definiteness condition holds near the inclusion boundaries. Away from the inclusion boundaries we allow general $L^\infty$ non-self-adjoint perturbations. We only require unique continuation based on the self-adjoint part of the background conductivity, thus making the methods compatible with generic unique continuation results.
Read the full abstract

Dynamical Systems

Crossing limit cycles of discontinuous piecewise differential systems with Pleshkan's isochronous centers

In recent decades, piecewise linear differential systems have attracted considerable attention due to their ability to describe a wide range of phenomena. A central problem, as in the theory of general planar differential systems, is to determine the existence and the maximal number of crossing limit cycles. However, deriving sharp upper bounds for this quantity remains a highly challenging problem. In this work we study crossing limit cycles in planar discontinuous piecewise differential systems separated by a straight line, where each subsystem is either a linear center or a cubic isochronous center with homogeneous nonlinearities. Within this setting, we consider all possible combinations arising from these families, leading to fifteen distinct classes of piecewise systems. Using the existence of first integrals, we reduce the detection of crossing limit cycles to algebraic closing conditions on the discontinuity set, which allows for a systematic and unified analysis across all configurations. As a consequence, we establish explicit upper bounds for the number of crossing limit cycles in all cases except for three configurations that remain open. In addition, we construct examples exhibiting three crossing limit cycles in every class, providing a nontrivial uniform lower bound. Our results extend and complement earlier work in the literature by including previously unstudied configurations and improving some known bounds, thereby providing a comprehensive description of the number of crossing limit cycles within this class of systems
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning

We compare in-context learning with fixed queries and agentic learning with adaptive queries for uniform approximation of task families. We consider two settings: an unrestricted regime, where querying and approximation are arbitrary functions, and a realizable regime, where we require these operations to be implemented by ReLU neural networks. In both settings, adaptivity never hinders approximation performance. However, this advantage can change when one passes from the unrestricted regime to the realizable regime. We identify four distinct approximation scenarios, each witnessed by an explicit task family: (a) no advantage of adaptivity; (b) an advantage in the unrestricted regime that persists under ReLU realizability; (c) an advantage that arises only under realizability; and (d) an advantage that disappears under realizability. This demonstrates that representational constraints interact profoundly with the effect of adaptivity.
Read the full abstract

Number Theory

Non-Expansive Matrix Based number Systems

An integer $d$-dimensional vector is usually represented by $d$ strings, which express the value of each component separately. This article is devoted to number systems that allow representing integer vectors using a single string of digits. This system is given by an integer square matrix $M$ and a finite set $\mathcal{D}$ of symbols, called digits. We focus on full number systems, in which every vector $\vec{x} \in \mathbb{Z}^n$ can be written in the form $\vec{x}=\sum_{i=0}^{k-1} M^i d_i$ with $d_i \in \mathcal{D}$ and thus represented by the string $d_{k-1}d_{k-2}\cdots d_1d_0$. In contrast to the very well-described case where the base $M$ is expansive, we focus on systems in which $M$ is similar to a Jordan block with the eigenvalue $\pm 1$. We follow the work of Caldwell, Hare, and Vávra who initiated the study of such systems. First, we address the question of choosing a minimal sized digit set $\mathcal{D}$. Then we describe optimal representations for vectors from $\mathbb{Z}^2$, both with respect to their length and the occurrence of non-zero digits.
Read the full abstract

Combinatorics

Matchings in permutations

We say that two permutations $[n]\to [n]$ intersect if they map some element $x$ to the same element $y$. A matching in a family of permutations is a collection of pairwise disjoint permutations. In this paper, we study families of permutations with no matchings of size $s$. In particular, we obtain a characterization of the largest $s$-matching-free families and a Hilton–Milner type result. We also obtain results for the families of derangements.
Read the full abstract

Combinatorics

Cluster Expansions from Punctured Orbifolds

We provide multiple combinatorial expansion formulas - in terms of snake graphs, labelled posets, matrices, and $T$-walks - for elements in generalized cluster algebras associated to arcs on punctured orbifolds and illustrate their equivalence. This work generalizes and unifies existing work on combinatorial expansion formulas from surfaces and unpunctured orbifolds.
Read the full abstract

All authors Esther Banaian, Wonwoo Kang, Elizabeth Kelley, Ezgi Kantarc{\i} Oğuz, Emine Y{\i}ld{\i}r{\i}m

Analysis of PDEs

Lifespan of Classical Solutions to One-Dimensional Quasilinear Wave Equations

In this paper, we consider the upper and lower bounds of the lifespan of classical solutions of the Cauchy problem for the one-dimensional quasilinear wave equation $u_{tt}-c(u_x)^2u_{xx}=0$ where the derivative of $c(\theta)$ tends to $0$ near the origin. In particular, our result shows that the lifespan of the solution extends algebraically depending on the smallness of the initial data. Furthermore, we also show that when $c(\theta)$ is flat at the origin ($c'(\theta)$ and any higher order derivatives vanish at the origin), the lifespan extends exponentially depending on the smallness of the initial data. Our proof is based on the method of Lax's characteristics and Riemann invariants.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Tests for white noise via asymptotically independent U-statistics in high-dimensions

Existing tests for high-dimensional white noise are tailored to the two ends of the sparsity spectrum: maximum-type statistics excel against a few dominant correlations and sum-type statistics against many weak ones, leaving the intermediate regime without a systematic tool. We propose a family of $U$-statistics built from the entry-wise $\ell_a$-norms of the sample autocovariance matrices, in which the even order $a$ interpolates between the sum-type ($a=2$) and maximum-type ($a\to\infty$) endpoints. As $p$ and $T$ diverge jointly, martingale difference theory yields joint asymptotic normality across orders together with asymptotic independence, so that several orders can be combined after a simple calibration. Neither cross-sectional independence nor a mixing condition is required, only a spectral condition on $\bSig_0$; the derivation links cross-sectional correlation to a graph structure that prices each moment edge by edge. Simulations confirm accurate size and power that is stable across sparse, intermediate and dense alternatives, and show that the low-order members of the family retain their level under conditional heteroscedasticity, where the existing tests distort severely.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Exact SU(2) Yang-Mills Waves from a Simple Ansatz

We propose a simple ansatz that reduces the sourceless SU(2) Yang–Mills equations in (3+1) dimensions to nine algebraic constraints. Solving these constraints yields three closed-form families of exact wave solutions. Family I embeds linear electromagnetic waves into the non-Abelian theory, with vanishing commutators and dispersion \(\omega = kc\). Family II describes genuinely nonlinear self-interacting waves that also propagate at the speed of light but exhibit a constant, gauge-invariant offset in the color-electric field, nonvanishing commutators, and a discrete topological parameter \(\xi\eta = \pm 1\) that controls the position of energy-density nodes (\(\theta=0\) or \(\theta=\pi\)). This provides an observable signature with no analogue in Abelian electromagnetism. Family III is a pure gauge solution with vanishing field strengths, valid for arbitrary \(k\) and \(\omega\) without any dispersion relation. These exact solutions offer new insights into how non-Abelian self-interactions fundamentally alter wave propagation and serve as benchmarks for numerical simulations, perturbative studies, and experiments on synthetic non-Abelian gauge fields.
Read the full abstract

Algebraic Topology

The discrete homotopy hypothesis for directed graphs

We develop a homotopy theory of directed graphs based on cubical homotopy groups, also known as $A$-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups yields an $\infty$-category, denoted by ${\sf DGra}_\infty$. We prove that ${\sf DGra}_\infty$ is equivalent to the $\infty$-category of spaces, establishing a directed version of the discrete homotopy hypothesis of Carranza and Kapulkin.
Read the full abstract

All authors Briony Eldridge, Sergei O. Ivanov, Xiaomeng Xu, Shing-Tung Yau, Mengmeng Zhang

Algebraic Geometry

A low-valence ribbon graph complex computing the cohomology of $M_{g,m}$

It is proven that every cohomology class of the moduli space $M_{g,m}$ for any $2g+m\geq 3$, $m\geq 1$ can be represented combinatorially by a ribbon quiver with at most four-valent vertices. The "at most four"-valency condition is sharp.

Algebraic Topology

Integral Homology and Poincaré Polynomials of classical and exceptional Real Flag Manifolds

This paper computes the integral homology of real flag manifolds associated with split real forms of classical and exceptional semisimple Lie algebras. Using the cellular homology provided by the Bruhat decomposition, we introduce a unified framework to systematically determine the coefficients of the boundary operator, explicitly resolving the issue of calculating their signs. This is achieved by computing the degree of change of coordinate maps between different reduced decompositions of Weyl group elements, analyzing commutation and braid relations through Lie bracket computations and exponential identities. By adopting the normal form of Weyl group elements as a canonical choice for reduced decompositions, we establish an explicit algorithmic implementation for these homology computations. As a direct application, we derive the Poincaré polynomials for the classical types $B_n, C_n$, and $D_n$ for $n \leqslant 7$, and for the exceptional types $F_4, E_6$, and $E_7$. With the aid of these polynomials, we address the question of the orientability of split real flag manifolds of exceptional Lie algebras.
Read the full abstract

Combinatorics

The Erdős-Pósa property for prime-length cycles fails (and beyond)

We prove that for every $t \in \mathbb{N}$, prime-length cycles do not have the $\frac{1}{t}$-integral Erdős-Pósa property, even when restricted to planar graphs. We in fact prove a more general density result. For every $t \in \mathbb{N}$ and every subset $L \subseteq \mathbb{N}$ with lower density zero, the set of cycles whose length is in $L$ do not have the $\frac{1}{t}$-integral Erdős-Pósa property, even when restricted to planar graphs. We also consider a less restrictive density condition on $L$, called porous, where the complement of $L$ contains arbitrarily long sequences of consecutive integers. We prove that for every porous set $L \subseteq \mathbb{N}$, the set of cycles whose length is in $L$ do not have the Erdős-Pósa property, even when restricted to projective planar graphs. Our results partially answer a question of Gollin, Hendrey, Kwon, Oum, and Yoo [Math. Ann., 393(2):2507-2559, 2025].
Read the full abstract

Number Theory

Exponential sums over singular binary quintics

We give a characteristic-free explicit formula for exponential sums over singular binary quintic forms, based on the Waring decomposition of binary forms. This extends the method used in our previous work on the space of binary quartics to a non-coregular space.

Logic

On $\lam$-existence over a predicate

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part. The notion of $\lam$-completeness, introduced in this paper, captures some obvious necessary conditions for such an extension to be possible (for example, the $P$-part of $A$ has to be a $\lam$-saturated model of the appropriate theory). So in a fully stable theory $T$, $\lam$-existence can only fail for trivial reasons. This generalizes results of Chatzidakis in the context of difference fields of characteristic 0.
Read the full abstract

Optimization and Control

Decision Problems in Multilevel Linear Programming

We study the computational complexity of decision problems in $k$-level linear programming (LP). Seminal work by Jeroslow establishes that determining whether the optimal objective value of a $k$-level LP is at least as good as a given threshold is $\Sigma^{\mathrm{p}}_{k-1}$-hard. In this paper, we demonstrate the matching upper bound and thereby prove that this problem is $\Sigma^{\mathrm{p}}_{k-1}$-complete. To this end, we show that the feasible region of a $k$-level LP can be expressed as a union of sets defined by weak and strict linear inequalities. Moreover, we show that the decision of the unboundedness is $\Sigma^{\mathrm{p}}_{k-1}$-complete. Finally, we discuss the extension of our results to the mixed-binary cases. In short, this work closes lasting open questions in multilevel programming.
Read the full abstract

Analysis of PDEs

Neural Discovery of Strichartz Extremizers

Strichartz inequalities are a cornerstone of the modern theory of dispersive PDEs, but their extremizers are known explicitly only in a handful of sharp cases. The non-convexity of the underlying functional makes the problem hard, and to our knowledge no systematic numerical attack has been attempted. We propose a simple neural-network-based pipeline that searches for extremizers as critical points of the Strichartz ratio, and apply it in three settings. First, on the Schrödinger group we recover the Gaussian extremizers of Foschi and Hundertmark–Zharnitsky in dimensions $d=1,2$ to within $10^{-3}$ relative error, with no analytical prior. Second, on $59$ further admissible pairs in $d=1$ where the answer is conjectural, the method consistently finds Gaussians, supporting the conjecture that Gaussians are the universal extremizers in the admissible range. Third, on the critical Airy–Strichartz inequality at $\gamma=1/q$, where existence is open, the optimization does not converge to any $L^2$ profile: instead, the iterates organize themselves as mKdV breathers $B(0,\cdot;\alpha,1,0,0)$ with growing internal frequency $\alpha$, and the discovered ratio approaches the Frank–Sabin universal lower bound $\widetilde A_{q,r}$ from below with a power-law gap $\sim\alpha^{-0.9}$. We confirm the same picture with an independent Hermite-basis ansatz. We propose a precise conjecture: the supremum equals $\widetilde A_{q,r}$ and is approached, but not attained, along the breather family. The pipeline thus serves both as a validator on known cases and as a discovery tool when no extremizer exists.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Optimal Error Exponents for Composite Sequential Quantum Hypothesis Testing

We study the composite sequential quantum hypothesis testing (SQHT) problem, where the objective is to distinguish a null quantum state from a set of alternative quantum states. We propose a mixture-sequential quantum probability ratio test that adaptively selects measurements based on the current mixture estimate of the alternative set, and stops upon the first threshold crossing of the mixture log-likelihood ratio. Under an expected sample size constraint, we show that our proposed strategy simultaneously achieves the Type-I and (worst-case) Type-II error exponents, characterized by the minimal measured relative entropies between the null state and the alternative set. We further establish a matching converse, thereby characterizing the optimal error exponent region. Finally, our results show that achieving vanishing error probabilities in composite SQHT requires an expected sample complexity at least as large as that of sequential testing between two fixed states.
Read the full abstract