Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 29 April

Quantum Algebra · Cross-listed from quant-ph

Resolving spurious topological entanglement entropy in stabilizer codes

Topological entanglement entropy (TEE) is a key diagnostic of long-range entanglement in two-dimensional gapped phases of matter, but it can suffer from spurious contributions that overestimate the total quantum dimension of the underlying topological order. In this work, we identify the microscopic origin of spurious TEE and introduce a concave partition for computing the Levin-Wen TEE of translation-invariant stabilizer codes of prime-dimensional qudits. We rigorously prove that this prescription is free of spurious contributions. As a complementary probe, we study bivariate bicycle codes on a bipartite cylinder and show that the entanglement entropy depends sensitively on the cylinder circumference, revealing topological frustration of the underlying anyons.
Read the full abstract

All authors Peilun Han, Zijian Liang, Yifei Wang, Bowen Yang, Yingfei Gu, Yu-An Chen

Optimization and Control

Man, Machine, and Mathematics

Nonlinear models and optimization methods have successfully tackled a rapidly growing set of problems in recent years. Indeed, a relatively small toolbox of such models and methods can provide sufficient performance across a large landscape of tasks: deep learning alone has made significant recent contributions in scientific modelling, natural language processing, visual analysis, etc. A similar relationship exists between physical theories and phenomena, where many applications and observations emerge neatly from remarkably minimal foundations. It is natural to wonder if sparse unified frameworks could be built to steer discussion and discovery in the fields concerned with learning, optimization, and modelling. In this work, we posit and examine a possible outline for such a unified theory, interpreting the notion of ”learning” in a broad sense. In particular, we pursue our goals by viewing learning as an inter-connected process on multiple levels: problem setup, choosing methods, and the analysis of their interplay via imposed optimisation dynamics. We begin by proposing a precise yet versatile definition for ”solvable” problems. We then define the ”parametrised methods” by which their solution(s) may be ”learned”. Our goal is to sketch a ”universal convergence theorem”, specifying how and when solvable problems become amenable to the methods chosen for them. We find these constructions reduce the study of learning down to remarkably few ideas and tools - many of which are simply adapted from existing ones in dynamical systems theory, geometry, and fundamental physics.
Read the full abstract

Operator Algebras · Cross-listed from quant-ph

Some applications of Choi polynomials of linear maps

This paper investigates the properties of Choi polynomials and their fundamental role in the theory of positive linear maps between matrix algebras. By focusing on Hermitian symmetric biquadratic forms, we establish a connection between the positivity of these forms and the structure of positive maps. We specifically explore the construction of indecomposable positive maps in matrix algebras, and their application as entanglement witnesses. Our analysis extends to the detection of Positive Partial Transpose (PPT) entangled states and the classification of edge PPT states in $M_m(\mathbb{C}) \otimes M_n(\mathbb{C})$. Our results provide a refined framework for identifying non-separable states that escape the standard PPT criterion, contributing to the broader understanding of entanglement distillation and quantum information theory.
Read the full abstract

All authors Minh Toan Ho, Thanh Hieu Le, Cong Trinh Le, Hiroyuki Osaka

Mathematical Physics

On the Quantisation of Linear Gauge Theories on Lorentzian Manifolds: Maxwell's Theory via Complete Gauge Fixing

This thesis is devoted to the study of hyperbolic differential operators on globally hyperbolic manifolds, linear gauge theories and their quantisation. In the first part, we treat the Cauchy problem for symmetric hyperbolic systems and normally hyperbolic operators on globally hyperbolic manifolds from first principles. Although hyperbolic equations are usually studied with local interactions, there are strong motivations from several areas of mathematical physics to consider also nonlocal interactions. As an intermezzo, we therefore take a small deviation from the classical local theory and prove well-posedness of the Cauchy problem for symmetric hyperbolic systems coupled to a broad class of nonlocal potentials. The second part presents a detailed exposition of linear gauge theories in globally hyperbolic spacetimes. Linear gauge theories are yet another deviation from the concept of hyperbolicity: the corresponding equations of motion are generically non-hyperbolic; however, can always be reduced to a constrained hyperbolic dynamics once an appropriate gauge fixing procedure has been applied. We give a thorough analysis of their Cauchy problem and classical phase space, complemented by a detailed discussion of many examples of physical interest, and discuss their quantisation following the algebraic approach to quantum field theory. The final chapter is devoted to the quantisation of Maxwell's theory on globally hyperbolic spacetimes, with the goal of proving the existence of Hadamard states. The novelty of our approach lies in a new gauge-fixing procedure at the level of initial data, which allows us to suppress the unphysical degrees of freedom. This gauge is achieved by means of a new Hodge decomposition for differential k-forms in Sobolev spaces on complete Riemannian manifolds, while states are constructed using tools from pseudodifferential calculus.
Read the full abstract

