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)

Tuesday 21 April

Numerical Analysis

Mapping-based Hard-constrained Physics-Informed Neural Networks for unbounded wave problems

The aim of this paper is to introduce a Mapping-based Hard-constrained Physics-Informed Neural Network (MH-PINN) for efficiently and accurately solving unbounded wave problems. First, we propose a coordinate mapping technique that compactifies the infinite physical domain into a finite computational space. This effectively resolves the sampling difficulties inherent to standard PINNs in unbounded regions. Additionally, it avoids the artificial truncation errors introduced by traditional methods such as perfectly matched layers. Second, we design a physics-based hard-constrained network structure that automatically satisfies both the inner boundary conditions and the far-field radiation conditions. This structure eliminates boundary loss terms, yielding high computational efficiency and fast convergence, which effectively addresses the challenges of high-frequency problems. Third, we introduce an inverse factor correction for boundary coefficients to address the influence of asymptotic factors,which makes the method highly geometrically adaptable. Finally, we present numerical examples covering various acoustic radiation and scattering scenarios as well as elastic dynamics scenarios to demonstrate the efficiency and accuracy of our algorithm.It highlights its potential for broader applications in the field of computational wave dynamics.
Read the full abstract

All authors Tao Zhang, Hanshu Chen, Ilia Marchevsky, Zhuojia Fu

Classical Analysis and ODEs

Boundedness properties of the bilinear fractional integral operators induced by hypermetrics of third order

We introduce a natural bilinear fractional integral type operator induced by a third order hypermetric on Ahlfors regular quasi-metric spaces. Given a quasi-metric space $(X,d)$ the function $\rho(x,y,z)$, defined as the distance, in $X^3$, of $(x,y,z)$ to the diagonal $\bigtriangleup_3=\{(x,x,x)\in X^3:x\in X\}$ is said to be a third order hypermetric in $X$. When $(X,d)$ is a Euclidean space or, more generally, when $(X,d,\mu)$ is $\eta$-Ahlfors regular for some $\eta$ positive, the function $\rho(x,y,z)$ generates kernels for bilinear operators of the type $T^{\gamma}(f,g)(x)=\iint_{X\times X}\rho(x,y,z)^{-\gamma}f(y)g(z)d\mu(y)d\mu(z)$, for a given positive $\gamma$. In the setting of $\eta$-Ahlfors regular space, the power $-\gamma=-2\eta$ of $\rho(x,\cdot,\cdot)$ provides the natural singularity for this family of kernels. In this paper we consider the fractional integral rank $0<\gamma<2\eta$. We prove boundedness properties of the type $\|T^{\gamma}(f,g)\|_{p_3}\leq C\|f\|_{p_1}\|g\|_{p_2}$ for adequate values of the exponents $p_1,p_2$ and $p_3$. The proof is based on three upper bounds for $T^{\gamma}(f,g)$ in terms of the classical linear fractional Riesz operators $I_{\eta-\frac{\gamma}{2}}$, using the linear Hardy-Littlewood-Sobolev inequality.
Read the full abstract

Probability

Phase Transitions in the Fluctuations of Functionals of Random Neural Networks

We establish central and non-central limit theorems for sequences of functionals of the Gaussian output of an infinitely-wide random neural network on the d-dimensional sphere . We show that the asymptotic behaviour of these functionals as the depth of the network increases depends crucially on the fixed points of the covariance function, resulting in three distinct limiting regimes: convergence to the same functional of a limiting Gaussian field, convergence to a Gaussian distribution, convergence to a distribution in the Qth Wiener chaos. Our proofs exploit tools that are now classical (Hermite expansions, Diagram Formula, Stein-Malliavin techniques), but also ideas which have never been used in similar contexts: in particular, the asymptotic behaviour is determined by the fixed-point structure of the iterative operator associated with the covariance, whose nature and stability governs the different limiting regimes.
Read the full abstract

Combinatorics

Greedy Routing in a Sequentially Grown One-Dimensional Random Graph

