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)

Tuesday 28 April

Numerical Analysis

Numerical Analysis of Stochastic Elliptic Variational Inequalities of the First Kind

This paper presents a numerical approach to the stochastic obstacle problem using the stochastic Galerkin (SG) method. Due to the low regularity of the solution, linear finite elements are employed in both the physical and random variable spaces. Properties of random fields and variational inequalities of the first kind are employed to establish the well-posedness of the problem. Finite element spaces are introduced to construct suitable approximation subspaces, and a comprehensive SG formulation is proposed to solve the stochastic obstacle problem. Well-posedness of the discrete formulation is shown and an optimal error estimate for the numerical solution in the $H^1$-norm is derived. Numerical experiments validate the effectiveness of the SG method, showing that both the expectation error and second moment error converge at a rate of $O(h)$ in the $H^1$-norm, consistent with theoretical predictions.
Read the full abstract

Probability

Terminal Defects, Growing Multiplicity, and Variance Extremality in the Double Dixie Cup Problem

We develop a terminal-defect method for the double Dixie cup problem and use it to prove the finite-variance extremality conjecture of Doumas and Papanicolaou. For every \(m\ge1\) and \(N\ge2\), among all positive coupon probability vectors \(p=(p_1,\ldots,p_N)\), the variance of the time \(T_m(N)\) to collect \(m\) complete sets is uniquely minimized at the uniform vector. We prove the stronger radial statement that the variance is strictly increasing along every ray from the uniform vector. The proof is finite-\(N\) and exact: after Poissonization, the completion time is a maximum of independent Erlang variables, and the radial derivative of its distribution is compared to a size-biased law using a monotone-likelihood-ratio argument based on a log-scale monotonicity property of the Gamma reverse hazard. The same framework gives a growing-multiplicity Gumbel theorem in the equal-probability case, with expectation and variance asymptotics on the inverse gamma-tail scale. This recovers the fixed-\(m\) equal-probability variance asymptotic stated as Conjecture 1 by Doumas and Papanicolaou, classically known for \(m=1\), and extends the mechanism to \(m=m_N\). We also illustrate the unequal-probability theory with endpoint-Laplace limits for power-law probabilities.
Read the full abstract

Information Theory

Relaxation Kernel, Spectral Dissipation, and Global Convergence of Blahut–Arimoto Dynamics

We develop a spectral theory for continuous- and discrete-time Blahut–Arimoto (BA) dynamics, centered on the relaxation kernel $ \G = \E_p[K^*_X \otimes K^*_X] $. Five main results are established. (i) Along the continuous-time BA flow, the free energy satisfies the exact $ \chi^2 $-dissipation identity $ \dot F_\beta = -\D(q) $, where $ \D(q)=\chi^2(\T q \| q) $ is the Pearson $ \chi^2 $-divergence. (ii) The operator $ \G $ admits a threefold identity: it is simultaneously the Gram matrix of the equilibrium Gibbs kernels, the linearised generator of the BA vector field, and the Fisher–Rao Hessian of the free energy at the fixed point. (iii) For the discrete iteration, the one-step Lyapunov dissipation decomposes spectrally as $ \Delta\mathcal{L}^{(2)} = \sum_i c_i^2\, d(\lambda_i) $, where $ d(\lambda) = -\lambda + \tfrac{3}{2}\lambda^2 - \tfrac{1}{2}\lambda^3 $. This reveals a double bottleneck at $ \lambda\approx 0 $ and $ \lambda\approx 1 $, with optimal dissipation near $ \lambda\approx 0.423 $. (iv) Global convergence follows a two-stage mechanism: $ \chi^2 $-dissipation drives finite-time entry into a local neighbourhood, after which the spectral gap $ \lam = \lambda_{\min}(\G|_T) $ governs exponential contraction. (v) The KL convergence factor is explicit: $ \KL(q^*\|q_{n+1}) \le (1-\lam)^2\,\KL(q^*\|q_n) + O(\|v_n\|_*^3) $, with per-iteration improvement $ \gamma = \lam(2-\lam) $. For Gaussian sources, $ \lam = 1/(2\beta\sigma^2) $ and the Jacobian is diagonalised by Hermite polynomials. The spectral formula complements Hayashi's global convergence theory with a constructive, computable local rate.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Rethinking Dimensional Regularization in Critical Phenomena