2604.27026 · 29 Apr · PhD Thesis, University of Genoa, Italy. xviii + 252 pages, 4 figures. The results are based in part on [arXiv:2401.08403] and [arXiv:2507.05004]; to a lesser extend, the thesis draws on aspects from [arXiv:2407.07576] and [arXiv:2507.11965]. This is an updated version of the PhD thesis defended in February 2026 and incorporates minor corrections over the original at hdl.handle.net/11567/1286476

Differential Geometry · Cross-listed from gr-qc

The Hawking Singularity Theorem for Hölder Continuous Metrics with $L^p$-Bounded Curvature

We prove a low-regularity version of Hawking's singularity theorem for Lorentzian metrics in $W^{1,p}$ with Riemann curvature in $L^p$, where $p>2n$ and $n$ the dimension of spacetime. This extends previous results beyond the Lipschitz regime. Under suitable lower Ricci bounds and upper mean curvature assumptions, expressed in terms of temporal functions, we establish both the globally hyperbolic version of Hawking's theorem, in the form of an upper bound on the time separation from a spacelike Cauchy hypersurface, and the version with a compact achronal spacelike hypersurface, yielding timelike RT-geodesic incompleteness. The proof combines regularisations, based on the elliptic RT-equations, to raise the regularity of the metric by one derivative, with a refinement of the previously used manifold convolution. We introduce a new smeared-out notion of mean curvature adapted to the low metric regularity before, and the $W^{2,p}$-hypersurfaces arising after regularisation. As further consequences, we show that $W^{1,p}$-Lorentzian metrics with $L^p$-bounded curvature are causally plain, and we prove a corresponding low-regularity version of Myers's theorem in the Riemannian setting.
Read the full abstract

All authors Michael Kunzinger, Moritz Reintjes, Roland Steinbauer, Inés Vega-González

Differential Geometry

Weighted linearization of vector fields via a formal Moser trick

Many well-known theorems establish sufficient criteria for linearizability of a vector field in terms of the eigenvalues of its linear approximation. By attaching weights to coordinates so that some directions are considered "linear", others "quadratic", and so on, one can define the notion of a weighted linear approximation. It is thus natural to ask when a vector field is "weighted-linearizable". In this paper, we formulate a weighted version of the non-resonance condition appearing in the Poincaré and Sternberg linearization theorems and show that it implies weighted linearizability. Our approach first addresses weighted linearization on the level of formal power series. In doing so, we develop a general framework to make sense of a power series version of Moser's trick, a technique used to prove various normal form results in geometry. This formal Moser trick works over any field of characteristic zero and may be of independent interest.
Read the full abstract

Classical Analysis and ODEs

Fractions of Recurrence Operators for Generalized Fourier Series in Classical Orthogonal Polynomials

We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this equation as the numerator of a fraction of linear recurrence operators. This interpretation lets us give a simple and unified view of previous algorithms computing these recurrences, with a noncommutative Euclidean algorithm as the algorithmic engine. Finally, we demonstrate the effectiveness of our approach on various examples.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Hyper Input Convex Neural Networks for Shape Constrained Learning and Optimal Transport

We introduce Hyper Input Convex Neural Networks (HyCNNs), a novel neural network architecture designed for learning convex functions. HyCNNs combine the principles of Maxout networks with input convex neural networks (ICNNs) to create a neural network that is always convex in the input, theoretically capable of leveraging depth, and performs reliably when trained at scale compared to ICNNs. Concretely, we prove that HyCNNs require exponentially fewer parameters than ICNNs to approximate quadratic functions up to a given precision. Throughout a series of synthetic experiments, we demonstrate that HyCNNs outperform existing ICNNs and MLPs in terms of predictive performance for convex regression and interpolation tasks. We further apply HyCNNs to learn high-dimensional optimal transport maps for synthetic examples and for single-cell data, where they oftentimes outperform ICNN-based neural optimal transport methods and other baselines across a wide range of setting.
Read the full abstract

Probability

