Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 15 May

Combinatorics

Three Quantum Latin Squares of Order 6 with Cardinalities 13, 15, and 17

We give three explicit quantum Latin squares of order $6$, with cardinalities $13$, $15$, and $17$. Throughout, vectors differing only by a global phase are counted as identical. The cardinality-$13$ construction is based on an orthogonal direct-sum decomposition $\C^6=\C^4\oplus\C^2$. The cardinality-$15$ and cardinality-$17$ constructions are based on two-dimensional Hadamard pairs supported on coordinate planes.
Read the full abstract

Optimization and Control

Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes

We study a stochastic optimization problem in which the sampling distribution depends on the decision variable, and the available samples are generated through an iterate-dependent Markov chain. Such settings arise naturally in problems with decision-dependent uncertainty; however, they introduce bias and temporal dependence, which render standard techniques developed for i.i.d.\ noise inapplicable. In this work, we analyze the stochastic mirror descent algorithm under iterate-dependent Markov noise. We first establish almost sure convergence for both convex and non-convex problems under the mild assumption of Lipschitz continuity of the objective function, without requiring differentiability. We then derive finite-time concentration bounds for smooth objectives. In the convex setting, the resulting sample complexity matches the classical rate of stochastic mirror descent under i.i.d.\ noise. In the non-convex setting, we obtain a sample complexity bound in terms of the norm of the Riemannian gradient over the probability simplex. Overall, our results establish a unified convergence framework for stochastic mirror descent with state-dependent Markov noise, and highlight its behavior in both convex and non-convex regimes.
Read the full abstract

Optimization and Control

Distributionally Robust Nash Equilibrium Seeking with Partial Observations and Distributed Communication

In this work, we study stochastic one-shot games where agents' utilities depend on the collective strategy profiles of other agents as well as on some well-behaved randomness. While each decision-maker is agnostic to the random variable's underlying distribution, they have access to finitely many i.i.d. samples generated from it. We consider two cases: one where samples are shared; and another, more special one, where samples are individually accessible. To hedge against the unknown uncertainty, each agent plays a distributionally robust game and aims to maximize the worst-case expected utility over a Wasserstein ball around the sample average distribution. In this setting, we provide conditions under which the game has a non-empty set of distributionally robust Nash equilibria (DRoNE) and then characterize the closeness of the DRoNE set to the Nash equilibria (NE) of the associated stochastic game. We then propose an inertial, supported, better response, ascending supergradient dynamics ISBRAG that seeks the DRoNE's when the distributionally robust game possesses what we term as amicable supergradients. This forms the basis of a distributed version (d-ISBRAG) where agents estimate others' strategies by means of a dynamic consensus subroutine over a directed communication network. While initially the distributed algorithm works in the case where agents have individual samples, we later extend this to the case of shared observations under certain simplifying assumptions. This involves analyzing a tractable reformulation of the distributionally robust optimization problem and solving it in a distributed manner to compute the required supergradients. Simulations illustrate our results.
Read the full abstract

Statistics Theory

Bounds on the Number of Modes of a Gaussian Mixture Density

We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in $\mathbb{R}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing the critical-point equations by a reference component, for $k\ge2$ we get the direct Pfaffian bound \[ U_{\mathrm{het}}(d,k)=2^{\,d+\binom{k-1}{2}}\left(d+2\min(d,k-1)+1\right)^{k-1}. \] For the same parameter range, an exact elimination augmented by an algebraic reciprocal variable gives the alternative bound \[ U_{\mathrm{aug}}(d,k)= 2^{\binom{k-1}{2}}(d+1)\left((2k-1)d+2k-1\right)^{k-1}. \] Thus, for $k\ge2$, the best critical-point bound is their minimum. A Morse-theoretic argument improves the corresponding finite-mode upper bound to \[ \left\lfloor \frac{\min\{U_{\mathrm{het}}(d,k),U_{\mathrm{aug}}(d,k)\}+1}{2}\right\rfloor. \] In the homoscedastic case, for $k\ge2$, the direct bound improves to \[ U_{\mathrm{hom}}(d,k)=2^{\,d+\binom{k-1}{2}}\left(d+\min(d,k-1)+1\right)^{k-1}, \] an affine-rank reduction replaces $d$ by the affine rank of the component means, and an augmented homoscedastic reduction gives the dimension-free bound \[ U_{\mathrm{aug,hom}}(k)=2^{\binom{k-1}{2}+1}(2k)^{k-1}. \] On the lower-bound side, for $d,k\ge 2$ we obtain \[ L_{\mathrm{bin}}(d,k)=k+\max_{2\le r\le \min(d,k)}\binom{k}{r}, \] together with a padding-product family that in particular implies the linear lower bound $d+k-1$, and a seed-closure principle that packages product and padding constructions. We further give explicit bounds for the number of connected components of the critical set.
Read the full abstract

