In this work, we present the logistic branching Brownian motion with selection (Log-BBM), a modification of the N-BBM defined by Groisman et. al (2020), in which birth and competition events are decoupled to allow for a variable population size that follows the branching process with logistic growth defined by Lambert (2005). We study the representation of the Log-BBM as a microscopic model for a FKPP-type equation. In the large population limit, the renormalised empirical measure of the Log-BBM converges weakly to a probability measure whose density solves a nonlocal version of the FKPP equation, while its cumulative distribution function solves the classical FKPP equation. We also show that this model exhibits behaviour that is characteristic of the Brunet-Derrida family of systems, in particular the so-called weak selection principle. Indeed, we show that, in the Log-BBM, the particles select the minimal propagation speed, in contrast to the FKPP equation, where the selected front speed depends on the initial condition.

For an algebraic group $Q$ with $\mathsf{Lie\,} Q=\mathfrak q$, we develop a method for estimating the index of a subalgebra $\mathfrak h$ in $\mathfrak q$ via the use of coadjoint $Q$-orbits in $\mathfrak q^*$. Let $\mathfrak q^ξ$ denote the stabiliser of $ξ\in\mathfrak q^*$. In the special case when $\mathfrak q^ξ\oplus\mathfrak h=\mathfrak q$, our estimate implies that $\mathsf{ind\,}\mathfrak h=0$. Using our theory, we also answer a question of Duflo. An orbit $Q{\cdot}η\subset\mathfrak q^*$ is said to be strange, if $\mathfrak q^η\oplus\mathfrak h=\mathfrak q$ for some $\mathfrak h$. In the second part of the paper, we study strange orbits for a semisimple algebra $\mathfrak g$. It is shown that an orbit ${\mathcal O}\subset\mathfrak g\simeq\mathfrak g^*$ is strange whenever the complexity of ${\mathcal O}$ is at most 1. Furthermore, if ${\mathcal S}\subset\mathfrak g$ is a sheet containing a strange nilpotent orbit, then all orbits in ${\mathcal S}$ are strange. We also show that strange orbits in $\mathfrak{sl}_n$ are not as sparse, as one might expect, and discuss some conjectures on strange orbits.

We propose a definition of a non-invertible symmetry enriched topological order (NI-SETO), and we implement our definition for string net models. We do so in two ways, using full inclusions of unitary fusion categories (UFCs), as well as anyon condensation. In both cases, the NI-SETO is a relative center of UFCs. All NI-SETOs can be realized in either model, where we can use enriched UFCs to get chiral examples on the boundary of a 3D Walker-Wang model representing the anomaly. We describe several examples of NI-SETOs and compute the qualitative symmetry action on anyons and symmetry defects using tube algebra techniques.

We construct an explicit family of smooth finite-time blow-up solutions for the focusing Calogero--Sutherland derivative NLS given by $$ i \partial_t u = -\partial_x^2 u - 2 D Π(|u|^2) u \quad \mbox{with} \quad (t,x) \in \mathbb{R} \times \mathbb{T} , $$ where $D=-i \partial_x$ and $Π$ denotes the Cauchy--Szegő projector. This is a mass-critical NLS-type equation with a Lax pair structure. The Cauchy problem is global well-posed in the class of Hardy-Sobolev spaces $H^s_+(\mathbb{T})=L^2_+(\mathbb{T}) \cap H^s(\mathbb{T})$ for small $L^2$-mass $\| u_0 \|_{L^2}^2 < 1$ as recently proven in [R.~Badreddine, Pure Appl. Anal. 6 (2024)]. By a non-perturbative method, we construct smooth blow-up initial data with $L^2$-mass in the entire range $1 < \|u_0 \|_{L^2}^2 <2$. The strategy is based on a stability analysis for the explicit formula for (CS) combined with a suitable choice of finite-gap potentials as initial data that bifurcate from the discrete set of trivial plane waves $e^{i m x}$ with $m \in \mathbb{Z}_{\ge 0}$. More precisely, we find a parametrized family of smooth initial data $u_0$ in $L^2_+(\mathbb{T})$ such that the corresponding solution $u(t)$ of (CS) blows up with $$ \| u(t) \|_{H^s} \sim \frac{1}{(T-t)^{2s}} \quad \mbox{as} \quad \mbox{$t \nearrow T$} \quad \mbox{for all $s > 0$} $$ for some finite time $0 < T < \infty$. Moreover, we give a full description of the blow-up dynamics and we identify the unique weak limit of $u(t)$ in $L^2_+(\mathbb{T})$ as $t \nearrow T$. Finally, we show instability of these blow-up solutions and complement our results by showing global existence for a class of finite-gap potentials as initial data with arbitrarily large $L^2$-mass.