We show that it is possible to use dimensional regularization (DR) beyond the usual $\varepsilon$-expansion in the context of renormalization group (RG) calculations in Critical Phenomena. Based on this fact, we propose a new functional RG scheme - Functional Dimensional Regularization (FDR) - and apply it to a scalar theory in three dimensions. We compute the critical exponents of the Ising universality class directly in $d=3$ under various typical approximations. The method that emerges combines the agility typical of DR with the generality proper of functional RG. Moreover, at a given order of approximation, FDR seems to provide faster convergence and better estimates than other functional RGs.
Read the full abstract

Numerical Analysis

A Posteriori Error Estimation for Parabolic Equations with Enriched Galerkin Finite Element Methods

This paper introduces a novel a posteriori error estimation framework for the enriched Galerkin (EG) finite element method applied to linear parabolic equations. While the EG method has been recognized for its local conservation property and computational efficiency compared to discontinuous Galerkin methods, its mathematical analysis in the context of a posteriori error estimation for parabolic problems remains unexplored. In this work, we prove reliability and efficiency using the residual-based approach. Furthermore, we integrate these error estimators into an adaptive mesh refinement strategy, demonstrating their effectiveness in achieving efficient and reliable error control through several numerical examples. The proposed approach provides a significant advancement in the mathematical foundation and practical applicability of the EG method for time-dependent problems.
Read the full abstract

Analysis of PDEs

Boundary estimates for the fractional spherical maximal function

In this article, we study the fractional spherical maximal function and its lacunary counterpart. We study the necessary and sufficient conditions for $L^p-L^q$ boundedness of both maximal functions. In particular, we prove the restricted weak type estimate for both full and lacunary fractional spherical maximal functions at the boundary of the maximal $L^p-L^q$ bounded regions.
Read the full abstract

Geometric Topology

Large flats in large subgraphs of fine curve graphs

The fine curve graph of a surface is a graph whose vertices are essential simple closed curves and whose edges connect disjoint curves. Following a rich history of hyperbolicity of various graphs associated to surfaces, the fine curve graph was shown to be hyperbolic by Bowden-Hensel-Webb, while the curve graph, obtained from the fine curve graph by collapsing subgraphs corresponding to isotopy classes, was first proven to be hyperbolic by Masur-Minsky. We show that certain large subgraphs of fine curve graphs, including fibers over a vertex of the curve graph, are not hyperbolic. Indeed, such graphs contain flats of every finite dimension. We then compute bounds on distances in fibers over a vertex of the curve graph, which we call single-isotopy-class fine curve graphs.
Read the full abstract

Numerical Analysis

A nonlocal coupled system: analysis and discretization

We analyze a nonlocal coupled system arising as the Euler–Lagrange equations of an energy functional involving regional fractional Laplacians of orders $s_1$ and $s_2$ ($ 0 < s_1,s_2 < 1$), each acting on a separate disjoint domain and coupled through a nonlocal interaction term depending on a kernel $J$. Under suitable assumptions on the domains and the kernel, we prove existence and uniqueness of the energy minimizer and derive regularity estimates in fractional Sobolev spaces. We introduce a finite element discretization and establish a priori error estimates. We develop an alternating Schwarz-type method for both the continuous and discrete problems and prove its geometric convergence. Numerical experiments validate the theoretical predictions and illustrate the performance of the method.
Read the full abstract

Mathematical Physics

Lie symmetry classification and invariant solutions of time-fractional telegraph systems with variable coefficients