Numerical Analysis

Method of Fundamental Solutions for Maxwell's Equations in Bi-Periodic Multilayered Media

In this paper, we present an accurate numerical method for the time-harmonic Maxwell's equations for bi-periodic multilayered media with quasi-periodic incident waves using the Method of Fundamental Solutions in conjunction with a periodization scheme. Following an approach used in acoustic scattering problems, the electric and magnetic fields in each layer are expressed as a sum of near and distant interactions. The near interaction comprises interactions between the unit cell and its nearest neighboring copies, while the distant interaction is approximated by proxy source points placed on spheres surrounding the unit cell. Imposing continuity of tangential components at the layer interface, quasi-periodicity conditions on the walls of the unit cell, and Rayleigh-Bloch expansion for the radiation condition yields a system of equations for the unknown coefficients, which can be solved by Schur complement and a backward-stable solver. The scheme is verified with known solutions and exhibits exponential convergence close to $10^{-14}$ for both single and multiple interfaces. An example with 39 interfaces is presented to demonstrate the solver's performance. The paper provides promising results for extending this method to a fast and accurate boundary integral equation solver for many cutting-edge applications involving a large number of layers in electromagnetics and optics.
Read the full abstract

All authors Jared Weed, Bowei Wu, Jingfang Huang, Min Hyung Cho

Differential Geometry · Cross-listed from cs.LG

Neural Point-Forms

Point cloud learning often rests on the premise that observed samples are noisy traces of an underlying geometric object, such as a manifold embedded in a high-dimensional feature space. Yet much of this geometry is not captured directly by coordinates, pairwise distances, or learned graph neighborhoods alone. In the smooth setting, differential forms are devices to encode higher order tangency information. In this work, we introduce a new family of principled learnable geometric features for point clouds called neural point-forms (NPFs). In the absence of a natural tangency structure, we instead use Laplacian-based techniques from Diffusion Geometry to build a discrete model for comparing differential forms on point clouds via inner products. In the continuum, submanifolds of a shared ambient feature space are represented as comparison matrices, whose entries describe how pairs of feature forms interact with extrinsic tangency information. We make this intuition precise by proving the long-run consistency of comparison matrices under standard sampling, bandwidth, density, and manifold-hypothesis assumptions. This yields a compact, efficient and permutation-invariant neural layer whose output is a learned form-comparison matrix. Across synthetic and biologically relevant experiments, we show that NPFs provide a competitive, and interpretable representation, with the strongest benefits appearing when labels depend on sampling density, manifold-like structure, or response-relevant population geometry.
Read the full abstract

All authors Bruno Trentini, Jacob Hume, Vincenzo Antonio Isoldi, Philipp Misof, Ekaterina S. Ivshina, Kelly Maggs

Optimization and Control

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients

Much of the existing theory on first-order non-smooth optimization is built on a restrictive assumption that the gradients of the objective function are uniformly bounded. We introduce a much more realistic class of generalized Lipschitz functions, where the gradient norms are bounded by an affine function of the optimality gap. We then ask a natural question: what algorithm achieves the best global convergence rates for solving convex stochastic generalized Lipschitz optimization problems? To address this, we develop a new convergence analysis for several existing algorithms and find that AdamW with clipped updates, provably outperforms other popular stochastic optimization methods, such as SGD and AdaGrad. Moreover, our analysis establishes the critical role of AdamW's exponentially weighted gradient accumulation, as opposed to simple averaging. We further show that clipped AdamW is universal and achieves improved rates under the popular generalized smoothness assumption, analyze the convergence of clipped AdamW with diagonal and matrix preconditioners, and extend our results to the quasar-convex setting.
Read the full abstract