We study a class of quantum error-correcting codes through the geometry of complex abelian varieties. These codes, introduced by Gottesman--Kitaev--Preskill, are built from symplectically integral lattices and therefore naturally define polarized complex abelian varieties. We give a precise mathematical formulation of this relationship and extend it to a dictionary between the main structures of GKP code theory and classical objects in the theory of abelian varieties. For instance, under this dictionary, the finite-dimensional code space becomes the space of theta functions $H^0(X, L)$, logical Pauli gates arise from the theta group, passive logical Clifford gates correspond to automorphisms of the polarized abelian variety, and concatenation with stabilizer codes corresponds to isogeny. We also prove several key results that give precise mathematical formulations of statements about these codes that often appear in heuristic form in the physics literature. In particular, we prove that the encoding is asymptotically isometric, that every logical Clifford gate is realized by a Gaussian unitary, and that, for noise of small variance, the failure probability is governed to first order by the shortest nontrivial displacement in the kernel of the polarization isogeny, a systolic invariant of the underlying polarization. This leads naturally to optimization problems on the moduli space of polarized abelian varieties.

We disprove the sum-product conjecture for real numbers by constructing arbitrarily large $A\subset \mathbb{R}$ (whose elements are algebraic integers in a number field of degree $\asymp \log\lvert A\rvert$) such that \[\max(\lvert A+A\rvert ,\lvert AA\rvert)\leq \lvert A\rvert^{2-c}\] where $c>0$ is an absolute constant. We also disprove the many sums and products conjecture by constructing, for any $k\geq 3$, arbitrarily large $A\subset \mathbb{R}$ such that \[\max(\lvert kA\rvert,\lvert A^{(k)}\rvert)\leq \lvert A\rvert^{C\frac{\log k}{\log\log k}}\] for some constant $C>0$. We obtain similar constructions for $p$-adics, finite fields, and function fields in positive characteristic, and also obtain new lower bounds for the number of solutions to linear equations in a multiplicative group and the number of solutions to the unit equation in sufficiently many variables.

We derive distributional approximations for the number of triangles in the linear preferential attachment model $\mathrm{PAM}(m,δ)$, where $m\ge 2$ and $δ>-m$, with explicit rates of convergence. The limiting distribution undergoes a phase transition from Gaussian to another nontrivial distribution, which we characterize explicitly. The asymptotic behavior is governed by the interplay between the hidden random environment and the mean-field interaction effect. In particular, our analysis also yields a continuous phase transition in the expected number of triangles as $δ$ varies.

We prove asymptotic equivalents for finite-level representations of symmetric groups, that is, for Young diagrams having all but finitely many boxes on their first row. We deduce that random walks on symmetric groups generated by conjugacy classes with a macroscopic number of fixed points have a Poissonian cutoff profile. We also prove that the random involution walk exhibits cutoff and find its cutoff profile. Finally, we obtain numerics for the random transposition walk on a deck of 52 cards, giving concrete estimates on the question that originally motivated Diaconis and Shahshahani.

