Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 20 April

Optimization and Control

CCOpt: an Open-Source Solver for Large-Scale Mathematical Programs with Complementarity Constraints

This paper presents the Julia package CCOpt, built on top of the interior-point solver MadNLP. CCOpt implements a suite of algorithms for Mathematical Programs with Complementarity Constraints (MPCCs). The solver additionally comes with interfaces for use in Matlab, Python, and C++. MPCCs have recently gained renewed attention in engineering optimization, as complementarity provides a powerful modeling tool for nonsmooth functions and logical conditions. These problems are inherently challenging since their nonlinear programming reformulations violate classical regularity conditions at all feasible points, complicating both theoretical analysis and numerical treatment. Consequently, specialized algorithms are required to handle this degeneracy, and several approaches have been proposed. We implement a toolbox of methods, including relaxation and penalty approaches, as well as a crossover to recently proposed active-set methods. Our solver is based on nonlinear interior-point algorithms that couple the relaxation or penalty parameter with the barrier parameter, yielding substantial speedups compared to standard implementations. Both monotone and nonmonotone strategies for updating this joint parameter update are proposed and investigated. In addition, we propose regularization techniques that improve the conditioning of the KKT system for small relaxation parameters, enhancing robustness and computational efficiency. The implementation is validated on the classical MacMPEC benchmark, large-scale problems in security-constrained optimal power flow, optimal control of nonsmooth systems, as well as on quadratic programs with complementarity constraints arising in model predictive control. This benchmarking reveals an algorithmically driven improvement of often an entire order of magnitude over other methods, including commercial solvers.
Read the full abstract

All authors Anton Pozharskiy, François Pacaud, Moritz Diehl, Armin Nurkanović

Algebraic Geometry

The unirationality of $S_9^-$ and moduli spaces of pointed spin curves

We show that the moduli space of odd spin curves of genus 9 is unirational. This is the highest genus for which such a result is known. This is achieved by realizing birationally the moduli space of odd spin curves of genus g<10 as a locally trivial projective bundle over a certain (finite quotient of the) moduli space of n-pointed odd stable spin curves of genus g'<g. We then present general results on the Kodaira dimension of both components of the moduli spaces of n-pointed spin curves of genus g.
Read the full abstract

Dynamical Systems

Transfer Operators for Stochastic Hybrid Systems on Manifolds with Guard-Induced Resets

This paper develops a transfer operator framework for stochastic hybrid systems with guard-induced resets, encompassing both the Koopman and Frobenius–Perron operators. Exploiting their duality, we derive a unified formulation in which observables and probability densities evolve under adjoint generators corresponding to the backward and forward Kolmogorov equations. The formulation is developed in a global and intrinsic manner on differentiable manifolds, ensuring consistency with the underlying geometric structure of the state space. In addition, we propose a finite volume computational scheme on manifolds that preserves total probability mass while accurately capturing fluxes across guards and reset-induced transfers. The proposed framework provides a unified and geometrically consistent approach to uncertainty propagation in stochastic hybrid systems, bridging continuous stochastic dynamics and hybrid transitions within a transfer operator perspective.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Harmoniq: Efficient Data Augmentation on a Quantum Computer Inspired by Harmonic Analysis

Quantum machine learning has attracted significant interest in recent years. Most existing approaches, however, are variational in nature and require extensive parameter optimization subroutines. Here, we propose a conceptually distinct quantum machine learning approach that goes beyond the variational paradigm. Harmoniq takes a recently developed data augmentation technique from quantum harmonic analysis and implements it as a stochastic mixture of n-qubit circuits with at most quadratic depth each. A key strength of Harmoniq is its modularity: viewed as a quantum process acting on density matrices, it can readily be combined with other quantum data processing and learning subroutines. A subsequent case study demonstrates this modularity by combining Harmoniq with stochastic amplitude encoding for the input density matrix and quantum PCA on the output density matrix. This results in a promising signal denoising pipeline that works particularly well in the small sample size regime.
Read the full abstract

