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 2 April

Dynamical Systems

On the Dynamics of Linear Finite Dynamical Systems Over Galois Rings

Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the system is defined over a field %and usually strive to achieve a complete description of the system and its dynamics. or lack practicability to effectively analyze the system's dynamical behavior. However, when analyzing and prototyping finite dynamical systems, it is often desirable to quickly obtain basic information such as the length of cycles and transients that appear in its dynamics, which is reflected in the structure of the connected components of the corresponding functional graphs. In this paper, we extend the analysis of the dynamics of linear finite dynamical systems that act over cyclic modules to Galois rings. Furthermore, we propose algorithms for computing the length of the cycles and the height of the trees that make up their functional graphs.
Read the full abstract

All authors Jonas Kantic, Claudio Qureshi, Daniel Panario, Fabian Legl

Analysis of PDEs

Solvability of boundary value problem for Schrödinger Equations with Reverse Hölder Potentials on $L^p$ and endpoint spaces

In this paper we discuss the solvability of the Neumann and Regularity boundary value problem of elliptic Schrödinger-type equation $-\DIV(A(x)\nabla u(x,t))+V(x)u(x,t)=0$ with bounded measurable uniformly elliptic coefficinets $A(x)$ independent of $t$ and $V$ in Reverse Hölder class $\mathcal{B}_q$, and Neumann boundary data $\partial_{\nu_A}u(x,0)=f(x)\in H^p_{\mathcal{L}}(\rn)$, or Regularity data $u(x,0)=g\in H^{1,p}_V(\rn)$, utilizing the method of layer potential. We prove the solvability when $A$ is a small $L^\infty$ perturbation of a matrix satisfying De Giorgi-Nash-Moser bounds. Besides we also give the Campanato norm estimate of the double layer potential related to the Dirichlet problem with boundary data in certain Campanato-type spaces.
Read the full abstract

Probability · Cross-listed from cond-mat.stat-mech

Anomalous scaling in redirection networks

In networks that grow by isotropic redirection (IR), a new node selects an initial target node uniformly at random and attaches to a randomly chosen neighbor of the target. The emerging networks exhibit leaf proliferation, in which the number of nonleaves scales sublinearly as $N^\mu$ and the degree distribution has an algebraic tail with exponent $1+\mu$. To understand these mysterious properties, we introduce a class of models with redirection to leaves whenever possible. The resulting networks exhibit qualitatively similar phenomenology to IR networks, but avoid the inherent non-locality of the IR growth rule. These networks admit an analytical description of the leaf degree distribution, from which we extract the exponent $\mu$.
Read the full abstract

All authors Harrison Hartle, P. L. Krapivsky, S. Redner, Yuanzhao Zhang

Classical Analysis and ODEs

A Sharp Norm Inequality and Buzano's Inequality via Determinants

We give a short linear-algebraic proof of the inequality $$ \|x\|_1\,\|x\|_\infty \le \frac{1+\sqrt{n}}{2}\,\|x\|_2^2, $$ valid for every $x\in\mathbb{R}^n$. This inequality relates three fundamental norms on finite-dimensional spaces and has applications in optimization and numerical analysis. Our proof exploits the determinantal structure of a parametrized family of quadratic forms, and we show the constant $(1+\sqrt{n})/2$ is optimal. The inequality is a special case of Buzano's inequality, and the same method also proves Buzano's inequality for real vectors.
Read the full abstract

Optimization and Control

On Integral Linear Constraints on Convex Cones

In this paper, we consider integral linear constraints and the dissipation inequality with linear supply rates for certain sets of trajectories confined pointwise in time to a convex cone which belongs to a finite-dimensional normed vector space. Such constraints are then shown to be satisfied if and only if a bounded linear functional exists which satisfies a conic inequality. This is analogous to the typical situation in which a quadratic supply rate over the entire space is related to a linear matrix inequality. A connection is subsequently drawn precisely to linear-quadratic control: by proper choice of cone, the main results can be applied to produce a known L1-gain analogue to the bounded real lemma in positive systems theory, as well as a non-strict version of the Kalman-Yakubovich-Popov Lemma in linear-quadratic control.
Read the full abstract