Inspired by strict-monotonicity criteria for the time constant in first passage percolation, we investigate convex ordering of point processes in relation to the time constant in first contact percolation. In a nutshell, first contact percolation models the spread of an infection as a contact process without recovery based on a generalized graphical representation, where the usual homogeneous Poisson point processes on the edges are replaced by general simple point processes. Based on a notion of convex ordering for point processes, we prove monotonicity in the number and existence of infection paths. We argue that this convex ordering is however not enough to ensure strict monotonicities in the asymptotic speed of the infection. Instead, we propose a criterion based on an ordering of void probabilities and prove a speed-up for one-dimensional systems based on $\mathbb{Z}$-stationary point processes.

Integrating probability and nonprobability survey samples is an important problem in modern survey sampling. Nonprobability samples often contain rich outcome information but may lack population representativeness, whereas probability samples provide design-based auxiliary information but may not contain the study variable. We propose a deep neural network (DNN)-assisted doubly robust framework for estimating the finite population mean from these two data sources. The proposed method models the logit sampling score for the nonprobability sample as an unknown nonparametric function and estimates it by maximizing a pseudo-likelihood that combines information from the nonprobability sample and a reference probability sample. The DNN parameters are optimized using the ADAM algorithm. The resulting DNN-estimated sampling scores are incorporated into a DNN-assisted inverse-probability weighted estimator and a deep doubly robust estimator. We establish consistency and convergence rates under regularity conditions and evaluate the finite-sample performance of the proposed estimators through simulation studies and an empirical application using Pew Research Center and Behavioral Risk Factor Surveillance System data. The results suggest that the proposed estimators can improve robustness to parametric propensity-score misspecification, especially when the true selection mechanism is nonlinear.

We propose a learning-based approach for approximating solution mappings of multiparametric generalized Nash equilibrium problems (GNEPs) with coupling in both objectives and constraints. Rather than solving a standard regression problem on a training dataset of GNEP solutions, which are expensive and possibly difficult to collect, we use the Nikaido-Isoda (NI) gap function as a training loss, which requires only best-response data. To avoid bilevel optimization, a value-function surrogate approximates each agent's optimal best-response cost and is substituted into the NI loss, yielding a single-level learning problem. Learning approximate solutions to standard multiparametric programming problems is a special case of the approach. We also establish new sufficient conditions for the existence of a continuous parametric variational GNE selection under a strong variational stability assumption that generalizes strong monotonicity. The trained neural network delivers approximate GNE solutions with speedups of several orders of magnitude over online solvers. Numerical experiments on different problem classes confirm the effectiveness of the approach. A Python library is available at https://github.com/bemporad/mpfit.

We develop IV Fréchet regression (IVFR), an instrumental-variable (IV) method for settings where the outcome is an entire distribution. Framing the problem as an IV regression in 2-Wasserstein space, IVFR extends global Fréchet regression to the case with endogenous covariates. IVFR projects IV-weighted quantile curves onto the space of valid distributions and then recovers the corresponding regression coefficient functions. The projection provably reduces the estimation error in finite samples and guarantees valid fitted distributions. We show that the IVFR estimator converges weakly to a mean-zero Gaussian process and establish the validity of a multiplier bootstrap procedure for uniform inference. In simulations, the projection reduces the integrated mean squared error (IMSE) by up to 63% relative to existing methods. Revisiting the effects of Chinese import competition on the wage distribution within commuting zones, the proposed method produces 9-10% narrower confidence bands than existing methods. Using our novel uniform confidence bands, we find no evidence that import competition reduced wages at the very bottom of the distribution, but only between the 10th and 35th quantile. We also revisit the effect of county food stamp programs on the county's birth weight distribution and find no significant effects.