All authors Kristina Kirova, Monika Doerfler, Franz Luef, Richard Kueng

Category Theory

Fibrations in Directed Type Theory

We study $\infty$-categories in the synthetic simplicial type theory developed by Riehl and Shulman. In particular, we define cocartesian fibrations and prove their closure properties using a novel equivalence between LARI adjunctions and initial sections. We formalize our work using the experimental proof assistant rzk and upstream our work to the formalization effort by Riehl et al. In addition to our new work, we also give an introduction to general type theory, homotopy type theory, and the simplicial type theory used by the rest of the thesis.
Read the full abstract

General Mathematics

Introduction to generalised Cesaro convergence I

This is the first in a set of three papers providing an introduction to generalised Cesaro convergence. We start with traditional Cesaro methods for extending classical convergence and further generalise these to allow the calculation of limits/sums for a much broader class of divergent sequences/series. These provide a constructive means of analytic continuation of functions of a complex variable and we give many examples. Future sets of papers will use these methods to derive new results (and re-derive many existing results) in areas including analytic number theory; the theory of the Riemann zeta function; reversal of order of summation; exponential sums; classical integration; Taylor series and Mellin transforms; asymptotic analysis; and a number of others.
Read the full abstract

Combinatorics

Some New Results on Energy of Graphs with Self Loops

The graph $G_\sigma$ is obtained from graph $G$ by attaching self loops on $\sigma$ vertices. The energy $ E(G_\sigma)$ of the graph $G_\sigma$ with order $n$ and eigenvalues $\lambda_1,\lambda_2,\dots,\lambda_n$ is defined as $ E(G_\sigma)= \displaystyle \sum_{i=1}^n\left|\lambda_i-\dfrac{\sigma}{n}\right| $. It has been proved that if $\sigma=0\; or\; n$ then $ E(G)=E(G_\sigma) $. The obvious question arise: Are there any graph such that $E(G)=E(G_\sigma)$ and 0$<\sigma<n$? We have found an affirmative answer of this question and contributed a graph family which satisfies this property.
Read the full abstract

Functional Analysis

Commuting Toeplitz operators with biharmonic symbols

We investigate the commutant problem for Toeplitz operators on the Bergman space of the unit disk whose symbols belong to a subclass of biharmonic functions. We obtain a complete characterization of when two such Toeplitz operators commute. As a consequence, we derive a full description of normal Toeplitz operators with symbols in this class.
Read the full abstract

Combinatorics

On Chromatic Asymptotic Approximate Groups

We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering ideas from approximate group theory. This framework encodes simultaneous additive growth across several color classes. We show some general lifting and invariance principles, establish chromatic covering theorems for finite tuples and for tuples whose color classes are finite unions of unbounded linear sets, and obtain exact structure theorems for translated submonoids and finite-set-plus-submonoid sets. We also obtain sharper binomial bounds in the finite and unbounded-linear cases than the previous lattice-covering estimates. In the integer setting, we show that for each fixed threshold $t$, the threshold-$t$ chromatic layers form an asymptotic approximate family, using Nathanson's eventual interval-plus-edges description to obtain a uniform bound of size $r+2$ and prove an inhomogeneous extension for certain families.
Read the full abstract

Analysis of PDEs

A strong-type unique continuation principle for the fractional $p$-Laplacian

We provide a simple and direct proof of a strong-type unique continuation principle for the fractional $p$-Laplacian $(-\Delta_p)^s$ for a range of $s$ and $p$. The result extends to strong solutions of the fractional nonlinear Schrödinger equation. We adapt the recent proofs of the weak UCP by Berger, Schilling and Prasad.
Read the full abstract

Algebraic Geometry

Pulling back Cartier structures along regular maps