Combinatorics

A $\mathbb{Z}_2$-Topological Framework for Sign-rank Lower Bounds

We develop a topological framework for proving lower bounds on sign-rank via $\mathbb{Z}_2$-equivariant topology, and use it to resolve the sign-rank of the Gap Hamming Distance problem up to lower-order terms. For every (partial) sign matrix $A$, we associate a free $\mathbb{Z}_2$-simplicial complex $S(A)$ and show that sign-rank of $A$ is characterized by the linear analog of $\mathbb{Z}_2$-index of $S(A)$. As a consequence, the classical $\mathbb{Z}_2$-index of $S(A)$ lower bounds the sign-rank of $A$, which reduces sign-rank lower bounds to topological obstructions. This reduction allows us to use various tools from $\mathbb{Z}_2$-equivariant topology, particularly in regimes where classical lower-bound techniques break down. As the main application, we consider the Gap Hamming Distance function $\mathrm{GHD}_k^n$ (defined for $k < n/2$), which distinguishes pairs of strings in $\{0,1\}^n$ with Hamming distance at most $k$ from pairs with distance at least $n-k$. We prove an essentially tight lower bound and show that for any $k$, \[ \text{sign-rank}(\mathrm{GHD}_k^n) = (1-o_k(1)) 2k. \] where the $o_k(1)$ term is $O\left(\sqrt{\frac{\log k}{k}}\right)$. This improves on the previous lower bound of Hatami, Hosseini, and Meng (STOC 2023) who proved that sign-rank of $\mathrm{GHD}_k^n$ is at least $\Omega(k/\log(n/k))$. A key technical ingredient is a new analysis of the $\mathbb{Z}_2$-coindex (which lower bounds $\mathbb{Z}_2$-index) of the Vietoris-Rips complex of the hypercube in the sparse regime which yields an essentially tight lower bound. Previously, no results were known in the sparse regime.
Read the full abstract

Combinatorics · Cross-listed from quant-ph

The Quantum Walk Characteristic Polynomial Distinguishes All Strongly Regular Graphs of Prime Orde

Let $G$ be a strongly regular graph of prime order $p$ with connection degree $k \geq 6$. We prove that the quantum walk characteristic polynomial $\chi_q(G,\lambda) \coloneqq \det(\lambda I - U_G)$, where $U_G$ is the coined quantum walk operator on $G$, completely determines $G$ up to isomorphism within the class of strongly regular graphs of the same order. The proof proceeds in three steps. First, we show that $U_G$ block-diagonalizes under the discrete Fourier transform over $\Z_p$, yielding $p$ blocks $U_G^{(j)}$ of size $k \times k$. Second, we prove an explicit formula \[ \chi_q\!\bigl(U_G^{(j)}, \lambda\bigr) = (\lambda-1)^{(k-2)/2}(\lambda+1)^{(k-2)/2} \!\left(\lambda^2 - \tfrac{2\widehat{A}_G(j)}{k}\,\lambda + 1\right), \] from which the Fourier coefficient $\widehat{A}_G(j)$ is recovered as the unique real part of an eigenvalue of $U_G^{(j)}$ distinct from $\pm 1$. Third, the inverse discrete Fourier transform recovers the connection set $S$ of $G$, and Turner's theorem (1967) identifies $G$ up to isomorphism. As a consequence, graph isomorphism is decidable in polynomial time within this class using the quantum walk spectrum, without resorting to the general quasi-polynomial algorithm of Babai (2016).
Read the full abstract

Algebraic Geometry

Galois group of exceptional curves on the generic del Pezzo surface

We prove that the Galois action on the exceptional curves on the generic del Pezzo surface of degree $d$ is maximal for all degrees $d$ and over any field $k$. As a consequence of the case $d=3$, we deduce that over $\mathbb{F}_q(u)$, 100% of cubic surfaces have no Brauer-Manin obstruction.
Read the full abstract