Degree-dependent and distance-dependent contact rates interpolate between explosive, exponential and polynomial epidemic growth

It is a fundamental question in epidemiology to estimate, model and predict the growth rate of a pandemic. Analogously, analysing the diffusion of innovation, (fake) news, memes, and rumours is of key importance in the social sciences. The resulting epidemic growth curves can be classified according to their growth rates. These have been found to range from exponential to both faster super-exponential curves and slower subexponential or polynomial curves. Previous research has lacked a unified explanatory framework capable of accommodating super-exponential, (stretched) exponential, and polynomial growth patterns within the same contact network. In this paper we propose a simple agent-based network model that can capture all these phases. We provide such a framework by modelling how transmission rates depend on spatial distance and on individuals' numbers of contacts. By comparing the growth rate of spreading processes with or without degree-dependent and/or distance-dependent contact rates through data-driven and synthetic simulations on real and modelled networks with underlying geometry, we find evidence that even a 'sublinear presence' of these causes may cause a significant slow down of the growth rate on the same underlying network. We find that the growth rate is governed by a combination of three factors: geometry, the prevalence of weak ties, and superspreaders. We confirm our results with rigorous proofs in a theoretical model, using a spatial multiscale-argument in long-range heterogeneous first passage percolation. Our results give a plausible explanation of why the consecutive waves of a single pandemic can differ in their growth even if their spreading mechanisms are similar.
Read the full abstract

All authors Zylan Benjert, Júlia Komjáthy, Johannes Lengler, John Lapinskas, Ulysse Schaller

Dynamical Systems

Thermodynamic formalism for singular flows

We prove that $C^\infty$ smooth three-dimensional flows with positive topological entropy admit only finitely many ergodic measures of maximal entropy, even in the presence of singularities (zero-velocity points). Furthermore, for flows in a $C^\infty$-open and dense subset of the space of such three-dimensional flows, every ergodic measure of maximal entropy is rapidly mixing. To prove this result, we construct a novel symbolic coding framework for singular flows, which serves as the fundamental technical tool. We then introduce the property of strong positive recurrence (SPR) for singular flows, and prove that SPR flows can be coded by suspension flows over SPR countable discrete symbolic systems. Under appropriate conditions, we further establish that such suspension flows are rapidly mixing. These frameworks can be further generalized to a broad class of flows, including star flows, and the results naturally extend to general equilibrium states.
Read the full abstract

Dynamical Systems

Data-driven discovery of polynomial ODEs with provably bounded solutions

We introduce SILAS, a data-driven framework for discovering polynomial ordinary differential equations (ODEs) with provably bounded trajectories. Boundedness is certified by compact absorbing sets defined via polynomial Lyapunov functions. We jointly identify the ODE vector field and the Lyapunov function using a well-posed nonconvex optimization problem built using polynomial optimization tools. We solve this problem using an alternating block-coordinate optimization scheme with convex subproblems, whose feasibility is ensured by a novel model-agnostic initialization that identifies a candidate Lyapunov function from data. Our methods extend prior approaches for quadratic ODEs with absorbing ellipsoids to a significantly broader class of ODEs and absorbing sets. A suite of over 100 examples demonstrates that SILAS can recover accurate and provably bounded ODE models for a broad range of nonlinear dynamical systems.
Read the full abstract

Optimization and Control

Learning Over-Relaxation Policies for ADMM with Convergence Guarantees

The Alternating Direction Method of Multipliers (ADMM) is a widely used method for structured convex optimization, and its practical performance depends strongly on the choice of penalty and relaxation parameters. Motivated by settings such as Model Predictive Control (MPC), where one repeatedly solves related optimization problems with fixed structure and changing parameter values, we propose learning online updates of the relaxation parameter to improve average performance on problem classes of interest, while guaranteeing that asymptotic convergence is not compromised for the worst-case realization of such problems. This choice is computationally attractive in the Operator Splitting Quadratic Program (OSQP)-like architectures, since adapting relaxation does not trigger the matrix refactorizations associated with penalty updates. We establish convergence guarantees for ADMM with time-varying penalty and relaxation parameters under mild assumptions, and show on benchmark quadratic programs that the resulting learned policies improve both iteration count and wall-clock time on average over baseline OSQP.
Read the full abstract

Optimization and Control · Cross-listed from cs.CG

Exact Dynamic Programming for Solow–Polasky Diversity Subset Selection on Lines and Staircases

