Statistics Theory
Principal Manifold Estimation with Riemannian Templates
Kun Meng and Christopher Perez
Principal
manifold estimation (PME) has been successfully applied to robotics and neuroimaging. However, the existing PME framework does not directly accommodate
manifolds with non-Euclidean
topology, and its theoretical foundations remain incomplete. In this article, we develop a complete theoretical framework for PME that summarizes high-dimensional point clouds using low-dimensional
manifolds with general, potentially non-Euclidean
topology. The choice of
topology can be informed by topological data analysis. Drawing on the theory of Sobolev spaces on Riemannian
manifolds, we establish that the proposed principal
manifolds are well-defined, prove convergence of the iterative
algorithm used to compute them, and establish the consistency of the finite-sample
estimator. We further provide a
Bayesian interpretation of PME that connects the framework to recent developments in Gaussian processes on Riemannian
manifolds. Examples illustrate how the proposed PME framework can be applied to existing statistical methods, including
manifold-valued regression. Numerical experiments illustrate the proposed methodology, its computational implementation, and its theoretical properties.
Read the full abstract ▾
Classical Analysis and ODEs
Bernstein inequality on parabolic domains
Yuan Xu
Several families of sharp Bernstein inequalities are established on the weighted $L^2$ space over
parabolic domains, which include bounded or unbounded rotational paraboloids and
parabolic surfaces. The main tool is a second-order differential operator satisfied by a specific basis of orthogonal
polynomials in weighted $L^2$ space.
Read the full abstract ▾
Probability
On Sharpest Tail Bounds for Functions of Tail Bounded Random Variables
Stephen Jordan Harrison
Consider $n$ real/complex, independent/dependent random variables with respective tail bounds and $g$ a measurable function of the r.v.'s. Consider $f$ the "sharpest" tail bound of $g$ (sharpest in the sense that if $f$ were any less, then for some $X_1,...,X_n$ satisfying the conditions, $g(X_1,...,X_n)$ would not satisfy $f$). Significant research has been done to approximate $f$ often with high accuracy. These results are often of the form that for $g$ in this family and tail bounds of $X_k$ in this family, $f$ is bounded by some $f'$ with high accuracy. However, the question "what would it take to find $f$ exactly?" has received little
attention, apparently even for simple cases. This is the question we try to answer. For $X_1,...,X_n$ required to be mutually independent, first the $X_k$ are simplified to be monotone on $(0,1)$ WLOG. This strengthens convergence in distribution to convergence a.e. (Skorokhod's representation
theorem) and allows defining shift operators, which help reduce the space of r.v.'s one searches to find $f$ and/or the maximum measure of a subset. We do find $f$ in some special cases, however $f$ rarely has a closed form. For $X_1,...,X_n$ dependent/not necessarily independent, another reduction in the space of r.v.'s one searches to find $f$ is done.
Read the full abstract ▾
Mathematical Physics · Cross-listed from eess.SY
Data-Driven Boundary Control of Distributed Port-Hamiltonian Systems
Thomas Beckers and Leonardo Colombo
Distributed Port-
Hamiltonian (dPHS) theory provides a powerful framework for modeling physical systems governed by partial differential equations and has enabled a broad class of boundary control methodologies. Their effectiveness, however, relies heavily on the availability of accurate system models, which may be difficult to obtain in the presence of nonlinear and partially unknown dynamics. To address this challenge, we combine Gaussian Process distributed Port-
Hamiltonian system (GP-dPHS) learning with boundary control by interconnection. The GP-dPHS model is used to infer the unknown
Hamiltonian structure from data, while its posterior uncertainty is incorporated into an energy-based robustness analysis. This yields probabilistic conditions under which the closed-loop trajectories remain bounded despite model mismatch. The method is illustrated on a simulated shallow water system.
Read the full abstract ▾
Information Theory · Cross-listed from stat.ML
Avoiding Non-Integrable Beliefs in Expectation Propagation
Zilu Zhao, Jichao Chen and Dirk Slock
Expectation Propagation (EP) is a widely used iterative message-passing
algorithm that decomposes a global inference problem into multiple local ones. It approximates marginal distributions as “beliefs” using intermediate functions called “messages”. It has been shown that the stationary points of EP are the same as corresponding constrained Bethe Free Energy (BFE) optimization problem. Therefore, EP is an iterative method of optimizing the constrained BFE. However, the iterative method may fall out of the feasible set of the BFE optimization problem, i.e., the beliefs are not integrable. In most literature, the authors use various methods to keep all the messages integrable. In most
Bayesian estimation problems, limiting the messages to be integrable shrinks the actual feasible set. Furthermore, in extreme cases where the factors are not integrable, making the message itself integrable is not enough to have integrable beliefs. In this paper, two EP frameworks are proposed to ensure that EP has integrable beliefs. Both of the methods allows non-integrable messages. We then investigate the signal recovery problem in Generalized Linear Model (GLM) using our proposed methods.
Read the full abstract ▾
Functional Analysis
Bernoulli cylinder frame operators: filtration, Haar structure, and self-similarity
James Tian
We study the finite-rank frame operators generated by cylinder indicator functions for the Bernoulli Cantor measure $\mu_{p}$. In the symmetric case $p=\frac{1}{2}$, the natural Haar differences diagonalize these operators. For general $0<p<1$, we show that the weighted Haar basis still yields a sparse tree-banded
matrix form, although diagonalization is lost. We also prove a filtration representation in terms of conditional expectations and level-wise mass operators. This leads to a norm convergent limit operator $K_{\infty}$, which is compact, positive, and self-adjoint. Finally, we show that $K_{\infty}$ is characterized by a self-similar operator identity induced by the first-level Cantor decomposition, and we derive corresponding block and scalar resolvent renormalization formulas.
Read the full abstract ▾
Analysis of PDEs
Modified scattering for the Vlasov-Riesz system with long-range interactions
Younghun Hong and Stephen Pankavich
We study the long-time asymptotic behavior of small-data solutions to the three-dimensional Vlasov–Riesz system with the inverse power-law potential $\lambda |x|^{-\alpha}$ in the strictly long-range regime ($0 < \alpha < 1$). By introducing finite- and infinite-time modified wave operators for the characteristic flows, we describe the asymptotic dynamics via convergence to an effective profile along a suitably modified reference flow, and establish modified scattering of solutions. Our proof relies mainly on ODE techniques for the characteristic flows, while also using PDE methods for weighted $W^{1,\infty}$-bounds. Compared with the earlier result (of Huang and Kwon), our Lagrangian approach extends modified scattering to the broader regime $\frac{1}{2}<\alpha<1$ and provides a distinct and more robust argument.
Read the full abstract ▾
Commutative Algebra
The Bourbaki degree of the syzygy module of 2 $\times$ 4 matrices
Marcos Jardim, Felipe Monteiro and Abbas Nasrollah Nejad
We introduce and study the Bourbaki degree as a numerical invariant for \(2 \times 4\)
matrices $\Theta$ of homogeneous
polynomials over a
polynomial ring \(R = k[x_1, \dots, x_n]\). This invariant, defined via a Bourbaki sequence for the syzygy module \(\operatorname{Syz}(\Theta)\), generalizes previous constructions for plane curves and Jacobian
matrices. Our main result is an explicit formula expressing the Bourbaki degree in terms of the degrees of the rows, the initial degree of a syzygy, and the first two
Hilbert coefficients of the cokernel module \(\mathcal{Q} = \operatorname{coker}(\Theta)\). We apply this framework to two important cases. First,
matrices with constant first row, which are determined by a three-equigenerated ideal \(J = (f_1, f_2, f_3)\), where we show the Bourbaki degree measures how far \(J\) is from being a perfect ideal, and we completely characterize its smaller and larger values. Second, for a linear
matrix, we use the Kronecker–Weierstrass classification to determine all possible Bourbaki degrees and homological types. This classification reveals the existence of a linear
matrix with Bourbaki degree equal to 2, a value that does not occur for Jacobian
matrices. Finally, in the
geometric context of \(\mathbb{P}^3\), we provide a sufficient condition for \(\operatorname{Syz}(\Theta)\) to define a codimension one distribution and obtain bounds on the Bourbaki degree when the initial degree is small.
Read the full abstract ▾
Operator Algebras
Bures–Kuratowski metrics and simplicial complexes for completely bounded maps
Remus Floricel, Sarah Plosker and Avner Sadikov
Let $A$ be a unital $C^*$-
algebra and $H$ a
Hilbert space. The cone $\CP(A,B(H))$ of completely positive maps carries the Bures metric $\beta$, closely related to the cb-norm. We introduce a family of Bures–Kuratowski (BK) metrics on $\CB(A,B(H))$ that extend $\beta$ exactly on $\CP(A,B(H))$. The construction combines a Kuratowski
embedding of the Bures cone, based at an anchor $\theta\in\CP(A,B(H))$, with a regular-representation Hausdorff coordinate arising from universal regular models. Each BK metric admits an $\ell^p$-wedge decomposition, splitting $\CB(A,B(H))$ into the Bures cone and a non-CP component attached at $\theta$. We then study Vietoris–Rips and Čech complexes of BK metric spaces. The wedge formula yields explicit criteria for mixed simplices, a join-type description of the mixed Rips complex, and ball-intersection criteria for mixed Čech simplices. For finite point clouds, this makes the mixed simplicial geometry computable from the two component metrics and reveals new homological features arising from the interaction between the CP and non-CP sectors.
Read the full abstract ▾
Dynamical Systems · Cross-listed from cs.SI
Transmission Neural Networks: Inhibitory and Excitatory Connections
Shuang Gao and Peter E. Caines
This paper extends the Transmission Neural Network model proposed by Gao and Caines in [1]-[3] to incorporate inhibitory connections and neurotransmitter populations. The extended network model contains binary neuronal states, transmission dynamics, and inhibitory and excitatory connections. Under technical assumptions, we establish the characterization of the firing probabilities of
neurons, and show that such a characterization considering inhibitions can be equivalently represented by a neural network where each
neuron has a continuous state of dimension 2. Moreover, we incorporated neurotransmitter populations into the modeling and establish the limit network model when the number of neurotransmitters at all synaptic connections go to infinity. Finally, sufficient conditions for stability and contraction properties of the limit network model are established.
Read the full abstract ▾
Optimization and Control
Smooth and Exact Parameterization of Continuous-time Signal Temporal Logic Specifications for Trajectory Optimization
Samet Uzun and Behçet Aç{\i}kmeşe
This paper presents a smooth parameterization of continuous-time Signal Temporal Logic (CT-STL) specifications for nonconvex trajectory optimization that is sound and complete up to the accuracy of the underlying numerical integration scheme. CT-STL provides a natural framework for encoding rich temporal and logical task requirements, but existing trajectory-optimization formulations typically enforce such specifications only at discrete sampling nodes. In contrast, the proposed method evaluates specifications in dense time, thereby guaranteeing continuous-time satisfaction of always predicates, which is critical for path constraints such as obstacle avoidance, while eliminating the node-induced conservatism of eventually predicates by allowing satisfaction at any time within the prescribed interval. These two dense-time constructions also serve as the main building blocks for handling more general CT-STL formulas, including complex until specifications. Furthermore, the proposed parameterization resolves the locality and gradient-masking issues inherent in standard quantitative semantics, yielding a more favorable landscape for gradient-based solvers. Although dense-time evaluation introduces additional function evaluations during discretization, it also permits substantially coarser temporal grids without sacrificing safety or logical fidelity. This, in turn, reduces the dimension of the resulting nonconvex program, which is often the dominant factor in trajectory-generation cost. The numerical effectiveness and semantic exactness of the proposed framework are demonstrated on an agile quadrotor flight problem subject to a complex continuous-time until specification. The implementation is available at https:// github.com/UW-ACL/TrajOpt_CT-STL
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Learning an Interpretable Risk Scoring System for Maximizing Decision Net Benefit
Wenhao Chi and Ş. İlker Birbil
Risk scoring systems are widely used in high-stakes domains to assist decision-making. However, existing approaches often focus on optimizing predictive accuracy or likelihood-based criteria, which may not align with the main goal of maximizing utility. In this paper, we propose a novel risk scoring system that directly optimizes net benefit over a range of decision thresholds. The model is formulated as a sparse integer linear programming problem which enables the construction of a transparent scoring system with integer coefficients, and hence, facilitates interpretation and practical application. We also establish fundamental relationships among net benefit, discrimination, and calibration. Specifically, we derive bounds relating the area under the net benefit curve to a ROC functional, both evaluated on a fixed threshold grid, and show that post-processing can achieve moderate calibration on the training data without decreasing the area under the net benefit curve on that grid. We evaluated our method on multiple public
datasets as well as on a large-scale credit risk
dataset. This computational study demonstrated that our interpretable method can effectively achieve high net benefit while maintaining competitive discrimination and calibration performance.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Feasibility and Explicit Safety Filters for Control Barrier Functions in Linear Systems
Shima Sadat Mousavi, Max H. Cohen, Pol Mestres et al. (+1 more)
Safety filters based on control barrier functions (CBFs) and high-order control barrier functions (HOCBFs) are commonly implemented through quadratic programs (QPs), which may become infeasible under conflicting safety and actuator constraints. For linear systems with affine safety functions, we exploit repeated input-space directions to obtain an explicit polyhedral feasibility domain, linear-program certificates for regional feasibility and final-gain selection, and conditions identifying gain-independent obstructions and the minimum common final gain. A compatible QP metric yields an exact saturation-based filter and, together with the regional certificate, persistent feasibility and safety. For a single exterior ellipsoidal CBF with unrestricted inputs, we also derive an exact, gain-independent linear
matrix inequality (LMI) test. Double-integrator and aircraft examples illustrate the results.
Read the full abstract ▾
All authors Shima Sadat Mousavi, Max H. Cohen, Pol Mestres, Aaron D. Ames
Optimization and Control · Cross-listed from eess.SY
Stability Margins of CBF-QP Safety Filters: Analysis and Synthesis
Shima Sadat Mousavi, Pol Mestres and Aaron D. Ames
Control barrier function (CBF)-QP safety filters enforce safety by minimally modifying a nominal controller. While prior work has mainly addressed robustness of safety under uncertainty, robustness of the resulting closed-loop stability is much less understood. This issue is important because once the safety filter becomes active, it modifies the nominal dynamics and can reduce stability margins or even destabilize the system, despite preserving safety. For linear systems with a single affine safety constraint, we show that the active-mode dynamics admit an exact scalar loop representation, leading to a classical robust-control interpretation in terms of gain, phase, and delay margins. This viewpoint yields exact stability-margin characterizations and tractable linear
matrix inequality (LMI)-based certificates and synthesis conditions for controllers with certified robustness guarantees. Numerical examples illustrate the proposed analysis and the enlargement of certified stability margins for safety-filtered systems.
Read the full abstract ▾
Statistics Theory
Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
Ilias Diakonikolas, Chao Gao, Daniel M. Kane et al. (+2 more)
We study robust regression under a contamination model in which
covariates are clean while the responses may be corrupted in an adaptive manner. Unlike the classical Huber's contamination model, where both
covariates and responses may be contaminated and consistent estimation is impossible when the contamination proportion is a non-vanishing constant, it turns out that the clean-
covariate setting admits strictly improved statistical guarantees. Specifically, we show that the additional information in the clean
covariates can be carefully exploited to construct an
estimator that achieves a better estimation rate than that attainable under Huber contamination. In contrast to the Huber model, this improved rate implies consistency even when the contamination is a constant. A matching minimax lower bound is established using Fano's inequality together with the construction of contamination processes that match $m> 2$ distributions simultaneously, extending the previous two-point lower bound argument in Huber's setting. Despite the improvement over the Huber model from an information-theoretic perspective, we provide formal evidence – in the form of Statistical Query and Low-Degree
Polynomial lower bounds – that the problem exhibits strong information-computation gaps. Our results strongly suggest that the information-theoretic improvements cannot be achieved by
polynomial-time
algorithms, revealing a fundamental gap between information-theoretic and computational limits in robust regression with clean
covariates.
Read the full abstract ▾
All authors Ilias Diakonikolas, Chao Gao, Daniel M. Kane, Ankit Pensia, Dong Xie
Rings and Algebras
A formal Lie correspondence
Vincent Bagayoko
We establish an equivalence between categories of 'formally nilpotent' Lie
algebras and exponential groups in characteristic zero. It extends the equivalences of Mal'cev, Lazard, Quillen and Warfield, and applies to groups under composition of generalized formal series or
automorphisms of
algebras of generalized formal series. We obtain first-order transfer results from finite dimensional nilpotent objects to formally nilpotent ones. We give applications to solving equations over groups, to the theory of nilpotent exponential groups as per Miasnikov-Remeslennikov, and to definability problems in certain groups of formal series.
Read the full abstract ▾
Differential Geometry
Expanding Soliton Models for Kähler-Ricci Flow Near Conical Singularities
Longteng Chen, Max Hallgren and Lucas Lavoyer
Let $(Y,g_0)$ be a compact analytic space with a finite number of singular points, where the metric at each singular point is modelled on a Kähler cone with smooth canonical model. We show that the Kähler-
Ricci flow with such initial data satisfies a $C/t$
curvature bound, and that the flow near each singular point is modelled on the unique Kähler-
Ricci expander asymptotic to the corresponding cone. Our motivation is to give a
geometric description of the Kähler–
Ricci flow emerging from singularities arising in the analytic minimal model program.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
Sharp asymptotic theory for Q-learning with LDTZ learning rate and its generalization
Soham Bonnerjee, Zhipeng Lou and Wei Biao Wu
Despite the sustained popularity of Q-learning as a practical tool for policy determination, a majority of relevant theoretical literature deals with either constant ($\eta_{t}\equiv \eta$) or polynomially decaying ($\eta_{t} = \eta t^{-\alpha}$) learning schedules. However, it is well known that these choices suffer from either persistent bias or prohibitively slow convergence. In contrast, the recently proposed linear decay to zero (LD2Z: $\eta_{t,n}=\eta(1-t/n)$) schedule has shown appreciable empirical performance, but its theoretical and statistical properties remain largely unexplored, especially in the Q-learning setting. We address this gap in the literature by first considering a general class of power-law decay to zero (PD2Z-$\nu$: $\eta_{t,n}=\eta(1-t/n)^{\nu}$). Proceeding step-by-step, we present a sharp non-asymptotic error bound for Q-learning with PD2Z-$\nu$ schedule, which then is used to derive a central limit theory for a new tail Polyak-Ruppert averaging
estimator. Finally, we also provide a novel time-uniform Gaussian approximation (also known as strong invariance principle) for the partial sum process of Q-learning iterates, which facilitates bootstrap-based inference. All our theoretical results are complemented by extensive numerical experiments. Beyond being new theoretical and statistical contributions to the Q-learning literature, our results definitively establish that LD2Z and in general PD2Z-$\nu$ achieve a best-of-both-worlds property: they inherit the rapid decay from initialization (characteristic of constant step-sizes) while retaining the asymptotic convergence guarantees (characteristic of polynomially decaying schedules). This dual advantage explains the empirical success of LD2Z while providing practical guidelines for inference through our results.
Read the full abstract ▾
Optimization and Control
On the optimal relaxation parameter of graph-based splitting methods for subspaces
Francisco J. Aragón-Artacho and César López-Pastor
In this paper, we investigate the behavior of the family of graph-based splitting
algorithms specialized to the problem of finding a point in the intersection of linear subspaces. The
algorithms in this family, which encompasses several classical methods such as the Douglas-Rachford
algorithm, are defined by a connected graph and a subgraph. Our main result establishes that when the graph and subgraph coincide, the optimal relaxation parameter is exactly $1$, thereby extending known results for the Douglas-Rachford
algorithm to a much broader class of methods. Our analysis hinges on some properties of iso-averaged linear operators, which are defined as the average of an isometry and the identity, and are characterized by a specific
symmetry of the norm of their relaxation.
Read the full abstract ▾
Differential Geometry
Optimal Synthesis in a Radially Symmetric Grushin Space
Michael Albert
We study a class of radially symmetric Grushin-type structures on $\mathbb{R}^3$ generated by $X=\partial_x, Y=\partial_y, Z_f=f(r)\partial_z$, with $r$ the cylindrical radius, and $f$ positive away from the vertical axis, increasing, and unbounded. Under a natural monotonicity assumption on the elasticity $\eta(r)=r f'(r)/f(r)$, we obtain the optimal synthesis from singular points. For profiles satisfying an additional monotonicity constraint on the radial effective potential which ensures that geodesics are either radially periodic, circular or planar straight lines, we demonstrate a continuous, globally defined cut time candidate for Riemannian geodesics, which coincides with the radial period, evidently a Maxwell time, for all radially periodic geodesics. We then specialize to the homogeneous family $f(r)=r^\alpha$, $\alpha>1$, and determine the full optimal synthesis from Riemannian points. The cut time is shown to coincide with the complete radial period. Finally, we identify the resulting cut locus, which forms a pair of properly embedded two-dimensional regions on the cylinder through the initial point. Finally, we obtain a necessary condition for the constructed Maxwell time to be the true cut time, and rule it out as the global cut mechanism for the full class under consideration.
Read the full abstract ▾
Algebraic Topology
Persistent Leray's spectral sequence
Edivaldo L. dos Santos and Telmo I. Acosta Vellozo
In this work, we construct a persistent version of the well-known Leray spectral sequence. More precisely, we construct a spectral sequence that computes the persistent
cohomology of a space from the persistent
cohomology in each open set and its intersections with a covering that is the pre-image under a function of a covering of a known space.
Read the full abstract ▾
Algebraic Topology
Separation properties of codimension-1 maps between generalized manifolds
Edivaldo L. dos Santos and Telmo I. Acosta Vellozo
In this work, we obtained separation results via codimension-1 maps to generalized
manifolds. More specifically, we proved results that allow us to estimate the number of connected components of the complement of the image of such maps.
Information Theory · Cross-listed from cs.CR
Beamforming Feedback as a Novel Attack Surface for Wi-Fi Physical-Layer Security
Jingzhe Zhang, Yitong Shen, Ning Wang et al. (+1 more)
With the rapid
evolution of wireless technologies, Wi-Fi has expanded beyond its original role in data transmission to support various emerging applications, particularly in physical-layer security, including device authentication, user authentication, and secret key generation. Despite extensive research on Wi-Fi Channel State Information (CSI)-based physical-layer security, its vulnerabilities remain largely unexplored. In this work, we propose BFIAttack, a novel attack that exploits Beamforming Feedback Information (BFI) to reconstruct the CSI of a legitimate user or device, thereby compromising Wi-Fi-based physical-layer security. We realize the attack by leveraging a closed-form CSI reconstruction method for the single-
antenna station scenario and a maximum likelihood estimation-based CSI reconstruction for the multi-
antenna station scenario. Moreover, we exploit spatial similarities among
antenna pairs to refine the reconstructed CSI and enhance attack effectiveness. Experimental results show that BFIAttack achieves an average attack success rate of $73\%$ in multi-
antenna station scenarios with no more than five attack attempts, and over $93\%$ in single-
antenna station scenarios with only a single attempt. BFIAttack reveals critical vulnerabilities in existing Wi-Fi-based physical-layer security.
Read the full abstract ▾
All authors Jingzhe Zhang, Yitong Shen, Ning Wang, Yili Ren
Mathematical Physics
Spatial Localization of Relativistic Quantum Systems: The Commutativity Requirement and the Locality Principle. Part II: A Model from Local QFT
Valter Moretti
This paper is the second and final part of a two-part study. We construct positive-energy relativistic spatial localization observables in Minkowski spacetime within standard
quantum field theory, using the stress–energy–momentum tensor smeared with suitable test functions. For each fixed timelike direction, the construction gives positive operator-valued measures (POVMs) on spacelike hypersurfaces, well defined on every $n$-particle sector and satisfying a relativistic causality condition excluding superluminal propagation of detection probabilities. The observables are built from local or quasi-local field-theoretic quantities, thus providing a rigorous version of earlier heuristic proposals. In the one-particle sector, the construction reduces to the observable previously introduced by the author, and its first moment gives the Newton–Wigner position operator under appropriate normalization and centering assumptions. Because the Reeh–Schlieder
theorem prevents the normally ordered stress–energy–momentum tensor from being positive on the full Fock space, we use
quantum energy inequalities to obtain lower bounds controlling deviations from positivity. This leads to regularized operator families, bounded from below, which approximate the localization effects. Finally, we define conditional localization observables for finite laboratories through modified local energy operators. By Haag duality, the corresponding conditional POVMs belong to local von Neumann
algebras and commute for causally separated regions, in accordance with the Araki–Haag–Kastler framework. The results show how commutativity of localization observables is recovered for conditional measurements in finite spacetime regions.
Read the full abstract ▾
Analysis of PDEs
An Aronson-Bénilan / Li-Yau estimate in the JKO scheme in small dimension
Fanch Coudreuse
We derive an Aronson-Bénilan / Li-Yau estimate in the JKO scheme associated to the porous-medium, heat, and fast-
diffusion equations, in dimensions $1$ and $2$, and on simple domains (cubes, quarter-space, half-spaces, whole space, and the
torus). Our method is based on a maximum principle for the determinant of the Hessian of Brenier potentials, iterated as a one-step improvement along the scheme. As a consequence, we obtain local $L^\infty$ bounds on the density, uniform in the time step, consistent with the continuous-time result. As a byproduct, we rigorously derive the optimality conditions in the fast-
diffusion case, filling a gap in the literature.
Read the full abstract ▾
Analysis of PDEs
Nonlocal Hyperdissipative Perturbations of the Three Dimensional Navier-Stokes System
Veli Shahmurov and Rishad Shahmurov
We study the three-dimensional incompressible Navier-Stokes system on $\mathbb{R}^3$ with an additional dissipative nonlocal term \[ \partial_t u + (u\cdot\nabla)u + \nabla p = \nu \Delta u + Lu, \qquad {\rm div}\, u = 0, \] where $L$ is a self-adjoint
Fourier multiplier whose symbol is comparable to $-|\xi|^{2\alpha}$ for some $\alpha>1$. We first identify a sharp
Fourier-symbol criterion distinguishing lower-order convolution perturbations from genuinely regularizing nonlocal corrections. In the resulting hyperdissipative class we prove the exact $L^2$ energy identity, global weak solvability for every $\alpha>1$, and local strong well-posedness in $H^s(\mathbb{R}^3)$ for $s>\frac52$. We then show that the Lions exponent $\alpha=\frac54$ remains the critical energy-growth threshold in this nonlocal setting: if $\alpha\ge \frac54$, every $H^s$ solution is global, while for every $\alpha>1$ one has global strong solvability for sufficiently small $H^s$ data. Finally, for the vanishing-hyperdissipation approximation of the classical three-dimensional Navier-Stokes equations, we prove a near-singular divergence principle: if the classical flow blows up at a first singular time $T_*$ in a continuation norm $X$, then the corresponding regularized family cannot remain uniformly bounded in $X$ on any interval approaching $T_*$. This identifies the precise point at which the fixed-parameter global theory degenerates in the Navier-Stokes limit.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Input Matrix Optimization for Desired Reachable Set Warping of Linear Systems
Hrishav Das and Melkior Ornik
Shaping the reachable set of a dynamical system is a fundamental challenge in control design, with direct implications for both performance and safety. This paper considers the problem of selecting the optimal input
matrix for a linear system that maximizes warping of the reachable set along a direction of interest. The main result establishes that under certain assumptions on the dynamics, the problem reduces to a finite number of linear optimization problems. When these assumptions are relaxed, we show heuristically that the same approach yields good results. The results are validated on two systems: a linearized ADMIRE fighter jet model and a damped oscillator with complex
eigenvalues. The paper concludes with a discussion of future directions for reachable set warping research.
Read the full abstract ▾
Combinatorics
Lozenge Tilings of Hexagons with Intrusions II: Shuffling Phenomenon
Seok Hyun Byun and Tri Lai
The enumeration of lozenge tilings of hexagons with holes has been studied intensively in recent years. Researchers tried to find shapes and positions of holes in hexagonal regions so that the number of lozenge tilings of the resulting regions is given by a simple product formula. In the present work, we consider new regions that are hybrids of regions studied by the first author (hexagons with intrusions) and Ciucu (F-cored hexagons). Then, we show that the tiling generating functions of these new regions under a certain weight are given by simple product formulas. To give a proof, we present shuffling
theorems for lozenge tilings of hexagons with intrusions, which give simple relations between the tiling generating functions of two related hexagonal regions with intrusions.
Read the full abstract ▾
Complex Variables
Laplace measure transitions and ghosts for meromorphic functions
João Fontinha, Jorge Buescu and Jaouen Ramalho
We study the measure transition problem for bilateral Laplace transforms of meromorphic functions on vertical strips. Given a meromorphic function F admitting Laplace representations on two adjacent strips separated by a vertical line, we investigate how the corresponding determining measures are related. Our first result shows that in the absence of poles on the separatrix the determining measures coincide. We next derive explicit transition formulas for the case of finitely many poles and obtain sufficient conditions under which these formulas remain valid for infinitely many poles. Applications are given to the analytic continuation of the
zeta function, periodic and almost periodic functions, and quotients of Gamma functions related to the confluent hypergeometric function. Finally, using generalized Cauchy integrals, we construct an entire function admitting distinct Laplace representations on the right and left half-planes, thereby producing a ghost transition. This provides a counterexample to uniqueness of solutions of the Cauchy problem for the heat equation.
Read the full abstract ▾
Information Theory · Cross-listed from cs.LG
The Geometric Alignment Tax: Tokenization vs. Continuous Geometry in Scientific Foundation Models
Prashant C. Raju
Foundation models for biology and physics optimize predictive accuracy, but their internal representations systematically fail to preserve the continuous geometry of the systems they model. We identify the root cause: the
Geometric Alignment Tax, an intrinsic cost of forcing continuous
manifolds through discrete categorical bottlenecks. Controlled ablations on synthetic dynamical systems demonstrate that replacing cross-
entropy with a continuous head on an identical encoder reduces
geometric distortion by up to 8.5x, while learned codebooks exhibit a non-monotonic double bind where finer quantization worsens geometry despite improving reconstruction. Under continuous objectives, three architectures differ by 1.3x; under discrete tokenization, they diverge by 3,000x. Evaluating 14 biological foundation models with rate-distortion theory and MINE, we identify three failure regimes: Local-Global Decoupling, Representational Compression, and
Geometric Vacuity. A controlled experiment confirms that Evo 2's reverse-complement robustness on real DNA reflects conserved sequence composition, not learned
symmetry. No model achieves simultaneously low distortion, high mutual information, and global coherence.
Read the full abstract ▾