We introduce a framework for pulling back Cartier modules and their associated invariants along regular $F$-finite morphisms. To achieve this, we construct a relative Cartier isomorphism and operator for an arbitrary regular $F$-finite map of locally noetherian schemes. As an application, we obtain new results on the constancy regions of mixed test ideals, based on the work of Felipe Pérez.
Read the full abstract

Differential Geometry

On the spacetime positive energy theorem in arbitrary dimension

We describe how the spacetime positive energy theorem in dimension $n \geq 4$ follows from our recent work on the Riemannian version of the positive mass theorem. Our proof builds on the fundamental work of Schoen and Yau and the remarkable work of Eichmair, and uses the Jang equation with a capillary term. We also use the shielding principle from the work of Lesourd-Unger-Yau.
Read the full abstract

Probability

Uniform analyticity of local observables in FK-percolation and analyticity of the Ising spontaneous magnetisation

We prove that, in the FK-percolation model, the probabilities of local events are uniformly analytic in the percolation parameter $p$ under suitable mixing assumptions on the measure, and satisfy a uniform exponential growth bound. This result allows us to prove that the magnetisation of the Potts model is analytic in a suitable range of parameters, including the Ising case in all dimensions $d \geq 3$ in the whole supercritical regime. We also provide a proof of the analyticity of the susceptibility of the Potts model with $q$ colours, for any $q \geq 2$ in the whole subcritical interval. Finally, we prove the analyticity of various quantities in the FK-percolation measure, including the multi-point and truncated multi-point connectivity probabilities.
Read the full abstract

Differential Geometry

The hypersymplectic flow descended from the $G_2$-Laplacian coflow

A conjecture of Simon Donaldson is that on a compact $4$-manifold $X^4$ one can flow from a hypersymplectic structure to a hyperkähler structure while remaining in the same cohomology class. To this end the hypersymplectic flow was introduced by Fine-Yao. In this paper the notion of a positive triple on $X^4$ is used to describe a hypersymplectic and hyperkähler structure. Given a closed positive triple one can define either a closed $G_2$ structure or a coclosed $G_2$ structure on $\mathbb{T}^3 \times X^4$. The coclosed $G_2$ structure is evolved under the modified $G_2$-Laplacian coflow. The coflow descends to a flow of the positive triple on $X^4$, which is again the Fine-Yao hypersymplectic flow.
Read the full abstract

Quantum Algebra

Non-linear Lie Conformal Algebras and One-Loop Corrections of self-dual Yang-Mills amplitudes

This work is motivated by recent developments in celestial holography. In \cite{CP}, the authors interpreted QCD collinear singularities in terms of operator product expansions in a two-dimensional CFT. We reformulate the algebraic structures arising in their work using the formalism of non-linear Lie conformal algebras developed in \cite{SK}.
Read the full abstract

Optimization and Control

Minimax optimal dual control – The single input case

An explicit solution is derived for the Bellman inequality corresponding to minimax optimal dual control. The minimizing player determines control action as a function of past state measurements and inputs. The maximizing player selects disturbances and model parameters for the underlying linear time-invariant dynamics. The optimal minimizing policy is a dual controller that optimizes the tradeoff between exploration and exploitation. Once sufficient data has been collected, the policy becomes a deterministic certainty equivalence controller. However, when data is insufficient, the policy introduces a randomized term to improve excitation.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Wasserstein Distributionally Robust Risk-Sensitive Estimation via Conditional Value-at-Risk

We propose a distributionally robust approach to risk-sensitive estimation of an unknown signal x from an observed signal y. The observation and unknown signal are modeled as random vectors whose joint probability distribution is unknown, but assumed to belong to a given type-2 Wasserstein ball of distributions, termed the ambiguity set. The performance of an estimator is measured according to the conditional value-at-risk (CVaR) of the squared estimation error. Within this framework, we study the problem of computing affine estimators that minimize the worst-case CVaR over all distributions in the given ambiguity set. As our main result, we show that, when the nominal distribution at the center of the Wasserstein ball is finitely supported, such estimators can be exactly computed by solving a tractable semidefinite program. We evaluate the proposed estimators on a wholesale electricity price forecasting task using real market data and show that they deliver lower out-of-sample CVaR of squared error compared to existing methods.
Read the full abstract