Geometric Topology

Detecting Causality with the Links–Gould Polynomial

The conjectures of Low and Natario–Tod, and Penrose's question on Arnold's Problem list ask if causality in spacetimes can be formulated in terms of linking of spheres of light rays in the manifold of all light rays. For $(2+1)$-dimensional spacetimes, this link happens in the manifold coverable by a solid torus $S^1\times \mathbb R^2$. This was solved positively by Chernov and Nemirovski, which raises the question of which link invariants can be used to study causality. Chernov, Martin and Petkova proved that Heegaard–Floer and Khovanov homology completely capture causality. Allen–Swenberg conjectured that the Jones polynomial, which is obtained as an alternating Euler characteristic from Khovanov homology, is also sufficient. But they constructed complicated examples of links $\mathrm{AS}(n)_{n=1}^{\infty}$ that suggest that the Alexander–Conway polynomial – which is the Euler characteristic of Heegaard–Floer homology – is not enough. The Links–Gould polynomial is a quantum invariant that specializes to the classical Alexander–Conway polynomial in two different ways and somewhat surprisingly inherits some of its characteristic classical features. We show that it distinguishes all the Allen-Swenberg links from the link of causally unrelated events and hence detects causality in all known examples where the Alexander–Conway polynomial is not sufficient. This suggests that it may completely capture causality. The work on the categorification of the Links–Gould Polynomial is an ongoing and hard problem, and it is not a subject of this paper. As a corollary, we also compute the Seifert genus of all Allen–Swenberg links.
Read the full abstract

Optimization and Control

Auto-Conditioned Frank-Wolfe Algorithms

Frank-Wolfe methods are projection-free algorithms for constrained optimization whose practical performance often depends critically on the choice of step size. Classical closed-loop step-size rules typically require prior knowledge of a global smoothness constant, while line-search variants avoid this requirement at the cost of additional function evaluations and implementation overhead. In this paper, we develop a fully auto-conditioned framework for Frank-Wolfe-type methods. The framework replaces the global Lipschitz constant in closed-loop step sizes with a local Lipschitz estimator computed from first-order information along the iterates. We show that this abstraction captures several important projection-free subroutines, including standard Frank-Wolfe, Matching Pursuit, pairwise Frank-Wolfe, and away-step Frank-Wolfe. For the resulting general class of methods, we establish convergence to stationary points in the nonconvex setting and recover the standard sublinear convergence guarantees in the convex setting, without requiring prior knowledge of a global smoothness constant. We further show that, when specialized to particular Frank-Wolfe variants and combined with additional structural assumptions, the same auto-conditioned framework yields accelerated convergence rates. Numerical experiments demonstrate that the proposed methods provide substantial practical improvements over line-search-based alternatives, highlighting the benefits of adapting to local curvature while retaining the simplicity of closed-loop step-size rules.
Read the full abstract

Information Theory

PrismQuant: Rate-Distortion-Optimal Vector Quantization for Gaussian-Mixture Sources

For a Gaussian source under mean-squared error (MSE), classical transform coding is rate–distortion (RD) optimal: the Karhunen–Loeve transform (KLT) diagonalizes the covariance, reverse waterfilling allocates the bits, and scalar quantization closes the loop. This elegant story breaks down for multimodal sources, where no single covariance can capture heterogeneous local geometries, and the RD function loses its closed form. We revisit this problem through Gaussian-mixture sources and develop a constructive RD theory for them. Our key finding is that the mixture structure incurs only a component label cost. Conditioned on the active mixture component, each branch is Gaussian; the challenge is allocating bits across heterogeneous branches. We prove that the genie-aided conditional RD function is governed by a single global reverse-waterfilling level shared across all components and eigenmodes. Building on this result, we introduce PrismQuant, which transmits the component label losslessly and encodes the residual using the component-matched KLT, followed by scalar quantization, achieving a rate of H(C)/n bits per source dimension of the converse, with a vanishing asymptotic gap. We further develop a practical implementation based on EM-driven Gaussian-mixture learning, component-adaptive KLTs, and entropy-constrained scalar quantization (ECSQ). Experiments on synthetic Gaussian mixtures show that PrismQuant closely approaches the theoretical RD bound, while experiments on real-world channel-state-information (CSI) data demonstrate competitive or superior performance compared with transformer-based learned codecs at more than one order of magnitude smaller model size.
Read the full abstract