We analyze greedy routing in a random graph G_n constructed on the vertex set V = {1, 2, ..., n} embedded in Z. Vertices are inserted according to a uniform random permutation pi, and each newly inserted vertex connects to its nearest already-inserted neighbors on the left and right (if they exist). This work addresses a conjecture originating from empirical studies (Ponomarenko et al., 2011; Malkov et al., 2012), which observed through simulations that greedy search in sequentially grown graphs exhibits logarithmic routing complexity across various dimensions. While the original claim was based on experiments and geometric intuition, a rigorous mathematical foundation remained open. Here, we formalize and resolve this conjecture for the one-dimensional case. For a greedy walk GW starting at vertex 1 targeting vertex n – which at each step moves to the neighbor closest to n – we prove that the number of steps S_n required to reach n satisfies S_n = Theta(log n) with high probability. Precisely, S_n = L_n + R_n - 2, where L_n and R_n are the numbers of left-to-right and right-to-left minima in the insertion-time permutation. Consequently, E[S_n] = 2H_n - 2 ~ 2 log n and P(S_n >= (2+c) log n) <= n^(-h(c/2) + o(1)) for any constant c > 0, with an analogous lower tail bound for 0 < c < 2, where h(u) = (1+u) ln(1+u) - u is the Bennett rate function. Furthermore, we establish that this logarithmic scaling is robust: for arbitrary or uniformly random start-target pairs, the expected routing complexity remains E[S_{s,t}] = 2 log n + O(1), closely mirroring decentralized routing scenarios in real-world networks where endpoints are chosen dynamically rather than fixed a priori.
Read the full abstract

Analysis of PDEs

Hamiltonian compactness and dissipation for the generalized SQG equation in the inviscid limit

We consider the dissipative generalized Surface Quasi-Geostrophic equation with dissipation given by any fractional power of the Laplacian. In the inviscid limit, it is proved that anomalous dissipation of the Hamiltonian is prevented by the strong compactness of the solutions in the lowest norm that makes the nonlinearity well-defined. In fact, only the dynamics at certain frequencies matters. The argument is quite robust as it applies regardless of the criticality regime and of the presence of a, possibly noncompact, external forcing. This reveals a more general mechanism behind some recent results obtained for the Navier-Stokes and the critical dissipative Surface Quasi-Geostrophic equations. Because of nonuniqueness issues, in our broader context it is important to work with Leray solutions enjoying suitable higher-order bounds. The existence of such solutions is shown and it might be of independent interest. Finally, we prove that the strong compactness is guaranteed for any initial datum with critical integrability, from which global existence of conservative, although Onsager's supercritical, weak solutions of the inviscid problem is deduced. This offers the largest class of initial data for which global existence is known so far, matching with the one considered by Delort at the endpoint.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

The non-perturbative topological string: from resurgence to wall-crossing of DT invariants

We study the resurgence structure of the topological string partition function, with an emphasis on the Borel analysis of the instanton amplitudes. To this end, we introduce a differential operator that implements the pointed alien derivative when acting on the topological string partition function and its iterated alien derivatives. We show that the algebra of alien derivatives is isomorphic to the Kontsevich-Soibelman Lie algebra, thus establishing a direct link between the resurgence of the topological string and wall-crossing of generalized Donaldson-Thomas invariants. Numerically, we continue the exploration of the Borel plane of the quintic and local $\mathbb{P}^2$. For the latter, we identify Borel singularities due to bound states involving D4-branes, and match the associated Stokes constants to the appropriate Donaldson-Thomas invariants. Finally, we identify the manifestation of a D2-brane decay in the Borel plane, and match to theoretical predictions.
Read the full abstract

Information Theory · Cross-listed from cs.LG

FB-NLL: A Feature-Based Approach to Tackle Noisy Labels in Personalized Federated Learning