This paper studies exact fixed-cardinality Solow–Polasky diversity subset selection on ordered finite $\ell_1$ point sets, with monotone biobjective Pareto fronts and their higher-dimensional staircase analogues as central applications. Solow–Polasky diversity was introduced in biodiversity conservation, whereas the same inverse-matrix expression appears in metric geometry as magnitude: for a finite metric space $(X,d)$ with exponential similarity matrix $Z_{ij}=e^{-q d(x_i,x_j)}$, the quantity $\1^\top Z^{-1}\1$ is the magnitude of the scaled finite metric space $(X,qd)$ whenever the weighting is defined by the inverse matrix. Thus, in this finite exponential-kernel setting, Solow–Polasky diversity and magnitude are mathematically the same object viewed through different motivations. Building on the linear-chain magnitude formula of Leinster and Willerton, the paper gives a detailed proof of the scaled consecutive-gap identity $ \SP(X)=1+\sum_r \tanh(qg_r/2),$ where the $g_r$ are the gaps between consecutive selected points. It then proves an exact Bellman-recursion theorem for maximizing this value over all subsets of a prescribed cardinality, yielding an $O(kn^2)$ dynamic program for an ordered $n$-point candidate set and subset size $k$. Finally, the paper proves ordered $\ell_1$ reductions showing that the same algorithm applies to monotone biobjective Pareto-front approximations and, more generally, to finite coordinatewise monotone $\ell_1$ staircases in $\R^d$. These are precisely the ordered $\ell_1$ chains for which the $\ell_1$-distance becomes a line metric along the chosen order, so the one-dimensional dynamic program applies without modification. Keywords: Solow–Polasky diversity; magnitude; metric geometry; dynamic programming; ordered points; $\ell_1$ geometry; Pareto-front approximation.
Read the full abstract

Analysis of PDEs · Cross-listed from q-bio.TO

Theory of adhesion-driven self-organisation in growing tissues

Cell invasion and spatial pattern formation are two distinct manifestations of cellular self-organisation in development, regeneration, and disease. Here, we develop and analyse a unified theoretical framework that links these two seemingly different behaviours within a single mechanistic model for adhesion-mediated self-organisation in growing cell populations. Using a multiscale analysis, we show that the balance between cell-cell adhesion, self-diffusion, and proliferation controls the emergence of distinct collective dynamics. We find that for weak adhesion, tissues invade through stable monotone fronts. As adhesion increases, invasion slows, fronts become unstable, leading to aggregates and spatial patterns emerging behind the advancing edge. In two spatial dimensions, these instabilities generate fingering morphologies reminiscent of dysregulated invasion in cancer. Crucially, we show that density-dependent regulation of adhesion suppresses these instabilities and restores cohesive tissue expansion. Together, our results identify adhesion strength and its regulation as key determinants of whether tissues invade cohesively or fragment into patterns, and provide a unified framework for understanding collective migration, morphogenesis, and dysregulated growth.
Read the full abstract

All authors Carles Falcó, Samuel W. S. Johnson, Mohit P. Dalwadi, Philip K. Maini

Optimization and Control · Cross-listed from cs.LG

A Note on How to Remove the $\ln\ln T$ Term from the Squint Bound

In Orabona and Pál [2016], we introduced the shifted KT potentials, to remove the $\ln \ln T$ factor in the parameter-free learning with expert bound. In this short technical note, I show that this is equivalent to changing the prior in the Krichevsky–Trofimov algorithm. Then, I show how to use the same idea to remove the $\ln \ln T$ factor in the data-independent bound for the Squint algorithm.
Read the full abstract

Operator Algebras

On a relationship between orthogonal projections and Toeplitz operators on poly-Bergman spaces of the upper half-plane: vertical symbols

In the context of studying $C^*$-algebras generated by Toeplitz operators acting on the poly-Bergman space $\mathcal{A}^2_{n}(\Pi)$ of the upper half-plane $\Pi$, we introduce a system of all-but-one orthogonal projections in generic position. We show that the $C^*$-algebra generated by these orthoprojections is closely related to the $C^*$-algebra generated by all Toeplitz operators with vertical symbols satisfying boundary conditions. This result suggests a new approach in the study of Toeplitz operators acting on other reproducing kernel Hilbert spaces. Furthermore, the range of one of the orthoprojections herein has a reproducing kernel expressed in terms of the digamma and the Nielsen's beta functions. The harmonic function also emerges in this development.
Read the full abstract