All authors Bumsu Park, Chanho Park, Youngmok Park, Namyoon Lee

Probability

Well-posedness of the obstacle problem for generalized Dean-Kawasaki equation

We investigate the obstacle problem for generalized Dean–Kawasaki equations driven by correlated conservative noise, establishing the existence, uniqueness, and $L^1$-stability of stochastic kinetic solutions. Our core strategy combines a kinetic characterization of the Skorokhod condition with a precise description of the reflection measure term associated with the obstacle, in which the barrier substitutes the solution. This formulation makes the reflection mechanism explicit at the kinetic level and yields a stable framework adapted to $L^1$ doubling of variables method. Consequently, under a merely continuous obstacle and the same structural assumptions as in the obstacle-free setting, we obtain well-posedness over the full porous-medium regime, covering degenerate diffusion and the critical square-root noise coefficient. This extends the existing theory of obstacle problems for stochastic partial differential equations to a class of degenerate equations with singular diffusion coefficients.
Read the full abstract

Combinatorics

Three short proofs of Mathar's 2014 conjecture for OEIS A002627

For the OEIS sequence A002627, defined by the inhomogeneous first-order recurrence $a(n) = n\,a(n-1) + 1$ with $a(0) = 0$, R.~J.~Mathar recorded in February 2014 the conjectured second-order homogeneous recurrence \[ a(n) - (n+1)\,a(n-1) + (n-1)\,a(n-2) = 0, \qquad n \ge 2, \] which has remained marked as a conjecture on the OEIS for over a decade. We give three short proofs. The first is two lines: subtract the defining recurrence at adjacent indices and the constant cancels (we call this homogenisation). The second reads off the same relation from the exponential generating function $F(x) = (e^x-1)/(1-x)$. The third is a Pascal-rule telescoping on the binomial-sum form $a(m) = \sum_{k=0}^{m-1} k!\binom{m}{k}$. All three derivations are elementary, requiring nothing beyond undergraduate techniques. We remark that the same homogenisation trick clears an entire class of “Conjecture: \dots” entries on the OEIS, namely sequences satisfying $a(n) = p(n)\,a(n-1) + q(n)$ with simple $q$.
Read the full abstract

Analysis of PDEs

Bilinear control to trajectories of 1D degenerate parabolic equations in moving domains

In this paper, we are concerned with local controllability properties of degenerate parabolic equations in bounded domains that evolve in time. More precisely, we deal with the exact controllability to a positive trajectory of a one-dimensional semilinear degenerate equation governed via the coefficient of the reaction term. We apply a well-known local inversion method combined with some appropriate specific estimates.
Read the full abstract

Group Theory

A nonfinitely based additively idempotent semiring of order four

We first establish a sufficient condition for an additively idempotent semiring to be nonfinitely based. As applications, we exhibit several examples of additively idempotent semirings satisfying this condition, including a $4$-element semiring $S_{(4,124)}$ whose additive reduct has two minimal elements and two coatoms. Consequently, these semirings have no finite basis for their identities.
Read the full abstract

Thursday 14 May

Optimization and Control

Mirror Descent Methods for Quasar Convex Optimization Problems With Non-Smooth Inequality Constraints

In this paper, we consider constraint optimization problems subject to non-smooth convex functional (inequality-type) constraints, wherein the objective function is non-smooth and quasar convex. We propose and analyze two groups of algorithms, each consisting of a standard version and a modified variant, that operate by switching between two types of iteration points: productive and non-productive. Within each group, we develop distinct mirror descent-type algorithms for both deterministic and stochastic settings, and we establish their convergence rates.
Read the full abstract

Rings and Algebras

Vector Determinant in the ARE Framework: From Scalar to Vector-Valued

