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)

Thursday 9 April

Commutative Algebra

On the structure theorem of graded components of $\mathcal{F}$-finite, $\mathcal{F}$-modules over certain polynomial ring

Let $K$ be a field of characteristic $p>0$, $A=K[[Y]]$ be a power series ring in one variable and $Q(A)$ be the field of fraction of $A$. Suppose that $R=A[X_1,\ldots,X_n]$ is a standard $\mathbb{N}^n$-graded polynomial ring over $A$, i.e., $\operatorname{deg} (A)=\underline{0}\in \mathbb{N}^n$ and $\operatorname{deg}(X_j)=e_j\in \mathbb{N}^n$. Assume that $M=\bigoplus_{\underline{u}\in \mathbb{Z}^n} M_{\underline{u}}$ is a $\mathbb{Z}^n$-graded $\mathcal{F}$-finite, $\mathcal{F}$-module over $R$. In this article we prove that, $\displaystyle M_{\underline{u}}\cong E(A/YA)^{a(\underline{u})}\oplus Q(A)^{b(\underline{u})}\oplus A^{c(\underline{u})}$ for some finite numbers $a(\underline{u}), b(\underline{u}), c(\underline{u})\geq 0$. Let for a subset of $U$ of $\mathcal{S}=\{1, \ldots, n\}$, define a block to be the set $\displaystyle\mathcal{B}(U)=\{\underline{u} \in \mathbb{Z}^n \mid u_i \geq 0 \mbox{ if } i \in U \mbox{ and } u_i \leq -1 \mbox{ if } i \notin U \}$. Note that $\bigcup_{U\subseteq \mathcal{S}}\mathcal{B}(U)=\mathbb{Z}^n$. We prove that the sets $\{a(\underline{u})\mid \underline{u}\in \mathbb{Z}^n\}$, $\{b(\underline{u})\mid \underline{u}\in \mathbb{Z}^n\}$ and $\{c(\underline{u})\mid \underline{u}\in \mathbb{Z}^n\}$ are constant on $\mathcal{B}(U)$ for each subset $U$ of $\{1,\ldots,n\}$. In particular, these results holds for composition of local cohomology modules of the form $ H^{i_1}_{I_1}(H^{i_2}_{I_2}(\dots H^{i_r}_{I_r}(R)\dots)$ where $I_1,\ldots,I_r$ are $\mathbb{N}^n$-graded ideals of $R$. This provides a positive characteristic analogue of the results proved in \cite{TS-23} by the authors in characteristic zero.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Wideband Compressed-Domain Cramér-Rao Bounds for Near-Field XL-MIMO: Data and Geometric Diversity Decomposition

Wideband orthogonal frequency-division multiplexing (OFDM) over near-field extremely large-scale MIMO (XL-MIMO) arrays couples beam squint and wavefront curvature, and existing single-frequency compressed covariance models are severely biased as a result. To the best of our knowledge, no compressed-domain Cramér-Rao bound (CRB) has been reported for this regime under hybrid analog-digital architectures; existing wideband near-field bounds assume full-array observation. We derive the wideband compressed-domain CRB and decompose its Fisher information gain into two terms: a dominant data-diversity term, exactly 10 log10(K_s) dB, where K_s denotes the number of independent subcarrier observations, and we prove that for a centred array the full-array range bound is invariant to beam squint, so the full-array wideband gain equals the data-diversity term to within 3x10^-4 dB. Under hybrid compression, however, this invariance breaks: the residual is a combiner-dependent fluctuation of either sign rather than a propagation-geometry effect, with mean +0.157 dB and standard deviation 0.767 dB over 385 realizations at N_RF = 16, B = 400 MHz, and its spread shrinks toward zero as the number of RF chains grows. At 28 GHz with B = 400 MHz, data diversity contributes +27.1 dB and hybrid compression contributes an additional 12.6 dB gap relative to the full-array bound at N_RF = 16 RF chains. Frequency-aware covariance modeling is therefore the dominant requirement, and the residual is a property of the analog front end rather than of the propagation geometry.
Read the full abstract

Optimization and Control

Discounted MPC and infinite-horizon optimal control under plant-model mismatch: Stability and suboptimality

We study the robustness to plant-model mismatch of nonlinear systems in closed loop with (discounted) optimal controllers designed for a nominal model, with quadratic stage costs across finite and infinite horizons. By combining Lyapunov analysis with a unifying relaxed dynamic programming framework, we establish conditions that guarantee robust stability alongside improved suboptimality bounds compared to existing literature. A key step in our analysis is proving that stability counteracts time-accumulated error growth due to plant-model mismatch, yielding robustness bounds that hold uniformly across all prediction horizons.
Read the full abstract

All authors Robert H. Moldenhauer, Karl Worthmann, Romain Postoyan, Dragan Nešić, Mathieu Granzotto

Probability

On d-stochastic measures with fractal support and uniform (d-1)-marginals, and related results

The family $\mathcal{P}_{d}^{\lambda_{d-1}}$ of all probability measures on $[0,1]^d$ whose $(d-1)$-dimensional marginals are all equal to the Lebesgue measure $\lambda_{d-1}$ on $[0,1]^{d-1}$ contains remarkably pathological elements: Working with Iterated Function Systems with Probabi\-lities (IFSPs) we construct measures $\mu \in \mathcal{P}_{d}^{\lambda_{d-1}}$ of the following two types: (i) $\mu$ has self-similar fractal support; (ii) $\mu$ has self-similar support and models the situation of complete/functional dependence in each direction.As our main results concerning type (i) we prove, firstly, that for every $d\geq 3$ the set $\mathcal{D}_d$ of Hausdorff dimensions of the supports of elements in $\mathcal{P}_{d}^{\lambda_{d-1}}$ is dense in $[d-1,d]$; and, secondly, that the subset of elements in $\mathcal{P}_{d}^{\lambda_{d-1}}$ having fractal support is dense in $\mathcal{P}_{d}^{\lambda_{d-1}}$ with respect to the Wasserstein metric. Moreover, we show the existence of an element in $\mathcal{P}_{3}^{\lambda_{2}}$ of type (ii) whose support is a Sierpinski tetrahedron and study some generalizations.
Read the full abstract

Spectral Theory

Johnson-Schwartzman Gap Labelling for Metric and Discrete Decorated Graphs

We study Schrödinger operators on metric and discrete decorated graphs. The values taken by the integrated density of states (IDS) on spectral gaps are called gap labels. A natural question is which gap labels can occur. We answer this for graphs arising from uniquely ergodic one-dimensional dynamical systems by proving Johnson-Schwartzman gap-labelling theorems in both the metric and discrete settings. Our results extend Johnson-Schwartzman gap labelling beyond the standard one-dimensional setting. Unlike in one dimension, these graphs may contain cycles, which prevent the use of Sturm oscillation theory and require different spectral methods. We also analyze discontinuities of the IDS for certain graph families and show that not every admissible label corresponds to an open spectral gap. This reveals a mechanism of gap closing driven by graph geometry rather than by the underlying dynamics.
Read the full abstract

Optimization and Control

Density-Driven Optimal Control: Convergence Guarantees for Stochastic LTI Multi-Agent Systems

This paper addresses the decentralized non-uniform area coverage problem for multi-agent systems, a critical task in missions with high spatial priority and resource constraints. While existing density-based methods often rely on computationally heavy Eulerian PDE solvers or heuristic planning, we propose Stochastic Density-Driven Optimal Control (D$^2$OC). This is a rigorous Lagrangian framework that bridges the gap between individual agent dynamics and collective distribution matching. By formulating a stochastic MPC-like problem that minimizes the Wasserstein distance as a running cost, our approach ensures that the time-averaged empirical distribution converges to a non-parametric target density under stochastic LTI dynamics. A key contribution is the formal convergence guarantee established via reachability analysis, providing a bounded tracking error even in the presence of process and measurement noise. Numerical results verify that Stochastic D$^2$OC achieves robust, decentralized coverage while outperforming previous heuristic methods in optimality and consistency.
Read the full abstract

Group Theory

Small entropy doubling for random walks and polynomial growth

Gromov's theorem states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. A key ingredient in its proof is the small doubling property. In this work, we study entropy analogues of this property for random walks on groups. We show that if a finitely supported symmetric random walk $R_n$ satisfies \[ \mathrm{H}(R_{2n}) \le \mathrm{H}(R_n) + \log K \] at some sufficiently large scale $n$, then the underlying group is virtually nilpotent, with bounds depending on $K$ and $\mu_{\min}$. Our approach adapts Tao's entropy Balog–Szemerédi–Gowers argument to unimodular locally compact groups, combined with structural results on approximate groups. As applications, we obtain entropy-based criteria for polynomial growth. We also deduce an entropy gap phenomenon: if $G$ is not virtually nilpotent, then the entropy of random walks on $G$ grows faster than a universal superlogarithmic function.
Read the full abstract

Differential Geometry

Einstein connection of a weak almost contact metric manifold

Advances in modern physics since Einstein have made the nonsymmetric metric (0,2)-tensor $G=g+F$, where $g$ is a pseudo-Riemannian metric associated with gravity, and $F\ne0$ is a skew-symmetric tensor associated with electromagnetism, more attractive than ever. Einstein considered a linear connection $\nabla$ with torsion $T$ such that $(\nabla_X\,G)(Y,Z)=G(T(Y,X),Z)$. In this paper, we explicitly present the Einstein connection of $G=g+F$ using a weak almost contact structure $(f,\xi,\eta)$ with $g(X,fY)=F(X,Y)$ with a natural condition (trivial in the almost contact case). We discuss special Einstein connections, and give an example in terms of the weighted product of almost Hermitian manifold and a real line.
Read the full abstract

Information Theory

Formalizing building-up constructions of self-dual codes through isotropic lines in Lean

The purpose of this paper is two-fold. First, we show that, after a specified form isometry, the two-coordinate reduction in the binary Hilbert-symbol realization of Chinburg and Zhang is inverse to Kim's building-up construction, up to permutation equivalence. Second, for $q\equiv1\pmod4$, we develop a $q$-ary analogue of this reduction-and-extension mechanism. The identity $c^2=-1$ yields the isotropic line governing the split construction. For every fixed ordered pairing of the coordinates, we obtain a universal rank-$r$ boxed normal form, where $r$ is the dimension of the intersection with the product of these isotropic lines. Applications include optimal self-dual $[6,3,4]$ and $[8,4,4]$ codes over $\mathbb F_{5}$, optimal self-dual $[8,4,5]$ and $[10,5,6]$ codes over $\mathbb F_{13}$, and a self-dual $[12,6,6]$ code over $\mathbb F_{13}$. We also give an exact repeated boxed realization of self-dual $[18,9,8]$ and $[20,10,10]$ codes over $\mathbb F_{13}$, in which the split-boxed parent and its building-up child occur in one complete generator matrix. The algebraic core is formalized in Lean 4.
Read the full abstract

Optimization and Control

Collective deterrence as a classification problem: Voting rules, deterrence credibility, and escalation risk

Deterrence coalitions that collectively own their deterrence technology, need an institutional design to decide when to retaliate against an attack or incident. This choice of institutional design, formalized through a social choice function, introduces a tradeoff between credible deterrence and escalation risk. We study this tradeoff via a simple signalling model, and use it to construct an associated binary classification problem to determine institutional designs that perform well in a variety of environments. For a small coalition of four members, we compute and study the statistics of the empirical ROC curves associated to a variety of choice functions and probability distributions for retaliation and false positives.
Read the full abstract

Symplectic Geometry

The topology of Lagrangian submanifolds via open-closed string topology

We study the topology of Lagrangian submanifolds in standard symplectic vector spaces $\mathbb{C}^n$ using ideas from open-closed string topology. Specifically, for a closed, oriented, spin Lagrangian $L$, we construct a (possibly curved) deformation of the dg associative algebra of chains on the based loop space of $L$. This is done via pushing forward moduli spaces of pseudo-holomorphic discs with boundaries on $L$, viewed as chains in the free loop space, along a string topology closed-open map. As an application, we prove that if $\pi_2(L)=0$, then $L$ has non-vanishing Maslov class, generalizing previous results due to Viterbo, Cieliebak-Mohnke, Fukaya, and Irie.
Read the full abstract

Differential Geometry

A dimension descent scheme for the positive mass theorem in arbitrary dimension

We describe how the Schoen-Yau proof of the positive mass theorem can be extended to arbitrary dimensions. To overcome the problem of singularities, we propose a new inductive scheme. To carry out the inductive step, we use a combination of several techniques, including the shielding principle of Lesourd-Unger-Yau, as well as a conformal blow-up argument in the spirit of Bi-Hao-He-Shi-Zhu. Our arguments also rely on the Cheeger-Naber bound for the Minkowski dimension of the singular set.
Read the full abstract

Algebraic Geometry

Formulae for indices of holomorphic foliations via reduction of singularities

We study numerical invariants associated with the reduction of singularities of holomorphic foliation germs on $(\mathbb{C}^2, 0)$. Building on our previous work on generalized curve foliations, we extend explicit formulas for several fundamental invariants to arbitrary foliations. In particular, we provide general expressions for the discrepancy vector, the Milnor and intrinsic Milnor numbers, and classical indices along a separatrix as Camacho-Sad, Variation, Gómez-Mont-Seade-Verjovsky and also the Baum-Bott index. These extensions require a careful analysis of the contributions of saddle-nodes arising in the desingularization process. As applications, we recover results of Brunella and Cavalier-Lehmann, as well as a related statement appearing in [8], within a unified and purely numerical framework. Furthermore, we obtain intrinsic characterizations of generalized curve foliations in terms of indices and of second type foliations in terms of the discrepancy vector.
Read the full abstract

Probability

Convergence of $k$-point functions in high dimensional percolation

We establish first-order asymptotics for the $k$-point connectivity function in critical Bernoulli percolation on $\mathbb{Z}^d$ assuming $d>6$ and Hara's two-point asymptotic. For every $k\ge 3$ and distinct macroscopically separated locations, the probability that the corresponding lattice points lie in the same open cluster, rescaled by $n^{(4-d)(k-1)-2}$, converges as $n \to \infty$ to an explicit sum of integrals indexed by trees. This confirms a conjecture of Aizenman and Newman. We also establish convergence of chemical-distance-decorated $k$-point functions. Conditionally on a set of $k$ point lying in the same cluster, this identifies the joint limiting distribution of all pairwise chemical distances after quadratic rescaling. It is described by binary trees with explicit laws along the edges. The decorated expansion also gives $k$ point asymptotics in the near-critical window. Our proof uses our previous results on convergence to the incipient infinite clusters to decouple macroscopic connections, as well as distributional convergence of the chemical distance.
Read the full abstract

All authors Shirshendu Chatterjee, Pranav Chinmay, Jack Hanson, Philippe Sosoe

Numerical Analysis

Hard-constrained Physics-informed Neural Networks for Interface Problems

Physics-informed neural networks (PINNs) have emerged as a flexible framework for solving partial differential equations, but interface problems remain challenging because continuity and flux conditions are typically imposed through soft penalty terms, leading to imperfect interface enforcement and degraded accuracy near interfaces. We introduce two ansatz-based hard-constrained PINN formulations for interface problems that embed the interface physics into the solution representation, decoupling interface enforcement from PDE residual minimization. The windowing approach constructs the trial space from compactly supported windowed subnetworks so that interface continuity and flux balance are satisfied by design. The buffer approach discretely hard-constrains subnetworks with additive buffer functions that enforce boundary and interface constraints at sampled points through a lightweight correction. We study both formulations on one- and two-dimensional elliptic interface benchmarks against soft-constrained baselines. A statistical study in one dimension shows that the windowing approach occasionally attains very high accuracy (as low as $O(10^{-9})$) on simple structured cases, but its rigid ansatz makes training stiff, so its median errors are often worse than the baselines. In contrast, the buffer approach achieves the smallest median error (as low as $O(10^{-5})$) across a wider range of source terms and interface configurations. In two dimensions, the buffer formulation is more robust for general geometries, while the windowing construction is more sensitive to overlap and corner effects and over-constrains the problem. These results position the buffer method as a straightforward and promising approach for interface problems, with the search for an optimal buffer function form left for future work.
Read the full abstract

All authors Seung Whan Chung, Stephen T. Castonguay, Sumanta Roy, Michael S. Penwarden, Yucheng Fu, Pratanu Roy

Complex Variables

Finiteness of the fixed point sets of automorphisms

We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be discrete. We show, under natural extension hypotheses, that discreteness forces finiteness. We also obtain a uniform bound for the number of fixed points of automorphisms in compact subgroups whose elements admit such extensions.
Read the full abstract

Logic

Probabilistic equational spectrum, primality and approximation in finite algebras

We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We study fundamental properties of this spectrum, such as density and limit points, and show that its structure is related to several notions of primality of an algebra. We introduce a quantitative measure of primality $\Prim(\A)\in[0,1]$ that characterizes the functional approximation capacity. We show that the degree of primality is related to the size of the spectrum. We also prove that all non-primal two-element algebras satisfy the universal bound $\Prim(\A)\le 1/2$.
Read the full abstract

Information Theory

Power Amplifier-aware Power Allocation for Noise-limited and Distortion-limited Regimes

The conventional power allocation strategy via water-filling relies on the premise that the power amplifier (PA) operates sufficiently below saturation such that a linear RF chain model holds. This work integrates the PA nonlinearity directly into the power allocation formulation, thereby removing the linearity assumption altogether and enabling operation in regimes where distortion noise is non-negligible. Leveraging the Bussgang theorem, we establish a statistical linearization of the PA's hard-limiting model to characterize the trade-off between signal gain and power-dependent distortion. We propose a projected gradient descent algorithm that optimizes power allocation while identifying an optimal spatial back-off strategy. We also derive a closed-form thermal noise variance threshold that separates the noise-limited and distortion-limited operating regimes as a function of the distortion noise variance and the channel Frobenius norm. Numerical simulations validate that our amplifier-aware strategy provides significant capacity gains in the saturation regime compared to standard water-filling.
Read the full abstract

Group Theory

Deck transformations of developable complexes of groups

We introduce the concept of deck transformations within the category of developable complexes of groups. Drawing inspiration from classical covering theory for topological spaces, we propose an alternative construction of the universal development of a developable complex of groups, formulated in terms of equivalence classes of paths. This framework allows us to provide a natural characterization of the group of deck transformations.
Read the full abstract

Algebraic Geometry

Derived jet and arc spaces

We study jet schemes and arc spaces in the context of derived algebraic geometry. Explicitly, we consider the jet and arc functors in the category of schemes and study their animations to the category of derived schemes – what we call the derived jet and arc spaces. We show that the derived constructions agree with the classical versions when the base scheme is smooth, or more generally for local complete intersection log canonical singularities, giving a derived interpretation to a theorem of Mustaţă. For more singular spaces we get new singularity invariants in the form of higher homotopy groups. We also study cotangent complexes for derived jet and arc spaces, generalizing previous formulas for sheaves of differentials of classical jet and arc spaces. Several applications are obtained. Specifically, we revisit recent results on the local structure of arc spaces from the lens of cotangent complexes, giving more unified proofs and removing unnecessary hypotheses. In particular, we extend a version of Reguera's curve selection lemma for arc spaces to the case of non-perfect base fields.
Read the full abstract

Classical Analysis and ODEs

The two-weight fractional Poincaré-Sobolev sandwich

We establish a two-weight fractional Poincaré-Sobolev sandwich, consisting of a two-weight fractional Poincaré-Sobolev inequality and a two-weight embedding from the first-order Sobolev space to a Triebel-Lizorkin space defined via a difference norm. Our constants are asymptotically sharp as the fractional parameter approaches $1$. Our results are new even in the one-weight case. For each inequality we give explicit quantitative dependence on Muckenhoupt weight characteristics and treat both subcritical and critical regimes, the former via elementary methods and the latter via sparse domination. As one of our main tools, we establish a new sparse domination result for Triebel-Lizorkin difference norms. Our methods unify, simplify and significantly extend various earlier approaches.
Read the full abstract

Dynamical Systems

Numerical approximation of the Koopman-von Neumann equation: Operator learning and quantum computing

The Koopman-von Neumann equation describes the evolution of wavefunctions associated with autonomous ordinary differential equations and can be regarded as a quantum physics-inspired formulation of classical mechanics. The main advantage compared to conventional transfer operators such as Koopman and Perron-Frobenius operators is that the Koopman-von Neumann operator is unitary even if the dynamics are non-Hamiltonian. Projecting this operator onto a finite-dimensional subspace allows us to represent it by a unitary matrix, which in turn can be expressed as a quantum circuit. We will exploit relationships between the Koopman-von Neumann framework and classical transfer operators in order to derive numerical methods to approximate the Koopman-von Neumann operator and its eigenvalues and eigenfunctions from data. Furthermore, we will show that the choice of basis functions and domain are crucial to ensure that the operator is well-defined. We will illustrate the results with the aid of guiding examples, including simple undamped and damped oscillators and the Lotka-Volterra model.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Algorithmic Aspects of the Fermi–Hubbard Model

Preparing Gibbs states on a quantum computer offers a way to computationally probe how microscopic interactions give rise to macroscopic phenomena at finite temperature. However, an uncomfortable tension has set in: our strongest general guarantees for Gibbs state preparation hold in regimes where the resulting states can also be simulated classically. We propose investigating physical models with competing energy scales. The Fermi–Hubbard model is a natural target: the competition between electron hopping, on-site repulsion and chemical potential encapsulates many mysteries of condensed matter physics, including Mott insulators, striping and superconductivity. Our main result identifies a simple guiding principle: the temperature scale for efficient preparation is set by the couplings between sites, while the on-site energy scale is unrestricted. For the Fermi–Hubbard model on an $n$-site nearest-neighbor lattice of fixed dimension, we construct a quantum Gibbs sampler that mixes in $\mathcal{O}(\log(n/\epsilon))$ time whenever the temperature is at least a constant factor larger than the hopping strength, but is allowed to be independent of the repulsion and chemical potential. We obtain analogous guarantees for local qubit systems with bounded intersite interactions and arbitrary external fields. As a consequence, our algorithms can efficiently prepare Fermi–Hubbard Gibbs states that are provably outside the convex hull of fermionic Gaussian states and qubit Gibbs states for locally interacting Hamiltonians outside the set of product states.
Read the full abstract

Combinatorics

4-cycle-free induced subgraphs of grid graphs

In this paper we consider sets $S$ of vertices of the $n \times n$ grid graph $G_n$ where the induced subgraph $G_S$ having vertex set $S$ contains no $4$-cycles. We first quickly establish the maximum size of any such induced subgraph. Then, for even $n$ we estimate the number of $4$-cycle-free induced subgraphs of maximum and near-maximum size. If ${\mathcal F}_\varepsilon$ denotes the family of $4$-cycle-free induced subgraphs with at least $(3/4-\varepsilon)n^2$ vertices, then we show $$ \log|{\mathcal F}_0|=(1+o(1))n\log n. $$ Then, we also establish exponential upper and lower bounds for $|{\mathcal F}_\varepsilon|$. This estimate is proved using a local letter-pattern encoding of the unique missing vertex in a set of $2\times2$ blocks that tile the grid; the upper bound for $|{\mathcal F}_\varepsilon|$ uses a coarser block tiling (using larger blocks). We discuss the problem of closing the gap between our upper and lower bounds for $|{\mathcal F}_\varepsilon|$, and a possible defect-container approach.
Read the full abstract

Combinatorics

Ehrhart positivity for marked order polytopes

Given a pair of finite posets $A \subseteq P$, the function counting integer-valued order preserving extensions of an order preserving map $\lambda : A\rightarrow \mathbb{Z}$ from $A$ to $P$ is given by a piecewise polynomial in $\lambda$. We provide a criterion for the nonnegativity of the coefficients of these multivariate polynomials and apply it to show that marked order polytopes of skew shapes are Ehrhart positive in a multivariate sense. This extends recent results of Ferroni-Morales-Panova on order polytopes of skew shapes and proves conjectures on the Ehrhart positivity of skew Gelfand-Tsetlin polytopes and $m$-generalized Pitman-Stanley polytopes due to Alexanderson-Alhajjar and Dugan-Hegarty-Morales-Raymond, respectively.
Read the full abstract

Optimization and Control

Data Poisoning Attacks Can Systematically Destabilize Data-Driven Control Synthesis

Data-driven control has emerged as a powerful paradigm for synthesizing controllers directly from data, bypassing explicit model identification. However, this reliance on data introduces new and largely unexplored vulnerabilities. In this paper, we show that an attacker can systematically poison the data used for control synthesis, causing any linear state-feedback controller synthesized by the planner to destabilize the physical system. Concerningly, we show that the attacker can achieve this objective without knowledge of the system model or the controller synthesis procedure. To this end, we develop a recursive data-poisoning mechanism that generates falsified state trajectories, inducing a precise geometric shift in the apparent system dynamics. More broadly, our results establish that data-driven control pipelines can be deterministically destabilized by model-agnostic attacks operating solely at the data level. Numerical simulations corroborate these findings for both noise-free and noisy data.
Read the full abstract

All authors Vijayanand Digge, Martina Vanelli, Ahmad W. Al-Dabbagh, Julien M. Hendrickx, Gianluca Bianchin

Probability

On a remark of de Gennes concerning three-dimensional polyelectrolytes

This work is inspired by a remark of de Gennes about polyelectrolytes, which are charged polymers. A common model for a polymer is a self-avoiding or self-repelling random walk or Brownian motion. For polyelectrolytes, the repelling potential is the Coulomb potential arising from pairs of charged particles. We show that in the continuous case of Brownian motion in three dimensions, the spread of the polymer, in particular the the radius of gyration of a polyelectrolyte of length $T$ grows linearly with $T$, up to logarithmic corrections.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Harmonic morphisms and dynamical invariants in network renormalization

Renormalization of complex networks requires principled criteria for assessing whether a coarse-graining preserves dynamical content. We prove that discrete harmonic morphisms – surjective maps preserving harmonic functions – provide the minimal condition under which random walks on a fine-grained network project exactly onto random walks on its coarse-grained image, through an appropriate random time change. We formalize this via the harmonic degree, a diagnostic quantifying how closely any network coarse-graining approximates a harmonic morphism. Applying this framework to geometric, Laplacian, and GNN-based renormalization across real-world networks, we find that each method produces a distinct dynamical fingerprint encoding its underlying physical assumptions. Most strikingly, Laplacian renormalization spontaneously yields exact harmonic morphisms in several networks, achieving exact preservation of first-exit random-walk transition structure at specific scales, a property that entropic susceptibility fails to detect. Our results identify a discrete analog of diffusion-preserving conformal maps for irregular network topologies and provide quantitative tools for designing and evaluating multi-scale network descriptions.
Read the full abstract

All authors Francesco Maria Guadagnuolo, Marco Nurisso, Federica Galluzzi, Antoine Allard, Giovanni Petri

Mathematical Physics · Cross-listed from quant-ph

Sufficiency and Petz recovery for positive maps

We study the interconversion of families of quantum states ("statistical experiments") via positive, trace-preserving (PTP) maps and clarify its mathematical structure in terms of minimal sufficient Jordan algebras, which can be seen to generalize the Koashi-Imoto decomposition to the PTP setting. In particular, we show that Neyman-Pearson tests generate the minimal sufficient Jordan algebra, and hence also the minimal sufficient *-algebra corresponding to the Koashi-Imoto decomposition. As applications, we show that a) equality in the data-processing inequality for the relative entropy or the $\alpha$-$z$ quantum Rényi divergence implies the existence of a recovery map also in the PTP case and b) that two dichotomies can be interconverted by PTP maps if and only if they can be interconverted by decomposable, trace-preserving maps. We thoroughly review the necessary mathematical background on Jordan algebras. As a step beyond the finite-dimensional case, we prove Frenkel's formula for approximately finite-dimensional von Neumann algebras.
Read the full abstract

Differential Geometry

Local and global conformal invariants of submanifolds

We develop methods for constructing and computing conformal invariants of submanifolds, with a particular emphasis on conformal submanifold scalars and conformally invariant integrals of natural submanifold scalars. These methods include a direct construction of the extrinsic ambient space, a construction of global invariants of conformally compact minimal submanifolds of conformally compact Einstein manifolds via renormalized extrinsic curvature integrals, and the introduction of a large class of conformal submanifold scalars that are easily computed at minimal submanifolds of Einstein manifolds. As an application, we derive an explicit Gauss–Bonnet–Chern-type formula relating the renormalized area of a conformally compact $k$-dimensional minimal submanifold of a conformally compact Einstein manifold to its Euler characteristic and the integral of a conformal submanifold scalar of weight $-k$. As another application, we prove a rigidity result for conformally compact minimal submanifolds of conformally compact hyperbolic manifolds.
Read the full abstract

All authors Jeffrey S. Case, Ayush Khaitan, Yueh-Ju Lin, Aaron J. Tyrrell, Wei Yuan