Metric Geometry

Softening locally polyhedral tilings

We call a cell $C \subset \mathbb{R}^d$ soft if every point of its boundary lies on a smooth curve contained in $\partial C$. A tiling of the space is called completely soft if all of its cells are soft. In their 2024 article, Domokos, Goriely, G. Horváth and Regős conjectured that every polyhedral tiling of $\mathbb{R}^3$ satisfying mild regularity assumptions can be locally deformed into a completely soft tiling. By constructing an algorithm that first bends the edges emanating from each vertex and then extends this transformation to a sufficiently smooth deformation, they proved the conjecture for polyhedral tilings satisfying a certain combinatorial condition. In the present paper, we precisely describe a new edge-bending algorithm that establishes a more general version of this conjecture: every locally polyhedral tiling of $\mathbb{R}^3$ can be completely softened. We also give a short proof of an earlier result of Domokos, G. Horváth, and Regős stating that every suitably nondegenerate polygonic tiling of the plane has, on average, at least two points per cell at which the softness criterion is violated.
Read the full abstract

Classical Analysis and ODEs

Near-optimal density theorems for large dilates of large point configurations

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the known upper bound up to the logarithmic factor, thus essentially resolving a problem posed by Falconer, Yavicoli, and the first author of the present paper. We also study the same problem for embeddings of $n$-point configurations into $\mathbb{R}^d$ equipped with the $\ell^p$ norm, obtaining an asymptotically sharp bound $1-1/n+o(1/n)$, as soon as $p\in(1,\infty)\setminus\{2\}$. In the proof of the former estimate we use equidistribution of polynomial sequences modulo $1$ combined with probabilistic thinning. The proof of the latter estimate relies on the geometry of the $\ell^p$ spaces for $p\neq2$.
Read the full abstract

Numerical Analysis · Cross-listed from physics.optics

THE ROLE OF FOURIER ANALYSIS IN TWO DIMENSIONAL TOMOGRAPHY

We highlight the important role of the Fourier transform in deriving inversion formulas for the integral transforms of tomographic imaging. We demonstrate this principle by deriving inversion formulas for the divergent beam transform and the V-line transform, the latter arising in contemporary models of single-scattering optical tomography.
Read the full abstract

Analysis of PDEs

Duality for the Adversarial Total Variation

Adversarial training of binary classifiers can be reformulated as regularized risk minimization involving a nonlocal total variation. Building on this perspective, we establish a characterization of the subdifferential of this total variation using duality techniques. To achieve this, we derive a dual representation of the nonlocal total variation and a related integration-by-parts formula, involving a nonlocal gradient and divergence. We provide such duality statements both in the space of continuous functions vanishing at infinity on proper metric spaces and for the space of essentially bounded functions on separable metric spaces. Furthermore, under some additional conditions we provide characterizations of the subdifferential in these settings.
Read the full abstract

Numerical Analysis

A differentiable software suite for accelerated simulation of turbulent flows

We present IncompressibleNavierStokes.jl, an open-source Julia package for solving the incompressible Navier–Stokes equations on staggered Cartesian grids. The package features matrix-free, hardware-agnostic kernels that are compiled from a single source for multi-threaded CPU or GPU execution, and hand-written adjoint kernels for all discrete operators, enabling efficient reverse-mode automatic differentiation through the entire solver. This differentiability allows neural network closure models to be trained a-posteriori while embedded in a large-eddy simulation. Memory optimizations permit double-precision direct numerical simulations at resolutions up to $840^3$ on a single GPU. The software design, numerical methods, hardware performance, and integration of neural network closure models are described, and results for turbulent channel flow are validated against reference data.
Read the full abstract