The ARE (Action, Rectification, and Structure) method is presented as a framework for reorganizing the Leibniz expansion of the determinant through the action of the cyclic group C_n on S_n. This action partitions the permutations into orbital classes and naturally leads to a finite Fourier decomposition of the determinant structure. The central object of the work is the vector determinant, whose components are Fourier modes associated with orbital sums of Leibniz terms. The classical determinant appears exactly as the fundamental mode G_0(A)=det(A), while the remaining modes are multilinear spectral observables associated with the orbital organization of the expansion. The manuscript establishes the fundamental properties of this formalism, including exact determinant recovery through a linear readout functional, multilinearity, Hermitian symmetry for real matrices, vector Jacobi and Laplace formulas, orbital Parseval identities, a vector Hadamard inequality, and finite trigonometric interpolation. The framework extends naturally to continuous frequencies through an associated orbital polynomial. It does not reduce the factorial complexity of determinant computation, but reveals an orbital-Fourier structure not visible in the classical scalar determinant. The work also clarifies the relation between orbital modes and circulant structures, proving that the crude orbital modes cannot generally coincide with circulant eigenvalues because of polynomial-degree incompatibility.
Read the full abstract

History and Overview of Mathematics

Alice Ambrose on Logic, A Priori Concepts, and the Epistemology of Convention

This essay argues that Alice Ambrose precedes key elements later critiques by Quine, first of Truth by convention (Quine 1936) and later of the analytic-synthetic distinction (Quine 1951). I demonstrate how Ambrose identifies in writing as early as in 1931: (1) the paradox of treating logical principles as mere conventions, (2) the infinite regress in stipulative definitions, (3) the preconditional role of logic for any convention, and (4) the instability of the analytic/synthetic divide. Ambrose, therefore, prefigures Margaret Macdonald (1934) unpublished dissertation (Cf. Spinney 2025) and predates some major contributions to the philosophy of logic by Quine a few years before he made them popular.
Read the full abstract

History and Overview of Mathematics

Extensionalism without Logicism: Ambrose and Extensional Logic

Drawing primarily on her early work (1931-1934), I argue that Alice Ambrose develops a philosophical project centered on preserving the rigor of extensional logic while rejecting the metaphysical and epistemological endorsements of logicism because of its commitment to the notion of material infinity. Positioning Ambrose as a transitional figure between formalism (Russell) and the constructivist turn represented by intuitionism (Brouwer), I demonstrate how Ambrose offers a practice oriented statement of finitist extensionalism. Employing only extensional methods (considering classes, relations, and propositions by reference to their members and truth values instead of mental processes), Ambrose reformulates an existential claim about pi as an explicit infinite disjunction of concrete instances insisting, against intensional projects, that such claims gain meaning only through a finite stopping rule that produces a witness.
Read the full abstract

Combinatorics

Combinatorial Approach to the Second Law

We study the second law in the context of combinatorial processes, focusing on the mechanisms that give rise to irreversible behavior from an underlying deterministic, invertible, and reversible dynamics.

Analysis of PDEs

A tree-like fractal Dirichlet space lying between strong and weak elliptic Harnack inequalities

In this paper we construct a self-similar fractal configured as an infinitely branched tree and equip it with a regular self-similar Dirichlet form. We show anomalous behaviour of the mean exit time with respect to typical metric balls. Under properly selected self-similar measure, we further show the weak elliptic Harnack inequality holds but the strong analogue fails.
Read the full abstract

Metric Geometry

Generalized Apollonius Circles As Equioptic Curves Of Circles In Constants Curvature Geometries

We extend the old definition of the Apollonius circle in such a way that it results in the same curve in Euclidean geometry but will be more convenient in hyperbolic and spherical geometries. We show that there exists an Apollonius circle of the centers of two circles that coincides with their equioptic curves, as in Euclidean geometry.
Read the full abstract

Optimization and Control · Cross-listed from eess.IV

DIPA: Distilled Preconditioned Algorithms for Solving Imaging Inverse Problems

Solving imaging inverse problems has usually been addressed by designing proper prior models of the underlying signal. However, minimizing the data fidelity term poses significant challenges due to the ill-conditioned sensing matrix caused by physical constraints in the acquisition system. Thus, preconditioning techniques have been adopted in classical optimization theory to address ill-conditioned data-fidelity minimization by transforming the algorithm gradient step to achieve faster convergence and better numerical stability. We extend the preconditioning concept beyond convergence acceleration and use it to improve reconstruction quality. We introduce DIPA: Distilled Preconditioned Algorithms, where a preconditioning operator (PO) is optimized using teacher-guided distillation criteria. Unlike standard model-compression KD, the teacher and student differ by the sensing operators available during reconstruction: the teacher uses a simulated, better-conditioned, and more informative sensing matrix, whereas the student uses the physically feasible sensing matrix. We design different distillation loss functions to transfer different properties of the teacher algorithm to the preconditioned student. The PO can be linear (L-DIPA), allowing interpretability, or non-linear (N-DIPA), parametrized by a neural network, offering better scalability. We validate the proposed PO design across several imaging modalities, including magnetic resonance imaging, compressed sensing, and super-resolution imaging.
Read the full abstract