Classical Analysis and ODEs

Falconer lattice sets and the Erdos similarity problem

We show that a family of extremely thin sets satisfy the Erdős similarity conjecture. These examples lie outside the range covered by recent work of Shmerkin and Yavicoli \cite{ShmerkinYavicoli2025}. As we shall see, they have small logarithmic dimension. They do not contain affine copies of slowly decaying sequences, so the result does not follow from earlier work of Falconer and Eigen \cite{Falconer1984,Eigen}. On the other hand, they do contain sequences of rapid decay, for which the conjecture is still open in general. Our argument is based on Falconer lattice sets and a theorem of Bourgain \cite{Bourgain2003}.
Read the full abstract

Wednesday 1 April

Probability · Cross-listed from q-fin.CP

Stochastic Policy Gradient Methods in the Uncertain Volatility Model

The multidimensional Uncertain Volatility Model leads to robust option pricing problems under joint volatility and correlation uncertainty. Their numerical resolution quickly becomes challenging because the associated stochastic control problem is high-dimensional. We propose a backward actor-critic stochastic policy-gradient scheme tailored to this setting. The method combines a discrete dynamic programming principle with Proximal Policy Optimization and one-hidden-layer neural-network approximations of both the value function and the control policy. A key ingredient is the policy parameterization: continuous controls are represented through a squashed Gaussian policy built on a $C$-vine representation of correlation matrices, which enforces positive definiteness by construction. Beyond the robust price itself, the spatial gradient of the trained critic provides an approximation of the associated superhedging strategy. We assess the quality of this learned gradient through a dual formulation, which also yields a numerical dual estimate of the price. Numerical experiments on a range of multidimensional derivatives show that the method yields accurate prices, remains computationally efficient, and compares favorably with existing Monte Carlo and machine-learning-based benchmarks for robust pricing in the Uncertain Volatility Model.
Read the full abstract

All authors Lokman A Abbas-Turki, Jean-François Chassagneux, Jean-Philippe Lemor, Grégoire Loeper, Simon Sananes

Information Theory

Fundamental for Delay and Reliability Guarantees for Emergency UAV

To support mission-critical services in emergency scenarios, wireless networks are required to provide stringent guarantees under massive Ultra-Reliable Low-Latency Communications (mURLLC) constraints. Distributed unmanned aerial vehicle (UAV)-based massive multiple-input multiple-output (MIMO) architectures have recently emerged as a promising solution for rapidly deployable emergency communication systems. However, how to fundamentally characterize and guarantee statistical quality-of-service (QoS) for such systems in the finite blocklength regime remains largely unexplored. To overcome these challenges, in this paper we develop a fundamental analytical framework for delay and reliability bounded QoS guarantees in distributed UAV-based massive MIMO emergency networks under finite blocklength coding (FBC). By rigorously modeling the stochastic service process of distributed massive MIMO fading channels, we derive statistical characterizations the delay and error-rate bounded QoS exponents. We also establish QoS-driven controlling functions, including the $\epsilon$-effective capacity and the feasible QoS region. Finally, the obtained simulation results validate and evaluate our developed modeling techniques and asymptotic formulations to support mURLLC.
Read the full abstract

All authors Wenchi Cheng, Jingqing Wang, Zhuohui Yao, Wei Zhang

Probability · Cross-listed from cs.DC

Hotspot-Aware Scheduling of Virtual Machines with Overcommitment for Ultimate Utilization in Cloud Datacenters

We address the problem of under-utilization of resources in datacenters during cloud operations, specifically focusing on the challenge of online virtual machine (VM) scheduling. Rather than following the traditional approach of scheduling VMs based solely on their static flavors, we take into account their dynamic CPU utilization. We employ $\Gamma$-robustness theory to manage the dynamic nature and introduce a novel variant of bin packing - Probabilistic k-Bins Packing (PkBP), which theoretically protects the Physical Machines (PMs) from hotspots formation within a specified probability $\alpha$. We develop a scheduling algroithm named CloseRadiusFit and cold-start AI based prediction algorithms for the online version of PkBP. To verify the quality of our approach towards the optimal solutions, we solve the Offline PkBP problem by designing a novel Mixed Integer Linear Programming (MILP) model and a combination of numerical upper and lower bounds. Our experimental results demonstrate that CloseRadiusFit achieves narrow gaps of 1.6% and 3.1% when compared to the lower and upper bounds, respectively.
Read the full abstract