The wormhole contribution to the gravitational path integral may be interpreted as smooth remnant of correlations among the erratic large-$N$ behaviors of dual CFTs. In this work, we investigate this idea in (2+1)-dimensional gravity. We show that one-sided boundary gravitons are intrinsically incomplete in the sense that the associated observable algebra has a nontrivial center regardless of choices of boundary conditions. Based on asymptotic symmetries, we bootstrap a general Poisson bracket to construct completions of the boundary gravitons. In the simplest completion, the commutant of the boundary graviton observable algebra is given by an observable algebra of monodromy data which we interpret as an effective description of one-sided black holes. We show that, to describe Lorentzian multi-boundary wormholes, only the monodromy data with a positivity restriction is needed. The positivity restriction results in emergent erratic large-$N$ behaviors for some observables. We filter out the erratic observables by restricting to a subspace on which they act trivially. The monodromy observables generate nonlocal symmetries lack of corresponding local currents. We show that gauging the nonlocal symmetries is equivalent to filtering out the erratic observables. For one CFT, gauging the nonlocal symmetries at the quantum level removes all black hole states. Filtering the partition function of CFTs leads to an apparent ensemble averaging. For two CFTs, a Hilbert subspace describing wormholes survives after gauging global part of the nonlocal symmetries. The filtered partition function of the two CFTs is an ensemble average over quantum gates entangling the monodromy degrees of freedom the two CFTs. The correlation between the erratic observables of the two CFTs is preserved, which contributes to the filtered partition function as a wormhole term.

In this paper we solve the polarization problem for real Hilbert spaces, a long-standing conjecture that had remained open for nearly three decades. We also confirm that the only extremal configurations are orthonormal sets. These are consequences of our proof of a stronger statement conjectured by Ball.

We show that there does not exist a complex $d\times n$ equiangular tight frame with \[ d^2-d+1<n<d^2. \] The proof, which originated from an internal model at OpenAI, mimics the relationship between real equiangular tight frames and strongly regular graphs.

We construct prime Fano manifolds from spin representations of $Spin_n$ for $n\le 14$. In this range, and if $n\ne 13$, the projectivizations of these representations are prehomogeneous, and we deduce that our Fano manifolds are locally rigid and, up to a few exceptions, quasi-homogeneous under the action of their automorphism groups. For $n=13$ we obtain a non-trivial family of minimal compactifications of $SL_3\times SL_3$, modulo some finite group.

In 1974, Witsenhausen asked for the maximum possible density $α_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known lower bound is $1 - 1/\sqrt{2} = 0.29289\dots$, obtained from the natural "double cap" construction of two opposite spherical caps, which is conjectured to be optimal for all $n$ by Gil Kalai. In this paper, we use a novel approach to establish an upper bound of $α_3\le 0.2953$, improving the previous best known bound $0.2977$ due to Bekker et al. (2025). Our approach combines harmonic-analytic arguments with the geometric fractional chromatic number of finite graphs, recently introduced by Ambrus et al. (2024). In this framework, any finite subset of the sphere yields an upper bound for $α_n$, and we obtain our bound by identifying an appropriate 33-element point set through a large-scale computer search. The same method can also be used in higher dimensions to yield potential improvements of the best known bounds.

We study topological conditions ensuring the presence of rotational chaos for non-wandering or area-preserving annular homeomorphisms. Compared to previous criteria, our main result provides a simpler alternative that avoids the need to locate periodic points, requiring only knowledge of the behavior of certain open sets. This feature is crucial for enabling concrete applications to Poincaré return maps arising in Hamiltonian systems with two degrees of freedom. The resulting topological criterion admits straightforward numerical implementation: a computer can verify all the required conditions using a simple algorithm that relies solely on basic data from the map. We illustrate this approach with the so-called driven pendulum.