All authors Romario Gualdrón-Hurtado, Roman Jacome, Leon Suarez, Henry Arguello

Combinatorics · Cross-listed from cs.DM

Clique-width and induced topological minors

A $P_4$ is a chordless path on four vertices. A diamond is a graph obtained from a clique of size four by removing one edge of the clique. A paw is a graph obtained from a clique of size four by removing two adjacent edges of the clique. We prove that for a graph $H$, the class of graphs with no induced subdivision of $H$ has bounded clique-width if and only if $H$ is an induced subgraph of $P_4$, the paw, or the diamond. This answers a~question of Dabrowski, Johnson, and Paulusma.
Read the full abstract

All authors Paweł Rafał Bieliński, Jadwiga Czyżewska, Martin Milanič, Amir Nikabadi, Paweł Rzążewski

Number Theory

Explicitly combing hedgehogs over fields of Stufe 4

Let $K[x,y,z]=K[X,Y,Z]/(X^2+Y^2+Z^2-1)$ be the coordinate ring of the algebraic unit sphere over a field $K$. Umberto Zannier showed that there exists a matrix in $\operatorname{SL}_3(K[x,y,z])$ with first row $(x,y,z)$ for $K=\mathbb Q_p$, the field of $p$-adic numbers for an odd prime $p$, or more generally, if $-1$ is a sum of two squares in $K$. The case $K=\mathbb Q_2$ remained open and was subsequently posed and discussed by Zannier with numerous researchers, thereby bringing the problem to broader attention. In 2025, Alexey Ananyevskiy and Marc Levine showed that such a matrix exists if and only if $K$ has Stufe at most $4$, equivalently, if there exist $a,b,c,d\in K$ such that $a^2+b^2+c^2+d^2=-1$. Since $\mathbb Q_2$ has Stufe $4$, this settled Zannier's problem. Their proof is purely existential and does not provide an explicit matrix. In this note, we construct an explicit example in terms of $a,b,c,d$ and describe the computational techniques used to find it.
Read the full abstract

Optimization and Control

Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed bound). Under some condition, we characterize the region to which all interior vertices of such a path must belong (Theorem 1). It is shown that for any point from this region, there exists a polygonal line satisfying the given constraints (Lemma 1). Based on these findings, an explicit expression is derived (Theorem 2) that describes the collection of all admissible sequences of corner points. This expression is then used to construct a finite family of sequences that approximates the aforementioned collection. The resulting finite approximating family serves as the basis for developing algorithms that provide approximate solutions to an optimization problem, where the objective function accounts for both the cost of traversing the segments and the cost associated with the turns.
Read the full abstract

Analysis of PDEs

Symmetry and Rigidity Results for the Mean Field Equation and Hawking Mass on $\mathbb{S}^2$

In this paper, we establish symmetry results for solutions of the mean field equation \[ \frac{\alpha}{2} \Delta u + e^u - 1 = 0 \] on $ \mathbb{S}^2 $ for $\frac{1}{3}\leq \alpha \leq 1$, under a geometric condition $(\mathcal{H})$ introduced below. The proofs utilize the Sphere Covering Inequality and incorporate topological arguments on $ \mathbb{S}^2 $. These results are further applied to demonstrate a rigidity property of the Hawking mass for stable constant mean curvature (CMC) spheres, addressing a question posed by Robert Bartnik in 2002. Our results unify and extend previous rigidity results obtained under symmetry or hemispherical balance assumptions, and apply beyond the nearly spherical setting.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Additivity Results for the Rényi-2 Entanglement of Purification

