Information Theory
Secure Transmission for Fluid Antenna-Aided ISAC Systems
Yunxiao Li, Qian Zhang, Xuejun Cheng et al. (+4 more)
Fluid
antenna (FA) has become a highly promising technology and has recently been used to enhance the integrated sensing and communication (
ISAC) system. However, the scenario where sensing targets act as eavesdroppers in
ISAC and how to maximize the sum secrecy rate has not been addressed. This letter investigates secure transmission in FA-aided
ISAC systems, where the spatial agility of FAs enables enhanced physical layer security. We jointly optimize
antenna position vector (APV) and beamforming to maximize the multiuser sum secrecy rate, which complicates the solution process. To solve the resulting non-convex problem, we use a block successive upper-bound minimization (BSUM)
algorithm, which incorporates the proximal distance
algorithm (PDA) for closed-form beamformer updates and extrapolated projected gradient (EPG) for APV optimization. Simulation results show that the proposed FA-
ISAC scheme achieves over 20$\%$ sum secrecy rate gain compared to fixed-position
antenna (FPA) systems.
Read the full abstract ▾
All authors Yunxiao Li, Qian Zhang, Xuejun Cheng, Zhiguo Wang, Xiaoyan Wang, Hongji Xu, Ju Liu
Combinatorics
Proof of the strong conjecture about $F$-irregular graphs in the class of graphs $\{F\}$ of diameter $2$
Tatiana Dovzhenok
Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong
conjecture about $F$-irregular graphs (Dovzhenok, Filuta, Chuhai), for any connected graph $F$ of order $|F|\geqslant 3$, there exist infinitely many $F$-irregular graphs. In the present paper, the strong
conjecture about $F$-irregular graphs is confirmed in the class of graphs $\{F\}$ of diameter $2$. It is proved that for every graph $F$ of diameter $2$, there exists an infinite series of $F$-irregular graphs of diameter $3$.
Read the full abstract ▾
Operator Algebras
The smallest quantum Mackey deformation
Yvann Gaudillot-Estrada
When $G$ is a real semisimple group, there is a surprising interplay between its representation theory and that of its motion group $G_0$, known as the Mackey analogy. The present paper extends this analogy to the framework of $q$-deformations, for $G = \mathrm{SL}(2,\mathbb{R})$. In fact, we construct a deformation of $\mathrm{SL}(2,\mathbb{R})$ parametrized by $(q,t) \in \mathbb{R}_+^* \times \mathbb{R}$, where $q$ is the quantization parameter and $t$ is the Mackey parameter. We show how the representation theory varies along this deformation and we prove an analogue of the Connes-Kasparov isomorphism for the $q$-deformed reduced group C*-
algebra.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Connecting Quantum Contextuality and Nonlocality
Jianqi Sheng, Dongkai Zhang and Lixiang Chen
Quantum theory departs from classical physics in its treatment of correlations, most prominently through the phenomena of contextuality and nonlocality. Once regarded primarily as foundational curiosities, these effects are now understood as key operational resources for
quantum computation, communication, and simulation. Although traditionally investigated in distinct settings, recent theoretical and experimental advances have revealed deep conceptual, mathematical, and operational connections between them. This review presents a unified perspective on these developments based on sheaf-theoretic and graph-theoretic frameworks, which provide theory-independent characterizations of statistical correlations. These approaches clarify the structural relationship between contextuality and nonlocality, facilitate the formulation of experimentally testable inequalities, and guide implementations in realistic physical platforms, with particular emphasis on photonic systems. By bridging abstract theoretical structures and concrete experimental realizations, this review sheds light on the nonclassical foundations of
quantum correlations and their emerging role in
quantum technologies.
Read the full abstract ▾
Logic
A $j$-translation with Kripke forcing relation
Satoshi Nakata
In this paper, we introduce a translation that combines the $j$-translation with Kripke forcing in the internal logic of an elementary topos. First, we show that our translation is sound for intuitionistic first-order logic and Heyting arithmetic. Furthermore, its interpretation in the effective topos provides an extension of the sheaf model of realizability introduced by de Jongh and Goodman. As an application, we systematically investigate translations for semi-classical axioms. Based on this investigation, we establish a separation result on semi-classical arithmetics, which cannot be obtained using the usual $j$-realizability.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.CV
Multidimensional Task Learning: A Unified Tensor Framework for Computer Vision Tasks
Alaa El Ichi and Khalide Jbilou
This paper introduces Multidimensional Task Learning (MTL), a unified mathematical framework based on Generalized Einstein MLPs (GE-MLPs) that operate directly on tensors via the Einstein product. We argue that current computer
vision task formulations are inherently constrained by
matrix-based thinking: standard architectures rely on
matrix-valued weights and vectorvalued biases, requiring structural flattening that restricts the space of naturally expressible tasks. GE-MLPs lift this constraint by operating with tensor-valued parameters, enabling explicit control over which dimensions are preserved or contracted without information loss. Through rigorous mathematical derivations, we demonstrate that classification,
segmentation, and detection are special cases of MTL, differing only in their dimensional configuration within a formally defined task space. We further prove that this task space is strictly larger than what
matrix-based formulations can natively express, enabling principled task configurations such as spatiotemporal or cross modal predictions that require destructive flattening under conventional approaches. This work provides a mathematical foundation for understanding, comparing, and designing computer
vision tasks through the lens of tensor
algebra.
Read the full abstract ▾
Category Theory · Cross-listed from cs.SI
Coalgebraic analysis of social systems
Nima Motamed, Nina Otter and Emily Roff
The algebraic analysis of social systems, or algebraic social network analysis, refers to a collection of methods designed to extract information about the structure of a social system represented as a directed graph. Central among these are methods to determine the roles that exist within a given system, and the positions. The analysis of roles and positions is highly developed for social systems that involve only pairwise interactions among actors - however, in contemporary social network analysis it is increasingly common to use models that can take into account higher-order interactions as well. In this paper we take a category-theoretic approach to the question of how to lift role and positional analysis from graphs to hypergraphs, which can accommodate higher-order interactions. We use the framework of universal coalgebra - a 'theory of systems' with origins in computer science and logic - to formalize the main concepts of role and positional analysis and extend them to a large class of structures that includes both graphs and hypergraphs. As evidence for the validity of our definitions, we prove a very general functoriality
theorem that specializes, in the case of graphs, to a folkloric observation about the compatibility of positional and role analysis.
Read the full abstract ▾
Numerical Analysis
On the choice of viscous discontinuous Galerkin discretization for entropy correction artificial viscosity methods
Samuel Q. Van Fleet and Jesse Chan
Entropy correction artificial viscosity (ECAV) is an approach for enforcing a semi-discrete
entropy inequality through an
entropy dissipative correction term. The resulting method can be implemented as an artificial viscosity with an extremely small viscosity coefficient. In this work, we analyze ECAV when the artificial viscosity is discretized using a local discontinuous Galerkin (LDG) method. We prove an $O(h)$ upper bound on the ECAV coefficient, indicating that ECAV does not result in a restrictive time-step condition. We additionally show that ECAV is contact preserving, and compare ECAV to traditional shock capturing artificial viscosity methods.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Mesoscopic fluctuation theory of particle systems driven by Poisson noise: study of the $q$-TASEP
Alexandre Krajenbrink and Pierre Le Doussal
We pursue our study of integrable weak noise theories of directed
polymer and interacting particle
stochastic models in the 1D KPZ universality class. Here we focus on the $q$-TASEP in either continuous or discrete time. Each particle on $\mathbb{Z}$ jumps independently by $+1$ with a rate (or probability) depending on the gap to the next particle on its right. We consider initial conditions (either step or random) which are empty of particles on $\mathbb{Z}^+$, and focus on the dynamics of the $N$ rightmost particles. In the limit $q \to 1$ and at large time (and large gaps) we identify a new intermediate "mesoscopic" (i.e. finite $N$) regime which corresponds to weak noise. In that regime Poisson noise remains important. We obtain the large deviations of the position of a given particle by two methods. The first derives asymptotics of $q$-TASEP Fredholm determinant formula. The second maps the weak noise limit to a system of semi-discrete or fully discrete, non linear differential equations. These are obtained as saddle point classical equations of a dynamical field theory, and their solutions represent the optimal configurations in the large deviation regime. We show the classical integrability of these two systems, and exhibit their explicit Lax pair. In the case of the continuous time $q$-TASEP it provides the first instance of classical integrability arising in a
stochastic system, with signatures of the Poisson noise persisting in the weak noise limit. For this model, we solve the scattering problem associated to its Lax pair and fully characterize the large deviations associated to the weak noise theory. Finally, we supplement this work with an Appendix on the first cumulant method to obtain the large deviations of several
lattice polymer models (Strict Weak, Log Gamma, Beta).
Read the full abstract ▾
Functional Analysis
A Study of the Extreme Points in the Unit Ball of $JT$
Spiros A. Argyros
In this note, we investigate the extreme points of the unit ball of the James Tree space ($JT$). We relate the
geometric structure of $JT$ to the classical James space $J$ and provide partial characterizations of extremality based on the concept of separated vectors. We provide a complete characterization for positive vectors and establish the equal sums property for positive extreme points.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.DS
Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
Amir Abboud, Ron Safier and Nathan Wallheimer
A recent paper by the authors (ITCS'26) initiates the study of the Triangle Detection problem in graphs avoiding a fixed pattern H as a subgraph and proposes a dichotomy hypothesis characterizing which patterns H make the Triangle Detection problem easier in H-free graphs than in general graphs. In this work, we demonstrate that this hypothesis is, in fact, equivalent to analogous hypotheses in two broader settings that a priori seem significantly more challenging: induced H-free graphs and colored H-free graphs. Our main contribution is a reduction from the induced H-free case to the non-induced H'-free case, where H' preserves the structural properties of H that are relevant for the dichotomy, namely 3-colorability and triangle count. A similar reduction is given for the colored case. A key technical ingredient is a self-reduction to Unique Triangle Detection that preserves the induced H-freeness property, via a new color-coding-like reduction.
Read the full abstract ▾
Algebraic Geometry
Kieran G. O'Grady
We survey recent advances in the theory of
moduli spaces of stable sheaves on hyperkähler
manifolds of dimension greater than $2$. We start by recalling the well-known theory in dimension $2$, i.e.~for $K3$ surfaces, emphasizing the techniques which can be extended to higher dimensions.
Read the full abstract ▾
Analysis of PDEs
Properties of hypersurface singular sets of solutions to the $\sigma_k$-Yamabe equation in the negative cone
Jonah A.J. Duncan and Luc Nguyen
We consider conformally flat Lipschitz viscosity solutions to the $\sigma_k$-Yamabe equation in the negative cone which admit smooth hypersurface singularities. Under natural regularity assumptions (that are satisfied by solutions to the $\sigma_k$-Loewner-Nirenberg problem on annuli, for example), we first prove that the trace and normal derivatives of such a solution along the hypersurface satisfy a certain PDE. For $k=2$, we also show that the hypersurface is minimal with respect to the Lipschitz solution and address some questions related to the formal expansion of the solution near the hypersurface.
Read the full abstract ▾
Analysis of PDEs
Low-Mach-number limit of a compressible two-phase flow system with algebraic closure
Cassandre Lebot
We analyse a bi-fluid isentropic compressible Navier-Stokes system with barotropic pressure laws in a two-phase framework with equal pressure and single velocity. We focus on the rigorous analysis of the low Mach number limit under well-prepared initial data. Our main result shows that, as the Mach number tends to zero, the partial densities converge to constant states while the velocity field converges to a divergence-free vector field, and we recover the incompressible non-homogenous fluid system. The volume fractions remain nontrivial and are transported by the limit flow. Our method relies on the introduction of suitable modulated quantities and on two relative
entropy functionals adapted to the two-phase structure: a standard
entropy commonly used in the literature, and a logarithmic
entropy, which is essential here as the former is not sufficient due to the structure of the underlying two-phase system.
Read the full abstract ▾
Analysis of PDEs
Remarks on the Pogorelov type estimate for the degenerate $k$-Hessian equation
Yasheng Lyu
This paper investigates the Pogorelov type estimate for the $k$-Hessian equation under a new condition on the degenerate right-hand side $f$.
Optimization and Control
Towards realizable free material optimization via energy bound hierarchy
Marek Tyburec, Michael Stingl and Shenyuan Ma
We study free orthotropic material optimization for two-dimensional plane-stress compliance minimization with two well-ordered isotropic phases. To connect free material optimization and composite realizability, we construct a hierarchy of admissible sets using zeroth-order, Voigt, and Hashin–Shtrikman energy bounds. The zeroth-order and Voigt models are convex, with admissible sets that coincide at global volume-budget endpoints and satisfy strict inclusion at intermediate volume budgets. The Voigt model reduces to isotropic variable-thickness-sheet optimization, while the single-loadcase continuum zeroth-order problem admits an orthotropic optimum. The classical Hashin–Shtrikman bounds yield a tighter admissible set that is nonconvex jointly in the elasticity tensor and volume fraction and whose convex hull equals the Voigt set. We derive reduced formulations by explicitly characterizing the minimum volume fraction compatible with these bounds. For orthotropic tensors, this volume-fraction
estimator reduces to a one-dimensional search over the strain trace. In the single-loadcase continuum setting, the Hashin–Shtrikman-constrained optimal value equals that of the classical Allaire–Kohn relaxation, attained by a homogenized design with sequential-laminate effective tensors. For multiple loadcases, the bounds remain necessary but are generally insufficient for realizability. Numerical results illustrate the compliance hierarchy and close agreement with single-loadcase laminate references.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Excited-state quantum phase transitions and chaos in a three-level Lipkin model
Alberto Mayorgas, Pedro Pérez-Fernández, Álvaro Sáiz et al. (+1 more)
Excited-state
quantum phase transitions (ESQPTs) have been extensively studied in two-level models, but their characterization remains challenging in systems displaying mixed regular and chaotic dynamics. In this work, we investigate ESQPTs within the three-level Lipkin-Meshkov-Glick model, where an enlarged
Hilbert space and multiple separatrices give rise to rich spectral structures strongly influenced by chaos. To investigate the different dynamical regions, we have calculated Poincaré sections and Peres
lattices. In addition, by combining chaos-sensitive measures with standard ESQPT diagnostics, we provide a static analysis of ESQPT signatures in this model and establish a robust framework for future studies of its dynamical behavior. The degree of chaos and the Kullback-Leibler divergence are found to be very effective chaos-sensitive measures, which are complementary to ESQPT diagnostics such as the mean field limit and the participation ratio. Hence we provide a standard framework to work with ESQPTs in chaotic three-level systems.
Read the full abstract ▾
All authors Alberto Mayorgas, Pedro Pérez-Fernández, Álvaro Sáiz, José Miguel Arias
Number Theory
Invertible Calabi-Yau Orbifolds over Finite Fields II
Marco Aldi and Andrija Peruničić
We state a
conjecture about the
zeta function of crepant resolutions of Berglund–Hübsch orbifold hypersurfaces over a finite field. In addition to numerical evidence, we show that our conjectural
zeta function satisfies the Weil
conjectures and we elucidate its connection with Monsky–Washnitzer
cohomology.
Read the full abstract ▾
Information Theory · Cross-listed from cs.AI
A Decision-Theoretic Formalisation of Steganography With Applications to LLM Monitoring
Usman Anwar, Julianna Piskorz, David D. Baek et al. (+6 more)
Large
language models are beginning to show steganographic capabilities. Such capabilities could allow misaligned models to evade oversight mechanisms. Yet principled methods to detect and quantify such behaviours are lacking. Classical definitions of steganography, and detection methods based on them, require a known reference distribution of non-steganographic signals. For the case of steganographic
reasoning in LLMs, knowing such a reference distribution is not feasible; this renders these approaches inapplicable. We propose an alternative, decision-theoretic view of steganography. Our central insight is that steganography creates an asymmetry in usable information between
agents who can and cannot decode the hidden content (present within a steganographic signal), and this otherwise latent asymmetry can be inferred from the
agents' observable actions. To formalise this perspective, we introduce generalised $\mathcal{V}$-information: a utilitarian framework for measuring the amount of usable information within some input. We use this to define the steganographic gap – a measure that quantifies steganography by comparing the downstream utility of the steganographic signal to
agents that can and cannot decode the hidden content. We empirically validate our formalism, and show that it can be used to detect, quantify, and mitigate steganographic
reasoning in LLMs.
Read the full abstract ▾
All authors Usman Anwar, Julianna Piskorz, David D. Baek, David Africa, Jim Weatherall, Max Tegmark, Christian Schroeder de Witt, Mihaela van der Schaar, David Krueger
Dynamical Systems
Existence and characterization of attractors for a nonlocal reaction-diffusion equation having an energy functional
Rubén Caballero, Pedro Marín-Rubio and José Valero
In this paper we study a nonlocal reaction-
diffusion equation in which the
diffusion depends on the gradient of the solution. We prove first the existence and uniqueness of regular and strong solutions. Second, we obtain the existence of global attractors in both situations under rather weak assumptions by the defining a multivalued semiflow (which is a
semigroup in the particular situation when uniqueness of the Cauchy problem is satisfied). Third, we characterize the attractor either as the unstable
manifold of the set of stationary points or as the stable one when we consider solutions only in the set of bounded complete trajectories.
Read the full abstract ▾
Optimization and Control
Operator learning for prescribed-time stabilization of reaction-diffusion systems
Kaijing Lyu, Umberto Biccari and Jun-Min Wang
This paper addresses boundary prescribed-time stabilization of a one-dimensional heat equation with spatially and temporally varying coefficients. In contrast to asymptotic or exponential stabilization, prescribed-time stabilization ensures convergence to
equilibrium within a user-defined time that is independent of the initial condition, a property that is particularly attractive in applications with stringent transient performance requirements. The backstepping design for this problem requires solving, at each time instant, a two-dimensional time-dependent kernel Partial Differential Equation (PDE) whose solution continuously varies with the plant coefficients. The repeated numerical solution of this
parabolic kernel PDE results in a prohibitive computational burden, thereby limiting real-time applicability. To overcome this limitation, we propose a neural-operator-based approximation of the mapping from the time-varying system coefficient to the corresponding backstepping kernel. The operator is trained offline using representative solutions of the kernel PDE and subsequently deployed online to generate the required time-varying kernels in real time. We establish, via Lyapunov analysis, that the resulting neural-operator-based controller preserves prescribed-time stability provided that the operator approximation error satisfies an explicit bound. Furthermore, we investigate a direct approximation of the full feedback law mapping the plant parameter functions and state measurements to the boundary control input. For this setting, we prove semiglobal practical prescribed-time stability of the closed-loop system. Numerical experiments demonstrate that the proposed approach reduces the computational cost of kernel generation by several orders of magnitude, thereby enabling real-time prescribed-time stabilization for heat equations with spatially and temporally varying coefficients.
Read the full abstract ▾
Mathematical Physics
Coupling of the continuum and semiclassical limit. Part I: convergence of eigenvalues
Matthias Keller, Lorenzo Pettinari and Christiaan J. F. van de Ven
We analyze the semiclassical $d$-dimensional Schrödinger operator in the continuum $ \frac{1}{2} \Delta + \lambda_N^2 V$ discretized on a mesh with spacing proportional to $1/N$. The semi-classical parameter $\lambda_N$ is chosen as $\lambda_N = N^{1 - \gamma}$, with $\gamma \in (-1,1)$, which ensures that $N$ governs both the semiclassical and continuum limit simultaneously. We prove that all
eigenvalues of the discrete operator converge to those of the continuum, as $\lambda_N\to\infty$. Beyond this semi-classical domain, in the case of the harmonic oscillator, we further discuss the spectral asymptotics for $\gamma \in \mathbb{R} \setminus (-1,1)$, thereby fully characterizing the
eigenvalue behavior across all possible values of $\gamma\in\mathbb{R}$.
Read the full abstract ▾
Algebraic Topology
Robustness of Persistent Topological Features and Minimum Homological Cuts
Pepijn Roos Hoefgeest and Lucas Slot
Persistent homology is a popular method for computing topological features of (metric) data. Standard approaches based on the Čech or Rips filtration are stable under small perturbations of the data, but highly sensitive to outliers. This lack of robustness has been frequently addressed in the literature. In this paper, we take a novel perspective by asking the following question: When can we guarantee that an observed persistent feature (a bar) is inherent to the underlying data in the presence of a limited number of unknown, arbitrary outliers. We formalize this question by introducing the notion of
adversarial robustness, and study the problem of deciding whether a given bar in the barcode of a filtered simplicial complex is adversarially robust. We show that this problem is essentially equivalent to a homological variant of the minimum cut problem in simplicial complexes, which we believe to be of independent interest. As our main technical contribution, we provide the first computational complexity results for this problem, consisting of an efficient
algorithm in $0$-dimensional homology, NP-hardness for the general problem, and an efficient
algorithm for codimension-$1$ in $n$-dimensional complexes embedded in $\mathbb{R}^n$. We also analyze its natural linear programming relaxation, whose dual defines a homological analog of the max-flow problem in graphs. We show that a max-flow/min-cut
theorem does not hold in our setting, implying that the LP relaxation is not tight in general. Finally, in the special case of the Rips filtration, we provide a global heuristic based on the Hausdorff distance that guarantees
adversarial robustness of sufficiently long bars. This connects
adversarial robustness to standard stability
theorems in persistent homology.
Read the full abstract ▾
Classical Analysis and ODEs
High-dimensional Laplace asymptotics up to the concentration threshold
Alexander Katsevich and Anya Katsevich
We study high-dimensional Laplace-type integrals $I(\lambda):=(\lambda/2\pi)^{d/2}\int_{\mathbb R^d} g(x)e^{-\lambda f(x)}dx$ in the regime where both $d$ and $\lambda$ are large. Existing rigorous Laplace-expansion results in growing dimension are largely confined to the "Gaussian-approximation" regime $d^2/\lambda\to0$, which excludes many practically relevant settings that lie beyond this threshold but still satisfy the concentration condition $d/\lambda\to0$. We close this gap by deriving an explicit asymptotic expansion for $\log I(\lambda)$ with quantitative remainder bounds that remain valid throughout this intermediate region, arbitrarily close to the concentration threshold. Fix $L\ge1$ and assume that, in a neighborhood of the global minimizer of $f$, the operator norms of derivatives of $f$ and $g$ are bounded independently of $d,\lambda$ up to orders $2L+2$ and $2L$, respectively. Assuming also some mild global growth conditions, we prove $$\log I(\lambda)=\sum_{k=1}^{L-1} b_k(f,g)\lambda^{-k}+O(d^{L+1}/\lambda^L), \qquad d^{L+1}/\lambda^L\to0,$$ with coefficients satisfying $b_k(f,g)=O(d^{k+1})$. Moreover, the $b_k(f,g)$ coincide with the coefficients from the formal cumulant expansion of $\log I(\lambda)$. We also study computation for concentrating densities $\pi(x)\propto e^{-\lambda f(x)}$. For smooth observables $g$, our expansion yields closed-form, analytic approximations of $\mathbb E_{X\sim\pi}[g(X)]$. For sampling, we construct explicit
polynomial transports $x_L$ such that $\pi_L:=(x_L)_\# N(0,\lambda^{-1}I_d)$ satisfies $\mathrm{TV}(\pi,\pi_L)\lesssim d^{L+1}/\lambda^L$ for $L=1,2,3,\dots$, yielding an accurate procedure arbitrarily close to the concentration threshold $d=o(\lambda)$.
Read the full abstract ▾
Probability
Interface for variants of the contact process
Isabella Alvarenga and Daniel Valesin
We study two one-dimensional variants of the contact process: the contact-and-barrier process, where the population evolves in a region delimited by a randomly moving barrier, and the multitype contact process, in which two species compete for space. The contact-and-barrier process is started with the barrier at the origin and all sites to its right occupied, while the multitype contact process is started from the Heaviside configuration with species 1 to the left of the origin and species 2 to the right. We prove that both models exhibit tight interfaces and that, after centring by an appropriate deterministic speed, the interface position satisfies a central limit
theorem. Our analysis relies on a renewal-time method based on a novel construction called patchwork construction, in which the processes are built by concatenating space-time evolutions over successive time intervals of random length, providing a more convenient framework for defining the renewal times that drive the proofs.
Read the full abstract ▾
Optimization and Control
Stochastic Differential Inclusions driven by Maximal Monotone Operators with empty interiors
Juan Guillermo Garrido, Pedro Pérez-Aros and Mathias Staudigl
This paper studies the long-time behavior of
stochastic differential inclusions driven by maximal monotone operators, motivated by continuous-time models of first-order optimization methods under noisy or approximate operator information. We first address well-posedness and show that existence and uniqueness can be established without the customary requirement that the operator's domain has nonempty interior, by adopting an appropriate notion of solution. We then analyze asymptotic properties of the resulting
stochastic dynamics, extending convergence guarantees beyond previously studied settings that rely on smooth potentials, full-domain subdifferentials, or Lipschitz monotone operators. In addition, we consider a Tikhonov-type regularization of the
stochastic inclusion and prove corresponding well-posedness and long-time convergence results.
Read the full abstract ▾
Mathematical Physics
Quantum thermodynamics and semidefinite programming: regularization and algorithms
Emanuele Caputo, Augusto Gerolin, Nataliia Monina et al. (+2 more)
We investigate variational problems in
quantum thermodynamics at positive temperature, in which admissible states are constrained by prescribed outcomes of a finite set of measurements. We solve a problem raised by the recent work [Liu, Minervini, Patel, Wilde; arXiv:2505.04514 - Section C] and develop a general mathematical setup which allows a broad class of possible regularizations. Employing methods inspired by non-commutative optimal transport, we analyze the dual formulation of the problem, study the existence and characterization of maximizers, and investigate the qualitative behavior of the model in the zero-temperature limit. In the second part, we tailor this framework to
quantum state
tomography and
quantum optimal transport. Finally, we address computational aspects, with particular
attention to the convergence of
algorithms in selected cases.
Read the full abstract ▾
All authors Emanuele Caputo, Augusto Gerolin, Nataliia Monina, Pavlo Pelikh, Lorenzo Portinale
Differential Geometry
Modular interpretation of the Weil-Petersson metric asymptotics for abelian varieties
Yanbo Fang and Andres Gomez
As a first step towards a refined description of the asymptotic of the Weil-Petersson metric on the
moduli space of polarized Calabi-Yau
manifolds we investigate the concrete case of abelian varieties by linking such asymptotic with the multi-scale collapsing limits of the parametrized flat
tori, as explicitly classified by Odaka.
Read the full abstract ▾
Probability
Gaussian fluctuations for hyperbolic Anderson model with Lévy colored noise
Raluca M. Balan and William D. Stephenson
In this article, we study the asymptotic behaviour of the spatial integral $F_R(t)$ of the solution to the
hyperbolic Anderson model in dimension $d=1$, driven by the Lévy colored noise introduced in Balan and Jiménez (2026). We assume that the spatial coloration kernel of the noise is either integrable on $\mathbb{R}$, or is the Riesz kernel of order $\alpha \in (0,1)$, and the Lévy measure of the noise has finite moments of order $p$ and $2p$ for some $p \in (1,2]$. By applying a recent result of Trauthwein (2025), we prove that $F_R(t)/\sqrt{{\rm Var}\big(F_R(t)\big)}$ converges to the standard normal distribution as $R \to \infty$, and we give an estimate for the rate of this convergence in the Fortet-Mourier distance, the 1-Wasserstein distance, or the Kolmogorov distance. We also provide the corresponding functional limit result.
Read the full abstract ▾
Analysis of PDEs
Michele Dolce and Martin Donati
We study the solution to the two-dimensional incompressible Navier-Stokes equations arising from a sum of Dirac masses in a particular co-rotating configuration. This configuration consists of a polygonal
vortex crystal with or without a central
vortex. By exploiting the
symmetries and stability properties of the system, we describe and control the solution up to sub-diffusive time scales, prior to the expected onset of
vortex merging.
Read the full abstract ▾