Personalized Federated Learning (PFL) aims to learn multiple task-specific models rather than a single global model across heterogeneous data distributions. Existing PFL approaches typically rely on iterative optimization-such as model update trajectories-to cluster users that need to accomplish the same tasks together. However, these learning-dynamics-based methods are inherently vulnerable to low-quality data and noisy labels, as corrupted updates distort clustering decisions and degrade personalization performance. To tackle this, we propose FB-NLL, a feature-centric framework that decouples user clustering from iterative training dynamics. By exploiting the intrinsic heterogeneity of local feature spaces, FB-NLL characterizes each user through the spectral structure of the covariances of their feature representations and leverages subspace similarity to identify task-consistent user groupings. This geometry-aware clustering is label-agnostic and is performed in a one-shot manner prior to training, significantly reducing communication overhead and computational costs compared to iterative baselines. Complementing this, we introduce a feature-consistency-based detection and correction strategy to address noisy labels within clusters. By leveraging directional alignment in the learned feature space and assigning labels based on class-specific feature subspaces, our method mitigates corrupted supervision without requiring estimation of stochastic noise transition matrices. In addition, FB-NLL is model-independent and integrates seamlessly with existing noise-robust training techniques. Extensive experiments across diverse datasets and noise regimes demonstrate that our framework consistently outperforms state-of-the-art baselines in terms of average accuracy and performance stability.
Read the full abstract

Combinatorics

On Scott's odd induced subgraph conjecture and a related problem

For a graph $G$, let $f_o(G)$ denote the maximum order of an induced subgraph of $G$ all of whose vertices have odd degree, and let $\chi(G)$ denote the chromatic number of $G$. Scott (CPC, 1992) proved that $f_o(G) \ge |V(G)|/(2\chi(G))$ for every graph without isolated vertices, and conjectured that the factor $2$ can be removed. Wang and Wu (JGT, 2024) showed that this conjecture fails for bipartite graphs, but holds for line graphs. In this article, we confirm Scott's conjecture for claw-free graphs without isolated vertices, thereby strengthening the result of Wang and Wu. We also construct $K_{1,r}$-free graphs of arbitrarily large order to show that the conjecture fails for this broader class, for every integer $r \ge 4$. Wang and Wu also asked whether $f_o(L(G)) \ge n/2$ holds for every connected regular graph $G$ of order $n \ge 3$. We show that $C_5$ is the smallest counterexample to this problem. On the positive side, we prove that if $G$ is a connected $k$-regular $C_5$-free graph on $n$ vertices with $k \ge 2$, then $f_o(L(G)) \ge n/2$.
Read the full abstract

Statistics Theory

Fast computation and theoretical guarantees for the NPMLE in exponential family mixtures

This work makes two advances in the study of the (approximate) nonparametric maximum likelihood estimator (NPMLE) for exponential family mixture models. First, we develop a data-compression strategy that reduces the cost of repeated likelihood evaluations in NPMLE computation to polylogarithmic order in the sample size. Second, we show that, for a broad class of approximate NPMLEs, the resulting marginal density estimator attains an almost parametric rate of convergence.
Read the full abstract

Combinatorics

Juniper Green and the Gallai-Edmonds Decomposition

Juniper Green is a simple combinatorial game invented by Rob Porteous and popularized by Ian Stewart. It was originally designed to familiarize school children with the concepts of multiplication and division. We analyze this elementary game through a completely different lens and show that it recovers the Gallai-Edmonds decomposition of the divisibility graph on the vertex set $V= \left\{1,2,\dots, n\right\}$. This characterizes the winning moves of the game; as a byproduct, we show that this decomposition seems to have many interesting and curious patterns that are currently unexplained.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Bootstrapping Tensor Integrals

This work proposes a bootstrapping with positivity methodology to study random $U(N)^{D}$ invariant tensors in the large $N$ limit. As has been done for $U(N)$ invariant random matrices, we combine the Dyson-Schwinger equations and positivity constraints of moments to approximate the moments of such tensor models. As examples, we bootstrap the quartic and two hexic rank three tensor models. All models studied converge quickly, and for those which have known analytic formulae, they converge to such solutions. We conjecture new explicit formulae for all moments of the rank three quartic model and support this conjecture using bootstrapped results and explicit double-series computations with 'feyntensor'.
Read the full abstract