We reformulate the Rényi entanglement of purification as a constrained minimum output Rényi entropy problem. Equivalently, for $p>1$, this formulation can be expressed in terms of a constrained maximal output Schatten $p$-norm. More precisely, for a completely positive map $\Omega:L(B')\to L(A)$, we consider the quantity $\upsilon_p(\Omega)$ defined by optimizing $\|(\Omega\otimes \mathrm{id}_E)(\sigma^{B'E})\|_p$ over all bipartite states $\sigma^{B'E}$ whose $B'$-marginal is maximally mixed. We focus on the case $p=2$. First, we compute $\upsilon_2$ for the transpose-depolarizing channel and prove that it is multiplicative under tensor powers. We then establish a general multiplicativity criterion: whenever a completely positive map $N:L(B')\to L(A)$ satisfies $N^{\dagger} \mathbin{\circ} N=a\,\mathrm{id}_A+b\,\mathrm{Tr}[\cdot]\,I_d$ for some constants $a,b\ge 0$, where $N^{\dagger}$ denotes the Hilbert-Schmidt adjoint of $N$, the quantity $\upsilon_2(N)$ is multiplicative under tensor powers. Examples of channels satisfying this criterion include the transpose-depolarizing channel, the depolarizing channel, and their respective complementary channels. Furthermore, we show that, for every completely positive map $\Omega$, multiplicativity of $\upsilon_p(\Omega)$ implies multiplicativity for its complementary map. This yields the corresponding additivity statements for the associated Rényi-2 entanglement of purification.
Read the full abstract

Optimization and Control

Control of the Fluidic Pinball using the Quadratic-Quadratic Regulator

The fluidic pinball presents a significant benchmark for nonlinear flow control, managing the complex interactions of three cylinder wakes. This study addresses the stabilization of the fluidic pinball to its unstable steady-state solution using a model-based nonlinear feedback strategy. We propose a framework that combines interpolatory model order reduction (IMOR) with the quadratic-quadratic regulator (QQR), a feedback control methodology that is specifically suited to the quadratic nonlinearity of the Navier-Stokes equations. A finite element model (FEM) of the problem coupled with IMOR is used to produce a reduced-order model (ROM) that accurately represents the input-output dynamics of the actuated wake. The performance of the QQR control is evaluated against the traditional linear feedback control for two different Reynolds numbers, $Re_D = 30$ and $Re_D = 50$. At $Re_D = 30$, the QQR controller is able to stabilize the wake and reaches the desired performance criteria 40.1% faster than using a linear feedback controller. More significantly, at $Re_D = 50$, the QQR controller successfully stabilizes the wake, whereas the linear controller fails to overcome the nonlinearity of the flow. The QQR control effectively suppresses vortex shedding, resulting in the elimination of lift oscillations and a reduction in the drag coefficient. These results demonstrate that the IMOR-QQR framework provides an effective model-based control strategy that can manage nonlinear hydrodynamic instabilities in such complex wake flows.
Read the full abstract

Number Theory

Counting solutions to the quadratic determinant equation

Given $h, N \in \mathbb{N}$ satisfying $1 \leqslant h \leqslant N^2$, we prove an asymptotic formula for the number of solutions to the equation $x_1 x_2 - x_3 x_4 = h$ with $x_1, \ldots, x_4 \in [-N,N] \cap \mathbb{Z}$. We use a combination of combinatorial and analytic arguments in physical space along with bounds for Kloosterman sums. Our main result concerns the case when $h = N^2 + O(N)$, wherein we obtain square-root cancellation error terms by bypassing Kloosterman sum bounds and exploiting an additional symmetry available in this setting via Ramanujan sums. This confirms a speculation of Dhanda-Haynes-Prasala in a very general form.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Coherent States of Non-Null Torus Knots

We construct coherent states for the quantized electromagnetic field that correspond to the classical non-null torus knot solutions of Maxwell's equations in vacuum. We derive the displacement operators from the general relation between classical fields and coherent state amplitudes and verify the defining properties of coherent states through direct computation. We determine the observables of the model: field expectation values, energy density, Poynting vector, helicity, photon number, quadrature uncertainties, and correlation functions, and calculate their expectation values in the knotted coherent states in terms of the integer parameters $(n,m,l,s)$ of the classical solutions. As an example, we particularize the construction in the case of the Hopfion coherent state. These results establish the quantum-classical correspondence for this type of vacuum topological electromagnetic systems.
Read the full abstract