Mathematical Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Saturday 4 April
This work is devoted to the study of dissipative fluid systems, through the lens of a geometric variational formulation. Building upon previous works extending Hamilton's principle to non-equilibrium thermodynamics, the present method incorporates an arbitrary number of additional variables expressed as differential forms. Dissipation sources, thermodynamic flux closures, and their associated boundary conditions are also all expressed in this differential-form framework. The resulting equations are consistent with the fundamental laws of thermodynamics, namely conservation of total energy and positive entropy production. Onsager's principle is also given a simple formulation, while Curie's principle is revisited within this geometric setting through the lens of representation theory. It is shown that this general framework encompasses physically relevant models, such as multi-species magnetohydrodynamics (MHD) equations with intricate dissipation mechanisms.
Combinatorics
On the Structure of 3D Queen Domination
We study the domination number $\gamma(Q_n^3)$ of the three-dimensional $n \times n \times n$ queen graph. The main result is a stratified theorem computing, for each position type – corner, edge, face, or interior – the number of inner-core vertices dominated by a queen, and showing in particular that interior placements dominate strictly more core cells than boundary placements. This yields a symmetry-reduction principle via the octahedral group and complements the standard counting lower bound and layered upper bound, giving $\gamma(Q_n^3) = \Theta(n^2)$. We also certify exact values for $n \leq 6$ via integer linear programming and independent verification.
Read the full abstract
Optimization and Control
Acceleration of Moment Bound Optimization for Stochastic Chemical Reactions Using Reaction-wise Sparsity of Moment Equations
Moment dynamics in stochastic chemical kinetics often involve an infinite chain of coupled equations, where lower-order moments depend on higher-order ones, making them analytically intractable. Moment bounding via semidefinite programming provides guaranteed upper and lower bounds on stationary moments. However, this formulation suffers from the rapidly growing size of semidefinite constraints due to the combinatorial growth of moments with the number of molecular species. In this paper, we propose a sparsity-exploiting matrix decomposition method for semidefinite constraints in stationary moment bounding problems to reduce the computational cost of the resulting semidefinite programs. Specifically, we characterize the sparsity structure of moment equations, where each reaction involves only a subset of variables determined by its reactants, and exploit this structure to decompose the semidefinite constraints into smaller ones. We demonstrate that the resulting formulation reduces the computational cost of the optimization problem while providing practically useful bounds.
Read the full abstract
Numerical Analysis · Cross-listed from cs.CE
Nonlinear Model Updating of Aerospace Structures via Taylor-Series Reduced-Order Models
Finite element model updating is a mature discipline for linear structures, yet its extension to nonlinear regimes remains an open challenge. This paper presents a methodology that combines nonlinear model order reduction (NMOR) based on Taylor-series expansion of the equations of motion with the projection-basis adaptation scheme recently proposed by Hollins et al. [2026] for linear model updating. The structural equations of motion, augmented with proportional (Rayleigh) damping and polynomial stiffness nonlinearity, are recast as a first-order autonomous system whose Jacobian possesses complex eigenvectors forming a biorthogonal basis. Taylor operators of second and third order are derived for the nonlinear internal forces and projected onto the reduced eigenvector basis, yielding a low-dimensional nonlinear reduced-order model (ROM). The Cayley transform, generalised from the real orthogonal to the complex unitary group, parametrises the adaptation of the projection basis so that the ROM mode shapes optimally correlate with experimental measurements. The resulting nonlinear model-updating framework is applied to a representative wingbox panel model. Numerical studies demonstrate that the proposed approach captures amplitude-dependent natural frequencies and modal assurance criterion(MAC) values that a purely linear updating scheme cannot reproduce, while recovering the underlying stiffness parameters with improved accuracy.
Read the full abstract
Combinatorics
Length-Maximal Codes with Given Singleton Defect: Structure and Bounds
Let $\mathcal C$ be an $(n,q^k,d)_q$ code of integer dimension $k\ge2$ and Singleton defect $s=n-k+1-d$. Repeated shortening followed by the Plotkin bound gives \[ n\le (s+1)(q+1)+k-2. \] We study the equality case, calling a code attaining this bound length-maximal. Equality provides rigid structure: the code is symbol-uniform under every successive shortening, is an orthogonal array of strength at least $k-1$, and has pairwise distances in $\{d\}\cup\{n-k+3,\ldots,n\}$. For $k\ge3$ it also satisfies $s\le q-1$ and $(s+2)\mid q(q+1)$. In dimension two, length-maximal codes are equivalent to resolvable $2$-$(q^2,q,s+1)$ multidesigns. The (inner) distance distribution, and hence the Hamming weight enumerator after any codeword is normalised to zero, is determined by the parameters. In dimension four this gives three cases: apart from the MDS case, only $s=q-2$ and $s=q-1$ remain possible; in the latter case the alphabet size is constrained by $(q+2)\mid36$, leaving six values of $q$. For $q\ge4$, every length-maximal code of dimension at least five is MDS, and requires $q$ to be a multiple of $36$. The non-MDS cases are the dual and extended ternary Golay codes, of dimensions five and six. Consequently, for $s\ge1$ one has $k\le4$ unless $q=3$, where $k\le6$. By shortening the codes before applying Plotkin, we provide sharper large-defect bounds and several ranges in which nonlinear codes satisfy the Griesmer bound.
Read the full abstract
Optimization and Control
An Improved Last-Iterate Convergence Rate for Anchored Gradient Descent Ascent
We analyze the last-iterate convergence of the Anchored Gradient Descent Ascent algorithm for smooth convex-concave min-max problems. While previous work established a last-iterate rate of $\mathcal{O}(1/t^{2-2p})$ for the squared gradient norm, where $p \in (1/2, 1)$, it remained an open problem whether the improved exact $\mathcal{O}(1/t)$ rate is achievable. In this work, we resolve this question in the affirmative. This result was discovered autonomously by an AI system capable of writing formal proofs in Lean. The Lean proof can be accessed at https://github.com/google-deepmind/formal-conjectures/pull/3675/commits/a13226b49fd3b897f4c409194f3bcbeb96a08515
Read the full abstract
Optimization and Control
Ordinary differential equations for regularized variational problems involving semi-discrete optimal transport
We consider entropically regularized, semi-discrete versions of variational problems on the set of probability measures involving optimal transport as well as other terms. We prove that the solutions can be characterized by well-posed ordinary differential equations in the regularization parameter. The initial conditions for these equations, corresponding to solutions to completely regularized problems, are typically known explicitly. The ODE can then be solved to recover the solution for an arbitrary degree of regularization; we verify that the solution is continuous in the regularization parameter, implying that taking the limit of the trajectory yields the solution to the fully unregularized problem. We establish analogous results for a version of the problem when the non-optimal transport term is not scaled with the regularization parameter. We exploit our characterization to numerically solve several example problems using standard ODE methods; this strategy exhibits superior robustness to alternatives such as Newton's method, as arbitrary initializations are not required.
Read the full abstract
Probability
Equilibrium fluctuations for a multi-species particle system with long jumps
In the present paper, we study the equilibrium fluctuations of a particle system in infinite volume with two conserved quantities and long-range dependence. More specifically, the model of interest is the so-called ABC model, in which three types of particles (A, B and C) exchange their locations between $x\in\mathbb{Z}$ and $x+z\in\mathbb{Z}$ at a rate that depends on the type of particles involved and is proportional to $|z|^{-\gamma-1}$ for $\gamma>0$. After rigorously identifying the normal modes associated to the conserved quantities (the density of particles of types $A$ and $B$, say), we prove that their fluctuations converge to independent fractional stochastic partial differential equations (SPDEs), which are either Gaussian or the Stochastic Burgers equation, and whose nature is determined by the microscopic range of dependence and the strength of the asymmetry.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Geometry- and topology-controlled synchronization phase transition on manifolds
In this work, we explore how the geometry and topology of the underlying manifold shape the synchronization phase transition of a system. To do so, we extend the Kuramoto-Sakaguchi model from spheres to compact, connected, orientable, and homogeneous Riemannian manifolds of arbitrary dimension. Starting from the mean-field kinetic equation on the manifold, we derive a local response equation for the order parameter near the incoherent state and separate the geometric and topological contributions to the phase transition out of the incoherent state. The manifold geometry determines the averaged projection factor $\kappa\left(M\right)$, which directly controls the coupling strength required to destabilize the incoherent state. The critical coupling is determined jointly by this geometric factor and the response of the intrinsic drift fields. The manifold topology affects the phase transition through the Euler characteristic $\chi\left(M\right)$: the Poincaré-Hopf relation fixes the net defect charge of the incipient ordered texture, and the local reduction and sign conditions stated below allow the same Euler-characteristic data to constrain the cubic coefficient of the reduced response equation. In that conditional class, a non-zero Euler characteristic gives the cubic sign used in the reduced normal form, and an additional stabilization condition gives a discontinuous local transition. When $\chi\left(M\right)=0$, the local branch is determined by the normal-form coefficients rather than by the Euler characteristic alone. We evaluate these geometric and topological indicators on representative families. Our framework recovers the topological part of the classical hyperspherical parity distinction and extends it to a broad class of non-spherical state spaces.
Read the full abstract
Number Theory
Arithmetic volume of Shtukas and Langlands duality
We extend the work of Feng–Yun–Zhang relating the arithmetic volume of Shtukas with derivatives of zeta functions by allowing arbitrary coweights for split semisimple algebraic groups. As in their original work, the formula involves some numbers called eigenweights. We obtain uniform formulas for the eigenweights in terms of the Langlands dual group, marking the first structural role for the dual group in such formulas governing derivatives of L-functions.
Read the full abstract
Analysis of PDEs
On Coron problems with Choquard term and mixed operator
In this article, we study a Coron-type problem involving a critical Choquard nonlinearity driven by a mixed operator combining the Laplacian and fractional Laplacian. In annular-type domains, we prove the existence of nontrivial positive solutions when the inner hole is sufficiently small. Using variational methods and concentration compactness arguments, we establish a global compactness result for Palais- Smale sequences and obtain high-energy solutions using topological methods. We also derive regularity results for weak solutions.
Read the full abstract
Numerical Analysis
Virtual element approximation of eigenvalue problems: is the stabilization of the right hand side necessary?
The VEM approximation of eigenvalue problems usually involves the appropriate tuning of stabilization parameters, unless self-stabilizing or stabilization-free VEM are used. In this paper we prove that for elliptic self-adjoint eigenvalue problems the stabilization of the mass matrix is not necessary when lower order standard VEM spaces are adopted. Numerical evidence shows that also for higher order schemes the same result is true on various mesh sequences.
Read the full abstract
Classical Analysis and ODEs
A Minimalist Approach to Rolling Wheels
In 1960, G. B. Robison discovered the general equations relating roads and wheels, where either can have an unusual shape (e.g., the square wheel rolls smoothly on a catenary). But he used some inobvious assumptions regarding the meaning of rolling. Here we derive the equations for the road appropriate for a given wheel using only the single assumption that rolling occurs with no slipping. We do not require that the wheel be differentiable, so this allows the construction of a wheel-road pair when the wheel is a continuous nowhere differentiable function.
Read the full abstract
Number Theory
On higher dimensional integrality and multiplicative dependence in semigroup algebraic dynamics
We study multiplicative dependence of points in semigroup orbits in higher dimensions. More specifically, we show that the non-density of integral points in semigroup orbits implies sparsity of multiplicative dependence in orbits. This can be viewed as a semigroup dynamical and a higher dimensional version of recent results by Bérczes, Ostafe, Shparlinski and Silverman, which in turn can be viewed as a generalization of theorems of Northcott and Siegel. We also confirm that the non-density hypothesis of integral points in orbits is implied by Vojta's conjecture.
Read the full abstract
Geometric Topology
Explicit canonical cycle at the virtual cohomological dimension of $\mathrm{SL}_n(\mathbb{Z})$ through Voronoi complex
We construct an explicit canonical cycle in the top-dimensional homology of the Voronoi complex associated with an arithmetic group. This cycle relates to the cohomology of SL$_n(\mathbb{Z})$ with rational coefficients at the virtual cohomological dimension. This cycle has been previously identified in computational works and conjectured to provide an intrinsic generator. Our approach relies on a geometric rigidity property of Voronoi tessellations. Furthermore, an abstract framework for polyhedral tessellations of convex cones under group actions is established, elucidating the underlying mechanism of the construction of such cycles.
Read the full abstract
Analysis of PDEs
Solvability of a Mixed Problem for a Time-Fractional PDE with Time-Space Degenerating Coefficients
In this paper, we investigate the unique solvability of a mixed boundary value problem for a fractional partial differential equation featuring a degenerate coefficient. By introducing a novel operator and applying the method of separation of variables, we establish the existence of eigenvalues and eigenfunctions for the associated spectral problem and prove that the operator possesses a discrete spectrum. Additionally, we establish the relationship between the given data and the unique solvability of the problem, offering new insights into how degeneracy influences fractional diffusion processes.
Read the full abstract
Analysis of PDEs
Nonexistence results for semilinear elliptic equations on metric graphs
In this paper, we study the nonexistence of solutions to semilinear elliptic equations with a positive potential on metric graphs. In particular, the Laplacian under consideration is of a special type, related to both the vertices and edges of metric graphs. We construct a modified distance function, introduce appropriate test functions, and establish the nonexistence of global solutions under suitable volume growth conditions imposed on the potential. More precisely, the nonnegative solutions or sign-changing solutions to the equations are the trivial zero solutions.
Read the full abstract
Combinatorics · Cross-listed from cs.DS
Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
We study algorithmic matroid intersection coloring. Given $k$ matroids on a common ground set $U$ of $n$ elements, the goal is to partition $U$ into the fewest number of color classes, where each color class is independent in all matroids. It is known that $2\chi_{\max}$ colors suffice to color the intersection of two matroids, $(2k-1)\chi_{\max}$ colors suffice for general $k$, where $\chi_{\max}$ is the maximum chromatic number of the individual matroids. However, these results are non-constructive, leveraging techniques such as topological Hall's theorem and Sperner's Lemma. We provide the first polynomial-time algorithms to color two or more general matroids where the approximation ratio depends only on $k$ and, in particular, is independent of $n$. For two matroids, we constructively match the $2\chi_{\max}$ existential bound, yielding a 2-approximation for the Matroid Intersection Coloring problem. For $k$ matroids we achieve a $(k^2-k)\chi_{\max}$ coloring, which is the first $O(1)$-approximation for constant $k$. Our approach introduces a novel matroidal structure we call a flexible decomposition. We use this to formally reduce general matroid intersection coloring to graph coloring while avoiding the limitations of partition reduction techniques, and without relying on non-constructive topological machinery. Furthermore, we give a fully polynomial randomized approximation scheme (FPRAS) for coloring the intersection of two matroids when $\chi_{\max}$ is large. This yields the first polynomial-time constructive algorithm for an asymptotic variant of Rota's Basis Conjecture. This constructivizes Montgomery and Sauermann's recent asymptotic breakthrough and generalizes it to arbitrary matroids.
Read the full abstract
Information Theory
Caps and LCD Codes with Large Dimensions
We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal binary caps, we derive nonexistence theorems for binary LCD codes with minimum distance at least $4$, providing computation-free proofs that were previously obtained only through exhaustive search. As an application, we completely determine the optimal minimum distances for codimensions $7$ and $8$ for the first time. The framework applies to ternary LCD codes and quaternary Hermitian LCD codes, where it reduces the problem to the structure of large caps. Using known results on large caps, we determine the optimal minimum distances of ternary LCD codes of codimension $6$ for all lengths, and we explain why the phenomena behind the binary nonexistence theorems, such as the dependence on the parity of the length, have no counterpart for these codes.
Read the full abstract
Mathematical Physics
Spatial Localization of Relativistic Quantum Systems: The Commutativity Requirement and the Locality Principle. Part I: A General Analysis
We investigate whether commutativity is necessary to represent relativistic locality for localization observables of relativistic quantum systems in Minkowski spacetime. A well known no-go theorem by Halvorson and Clifton shows that commutativity of localization effects for causally separated regions is incompatible with other seemingly natural assumptions about spatial localization. Since commutativity is taken to represent locality in the Araki-Haag-Kastler framework of QFT, this prompts the question whether it follows from more elementary locality principles of quantum theory. Using Busch's operational analysis in terms of no-signaling and relativistic consistency, we argue that for particle-like systems commutativity is not implied by these principles. Assuming a natural local detectability principle, elementary localization observables are not localized in arbitrarily small spacetime neighborhoods of the relevant spatial regions, but rather in regions containing the entire rest space (a Cauchy surface) on which the measurement is performed. This reflects the particle picture itself, where localization occurs at a unique place on a rest space filled with ideal detectors, and therefore does not directly conflict with the Araki-Haag-Kastler notion of locality. We also show that commutativity and localization can coexist for less idealized localization procedures. To this end, we introduce conditional localization POVMs associated with bounded spatial regions interpreted as laboratories. By the gentle measurement lemma, these observables describe conditional localization probabilities and can, in principle, satisfy commutativity for causally separated laboratories. They may therefore be represented by local observables in the Araki-Haag-Kastler sense. Explicit examples are presented in a second work within local QFT.
Read the full abstract
Optimization and Control
Carbon-Driven Incentive Mechanism for Renewable Power-to-Ammonia Production in Coupled Carbon and Ammonia Markets
Renewable power-to-ammonia (ReP2A) production offers a promising pathway to decarbonize the power, transport and, chemical sectors, yet its competitiveness remains limited by high costs and fragmented carbon-policy frameworks. In particular, a unified mechanism that links ReP2A producers with fossil-based gray ammonia (GA) competitors in carbon and ammonia markets, while coordinating incentives among renewable generation, hydrogen production, and ammonia synthesis stakeholders in the ReP2A process chain, is still lacking. To address this gap, this paper proposes a hierarchical carbon-driven incentive mechanism (PCIM) that integrates carbon policy with multi-energy market interactions. A two-layer trading framework is developed, where ReP2A and GA compete in carbon allowance (CA) and ammonia markets (outer layer), while electricity and hydrogen transactions coordinate the ReP2A chain (inner layer). The resulting interactions are modeled as a hierarchical equilibrium, where the inner layer is reformulated as a tractable equivalent optimization problem, and the outer layer is solved as a mixed-integer linear program (MILP) derived from Karush-Kuhn-Tucker conditions. Based on equilibrium analysis, the carbon-related revenue of ReP2A is quantified, and a CA allocation mechanism (PCAM) is proposed to ensure individually rationality among stakeholders. Results show that the proposed mechanism reduces carbon emissions by 12.9% with only a 1.8% decrease in sector-wide revenue. Moreover, carbon pricing under the proposed framework redistributes profits between green and gray ammonia without reducing total welfare, and the PCAM further enhances stakeholders' willingness to participate in ReP2A production.
Read the full abstract
Numerical Analysis
A high order stabilization-free virtual element method for general second-order elliptic eigenvalue problem
In this paper, we discuss a novel higher-order stabilization-free virtual element method for general second-order elliptic eigenvalue problems. Optimal a priori error estimates are derived for both the approximate eigenspace and eigenvalues. Numerical experiments are conducted on regular convex polygonal meshes, convex-concave polygonal meshes, and concave polygonal meshes. The numerical results validate the effectiveness of the proposed method.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Quantum Algebraic Diversity: Single-Copy Density Matrix Estimation via Group-Structured Measurements
We extend the algebraic diversity (AD) framework from classical signal processing to quantum measurement theory. The Quantum Algebraic Diversity (QAD) Theorem establishes that a group-structured positive operator-valued measure (POVM) applied to a single copy of a quantum state produces a full-rank, group-averaged density matrix estimator whose eigenbasis and eigenvalue ordering track those of the true density matrix, with a bias toward the symmetrized state, analogous to the classical recovery of covariance eigenstructure from a single observation. We establish a Classical-Quantum Duality Map connecting classical covariance estimation to quantum state tomography, and an Optimality Inheritance Theorem showing that classical group optimality transfers to quantum settings via the Born map within the group-averaged family. SIC-POVMs are identified as AD with the Heisenberg-Weyl group and mutually unbiased bases as AD with the Clifford group, revealing the hierarchy $\mathrm{HW}(d) \subseteq \mathcal{C}(d) \subseteq S_d$ that mirrors the classical $\mathbb{Z}_M \subseteq G_{\min} \subseteq S_M$. The double-commutator eigenvalue theorem gives polynomial-time adaptive POVM selection. A worked qubit example shows the group-averaged estimator from a single computational-basis measurement, averaged over a matched $\mathbb{Z}_2$ group, reaching fidelity 0.99 where standard single-basis tomography gives a rank-1 estimate of fidelity 0.80. Monte Carlo simulations for $d = 2$ to $13$ confirm fidelity above 0.90 from a single outcome while standard fidelity degrades as $\sim 1/d$. The growing ratio reflects collapse of the rank-1 standard estimator, not fewer copies per parameter: the biased single-copy estimator reduces the number of distinct measurement settings, not the per-parameter sampling cost, and a genuine copy reduction holds only under exact symmetry.
Read the full abstract
Probability
Statistical Inference for Fractional Diffusions
This is a review of statistical inference methodology for stochastic differential equations driven by fractional Brownian motion, otherwise called fractional diffusions. The first section reviews the theory needed to rigorously define them. The second section reviews existing theory of statistical inference for fractional diffusions, identifies remaining challenges and introduces a novel approach. The final section discusses results for the case where fractional diffusions result as a homogenisation limit.
Read the full abstract
Combinatorics
Magnitude homology of real hyperplane arrangements
We define and study the magnitude and magnitude homology of real hyperplane arrangements by regarding their tope graphs as metric spaces. Since magnitude is a refinement of the cardinality, this may be viewed as a natural generalization of the classical problem of counting the chambers of an arrangement. Our central result is a structure theorem asserting that the magnitude and magnitude homology of an arrangement decompose into contributions indexed by its faces. In particular, the magnitude is determined by the intersection lattice of the arrangement. We also observe several interesting phenomena, including a characterization of Boolean arrangements in terms of diagonality and a reciprocity theorem reminiscent of Ehrhart–Macdonald reciprocity. Finally, based on explicit computations, we conjecture that the magnitude homology of an arrangement is torsion-free and determined by its intersection lattice.
Read the full abstract
Probability
Berry-Esseen Bounds for Statistics of Non-Stationary, $\phi$-Mixing Random Variables
Using a modification of Stein's method, we generalize the results of Bentkus, Götze, and Tikhomirov \cite{bentkus1997berry} to obtain Berry-Esseen bounds for a broad class of statistics of sequences of $\phi$-mixing, non-stationary random variables with polynomial mixing rates. %and linear variance. We then consider applications of this theorem to ensure Berry-Esseen rates for various classes of non-stationary $\phi$-mixing random variables, including rates for a general class of processes of $\phi$-mixing random variables satisfying an aggregate third moment bound.
Read the full abstract
Differential Geometry
A Pontryagin class obstruction for purely electric and purely magnetic Weyl curvature tensors
Do all manifolds that admit Lorentzian metrics also admit such metrics that have a purely electric (PE) or purely magnetic (PM) Weyl curvature tensor? To (partially) answer this question, we show that for all algebraic curvature tensors on a $4k$-dimensional scalar product space that are even or odd under the action of a orientation-reversing isometry, the products of Pontryagin forms that land in the top-degree exterior power of the dual vector space vanish. We use this to derive the vanishing of all products of Pontryagin classes that land in the top-degree de Rham cohomology of a $4k$-dimensional pseudo-Riemannian manifold with a PE or PM Riemann or Weyl curvature tensor. For compact manifolds, this gives nontrivial cohomological obstructions to the existence of such pseudo-Riemannian metrics with globally PE or PM Riemann or Weyl curvature tensors. These obstructions can be linked to the existence of Lorentzian metrics of several Petrov subtypes, which play an important role in classifying exact solutions to the Einstein equations. Moreover, they can be applied to foliations by nondegenerate umbilic hypersurfaces, which may appear as timeslices of spacetimes.
Read the full abstract
Analysis of PDEs
Well-posedness of inhomogeneous nonlinear wave equations in $\mathbb{R}^3$
This paper is devoted to the well-posedness of the inhomogeneous nonlinear wave equations. By combining Strichartz estimates with the contraction mapping principle, we establish local and global well-posedness in the function spaces $\dot{H}^1(\mathbb{R}^3)\times L^2(\mathbb{R}^3)$ and $\dot{H}^{s+1}(\mathbb{R}^3)\times \dot{H}^{s}(\mathbb{R}^3)$. The analysis is carried out in the energy-subcritical regime. As a consequence, our results extend and improve upon previous results in the literature for general nonlinear wave equations.
Read the full abstract
Optimization and Control
Robust self-testing with CHSH mod 3
The CHSH mod 3 Bell inequality is a natural testbed for higher-dimensional quantum nonlocality, yet its maximal quantum violation and self-testing properties have remained unresolved. We determine its exact maximal quantum value and show that, up to unitary equivalence and the natural symmetries of the inequality, it admits a unique optimal irreducible strategy; equivalently, there are four symmetry-related optimal irreducible strategies. Each of these strategies uses a maximally entangled two-qutrit state. We further prove that any strategy whose value is within $\varepsilon$ of the optimum is $O(\sqrt{\varepsilon})$-close, up to local isometries, to a direct sum of optimal irreducible strategies.
Read the full abstract
Information Theory
Region-Based Constellation Designs for Constructive Interference Precoding in MU-MIMO
The performance of constructive interference precoding (CIP) for multi-user multi-antenna (MU-MIMO) systems is governed by the structure of the constructive interference (CI) regions, yet this is overlooked in conventional constellation design. This work proposes the region-based constellation (RBC) model to lay the foundation for CIP constellation design. An RBC directly defines the mapping between messages and their feasible regions, instead of deriving them from an existing constellation. To provide insight for RBC design, we study the limitations of quadrature-amplitude-modulation (QAM)-based CIP. Analytical results show that the restrictive CI regions of QAM symbols are systematically misaligned with the objective-minimising sign pattern, resulting in a significant gap to the theoretical performance limit. From the perspective of improving sign alignment, two novel RBC schemes with non-convex feasible regions are proposed, namely mirrored-ends QAM (ME-QAM) and real-extended ME-QAM. A low-complexity algorithm is also developed for the resulting mixed-integer quadratic program, achieving a complexity comparable to QAM-based CIP. Simulation results with constellation sizes $\{16,64\}$ demonstrate up to $4$~dB signal-to-noise-ratio gain of the proposed schemes over QAM-based CIP. The proposed RBC model is also applicable to other systems with non-bijective modulation, representing a promising direction for future research.