We study infinite-horizon robust Markov decision processes (MDPs) on continuous state spaces with structured rectangular ambiguity set. The proposed ambiguity set falls within the convex hull of unknown generating kernels. We utilize the dynamic formulation of the corresponding robust MDPs, and subsequently introduce a stochastic first-order method for robust policy evaluation. We establish its high probability convergence to the robust value function, which in turn leads to an $\widetilde{\mathcal O}(1/ε^2)$ sample complexity. This high probability accuracy certificate is then used in an approximate policy iteration method that finds an $ε$-optimal policy with $\widetilde{\mathcal O}(1/ε^2)$ samples. The obtained sample complexities for both robust policy evaluation and optimization appear to be new for robust MDPs with continuous state spaces. Of independent interest, the proposed method is also directly applicable to zero-sum Markov games, which seems to strictly improve the existing sample complexities for continuous state spaces.

Baldwinian and Lamarckian evolution have existed for a long time in evolutionary algorithms (EAs) without ever dominating the academic literature or practical applications. In this work, we use modern empirical and theoretical methods to revisit Lamarckian and Baldwinian evolution and rigorously compare them with the generic Darwinian evolution. On the empirical side, we run a comprehensive suite of experiments on graphs from six different datasets from the recent GraphBench benchmark on Maximum Independent Set and Maximum Cut problems. Our results show that Baldwinian and Lamarckian evolution consistently outperform Darwinian evolution, confirming the great potential of local search augmented evolutionary algorithms. Notably, in the great majority of cases, all EAs outperform recent deep learning baselines and approach the performance of highly specialised heuristic and exact solvers. We furthermore report a high-performing set of generalist parameters for all studied evolution types that we hope will be of use to practitioners in future. On the theoretical side, we extend the existing Deceptive Leading Block benchmark to arbitrary block length and use tools from modern theoretical runtime analysis to prove upper and lower bounds on the expected runtime. For block lengths greater than two, Baldwinian evolution is asymptotically faster than Lamarckian which is asymptotically faster than Darwinian evolution. When accounting for the cost of the local search procedure in fitness evaluations, the ordering depends on the implementation with Baldwinian evolution staying fastest from small block lengths onwards, explaining its strong empirical performance.

We study a class of nested path problems, in which every path-based variable can be decomposed into a sequence of subpaths. Subpaths must satisfy local resources, while paths must satisfy additional global resources. This paper develops a new exact pricing algorithm in column generation for these problems that avoids the enumeration of non-dominated subpaths. The algorithm relies on adaptive partitioning of subpaths into buckets characterizing the consumption of global path resources. The algorithm represents each bucket by its subpath of minimum reduced cost, and iterates between pessimistic and optimistic pricing steps to combine subpaths into paths while maintaining upper and lower bounds on the minimum reduced cost. An adaptive refinement procedure closes the gap in a finite number of iterations. We demonstrate the effectiveness of the algorithm on two applications. For the balanced multi-period capacitated vehicle routing problem, we obtain speed-ups of up to a factor of 13 over a state-of-the-art column generation benchmark, and the resulting branch-price-and-cut algorithm solves three times as many instances to optimality as a subpath-based baseline. For the robust railway crew scheduling problem, we obtain speed-ups of up to a factor of three and produce primal solutions within 1% of optimality.

We give a purification and fidelity formulation of the projection method for mixed Hartree data. For the mean-field evolution of $N$-particle density matrices, we prove quantitative propagation of chaos for all fixed marginals, first in squared Uhlmann fidelity and then in trace norm via the Fuchs--van de Graaf inequality. The argument applies a rank-one Pickl-type counting estimate in a purified one-particle space and uses monotonicity of fidelity under partial trace to return to the physical variables. The result allows singular interactions satisfying a projected-square bound, including $L^{2r}$ interactions and the Coulomb potential.