All authors Maribel Loaiza, Miguel Antonio Morales-Ramos, María del Rosario Ramírez-Mora, Josué Ramírez-Ortega

Optimization and Control

Generalization of Zeroth-Order Method for Quotients of Quadratic Functions

Optimization of quadratic functions and their quotients is relevant in subspace and iterative optimization methods. In this paper, we consider the matrix-free computation of the generalized operator norm and the maximization of a generalized Rayleigh quotient when only forward evaluations of two linear operators $A$ and $B$ are available. The proposed method samples search directions uniformly from the full unit sphere, thereby avoiding tangent-space sampling and explicit access to the metric matrix $B^{\mathrm T}B$. The exact line search along each sampled direction reduces to a $2\times2$ generalized eigenvalue problem on specific Gram matrices. In the generic case its maximizing step has a closed form. We prove that the objective values converge almost surely to the largest generalized eigenvalue and that the distance of the iterates to the leading generalized eigenspace converges to zero. We also relate full-sphere moment estimators to the Riemannian gradient and Hessian. The numerical experiments on synthetic Gaußian operators illustrate the behavior of the methods, and further studies of the proposed algorithms indicate favorable empirical convergence and weak dependence on the tested problem dimensions.
Read the full abstract

Analysis of PDEs

$C^1$-Regularity of the Free Boundary for Hele-Shaw Flow with Source and Drift

This paper is a continuation of the work in \cite{kimzhang2024} concerning Hele-Shaw flow with both drift and source terms. We prove that, in a local neighborhood, if the free boundary is Lipschitz continuous with a sufficiently small Lipschitz constant, then the free boundary is $C^{1}$. As a corollary, we also consider the 2D vertical Hele-Shaw (or one-phase Muskat) problem with an advection term. We show that, provided the initial data and the advection term are small and the propagation speed is large, the free boundary becomes uniformly $C^1$ after a finite time.
Read the full abstract

Analysis of PDEs

Global boundedness and asymptotic behavior of the chemotaxis system for Alopecia Areata with weakly singular sensitivity

This paper considers the homogeneous Neumann initial-boundary value problem for Alopecia Areata chemotaxis model with weakly singular sensitivity. For any appropriately regular initial conditions,it is shown that the problem admits a global boundedness of classical solutions in two spatial dimensions. Moreover, through the explicit construction of Lyapunov functions, we establish that the globally bounded solution converges exponentially to a constant steady state. The paper concludes with numerical experiments that serve to visually illustrate and corroborate some of the theoretically derived findings.
Read the full abstract

Number Theory

On the automorphisms of the power semigroups of a numerical semigroup

If $H$ is a numerical semigroup (that is, a cofinite subset of the non-negative integers closed under addition), then the non-empty subsets of $H$ form a semigroup $\mathcal P(H)$ under the sumset operation induced by addition in $H$. Moreover, if $0 \in H$, then $\mathcal P(H)$ is a monoid with identity element $\{0\}$, and the family $\mathcal P_0(H)$ of all subsets of $H$ containing $0$ is a submonoid of $\mathcal P(H)$. We show that the automorphism group of $\mathcal P(H)$ is trivial, and the same holds for $\mathcal P_0(H)$ when $0 \in H$. The proofs blend ideas from combinatorics and semigroup theory.
Read the full abstract

Probability

Stochastic Scaling Limits and Synchronization by Noise in Deep Transformer Models

We prove pathwise convergence of the layerwise evolution of tokens in a finite-depth, finite-width transformer model with MultiLayer Perceptron (MLP) blocks to a continuous-time stochastic interacting particle system. We also identify the stochastic partial differential equation describing the evolution of the tokens' distribution in this limit and prove propagation of chaos when the number of such tokens is large. The bounds we establish are quantitative and the limits we consider commute. We further prove that the limiting stochastic model displays synchronization by noise and establish exponential dissipation of the interaction energy on average, provided that the common noise is sufficiently coercive relative to the deterministic self-attention drift. We finally characterize the activation functions satisfying the former condition.
Read the full abstract

All authors Andrea Agazzi, Giuseppe Bruno, Eloy Mosig García, Samuele Saviozzi, Marco Romito

Numerical Analysis

Data assimilation for slightly compressible flow