All authors Jiaxi Wu, Pavel Popov, Wenquan Yang, Andrei Gudkov, Elizaveta Ponomareva, Xinming Han, Yunzhe Qiu, Jie Song, Stepan Romanov

Information Theory

Tunneling-Augmented Simulated Annealing for Short-Block LDPC Code Construction

Designing high-performance error-correcting codes at short blocklengths is critical for low-latency communication systems, where decoding is governed by finite-length and graph-structural effects rather than asymptotic properties. This paper presents a global discrete optimization framework for constructing short-block linear codes by directly optimizing parity-check matrices. Code design is formulated as a constrained binary optimization problem with penalties for short cycles, trapping-set-correlated substructures, and degree violations. We employ a hybrid strategy combining tunneling-augmented simulated annealing (TASA) with classical local refinement to explore the resulting non-convex space. Experiments at blocklengths 64-128 over the AWGN channel show 0.1-1.3 dB SNR gains over random LDPC codes (average 0.45 dB) and performance within 0.6 dB of Progressive Edge Growth. In constrained regimes, the method enables design tradeoffs unavailable to greedy approaches. However, structural improvements do not always yield decoding gains: eliminating 1906 trapping set patterns yields only +0.08 dB improvement. These results position annealing-based global optimization as a complementary tool for application-specific code design under multi-objective constraints.
Read the full abstract

Combinatorics · Cross-listed from cs.DM

Validity, Sparse Holes, and Breadth in Language Generation: Banach Density, Topology, and Geometry

Language generation in the limit, rooted in work of Gold and Angluin and revived by Kleinberg and Mullainathan, studies generation under minimal assumptions: an adversary enumerates strings from an unknown target language $K$, and an algorithm must eventually generate unseen strings from $K$. A central question is the tension between validity and breadth: can a generator avoid hallucination while covering the hidden language broadly? In our previous work, we proved that every countable language class admits the optimal 1/2 lower-asymptotic-density guarantee. This prefix-based measure makes validity and breadth universally compatible. Here we replace prefix averaging by the local requirement of lower Banach density, which examines every long interval or box. We prove that for some countable language collections, every eventually valid generator must leave arbitrarily large sparse holes. Thus a worst-case local form of mode collapse is unavoidable: sparse holes are forced by the requirement of valid generation itself. This local notion reveals structure hidden by prefix averaging. In one dimension, the problem is intrinsically topological and combinatorial: finite Cantor–Bendixson rank guarantees the optimal lower Banach density 1/2, whereas infinite-rank classes can force density zero. In dimensions $d \geq 2$, Ramsey/discrepancy geometry adds in to force ordinary Banach density zero even for a singleton language class. We introduce filtered lower Banach density to remove this geometric obstruction and prove a $1/2-\epsilon$ guarantee for finite-rank classes. We also establish a dichotomy for $f$-window densities, interpolating between lower asymptotic and lower Banach density.
Read the full abstract

Number Theory

General formulas for a class of Euler sums

Let $H_k = 1 + 1/2 + 1/3 + \cdots + 1/k$ denote the $k$th harmonic number. We present an easy-to-implement algorithm for the computation of explicit closed-form evaluations, in terms of the digamma and polygamma functions, for Euler sums of the form \begin{align} \sum_{k=1}^\infty R(k) H_k, \end{align} where $R(k)$ is a rational function (quotient of two polynomials) whose denominator degree is at least two larger than the numerator degree. We apply the same method to show how the computation of a general formula for Euler sums of the form \begin{align*} \sum_{k=1}^\infty \frac{H_k}{(m_1 k + n_1)^{p_1} (m_2 k + n_2)^{p_2} \cdots (m_r k + n_r)^{p_r}} \end{align*} reduces to partial fraction decomposition. We present explicit formulae for sums with one or two terms in the denominator, with powers $p_i$ ranging up to 3, and with multipliers $m_i$ ranging up to 4. We also include results for related Euler sums such as \begin{align*} \sum_{k=1}^\infty \frac{k^q H_k}{(m k + n)^p}. \end{align*} Computation of Euler sums directly to very high precision enables us to rigorously check the above-mentioned formulas in many specific cases.
Read the full abstract