Reduced-order models (ROMs) can accelerate high-dimensional dynamical simulations, but their accuracy often deteriorates when online dynamics leave the regime represented by offline training data. We develop a projection-based adaptive ROM framework based on incremental singular value decomposition (iSVD), in which occasional full-order operator evaluations provide correction snapshots for online basis updates. The intrusive ROMs considered here are fully parameterized by the basis, so each update naturally propagates to reduced operators and hyper-reduction machinery. Through its evolving singular structure, iSVD retains an encoded history of the observed dynamics and is history-aware in this sense. We study the method on three nonlinear problems of increasing complexity: the one-dimensional viscous Burgers equation, the Sod shock tube, and a stiff one-dimensional ten-species rotating detonation engine (RDE). The Burgers problem is used to analyze the method and compare iSVD with alternative basis adaptation rules, showing that history-aware updates outperform instantaneous updates and that iSVD gives the strongest overall performance. The Sod and RDE cases demonstrate that these advantages persist in more challenging compressible-flow settings. For the RDE problem, the iSVD adaptive ROM improves upon the current state-of-the-art Direct adaptive ROM baseline in both predictive accuracy and computational efficiency. A cost analysis shows that the dominant online cost comes from interacting with the full-order model to obtain correction snapshots, while the iSVD update itself is negligible. These results identify iSVD as an effective mechanism for online learning of reduced subspaces and suggest a path toward ROMs that remain predictive over horizons several orders of magnitude longer than their initial training window.

For any acyclic quiver $Q$ without multiple edges, we construct a monoidal category $\mathcal{R}_Q$ whose indecomposable objects are tensor products (over the base field) of finite-dimensional modules over the path algebra of $Q$. We show the existence and uniqueness up to homotopy of certain distinguished chain complexes satisfying good homological properties (higher almost split complexes) preserved under tensoring by objects in $\mathcal{R}_Q$. As a crucial ingredient for this construction, we establish the existence of a family of complete exceptional sequences in $\mathrm{mod}\,\mathbf{k}Q$ satisfying many good properties, which we believe might be of independent interest. We then prove that when $Q$ admits a height function, the Euler characteristics of (the images under certain additive functor of) these complexes coincide with the truncated $q$-characters of the standard modules in Hernandez-Leclerc's category $\mathcal{C}^{(1)}$. Applying our results to the case where the underlying graph of $Q$ is a Dynkin diagram of type $A_n, n \geq 1$, we also interpret the cluster characters of all cluster variables in the finite type cluster algebra $\mathcal{A}_Q$ as Euler characteristics of certain chain complexes in $\mathcal{R}_Q$.

We study the large-scale behaviour of a family of stochastic reaction-diffusion equations driven by long-range correlated noise in a weakly nonlinear regime. Depending on the decay of correlations of the noise and the strength of the nonlinearity, the universal behaviour is governed by a version of the dynamical $Φ^p$ model with long-range correlated noise, and with a coupling constant determined by the reaction term of the microscopic model. Our main result establishes the stochastic estimates and convergence of models required in the theory of regularity structures. We adapt the multiindex-based approach to regularity structures using a suitable expansion of the reaction term tailored to the law of the noise. This yields a systematic weak universality result, allowing for a particularly simple identification of the macroscopic limit throughout the full subcritical regime and beyond Gaussian noise. The method appears robust and applicable to a broader class of singular stochastic PDEs.

We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares approach certifies nonnegativity with multiple algebraic identities which can be found in parallel. Our main result is a disjunctive Positivstellensatz proving that we can keep the degree of each algebraic identity as low as the degree of the polynomial whose nonnegativity is in question. Based on this result, we construct a semidefinite programming based converging hierarchy of lower bounds for the problem of minimizing a polynomial over a compact basic semialgebraic set, where the size of the largest semidefinite constraint is fixed throughout the hierarchy. We further prove a second disjunctive Positivstellensatz which leads to an optimization-free hierarchy for polynomial optimization. We specialize this result to the problem of proving copositivity of matrices. Finally, we describe how the disjunctive sum of squares approach can be combined with a branch-and-bound algorithm and we present numerical experiments on polynomial, copositive, and combinatorial optimization problems.