Algebraic Geometry

The integral Chow ring of $\mathscr{M}_{0}(\mathbb{P}^r, 2)$

We compute a presentation for the integral Chow rings of the moduli stacks of degree $2$ maps from smooth rational curves to projective space $\mathbb{P}^r$, as a quotient of a three-variable polynomial ring. The relations as $r$ varies have rich combinatorial structure: all non-trivial relations are encoded by two generating functions which are rational functions.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Ultrametric OGP - parametric RDT symmetric binary perceptron connection

In [97,99,100], an fl-RDT framework is introduced to characterize statistical computational gaps (SCGs). Studying symmetric binary perceptrons (SBPs), [100] obtained an algorithmic threshold estimate $\alpha_a\approx \alpha_c^{(7)}\approx 1.6093$ at the 7th lifting level (for $\kappa=1$ margin), closely approaching $1.58$ local entropy (LE) prediction [18]. In this paper, we further connect parametric RDT to overlap gap properties (OGPs), another key geometric feature of the solution space. Specifically, for any positive integer $s$, we consider $s$-level ultrametric OGPs ($ult_s$-OGPs) and rigorously upper-bound the associated constraint densities $\alpha_{ult_s}$. To achieve this, we develop an analytical union-bounding program consisting of combinatorial and probabilistic components. By casting the combinatorial part as a convex problem and the probabilistic part as a nested integration, we conduct numerical evaluations and obtain that the tightest bounds at the first two levels, $\bar{\alpha}_{ult_1} \approx 1.6578$ and $\bar{\alpha}_{ult_2} \approx 1.6219$, closely approach the 3rd and 4th lifting level parametric RDT estimates, $\alpha_c^{(3)} \approx 1.6576$ and $\alpha_c^{(4)} \approx 1.6218$. We also observe excellent agreement across other key parameters, including overlap values and the relative sizes of ultrametric clusters. Based on these observations, we propose several conjectures linking $ult$-OGP and parametric RDT. Specifically, we conjecture that algorithmic threshold $\alpha_a=\lim_{s\rightarrow\infty} \alpha_{ult_s} = \lim_{s\rightarrow\infty} \bar{\alpha}{ult_s} = \lim_{r\rightarrow\infty} \alpha_{c}^{(r)}$, and $\alpha_{ult_s} \leq \alpha_{c}^{(s+2)}$ (with possible equality for some (maybe even all) $s$). Finally, we discuss the potential existence of a full isomorphism connecting all key parameters of $ult$-OGP and parametric RDT.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Networked Tracking of Multiple Moving Targets in 6G Network

This paper considers a networked tracking architecture in 6G integrated sensing and communication (ISAC) systems, where multiple base stations (BSs) cooperatively transmit radio signals and process received echo signals to track multiple moving targets. Compared to the single-BS counterpart, networked tracking allows the moving targets to be associated with different BSs over time such that the wireless resources can be dynamically allocated among BSs based on target locations. However, networked tracking imposes new challenges for algorithm design and resource allocation. In this paper, we first design the networked Kalman Filter (NKF) that is suitable for multi-BS based tracking, then characterize the posterior Cramer-Rao bound (PCRB) under this NKF, and last design the beamforming vectors of all the BSs to minimize the tracking PCRB. Numerical results show that our dynamic beamforming design can properly associate the targets to the suitable BSs at various sensing blocks and reduce the tracking mean-squared error (MSE).
Read the full abstract

All authors Yanmo Hu, Weifeng Zhu, Chenshu Wu, Shuowen Zhang, J. Andrew Zhang, Liang Liu

Numerical Analysis

Proximal Discontinuous Galerkin Methods for Variational Inequalities