General Mathematics

Neural Prime Sieves: Density-Driven Generalization and Empirical Evidence for Hardy-Littlewood Asymptotics

Special prime families (twin, Sophie Germain, safe, cousin, sexy, Chen, and isolated primes) are central objects of analytic number theory, yet no efficiently computable probabilistic filter exists for identifying likely members among known primes at large scale. Classical sieves assign no probability weights to surviving candidates, and prior machine learning approaches are limited by the algorithmic randomness of the prime indicator sequence, yielding near-zero true positive rates. We present PrimeFamilyNet, a multi-head residual network conditioned on the backward prime gap and modular primorial residues of a known prime $p$, learning probabilistic filters for all seven families simultaneously and generalising across nine orders of magnitude from training ($10^7$–$10^9$) to evaluation at $10^{16}$. Isolated prime recall increased monotonically from $0.809$ at $5\times10^8$ to $0.984$ at $10^{16}$, a gain of $17.5$ percentage points and the only family among seven to improve with scale. Because recall is invariant to class prevalence, this reflects genuine decision boundary sharpening, not the rising isolated-prime fraction at extreme scales. A model trained only to $10^9$ reproduced the correct asymptotic direction without density supervision, corroborating Hardy–Littlewood $k$-tuple predictions. The causal model retained over $95\%$ recall for five families near $10^{10}$ while reducing the search space by $62$–$88\%$. For Chen primes, causal recall exceeded non-causal recall at every scale (margin $+0.245$ at $10^{16}$) because $g^+=2$ encodes only the prime case of the Chen condition. Focal Loss collapsed sparse algebraic family recall to $0.000$. Asymmetric Loss outperformed weighted BCE in-distribution but degraded more steeply out-of-distribution, showing that in-distribution recall alone is a misleading criterion for scale-generalisation tasks.
Read the full abstract

Information Theory · Cross-listed from cs.NI

Agentic AI-Empowered Wireless Agent Networks With Semantic-Aware Collaboration via ILAC

The rapid development of agentic artificial intelligence (AI) is driving future wireless networks to evolve from passive data pipes into intelligent collaborative ecosystems under the emerging paradigm of integrated learning and communication (ILAC). However, realizing efficient agentic collaboration faces challenges not only in handling semantic redundancy but also in the lack of an integrated mechanism for communication, computation, and control. To address this, we propose a wireless agent network (WAN) framework that orchestrates a progressive knowledge aggregation mechanism. Specifically, we formulate the aggregation process as a joint energy minimization problem where the agents perform semantic compression to eliminate redundancy, optimize transmission power to deliver semantic payloads, and adjust physical trajectories to proactively enhance channel qualities. To solve this problem, we develop a hierarchical algorithm that integrates inner-level resource optimization with outer-level topology evolution. Theoretically, we reveal that incorporating a potential field into the topology evolution effectively overcomes the short-sightedness of greedy matching, providing a mathematically rigorous heuristic for long-term energy minimization. Simulation results demonstrate that the proposed framework achieves superior energy efficiency and scalability compared to conventional benchmarks, validating the efficacy of semantic-aware collaboration in dynamic environments.
Read the full abstract

All authors Zhouxiang Zhao, Jiaxiang Wang, Zhaohui Yang, Kun Yang, Zhaoyang Zhang, Mingzhe Chen, Kaibin Huang

Metric Geometry · Cross-listed from q-bio.GN