In the present paper, we first describe the principal basis of non-integral geometry. Non-integral geometry is a new field of generalized function (distribution) theory where the effects breaking the symmetry of integration measure have been investigated. In turn, the non-symmetric integration measure (the non-invariant measure) leads to the complex form of the universal, dimension-independent inverse operator with the additional contributions compared to the methods of integral geometry. The additional term with the complex integration measure serves to the extension that improves the image reconstruction procedure. Then, we proof that this additional term $f_A$ in the universal inverse Radon transforms plays a role of the regularizing contribution. In particular, we show that owing to the presence of $f_A$ the corresponding complex singularities can be eliminated in the image reconstruction process.

Let $n\geq 3$ and let $Ω\subset \mathbb{R}^n$ be a $\mathcal{C}^1$ bounded domain which is diffeomorphic to a ball. We investigate here the problem of finding critical points of the $n$-energy in the space $\mathcal{I}=\{v\in W^{1,n}(Ω,\mathbb{R}^n) ; \ |\mathrm{tr}_{|\partial Ω}v|=1\}$. Maps in $\mathcal{I}$ have a well-defined topological degree on $\partial Ω$ but this degree is not continuous for the weak convergence in $W^{1,n}$. Hence finding critical points with prescribed degrees results in a problem of lack of compactness. We first prove that minimizers of the $n$-energy exist only when $Ω$ is a round ball and when the prescribed degree is $-1,0$ or $1$. We then develop a mountain pass approach for the $(n+α)$-energies and study the convergence, when $α$ goes to zero, of the resulting critical points via a bubbling analysis. We exclude the existence of bubbles in the case where $Ω$ is close to a ball by proving an energy gap result for free boundary $n$-harmonic maps from $\mathbb{B}^n$ to $\mathbb{B}^n$. We thus obtain the existence of critical points of the $n$-energy with prescribed degree $1$ when $Ω$ is close to a ball.

Motivated by the prevalence of non-smooth, possibly non-periodic signals in real-world applications, the output regulation of linear systems subject to non-smooth non-periodic exogenous signals has emerged as a challenging problem. A fundamental prerequisite for solving this problem is the existence of solutions to the so-called ``quasi-regulator equations''. In this paper, we investigate the solvability of these equations. To this end, we reformulate the quasi-regulator equations as differential-algebraic equations and highlight the critical role played by the system's relative degree. We finally propose a ``non-smooth non-resonance condition'' that, under specific relative degree requirements, provides a necessary and sufficient characterization of the solvability of the quasi-regulator equations.

Uncrewed aerial vehicles (UAVs) are increasingly used for exploration-driven monitoring in hazardous environments such as disaster zones, contaminated sites, wildfire areas, and damaged infrastructure, where limited flight endurance must be allocated between visiting reported locations and gathering new information. In these settings, prior information regarding hazards is often incomplete, spatially imprecise, and subject to change during execution. For example, initial reports may identify a region where a hazard is likely to exist, but the actual hazard may be displaced, partially observed, or entirely unreported. We present an integrated exploration-aware UAV route optimization and path planning framework for hazard monitoring under uncertain and evolving prior information. The environment is represented as a spatial risk map, where each location has an associated belief of hazardous conditions. Reported hazards are modeled as uncertain regions of interest (ROIs) rather than confirmed target locations, requiring the UAV to inspect reported areas while also using its limited flight endurance to explore informative regions. The proposed method solves a vehicle routing problem over reported ROIs, augments the route with auxiliary pseudo-nodes to improve spatial coverage, allocates the remaining flight distance budget across route segments, and optimizes dynamically feasible B-spline trajectories for local exploration. During execution, UAV measurements update a grid-based belief map, and the remaining trajectory is replanned when new information and the remaining budget justify adaptation. Across 48 scenario configurations, online replanning improves average KL reduction by 15.9% over the offline optimized planner and 48.6% over straight-line traversal.