We introduce a family of proximal discontinuous Galerkin methods for variational inequalities, focusing on the obstacle problem as a didactic example. Each member of this family is born from applying a different well-known nonconforming finite element discretization to the Bregman proximal point method. We explicitly treat four examples: the symmetric interior penalty discontinuous Galerkin, the enriched Galerkin, the hybridizable interior penalty and the hybrid high-order methods. We formulate a unified analysis framework for this family of methods and prove the existence and uniqueness of solutions, energy dissipation, and error estimates for both the primal and dual variables. Remarkably, the proximal hybrid high-order method with piecewise constant cell unknowns and piecewise affine facet unknowns leads to the first higher-order convergence result for any proximal Galerkin method.
Read the full abstract

All authors Alexandre Ern, Brendan Keith, Dohyun Kim, Rami Masri, Beatrice Riviere

Mathematical Physics · Cross-listed from hep-th

Unitary Quadratic Quantum Gravity in 4D

In quadratic gravity, with a positive Weyl squared coefficient, the extra spin-2 sector is shown to correspond to a dual inverted harmonic oscillator, instead of a ghost. Using the Wightman spectrum condition, we prove that the associated Källén–Lehmann spectral density vanishes, reflecting the absence of a normalizable ground state and the spacelike nature of the propagator pole. This uniquely fixes the propagator to a principal value form as a theorem, not a prescription. The optical theorem is satisfied, the dual IHO spin-2 is not an asymptotic state, and gives only virtual contributions at all loop orders. As a result, unitarity is preserved consistently with renormalizability.
Read the full abstract

Functional Analysis

On local Lipschitz one sets

We study the local Lipschitz one subsets of a finite dimensional space, that is, sets for which there exists a continuous function whose local Lipschitz derivative is the characteristic function of said set. We give a characterization of a local Lipschitz one set on the real line in terms of a certain measure-theoretic density condition, which we call quasi-density. We show that any local Lipschitz one set needs to be quasi-dense, but the converse does not hold. Finally, we show that any regular closed subset of a normed space is a local Lipschitz one set, but there exist local Lipschitz one sets that are not regular closed.
Read the full abstract

Mathematical Physics

The bosonic Hubbard model on a three dimensional flat band lattice

The lowest eigenstates of the hopping matrix on the line graph of a cubic lattice with periodic boundary conditions are highly degenerate, they form a lowest flat band. Further, these states are localized. If one considers a repulsive bosonic Hubbard model on this lattice it is possible to construct exact multi-particle ground states simply by putting particles in the localized single particle ground states such that they avoid each other. This can be done up to a certain critical particle number $N_c$. We prove that at this particle number the ground state entropy is subextensive $\propto N_c^{2/3}$. For lower densities the entropy is extensive. We further show that the problem is related to the number of 4-cycle decompositions of the cubic lattice with periodic boundary conditions.
Read the full abstract

Analysis of PDEs

Minimal time for null controllability of the parabolic spherical Baouendi-Grushin equation

We study null controllability for the parabolic equation on $\mathbb{S}^{2}$ endowed with its canonical almost-Riemannian structure. For a spherical crown $\omega=\{\alpha<x_3<\beta\}$, where $0\le \alpha<\beta\le1$, we prove the sharp minimal time formula $T_{\min}(\omega)=\ln(1/\sqrt{1-\alpha^{2}})$ for null controllability in $\omega$. We also prove that, whenever the control region contains the equator, null controllability holds in every positive time. The proof combines two complementary tools. First, after Fourier decomposition with respect to the periodic variable, we establish observability estimates for a family of one-dimensional singular parabolic equations, with constants uniform with respect to the Fourier mode; the singularities at the poles are handled via a Hardy-Poincaré inequality. Second, for crowns away from the equator, we use the moment method to construct controls on the pole-touching crown $\alpha<x_3< 1$ from sharp weighted lower bounds on associated Legendre functions, and then pass to a general crown $\alpha<x_3<\beta$ by a cut-off argument on the full domain combined with the arbitrary-time controllability of crowns containing the equator. The result closes the large-time gap left in earlier work and gives the exact null-controllability threshold for the canonical almost-Riemannian heat equation on $\mathbb S^2$.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