Time-fractional telegraph equations provide fundamental mathematical models for transport processes that exhibit memory and nonlocal effects in industrial and physical systems. These models arise naturally in heat transport in materials with thermal memory, wave propagation in viscoelastic media, and charge transport in spatially heterogeneous semiconductor devices. In this study, we investigate a class of time-fractional telegraph systems with spatially varying coefficients using Lie symmetry analysis and the Riemann–Liouville fractional derivative. We establish a complete Lie group classification for sufficiently differentiable coefficient functions and determine all functional forms that admit such symmetry extensions. The symmetry structure is shown to depend fundamentally on the relationship between the transport coefficient and the potential function, resulting in three distinct symmetry classes. For each case, optimal systems of one-dimensional Lie subalgebras are constructed, and the governing fractional partial differential equations are systematically reduced to fractional ordinary differential equations. Exact invariant solutions are obtained in closed form and expressed in terms of Mittag–Leffler functions, generalized Wright functions, and Fox $H$-functions. These analytical solutions provide valuable insights into fractional telegraph-type transport phenomena and serve as important benchmarks for validating numerical methods in industrial transport modeling and fractional evolution systems.
Read the full abstract

All authors Sodbaatar Adiya, Khongorzul Dorjgotov, Bayarmagnai Gombodorj, Bayarpurev Mongol, Uuganbayar Zunderiya

Mathematical Physics

Gegenbauer polynomials and fluctuation properties of the one-dimensional Riesz gas

The Riesz gas in one-dimension consists of particles interacting via a pair potential, ${\rm sgn}(s) |x - x'|^{-s}$, $s \ne 0$ and $-\log | x - x'|$ for $s=0$. In the infinite density limit, with the particle support the interval $[-1,1]$, we apply a functional derivative method due to Beenakker to compute the covariance of two smooth linear statistics for the Riesz gas with exponent $s \in (-1,1)$, $s \ne 0$. This we give in terms of a sum over Fourier components of the linear statistics with respect to a Gegenbauer polynomial $\{C_n^{(s/2)}(x) \}$ basis, which generalises a known form in the case $s=0$ involving a cosine expansion. For the power sum linear statistic, our general formula can be reduced to a product of gamma function form, and compared against recent exact results in the literature for this case.
Read the full abstract

Classical Analysis and ODEs

The smoothest average and some extremal problems for polynomials

We study the problem of finding the "smoothest” local average of a function $f \in \ell^2(\mathbb{Z})$ when we consider its convolution with suitable kernels $u$. The measurement of smoothness is as follows: Given a positive integer $k$, we aim to minimize the constant \begin{equation*} \sup_{0 \neq f \in \ell^2(\mathbb{Z})} \frac{\|\nabla^{k}(u\ast f)\|_{\ell^2(\mathbb{Z})}}{\|f\|_{\ell^2(\mathbb{Z})}} \end{equation*} among all symmetric kernels $u : \{-n,\dots,n\} \to \mathbb{R}$ with normalization $\sum_{j=-n}^{n}u(j) = 1$. We are also interested in finding the kernel for which the least constant is attained. For $k=1$ and $k=2$, the sharp constants and optimal kernels were obtained by Kravitz-Steinerberger, and Richardson. In this paper, we provide alternative proofs for $k\in \{1,2\}$ by using complex analysis tools. Moreover, we establish the case $k=3$, and also the cases $k\in \{4,6\}$ when the kernels are restricted to have non-negative Fourier transform. These are the first results in the literature for $k>2$. Finally, we deduce a general relation between the sharp constants and optimal kernels corresponding to $\nabla^k$ and $\nabla^{2k}$.
Read the full abstract

Monday 27 April

Algebraic Geometry

Constant cycle surfaces on Fano varieties of cubic fourfolds

Huybrechts proved the finiteness of constant cycle curves of fixed order in any linear system $|L|$ on a K3 surface. In this paper, we study constant cycle surfaces on the Fano variety of lines $F(X)$ of a smooth cubic fourfold $X$. Fano surfaces $F(Y) \subset F(X)$ of hyperplane sections $Y \subset X$ are higher-dimensional analogues of curves on K3 surfaces. We prove that there are at most finitely many constant cycle surfaces of the form $F(Y)$ of any fixed order on $F(X)$.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization

Knowledge base (KB) embeddings aim at combining the capability of classical knowledge graph embeddings to generalize the information present in facts, the ABox, with conceptual knowledge represented in an ontology language, the TBox. Several authors have recently explored the idea of mapping concepts to convex regions in a vector space. This is useful to represent hierarchies, typically present in TBoxes, since more general concepts can be mapped to larger regions, containing those regions associated with more specific concepts. However, the power of convexity is rarely leveraged during the actual learning tasks. Here, we introduce BoxLitE, a KB embedding model for DL-Lite$^{\mathcal{H}}$ that allows for convex optimization. We show that for any satisfiable DL-Lite$^{\mathcal{H}}$ KB, there is a BoxLitE embedding that is a weakly faithful model. As a proof of concept, we show how to formulate the KB embedding task as a convex optimization problem and how to obtain embeddings with such desirable faithfulness properties.
Read the full abstract

All authors Bruno F. Lourenço, Hesham Morgan, Ana Ozaki, Aleksandar Pavlović, Emanuel Sallinger

Analysis of PDEs

A maximum principle for the $p$-Laplacian, an eigenvalue estimate and a stabilization phenomenon for the large-$p$ regime

We establish an explicit maximum principle for the Dirichlet problem associated with the $p$-Laplacian ($p>1$), where the constant depends on both $p$ and the geometry of the domain. From this result we derive two main applications. First, we obtain a new lower bound for the first nontrivial eigenvalue of the $p$-Laplacian, which improves upon existing estimates in certain parameter regimes and for thin domains. Second, we prove an existence theorem for nonlinear boundary value problems of the form \[ -\Delta_p u = \lambda f(u) \quad \text{in } \Omega, \qquad u=0 \quad \text{on } \partial \Omega, \] with $f$ nonnegative, continuous and nondecreasing. A striking consequence is the emergence of a stabilization phenomenon: for every such nonlinearity there exists a threshold $p_0 \colon = p_0(f,\lambda,\Omega)$ such that for all $p \geq p_0$ solutions exist. To our knowledge, this stabilization effect with respect to $p$, that apparently has not been observed before, suggests a connection to the $\infty$-Laplacian.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Statistical Inference and Quality Measures of KV Cache Quantisations Inspired by TurboQuant

We analyse three KV cache quantization schemes under a fair bit budget: KV (scalar MSE baseline), KQV (WHT + MSE on $K$; WHT + MSE + QJL on $V$), and QKQV (WHT + MSE + QJL on both). Starting from the Beta distribution on the hypersphere, we trace how QJL on $K$ inflates inner product variance by $\pi/2$, which softmax amplifies nonlinearly via Jensen's inequality, and we present statistical inference and information metrics to highlight practical differences. Three empirical findings emerge. (1)~At $n=4$ (the practically dominant budget), KQV wins on every measure – KL divergence, geometric $K$ error, and 6D distance – across all distributions and ranks tested. (2)~The K–V asymmetry is unconditional: QKQV is consistently worse than KQV in KL divergence at every budget and distribution. (3)~A budget-dependent crossover exists: QKQV achieves better geometric $K$ reconstruction at $n \in \{2,3,5\}$, KQV at $n \in \{4,6\}$, invariant to rank and tail weight – an open rate-distortion problem. $\mathrm{KL}(p_{\mathrm{ref}} \| p_{\mathrm{quant}})$, K-only by construction, bridges K direction error to routing corruption and output collapse. We present a sufficient condition when the Jensen mechanism amplifies superlinearly through the softmax. At $n \in \{2,3,5\}$, QKQV wins geometrically because this assumption does not bind. At $n=4$, elevated K error and KL divergence for QKQV strongly suggest the Jensen mechanism is the operative cause of the crossover, providing a new perspective and explanation.
Read the full abstract

Rings and Algebras

The structure of $\lim^1$-groups