Continuous data assimilation (CDA) nudges observational data into governing equations to recover the underlying flow and improve predictions. Existing rigorous CDA analyses focus primarily on incompressible flows, yet no physical flow is perfectly incompressible. Approximating a slightly compressible flow with an incompressible model introduces non-negligible model errors. Data assimilation for compressible flows remains challenging due to strong nonlinearities and the presence of shocks. We design an algorithm that addresses the limitations of velocity-only nudging for slightly compressible flow. This work incorporates both velocity and pressure data from the slightly compressible flow and nudges both quantities into the incompressible Navier–Stokes equations. Our analysis shows that the model error decays exponentially in the initial error, with an asymptotic residual of order $\mathcal{O}(H)$, where H denotes the observation resolution. The analysis also identifies a scaling for the pressure nudging parameter $\mu_1 = O(1/H^2)$ that ensures effective assimilation. We validate the theoretical results through a suite of numerical experiments: a convergence study confirming optimal rates, a modified Taylor–Green vortex benchmark demonstrating synchronization of energy, enstrophy, and pressure, and an acoustic wave propagation test that isolates the role of pressure nudging and achieves a $97.9\%$ reduction in pressure error relative to velocity-only assimilation. Together, these results provide a foundation for discrete error estimates and realistic compressible applications.
Read the full abstract

Differential Geometry

Stable systolic inequalities via mod n covering

We introduce a mod $n$ covering based approach to stable systolic inequalities. The idea is to prescribe a cohomology class mod $n$ which forces the desired cup product or index to be nonzero, and then find a short integral lift of that class. The method is especially effective in rank two as we can compute the covering constant. As a curvature free application, we improve the stable two systolic bound for $S^2\times S^2$ to $2$. The same bound holds for every oriented four manifold with $b_2=2$. Under a positive scalar curvature lower bound, the mod $n$ covering method combined with a sharp cowaist inequality for line bundles gives stable two systolic bounds. This gives the sharp stable two systolic inequality for odd complex projective spaces and an $O(m\log m)$ bound for $(S^2)^m$ when scalar curvature is at least $2m$. For $S^2\times S^2$ one gets that every metric with scalar curvature at least $4$ has stable two systole at most $8\pi$.
Read the full abstract

Combinatorics · Cross-listed from cs.DM

Approximating the Network Design Problem for Potential-Based Flows

We develop efficient algorithms for a fundamental network design problem arising in potential-based flow models, which are central to many energy transport networks (e.g., hydrogen and electricity). In contrast to classical network flow problems, the nonlinearities inherent in potential-based networks introduce significant new challenges. We address these challenges through intricate reductions to classical combinatorial optimization problems, such as (constrained) shortest path problems, enabling the application of well-established algorithmic techniques to compute exact and approximate solutions efficiently. Finally, we complement these algorithmic results with matching complexity results concerning the hardness and non-approximability of the considered problem variants.
Read the full abstract

All authors Max Klimm, Marc E. Pfetsch, Martin Skutella, Lea Strubberg

Numerical Analysis

Systems of Nonlocal Conservation Laws with Memory and Their Zero Retention Limit

We study the entropy solution for a class of systems of nonlocal conservation laws in which the convective flux is convoluted with a kernel in both spatial and temporal variables. This formulation models the flux dependence on the solution within its spatial neighbourhood (nonlocal in space) as well as on prior states in time (nonlocal in time), thereby incorporating memory effects. In addition, employing a convergent finite volume approximation, the existence of the entropy solution is discussed. The uniqueness of such entropy solutions is also established. In addition, we analyze the asymptotic behaviour of the solutions as the support of the temporal convolution kernel shrinks, demonstrating the "memory-to-memoryless" effect and convergence to the entropy solution of the corresponding nonlocal conservation law without memory (i.e., nonlocal only in space). Convergence rate estimates are derived. In addition, the proposed numerical approximations are shown to be asymptotically compatible with this passage to the memoryless limit by deriving the corresponding asymptotic convergence rate estimates. The analysis is carried out in a very general setting, without imposing any geometric restrictions such as the convexity of the spatial and temporal convolution kernels, unlike the existing literature on the asymptotic analysis of nonlocal-in-space only conservation laws. To the best of our knowledge, this provides the first convergence and asymptotic analysis for finite volume schemes applied to nonlocal conservation laws with memory. Numerical experiments are included to illustrate the theory.
Read the full abstract

Mathematical Physics · Cross-listed from nlin.SI

On matrix Lax representations for (1+1)-dimensional evolutionary differential-difference equations