VeloTree: Inferring single-cell trajectories from RNA velocity fields with varifold distances

Trajectory inference is a critical problem in single-cell transcriptomics, which aims to reconstruct the dynamic process underlying a population of cells from sequencing data. Of particular interest is the reconstruction of differentiation trees. One way of doing this is by estimating the path distance between nodes – labeled by cells – based on cell similarities observed in the sequencing data. Recent sequencing techniques make it possible to measure two types of data: gene expression levels, and RNA velocity, a vector that quantifies variation in gene expression. The sequencing data then consist in a discrete vector field in dimension the number of genes of interest. In this article, we present a novel method for inferring differentiation trees from RNA velocity fields using a distance-based approach. In particular, we introduce a cell dissimilarity measure defined as the squared varifold distance between the integral curves of the RNA velocity field, which we show is a robust estimate of the path distance on the target differentiation tree. Upstream of the dissimilarity measure calculation, we also implement comprehensive routines for the preprocessing and integration of the RNA velocity field. Finally, we illustrate the ability of our method to recover differentiation trees with high accuracy on several simulated and real datasets, and compare these results with the state of the art.
Read the full abstract

Combinatorics

An inequality for anti-self-polar polytopes

We prove an inequality for the f-vectors of anti-self-polar polytopes conjectured by Katz in 1989. The proof uses Kalai's combinatorial inequality based on a result of Whiteley. The inequality can also be obtained from the results of Stanley and Karu which however involve difficult algebraic geometry.
Read the full abstract

Combinatorics

Enumeration of Factor Occurrences in $k$-Bonacci Words over an Infinite Alphabet

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in the finite iterates. For $k \ge 3$, we obtain closed forms for the generating functions (with respect to the iteration index) that count the number of occurrences of an arbitrary digit in the $n$th iterate. We then characterize the complete set of length-$2$ factors occurring in the infinite word and compute, for each such factor, a closed form for the generating function encoding its number of occurrences across all finite iterates. As a consequence, the associated counting sequences satisfy uniform $(k\!-\!1)$-step Fibonacci-type recurrences and admit a description in terms of $(k\!-\!1)$-Bonacci enumeration phenomena, including self-convolution structures.
Read the full abstract

All authors Narges Ghareghani, Mehdi Golafshan, Morteza Mohammad-Noori, Pouyeh Sharifani

Rings and Algebras

Translation Monoids and Recursive Evaluation in Finite Binary Algebras

Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by listing its values on \(A^n\) in lexicographic order. This produces an \(m^n\times C_{n-1}\) array, where \(m=|A|\) and \(C_{n-1}\) is the \((n-1)\)st Catalan number. We show that the recursive structure of these arrays is governed by the translation monoid \[ T(A)=\langle L_a,R_a:a\in A\rangle\leq A^A, \qquad L_a(x)=a\star x,\quad R_a(x)=x\star a. \] More precisely, context maps arising from subterms are exactly the elements of \(T(A)\), so every element of the translation monoid occurs as a recursive block map. We also prove that rank defines a natural chain of two-sided ideals in \(T(A)\), that the minimum-rank elements form a minimal nonempty two-sided ideal, and that Green's \(\mathcal J\)-classes are contained in rank layers. Finally, we show by example that equal rank does not determine the \(\mathcal J\)-class in general.
Read the full abstract

Optimization and Control

The Newton-Muon Optimizer