If $(A_n)_n$ is a decreasing filtration of a module $A$ and $\widehat{A} = \lim_n A/A_n$, then $\lim^1_n A_n$ is identified with the cokernel of the canonical map $A \longrightarrow \widehat{A}$. In this note, we show that any $\lim^1$-group is canonically of that form: For any inverse sequence of modules $(X_n)_n$ there exists an inverse sequence $(A_n)_n$ as above and a morphism $(A_n)_n \longrightarrow (X_n)_n$, depending functorially on $(X_n)_n$, that induces an isomorphism on $\lim^1$. The proof is based on Quillen's small object argument, as formulated by Eklof and Trlifaj in their investigation of the existence of enough injective objects in certain cotorsion pairs, and also uses a construction by Salce that provides enough projective objects therein.
Read the full abstract

Information Theory

Secure Integrated Sensing and Communication: Information Theory Offers Insights

Integrated sensing and communication (ISAC) combines sensing and communication within a shared system framework by using the same transmitted signal for both objectives. ISAC can improve the efficiency of spectrum and hardware use but also gives rise to new security challenges, as users associated with one function may need to be prevented from inferring information related to the other. This paper surveys information-theoretic approaches to secure ISAC with emphasis on formulations, performance metrics, and fundamental limits. We first review the information-theoretic ISAC models that underlie secure formulations. We then organize the secure ISAC literature according to the protected functionality and the adversary model, covering secure communication, sensing security, and active-adversary settings such as jamming. We also discuss formulations in which communication security and sensing security interact more directly, as well as their connections to privacy and covert communication. Throughout, we highlight the main modeling assumptions and the insights they provide on the tradeoffs among communication reliability, sensing performance, and security.
Read the full abstract

General Mathematics

Introduction of Over/Under/Off Masses

In this paper, for the first time, we extend the Over/Under/Off Set/Logic/Probability used in uncertain theories (such as: fuzzy, neutrosophic and extensions) to the Over/Under/Off Mass that could be used in Information Fusion. The approach is exemplified in three scenarios: (1) wildfire evacuation and resource allocation with satellite, IoT, and social media; (2) coverage gaps where indeterminacy must be managed; and (3) security monitoring where contradictory or erroneous reports are discounted.
Read the full abstract

Numerical Analysis

On Physics-Based Loss Scaling for MF-PINNs applied to the neutron diffusion equation

Physics-Based Loss Scaling (PBLS) is introduced for Mixed-Formulation PINNs (MF-PINNs) applied to the neutron diffusion equation. In particular, we propose a new scaled loss function based on the material cross sections, which is equivalent to the classical MF-PINN loss, but accelerates the convergence and improves accuracy of MF-PINNs. Several numerical experiments on both the fixed source and the k-eigenvalue problem, from one-group to multigroup cases and from two-dimensional (2D) to three-dimensional (3D) configurations, illustrate the efficiency of the proposed scaling method.
Read the full abstract

All authors Minh-Hieu Do, François Madiot, Karim Ammar, Nicolas Gérard Castaing

General Mathematics

Lattice triangles whose centers are lattice points

We show that for an integer $\ell$, there exists an acute integer lattice triangle of lattice perimeter $\ell$ such that its orthocenter is an integer lattice point, if and only if $\ell=6 $ or $\ell\ge 8$. Analogous results are obtained for the circumcenter and the centroid, and the results are contrasted with those for obtuse and right triangles.
Read the full abstract

Mathematical Physics

Invariant Measures in Hamiltonian Systems: The Analytical Foundations of Statistical Physics

We construct a measure in the hamiltonian function level sets that is invariant under the hamiltonian flow for short times and flow preserving for arbitrarily long times. This allows a probabilistic approach to the study of hamiltonian systems, in the space of states with fixed energy. We prove that this measure generates the microcanonical partition function employed in physics and show that it can be transformed into the canonical partition function in an asymptotic limit, hence reproducing classical Statistical Physics. We also argue that this gives an alternative solution to Simon's second problem.
Read the full abstract

Dynamical Systems

Lyapunov spectrum of homoclinic classes