Classical Analysis and ODEs

Counterexamples for lacunary dilates via dyadic spike blocks

We construct counterexamples, along dyadic lacunary sequences, to two problems of Erdős on the almost-everywhere behavior of sums $\sum_{j\le N}f(n_jx)$ on the circle. The main device is a dyadic spike block: rare positive spikes, each counted many times by a run of consecutive dilates, make the lacunary averages large, while a deterministic lower bound on every block prevents the rest of the series from cancelling them. We obtain a mean-zero $f\in\bigcap_{1\le q<\infty}L^q(\mathbb T)$ and a sequence $n_j=2^{m_j}$ with $n_{j+1}/n_j\ge2$ such that $\|f-S_Nf\|_2\ll(\log\log N)^{-1/2}$ and $\limsup_{N\to\infty}\frac1N\sum_{j\le N}f(n_jx)=+\infty$ for almost every $x$. This answers negatively a question of Erdős on whether the condition $\|f-S_Nf\|_2\ll(\log\log\log N)^{-C}$ suffices for almost-everywhere convergence, and shows that Matsuyama's condition $\|f-S_Nf\|_2\ll(\log\log N)^{-c}$, $c>1/2$, cannot be relaxed to $c=1/2$. A second choice of parameters gives, for every $2\le p<\infty$, functions $f\in L^p(\mathbb T)$ with $\limsup_{N\to\infty}\sum_{j\le N}f(n_jx)/(N(\log N)^{1/p-\varepsilon})=+\infty$ for every $\varepsilon>0$, almost everywhere. This is sharp up to $\varepsilon$, and the case $p=2$ answers negatively a second question of Erdős. Finally, a bounded variant in the spirit of Marstrand's disproof of Khintchine's conjecture gives sets of arbitrarily small measure whose lacunary visiting frequencies have limsup $1$ almost everywhere.
Read the full abstract

Functional Analysis

Weak minimizing property and reflexivity

For an operator T from X to Y denote m(T) the infimum of $||Tx||$ on the unit sphere $S_X$ of X. A sequence $(x_n)$ in $S_X$ is said to be minimizing for T if $||Tx_n||$ tends to m(T). In 2020 U. S. Chakraborty introduced and studied the following weak minimizing property (WmP): a pair (X,Y) of Banach spaces is said to have the WmP if, for every bounded linear operator $T: X \to Y$ that admits a non-weakly null minimizing sequence, the function $x \mapsto \|Tx\|$ attains its minimum on the unit sphere. We present the following new results about the WmP for pairs of infinite-dimensional separable Banach spaces: (i) If (X,Y) has the WmP, then X is reflexive. (ii) If X is reflexive and Y does not contain isomorphic copies of X, then (X,Y) has the WmP. (iii) If X is reflexive and Y contains an isomorphic copy of X, then there is an equivalent norm on Y such that, for this equivalent norm, (X,Y) does not have the WmP. The first result extends to non-separable X if and only if X possesses a countable total set of functionals.
Read the full abstract

Logic

Positive, Negative, and Reliable Information in a First-Order Logic of Evidence and Truth

In this paper we present the first-order logic QLETF+, a quantified version of the logic LETF+, introduced in Coniglio and Rodrigues (Studia Logica 112:561-606, 2024). QLETF+ exhibits several properties that are not always enjoyed by logics equipped with classicality operators. We show that it satisfies the replacement property and admits conjunctive, disjunctive, and prenex normal forms. Alongside extensions and anti-extensions, as in the previously studied first-order semantics for LETs, we make use here of what we call o-extensions: given an n-ary predicate symbol P, the o-extension of P is the set of n-tuples of individuals that satisfy the predicate oP. We prove the soundness and completeness of the deductive system of QLETF+ with respect to the six-valued first-order semantics.
Read the full abstract