The Muon optimizer has received considerable attention for its strong performance in training large language models, yet the design principle behind its matrix-gradient orthogonalization remains largely elusive. In this paper, we introduce a surrogate model that not only sheds new light on the design of Muon, but more importantly leads to a new optimizer. In the same spirit as the derivation of Newton's method, the surrogate approximates the loss as a quadratic function of the perturbation to a weight matrix $W$ using only three matrices: the gradient $G$, an output-space curvature matrix $H$, and the data matrix $Z$ that stacks the layer inputs. By minimizing this surrogate in one step and adopting a certain isotropic assumption on the weights, we obtain the closed-form update rule (up to momentum and weight decay) $W \leftarrow W - \eta \cdot \mathrm{msgn}(G(ZZ^\top)^{-1})$, where $\eta$ is the learning rate and $\mathrm{msgn}(X)=UV^\top$ if $X=USV^\top$ is a compact singular value decomposition. This new optimization method, which we refer to as Newton-Muon, shows that standard Muon can be interpreted as an implicit Newton-type method that neglects the right preconditioning induced by the input second moment. Empirically, on a reproduction of the earliest publicly released Modded-NanoGPT speedrun configuration using Muon for GPT-2 pretraining, Newton-Muon reaches the target validation loss in 6% fewer iteration steps and reduces wall-clock training time by about 4%.
Read the full abstract

Statistics Theory

Sharp Debiasing for Smooth Functional Estimation in Banach Spaces

This paper studies the estimation of smooth functionals $f(\theta)$ of a mean parameter $\theta = \mathbb{E}_P[W]$ for a distribution $P$ on a general Banach space. We propose a cross-fitted estimator based on a single sample splitting and establish non-asymptotic moment bounds and Berry–Esséen bounds for both $m$-smooth and infinitely smooth functionals under the finite moment assumptions. Our framework is applied to precision matrix estimation and the inference of projection parameters in high-dimensional regression. In these Euclidean settings, the proposed estimators achieve asymptotic normality under the dimension regime $d \log^2(en) = o(n)$ without requiring any structural assumptions (e.g., sparsity). We discuss computational relaxations that enables polynomial-time implementation for a range of matrix functionals.
Read the full abstract

Number Theory

On algebraic independence of three p-adic continued fractions

In this paper, we establish sufficient conditions on the elements of the p-adic continued fractions $A$ and $B$ which guarantee that the p-adic continued fractions $A, B $ and $A^{B}$ are algebraically independent over $\mathbb{Q}$. These elements have partial quotients that increase rapidly. We note that these results extend some work of Bundschuh. Furthermore, we give some numerical examples which illustrated the theoretical results.
Read the full abstract

Optimization and Control

Discrete-Time Event-Triggered Extremum Seeking

This paper proposes a discrete-time event-triggered extremum seeking control scheme for real-time optimization of nonlinear systems. Unlike conventional discrete-time implementations relying on periodic updates, the proposed approach updates the control input only when a state-dependent triggering condition is satisfied, reducing unnecessary actuation and communication. The resulting closed-loop system combines extremum seeking with an event-triggering mechanism that adaptively determines the input update instants. Using discrete-time averaging and Lyapunov analysis, we establish practical convergence of the trajectories to a neighborhood of the unknown extremum point and show exponential stability of the associated average dynamics. The proposed method preserves the optimization capability of classical extremum seeking while significantly reducing the number of input updates. Simulation results illustrate the effectiveness of the approach for resource-aware real-time optimization.
Read the full abstract

All authors Victor Hugo Pereira Rodrigues, Tiago Roux Oliveira, Miroslav Krstić, Frank Allgöwer

Information Theory · Cross-listed from econ.TH

All Substitution Is Local

When does consulting one information source raise the value of another, and when does it diminish it? We study this question for Bayesian decision-makers facing finite actions. The interaction decomposes into two opposing forces: a complement force, measuring how one source moves beliefs to where the other becomes more useful, and a substitute force, measuring how much the current decision is resolved. Their balance obeys a localization principle: substitution requires an observation to cross a decision boundary, though crossing alone does not guarantee it. Whenever posteriors remain inside the current decision region, the substitute force vanishes, and sources are guaranteed to complement each other, even when one source cannot, on its own, change the decision. The results hold for arbitrarily correlated sources and are formalized in Lean 4. Substitution is confined to the thin boundaries where decisions change. Everywhere else, information cooperates. Code and proofs: https://github.com/nidhishs/all-substitution-is-local.
Read the full abstract

Analysis of PDEs

On Aviles-Giga limit states with $L^p$ entropy productions