We study the Lyapunov spectrum of the ergodic measures of isolated homoclinic classes of $C^1$-generic diffeomorphisms. We show that this spectrum has nonempty interior and that any vector in its interior is the spectrum of some ergodic measure fully supported on the homoclinic class. We also discuss the averaged Lyapunov spectrum of homoclinic classes (an extension of the Lyapunov graph).
Read the full abstract

All authors Lorenzo J. Díaz, Katrin Gelfert, Xiaodong Wang, Jiagang Yang

Combinatorics · Cross-listed from quant-ph

A SWAP-free Framework for QAOA

The performance of the Quantum Approximate Optimization Algorithm (QAOA) on noisy intermediate-scale quantum (NISQ) devices is strongly limited by sparse qubit connectivity. When interactions required by QAOA Hamiltonians are not aligned to the hardware topology, transpilation introduces SWAP gates, increasing circuit depth and noise. We propose a SWAP-free QAOA framework based on modifying the cost Hamiltonian so that it can be implemented natively on the hardware. We formulate this as a mixed-integer semidefinite program (MISDP) that selects a hardware-compatible approximation of the original cost matrix and optimizes the allocation of logical variables to physical qubits. We prove that the associated decision problem is NP-complete and derive theoretical guarantees relating the MISDP objective to the loss in the original optimization problem through the Lovász number of the hardware graph. Since solving MISDPs is practical only for small instances, we introduce heuristics based on spectral properties of the problem matrix and hardware graph. Our experiments on a cardinality-constrained quadratic optimization model for index tracking show competitive performance against a baseline representing ideal QAOA under SWAP-induced noise. These results indicate that, on sparse NISQ architectures, a hardware-aware approximation of the objective may be more effective than an exact but heavily transpiled Hamiltonian implementation.
Read the full abstract

All authors Thiago Assis, Pedro Baptista, Laila Lopes, Diego Ferreira, Gabriel Coutinho

Combinatorics

On the Determinant of Kőnig-Egerváry Graphs

Several graph decompositions that factorize the determinant of the adjacency matrix isolate a Kőnig-Egerváry part, such as the SD–KE decomposition and the critical independence decomposition of Larson. This suggests that the study of graph unimodularity can be approached, to a large extent, through the structure of Kőnig-Egerváry graphs. In this paper we advance this point of view by introducing a new determinant factorization inside the class of Kőnig-Egerváry graphs. More precisely, given a Kőnig-Egerváry graph $G$, we consider the partition of $V(G)$ into its perfect-flower part $PF(G)$ and its perfect-flower-free part $PFF(G)$, and prove that \[ \det(G)=\det(G[PF(G)])\det(G[PFF(G)]). \] We also obtain the analogous factorization for the permanent. This decomposition provides a new tool for the study of unimodularity, reducing the problem to two induced subgraphs of a very different nature: the graph $G[PF(G)]$, whose structure is closely related to Sterboul–Deming configurations with perfect matching, and the graph $G[PFF(G)]$, which is governed by the theory of critical independent sets. In this way, the paper gives a new structural framework for the study of unimodular graphs through Kőnig-Egerváry theory.
Read the full abstract

Combinatorics

Families of Eliahou semigroups linked to Farey intervals

We describe a way to explore the numerical semigroup tree to find all Eliahou semigroups of conductor up to 200 (and conjecturally up to 400) thanks to a new way of representing the semigroups and pruning off unwanted branches. This proves that Wilf's conjecture holds for conductor up to 200. Based on this list, we describe new classes of numerical semigroups, with a Farey interval as a crucial parameter. We show that these semigroups probably all satisfy Wilf's conjecture. We explicitly construct many families of Eliahou semigroups belonging to these classes, encompassing families described by Delgado, Eliahou and Fromentin, and Bras-Amorós.
Read the full abstract

Optimization and Control

Second-order optimality conditions for optimization problems with generalized equation constraints