On two ways to use determinantal point processes for Monte Carlo integration

The standard Monte Carlo estimator $\widehat{I}_N^{\mathrm{MC}}$ of $\int fd\omega$ relies on independent samples from $\omega$ and has variance of order $1/N$. Replacing the samples with a determinantal point process (DPP), a repulsive distribution, makes the estimator consistent, with variance rates that depend on how the DPP is adapted to $f$ and $\omega$. We examine two existing DPP-based estimators: one by Bardenet & Hardy (2020) with a rate of $\mathcal{O}(N^{-(1+1/d)})$ for smooth $f$, but relying on a fixed DPP. The other, by Ermakov & Zolotukhin (1960), is unbiased with rate of order $1/N$, like Monte Carlo, but its DPP is tailored to $f$. We revisit these estimators, generalize them to continuous settings, and provide sampling algorithms.
Read the full abstract

Functional Analysis

The Cesaro operator on L^2(0, 1)

This paper explores a version of the classical Ces`aro integral operator for the Lebesgue space L2(0, 1) where we discuss its norm, adjoint, spectral properties, and invariant subspaces. An important tool will be semigroups of weighted composition operators on L2(0, 1).
Read the full abstract

All authors Anil Belli, Ugur Gul, William T. Ross, Aristomenis G. Siskakis

Number Theory

Explicit counting of ideals in number fields of arbitrary degree

We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term and avoid terms on the order of $n^{n^2}$. We do this by studying fundamental domains for the action of multiplying with units of infinite order in Minkowski space. With some lattice theory we show that one can make different choices for such a fundamental domain, which yield a smaller error, especially when the degree of the field extension is large. We also adapt Schmidt's partition trick to this generalised setting.
Read the full abstract

Dynamical Systems

Linear response for Sinai billiards with small holes

We show that the conditional survival probability measure for a Sinai billiard with a small hole on the boundary of the table is differentiable with respect to the size t of the hole at t = 0 and we compute the derivative.

Dynamical Systems

Multiscale Kinetic Structures for Living Systems

This paper develops a conceptual extension of the Kinetic Theory of Active Particles, building upon the framework introduced in [2]. Living systems cannot be adequately described within classical single-scale paradigms, even when refined. To overcome this limitation, we introduce a Multiscale Kinetic Theory of Active Particles (MS-KTAP), in which a sub-microscopic scale of interacting entities is incorporated into the description of collective dynamics. In this framework, the activity variable is interpreted as an emergent quantity arising from lower-scale regulatory mechanisms and influenced by interactions across higher scales. The proposed framework captures key features of living systems, including heterogeneity, adaptive decision-making, nonlinear and non-conservative interactions, spatial dynamics, and cross-scale feedback, within a unified mathematical structure. Competition and cooperation are thus described across multiple levels of organization. The first part of the paper derives the mathematical framework, while the second presents how specific models can be obtained. The paper concludes with perspectives on further developments, including possible integrations with scientific machine learning.
Read the full abstract

Number Theory

Pseudometrics and preorders on sets of integer sequences induced by arithmetic functions functions

Starting from pseudometrics and preorders on sets of integers, we extend the focus to sets of finite sequences of integers, in particular sequences of consecutive integers. We outline existing concepts for deriving centred pseudometrics and preorders in a given pseudometric space and their application to $\mathbb{Z}$ and develop approaches to generalize the ideas to $\mathbb{Z}^m$. Sequences of consecutive integers represent a special case here and are examined in more detail. Another main topic is the use of arithmetic functions in this context. The types of pseudometrics and preorders examined in this paper can be induced by suitable arithmetic functions. We derive fundamental conclusions about relationships between functions and preorders, as well as about equivalent and potentially distinct types of preorders.
Read the full abstract

Combinatorics

On colorful generalizations of the Goodman–Pollack transversal problem

We establish a colorful and, more generally, matroidal solution to the problem of Goodman and Pollack on the existence of an $\mathbb{F}$-affine $k$-dimensional transversal to a family of convex sets in $\mathbb{F}^d$, where $0 \le k \le d - 1$ is an integer and $\mathbb{F} \in \{\mathbb{R}, \mathbb{C}\}$ is a field. Our results unify several classical and recent theorems. In the case $k=0$, we recover the colorful Helly theorem of Lovász, together with a matroidal extension due to Kalai and Meshulam. In the opposite extremal case $k=d-1$, we obtain Holmsen's colorful and matroidal generalization of the Goodman-Pollack-Wenger theorem. Additionally, we extend the recent noncolorful solution of the Goodman-Pollack problem by McGinnis and the author. As the main application, we obtain a matroidal and colorful Dol'nikov-type transversal theorem. Our methods are topological. We introduce matroidal joins, defined as homotopy colimits of diagrams over face posets of matroidal complexes, and derive estimates on their connectivity. The proof additionally relies on adaptations of nonexistence results for equivariant maps from Stiefel manifolds to spheres.
Read the full abstract

Optimization and Control

Regulation Zero 2: A Flow-Centric Sequential Regulation Planning Framework to Counter Regulation Cascading in Pre-tactical Air Traffic Flow Management

Air Traffic Flow Management (ATFM) traffic regulations are being increasingly used as rising demand meets persistent workforce shortages. This operational strain has amplified a critical phenomenon that we call regulation cascading: the compounding, non-linear interactions that occur when multiple regulations influence one another in unpredictable ways. As the number and complexity of regulations grow, cascading effects become more pronounced, undermining the network operator's ability to protect sectors reliably. To address this challenge, we introduce Regulation Zero 2, an updated sequential planning framework that natively operates in the regulation space, optimizing over ordered sequences of flow-level regulations that remain compatible as much as possible with existing slot-allocation systems such as CASA and RBS++. We equipped Regulation Zero 2 with new heuristics to render flow finding more efficient. At its core, the method employs a hierarchical Monte Carlo Tree Search (MCTS) that first samples congestion hotspots and then selects candidate regulations synthesized by a local proposal engine. Each proposal is evaluated by a fast First-Planned-First-Served (FPFS) allocator to estimate its reward, with these feedbacks guiding the subsequent MCTS exploration. Experiments on many pan-European summer-peak traffic days that Regulation Zero delivers promising and consistent performance. Compared to a flight-centric simulated-annealing and NSGA-II baselines, it achieves markedly higher objective improvements, while maintaining a tighter scope of impact on the network. Ablation studies also found that Regulation Cascading could reduce up to 50% of potential effectiveness. RZ also preserves FPFS fairness and supports expert knowledge injection, offering a pragmatic and low-disruption pathway toward automation in operations.
Read the full abstract

All authors Thinh Hoang, Zhengyi Wang, Leila Zerrouki, Daniel Delahaye

Differential Geometry

An upper bound on the growth of minimal graphs

Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.

Analysis of PDEs

The filter of singularities in global anisotropic microlocal analysis

We define a filter of time-frequency anisotropic global singularities of phase space for tempered distributions. The filter contains information from the corresponding anisotropic Gabor wave front set and admits propagation results for the Cauchy problem for certain linear evolution equations of Schrödinger type that generalize the harmonic oscillator.
Read the full abstract

Functional Analysis

A truncation criterion for compactness in asymptotic $L_p$ spaces

We prove a compactness criterion for asymptotic $L_p$ spaces over arbitrary measure spaces. Total boundedness is characterized by almost equiboundedness together with total boundedness in $L_p$ of all truncations. As a consequence, we obtain a simpler proof of the Kolmogorov–Riesz compactness theorem for asymptotic $L_p$ spaces on $\mathbb R^n$.
Read the full abstract