The Aviles-Giga energy provides sequences of maps converging to weak solutions $m\colon\Omega \subset\mathbb R^2\to\mathbb R^2$ of the eikonal equation \begin{align*} \mathrm{div}\, m=0\text{ in }\mathcal D'(\Omega),\quad |m|=1\text{ a.e. in }\Omega\,, \end{align*} whose entropy productions $\mathrm{div}\,\Phi(m)$ are Radon measures in $\Omega$, controlled by the energy. Here, the entropies are all $C^2$ vector fields $\Phi\colon\mathbb S^1\to\mathbb R^2$ such that $\mathrm{div}\,\Phi(m_*)=0$ for any smooth solution $m_*$. It is conjectured that the entropy production measures are concentrated on the one-dimensional jump set of $m$, as follows from the chain rule if $m$ has bounded variation. In particular, the entropy production measures should vanish if they coincide with $L^p$ functions: this is what we establish in this note if $p$ is not too small and under natural boundary conditions.
Read the full abstract

Optimization and Control

Rendezvous Planning from Sparse Observations of Optimally Controlled Targets

We develop a probabilistic framework for rendezvous planning: given sparse, noisy observations of a fast-moving target, plan rendezvous spatiotemporal coordinates for a set of significantly slower seeking agents. The unknown target trajectory is estimated under uncertain dynamics using a filtering approach that combines a kernel-based maximum a posteriori estimation with Gaussian process correction, producing a mixture over trajectory hypotheses. This estimate is used to select spatiotemporal rendezvous points that maximize the probability of successful rendezvous. Points are chosen sequentially by greedily minimizing failure probability in the current belief space, which is updated after each step by conditioning on unsuccessful rendezvous attempts. We show that the failure-conditioned update correctly captures the posterior belief for subsequent decisions, ensuring that each step in the greedy sequence is informed by a statistically consistent representation of the remaining search space, and derive the corresponding Bayesian updates incorporating temporal correlations intrinsic to the trajectory model. This result provides a systematic framework for planning under uncertainty in applications of autonomous rendezvous such as unmanned aerial vehicle refueling, spacecraft servicing, autonomous surface vessel operations, search and rescue missions, and missile defense. In each, the motion of the target entity can be modeled using a system of differential equations undergoing optimal control for a chosen objective, in our example case Hamilton–Jacobi–Bellman solutions for minimum arrival time of a Dubins car with uncertain turning radius and destination.
Read the full abstract

All authors Thomas A. Scott, Lukas Taus, Yen-Hsi Richard Tsai, Tan Bui-Thanh, Justin G.R. Delva

Representation Theory

Nilpotent orbits of classical Lie algebras stable under negation

Gibbs states are probability distributions defined on Hamiltonian G-manifolds that are naturally parametrized by elements of the Lie algebra g. In this paper, we focus on a specific case of the simplest Hamiltonian G-manifolds, the coadjoint orbits of Lie algebras. We look at the nilpotent coadjoint orbits of the classical Lie algebras, or equivalently the nilpotent adjoint orbits. We show that Gibbs states do not exist on nilpotent orbits that are stable under multiplication by -1, and proceed to classify those for all classical Lie algebras.
Read the full abstract

Optimization and Control · Cross-listed from quant-ph

Distributed Variational Quantum Linear Solver

This paper develops a distributed variational quantum algorithm for solving large-scale linear equations. For a linear system of the form $Ax=b$, the large square matrix $A$ is partitioned into smaller square block submatrices, each of which is known only to a single noisy intermediate-scale quantum (NISQ) computer. Each NISQ computer communicates with certain other quantum computers in the same row and column of the block partition, where the communication patterns are described by the row- and column-neighbor graphs, both of which are connected. The proposed algorithm integrates a variant of the variational quantum linear solver at each computer with distributed classical optimization techniques. The derivation of the quantum cost function provides insight into the design of the distributed algorithm. Numerical quantum simulations demonstrate that the proposed distributed quantum algorithm can solve linear systems whose size scales with the number of computers and is therefore not limited by the capacity of a single quantum computer.
Read the full abstract