Information Theory · Cross-listed from cond-mat.dis-nn

BBP transition and the leading eigenvector of the spiked Wigner model with inhomogeneous noise

The spiked Wigner ensemble is a prototypical model for high-dimensional inference. We study the spectral properties of an inhomogeneous rank-one spiked Wigner model in which the variance of each entry of the noise matrix is itself a random variable. In the high-dimensional limit, we derive exact equations for the spectral edges, the outlier eigenvalue, and the distribution of the components of the outlier eigenvector. These equations determine the BBP transition line that separates the gapped phase, where the signal is detectable, from the gapless phase. In the gapped regime, the distribution of the outlier eigenvector provides a natural estimator of the spike. We solve the equations for a noise matrix whose variances are generated from a truncated power-law distribution. In this case, the BBP transition line is non-monotonic, showing that an inhomogeneous noise can enhance signal detectability.
Read the full abstract

Mathematical Physics

Low-noise Pauli-consistent ensemble Monte Carlo for graphene with electron-electron scattering

We investigate Pauli-consistent ensemble Monte Carlo simulations of graphene with explicit intraband electron-electron scattering. To reduce the cost of electron-electron proposal-rate evaluation, we introduce a sampled-partner approximation that replaces the full partner-cell sum by uniform sampling from the instantaneous ensemble, while leaving the event-level collision step unchanged. Comparison with the full-sum reference shows close agreement together with a substantial reduction in computational cost, enabling large-ensemble low-noise simulations. In this regime, systematic oscillatory components become clearly resolved in ensemble-averaged time traces. We show that these oscillations are numerical and originate from deterministic drift on the discretized momentum-space grid. We also discuss a procedure for reducing their impact in recorded observables without modifying the underlying Monte Carlo dynamics.
Read the full abstract

General Topology

JAI functional contractions in relational metric spaces

The 2015 fixed point result on rs-relational metric spaces due to Alam and Imdad [J. Fixed Point Th. Appl., 17 (2015), 693-702] is equivalent with the classical Banach Contraction Principle [Fund. Math., 3 (1922), 133-181]. This is also valid for the 1961 statement in metric spaces due to Edelstein [Proc. Amer. Math. Soc., 12 (1961), 7-10], or the 2005 fixed point result in quasi-ordered metric spaces obtained by Nieto and Rodriguez-Lopez [Order, 22 (2005), 223-239].
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Bosonization, vertex operators and maximal violation of the Bell-CHSH inequality in wedge regions

It is pointed out that the vertex operators of a chiral boson in 1+1 dimensions provide an explicit realization of dichotomic, bounded, Hermitian operators that saturate the Tsirelson bound of the Bell-CHSH inequality in the vacuum state.
Read the full abstract

All authors J. G.A. Caribé, M. S. Guimaraes, I. Roditi, S. P. Sorella

Optimization and Control

An adaptive discretization algorithm for locally optimal experimental design with constraints

We develop a novel iterative algorithm for locally optimal experimental design under constraints, like budget or performance constraints. It is an adaptive discretization algorithm. In every iteration, a discretized version of the constrained-design problem is solved and then the discretization is adaptively refined by adding an approximate violator of a suitable sufficient $\eps$-optimality condition for the current design. We prove that with $\eps = 0$, our algorithm converges to an optimal design and that with $\eps > 0$, our algorithm finitely terminates at an $\eps$-optimal design. Compared to the existing algorithms on constrained experimental design, our algorithm comes with considerably less computational effort because the nonlinear subproblems in our algorithm have a smaller dimension and have to be solved only approximately and only in selected iterations (typically the last few). Additionally, our algorithm covers a considerably larger class of constraints. We demonstrate the good convergence properties of the algorithm on experimental design problems from chemical engineering that feature time and yield constraints.
Read the full abstract

All authors Jochen Schmid, Philipp Seufert, Jan Schwientek, Tobias Seidel, Karl-Heinz Küfer