This paper provides second-order optimality conditions for optimization problems with generalized equation constraints (GEPs), a framework that encompasses several important and challenging models in mathematical programming, including mathematical programs with variational inequality constraints (MPVIs) and bilevel programs. The obtained optimality conditions are novel even for these particular problem classes. As an application, second-order optimality conditions for MPVIs are detailed. The technical key lies in developing first- and second-order variational analysis of the highly intricate constraint system, which is needed to capture the local curvature of the feasible set entering these optimality conditions. Part of this task was already carried out in our companion paper \cite{BeGfrYeZhangZhou}, and here we complete the study. Comprehensive variational analysis results are derived, which are of independent interest.
Read the full abstract

All authors M. Benko, H. Gfrerer, J. J. Ye, J. Zhang, J. Zhou

Information Theory · Cross-listed from quant-ph

Stabilizers for Compiling Logical Circuits under Hardware Constraints

To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance – how can we realize a relatively noiseless computation by cleverly combining noisy components? – and compilation – how can we realize an arbitrary quantum algorithm given the basic operations available on the quantum device at hand? We show how treating the former problem via error-correcting codes enables greater flexibility in resolving the latter. Specifically, we explicitly leverage the fact that error-correcting codes introduce redundancy which renders physically distinct operators logically indistinguishable. In terms of computation, it suffices to implement any operator logically equivalent to some target, yet from a compilation perspective, certain choices may be preferable to others. Our novel contribution is making this intuition precise in the general setting of the special unitary group. In particular, we describe how to reduce the problem of making a compilation-ideal choice to a least squares problem and provide a closed form solution thereof. Using our framework, it is possible to circumvent inserting costly swaps to adhere to hardware connectivity; instead, we could realize the logical target through a distinct physical Hamiltonian that is natively accessible. We elucidate our approach using the $[[4,2,2]]$ code. We discuss connections to compressed sensing that may pave the way to efficient compilation leveraging physical degrees of freedom.
Read the full abstract

Differential Geometry

Classification of Steady Gradient Ricci-Yang-Mills Solitons on Surfaces

We construct string backgrounds in dimension 2 which connect the Hamilton cigar to the round sphere. Specifically, we construct a 1-parameter family of rotationally symmetric steady gradient Ricci-Yang-Mills solitons on surfaces, where we denote the parameter by $\lambda\in[-2,\infty)$. At $\lambda=-2$ is the Hamilton cigar, for $-2<\lambda<0$ the solitons are asymptotic to cylinders, at $\lambda=0$ is a complete noncompact soliton forming a cusp at infinity, and as $\lambda$ approaches infinity the family approaches a round point. Furthermore, we show any complete steady gradient Ricci-Yang-Mills soliton on a surface must come from this family.
Read the full abstract

Optimization and Control

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems

We study the problem of minimizing a multivariate polynomial function over the unit hypercube. Exploiting sparsity in the interaction graph or hypergraph, we identify variables that can be restricted to binary values and eliminate the remaining continuous variables component-wise, reducing the problem to structured binary polynomial optimization. For quadratic objectives, we obtain polynomial-time solvability in the standard Turing model under conditions on treewidth and a nonconvexity measure of the continuous components. For higher-degree objectives, we obtain a polynomial-time algorithm in the unit-cost algebraic RAM model under logarithmic incidence treewidth and small, weakly coupled continuous components.
Read the full abstract

Operator Algebras

Pointwise Convergence for Random Ergodic Averages in Non-commutative $L^p$-spaces

Let $M$ be a semifinite von Neumann algebra and $T$ a positive contraction on both $L^1(M)$ and $L^\infty(M)$. We consider ergodic averages along a random sparse subsequence determined by independent Bernoulli variables $(X_n)_{n\geq 1}$ with $\mathbb{P}(X_n = 1) = n^{-\alpha}$, and set $W_N = \sum_{n=1}^N \mathbb{E}[X_n]$. We prove that, almost surely, the averages $\frac{1}{W_N} \sum_{n=1}^N X_n\, T^n(x)$ converge bilaterally almost uniformly to the ergodic projection for all $1 < p < \infty$. This extends a theorem of Bourgain to the non-commutative setting.
Read the full abstract