Differential-difference matrix Lax representations (Lax pairs), gauge transformations, and discrete Miura-type transformations (MTs) belong to the main tools in the theory of (nonlinear) integrable differential-difference equations. For a given equation, two matrix Lax representations (MLRs) are said to be gauge equivalent if one of them can be obtained from the other by applying a matrix gauge transformation. Generalizing and extending several previous works on MLRs and MTs, we present new results on the following problems: - When and how can one simplify a given MLR by means of gauge transformations? - How can one use MLRs and gauge transformations for constructing MTs? - A MLR is called fake if it is gauge equivalent to a trivial MLR. How to determine whether a given MLR is not fake? We consider the general (1+1)-dimensional evolutionary differential-difference case when a MLR can depend on any shifts of dependent variables and can be non-autonomous. As applications and illustrations of the presented general theory, we construct several new two-component integrable equations (with new MLRs) connected by new MTs to known integrable equations from the papers [S. Konstantinou-Rizos, A.V. Mikhailov, P. Xenitidis, J. Math. Phys. 2015], [E. Mansfield, G. Mari Beffa, Jing Ping Wang, Found. Comput. Math. 2013]), including non-autonomous examples.
Read the full abstract

Optimization and Control

Function-free Optimization via Comparison Oracles

In this work, we study optimization specified only through a comparison oracle: given two points, it reports which one is preferred. We call it function-free optimization because we do not assume access to, nor the existence of, a canonical application-given objective function. The goal is to find the most preferred feasible point, which we call the optimal solution. This model arises in preference- and ranking-based settings where objective values and derivatives are unavailable or meaningless. Even when a representative function exists, it may be nonsmooth, nonconvex, or discontinuous. We develop an analytical and algorithmic framework based on the geometry of preference level sets, which remains well-defined from comparisons alone. We introduce the level-set optimality gap, the distance from a preference level set to the optimal solutions, and the regularity radius, a stationarity certificate. Under regularity of the preference relation in a $d$-dimensional Euclidean space, we estimate normal directions to accuracy $\epsilon$ using $O(d\log(d/\epsilon))$ comparisons, nearly matching a lower bound of $\Omega(d\log(1/\epsilon))$. Under convexity, regularity, and a local growth condition on the regularity radius, the resulting normal direction descent method reaches an $\epsilon$ level-set optimality gap using at most $\widetilde O(dD^2/\epsilon^2)$ comparisons over $O(D^2/\epsilon^2)$ normal direction estimation steps, where $D$ is the distance from the initial point to the optimal solutions. This number of steps matches the lower bound of $\Omega(D^2/\epsilon^2)$ for normal direction span-based methods. Since prior knowledge in practical applications is usually limited, we also develop adaptive schemes for estimating the normal direction and solving the optimization problem. They match the fixed-parameter complexity bounds up to logarithmic factors.
Read the full abstract

Numerical Analysis · Cross-listed from quant-ph

MLMC-qDRIFT: Multilevel Variance Reduction for Randomized Quantum Hamiltonian Simulation

Simulating quantum dynamics is one of the central applications of quantum computing. For Hamiltonians written as a sum of many terms, deterministic Trotter–Suzuki product formulas can require applying a large number of term-wise evolutions at each time step, leading to high circuit costs for large or dense systems. Randomized methods such as qDRIFT offer an alternative: each step samples only one Hamiltonian term, giving a circuit depth with no explicit dependence on the number of terms. However, when qDRIFT is used for observable estimation, high precision requires many independent random circuit realizations, resulting in a total gate complexity that scales as $\mathcal{O}(\varepsilon^{-3})$. We introduce a multilevel Monte Carlo framework for qDRIFT that reduces this sampling overhead. The method constructs a hierarchy of qDRIFT estimators with increasing circuit depths and couples adjacent levels by sharing their random Hamiltonian-term samples. This coupling makes the variance of the level differences decay with depth, allowing most samples to be taken on cheaper, coarse circuits and only a few on expensive, fine circuits. We prove that the resulting MLMC-qDRIFT estimator reduces the total gate complexity for fixed-precision observable estimation from the standard qDRIFT scaling $\mathcal{O}(\varepsilon^{-3})$ to $\mathcal{O}(\varepsilon^{-2}\log^2(1/\varepsilon))$, while preserving qDRIFT's lack of explicit dependence on the number of Hamiltonian terms. Numerical experiments for spin-chain dynamics confirm the predicted variance decay and demonstrate the practical gate-count savings of the multilevel construction.
Read the full abstract