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)

Monday 6 April

Category Theory

Hybrid Systems as Coalgebras: Lyapunov Morphisms for Zeno Stability

Hybrid dynamical systems exhibit a diverse array of stability phenomena, each currently addressed by separate Lyapunov-like results. We show that these results are all instances of a single theorem: a Lyapunov function is a morphism from a hybrid system into a simple stable target system $\sigma$, and different stability notions such as Lyapunov stability, asymptotic stability, exponential stability, and Zeno stability correspond to different choices of $\sigma$. This unification is achieved by expressing hybrid systems as coalgebras of an endofunctor $\mathcal H$ on a category $\mathsf{Chart}$ that naturally blends continuous and discrete dynamics. Instantiating a general categorical Lyapunov theorem for coalgebras to this setting results in new Lypaunov-like conditions for the stability of Zeno equilibria and the existence of Zeno behavior in hybrid systems.
Read the full abstract

Representation Theory

On the triviality of inhomogeneous deformations of $\mathfrak{osp}(1|2n)$

We specify a symmetrized mixed-oscillator deformation family of $B(0,n)=\operatorname{osp}(1|2n)$, with even mixed coefficients and one odd square-zero parameter. For every $n\geq1$, we derive its bracket from a faithful oscillator realization and exhibit an odd cochain whose coboundary is the recovered deformation coefficient. The resulting even change of generators is an exact isomorphism over the exterior parameter algebra. For $n=1$, the cochain agrees with the normalization of Bakalov-Sullivan. We give the source relations and the even-central specialization explicitly, together with a Lean 4 formalization.
Read the full abstract

Analysis of PDEs

The two-phase Alt-Phillips problem for quasilinear operators

We establish interior regularity and growth estimates for the sign-changing minimizers of the $p-$singular or $p-$degenerate quasilinear Alt–Phillips functional throughout the full range of $1<p<\infty$ and of the nonlinearity power $0<\gamma<p$. As a consequence, we show that the nonbranching hypersurface is locally $C^{1,\alpha}$ rectifiable. In addition, we obtain local density estimates, from which we deduce the local finiteness of the $\big(N-1+\gamma(p-1)/(p-\gamma)\big)-$dimensional Hausdorff measure of the remaining free boundaries for a restricted range of $\gamma$.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.mes-hall

Edge universality in Floquet sideband spectra

A monochromatic voltage drive redistributes noninteracting fermions over sidebands with Bessel amplitudes. A sharp Fermi step gives the discrete Bessel source kernel, whose large amplitude edge has the Airy limit known from random matrices and propagating fronts. At zero temperature and for energy independent transmission, the deficit of the dc bias derivative of low frequency partition noise from its large bias slope is proportional to the kernel diagonal, with ac amplitude fixed. Shifting the integer threshold coordinate down by half a sideband removes the leading finite amplitude correction. For reservoirs at a common temperature, we derive the rescaled deficit's crossover through one thermal convolution per reservoir. Its leading low temperature correction is twice that of the rescaled source occupation. We specify the geometry and mode resolution needed to distinguish this signature from the full Airy point process.
Read the full abstract

Statistics Theory

Information Geometry and Asymptotic Theory for SMML Estimators

Strict minimum message length (SMML) is an information-theoretic coding principle that represents a continuous statistical model by a finite set of assertions and a partition of the sample space. We show that the SMML objective decomposes into assertion entropy and conditional cross-entropy, balancing the cost of identifying an assertion against the cost of encoding data under the assigned model. For any fixed partition, the optimal codepoint for each cell is the model distribution that minimises Kullback-Leibler divergence from the data distribution restricted to that cell. Using the local Fisher-Rao geometry of regular parametric models, we show that, under high-resolution regularity conditions, optimal SMML partitions are asymptotically the pullback, through the maximum likelihood estimator, of weighted Fisher-Rao Voronoi tessellations in parameter space, with assertion probabilities appearing as additive weights. For regular exponential families, SMML codepoints satisfy a moment-matching condition and admit an interpretation as KL/Bregman centroids, while exact SMML cells are pullbacks of convex polyhedra in sufficient-statistic space. Together, these results show that SMML induces a natural information-geometric quantisation linking entropy-based coding, KL projection, and divergence-based Voronoi geometry.
Read the full abstract

Commutative Algebra

A Prime-Generated Formalization of Nagata's Factoriality Theorem in Lean 4

We present a Lean 4 Mathlib formalization of Nagata's factoriality theorem: if R is a noetherian domain and S <= R is a prime-generated submonoid such that S^{-1}R is a UFD, then R itself is a UFD. The prime-generated hypothesis – every element of S is a finite product of primes belonging to S – replaces a superficially cleaner but degenerate prime-or-unit condition that the formalization effort exposed. The development packages the theorem both for the concrete type Localization S and through abstract IsLocalization formulations. As applications, we formalize two Nagata-based proofs that R[X] is a UFD whenever R is a noetherian UFD: one via Laurent-polynomial localization at powers of X, and one via localization at the constant primes and identification with Frac(R)[X]. Reusing the same package, we also obtain the iterated polynomial corollary R[X][Y]. No public formalization of this result is known to us in Lean, Coq, or Isabelle.
Read the full abstract

Probability

Quantitative propagation of chaos and universality for asymmetric Langevin spin glass dynamics

We obtain quantitative estimates on quenched propagation of chaos for Langevin spin glass dynamics with i.i.d. disorder. Prior work in the case of Gaussian disorder established the qualitative convergence of the law of a single spin to a deterministic McKean-Vlasov limit. We prove convergence rates in expected Wasserstein distance and quantitative concentration rates for Lipschitz observables under the assumption that the disorder satisfies the T2 inequality. The proof uses a coupling argument, together with techniques from concentration of measure, filtering theory, and Malliavin calculus
Read the full abstract

Algebraic Geometry

Notes on acceptable bundles II

The notion of acceptable bundles plays a fundamental role in the Simpson–Mochizuki theory. We study acceptable bundles on a partially punctured polydisk in detail. While this article is primarily expository, it also presents new arguments that differ from those of Mochizuki.

Logic

The colored edge theory of A. Bulatov and binary absorption in minimal Taylor algebras

We find a new definition of colored edge graphs of finite algebras in the case of minimal Taylor algebras, a definition which includes the graphs invented by A. Bulatov. Next we proceed to reprove the main results of A. Bulatov's theory in the case of minimal Taylor algebras and in our setting, finding several simplifications compared to the more general case of smooth algebras Bulatov considered.
Read the full abstract

All authors Zarathustra Brady, Petar {\DJ}apić, Petar Marković, Aleksandar Prokić, Vlado Uljarević

Numerical Analysis · Cross-listed from cs.LG

Curvature-Aware Optimization for High-Accuracy Physics-Informed Neural Networks

Efficient and robust optimization is essential for neural networks, enabling scientific machine learning models to converge rapidly to very high accuracy – faithfully capturing complex physical behavior governed by differential equations. In this work, we present advanced optimization strategies to accelerate the convergence of physics-informed neural networks (PINNs) for challenging partial (PDEs) and ordinary differential equations (ODEs). Specifically, we provide efficient implementations of the Natural Gradient (NG) optimizer, Self-Scaling BFGS and Broyden optimizers, and demonstrate their performance on problems including the Helmholtz equation, Stokes flow, inviscid Burgers equation, Euler equations for high-speed flows, and stiff ODEs arising in pharmacokinetics and pharmacodynamics. Beyond optimizer development, we also propose new PINN-based methods for solving the inviscid Burgers and Euler equations, and compare the resulting solutions against high-order numerical methods to provide a rigorous and fair assessment. Finally, we address the challenge of scaling these quasi-Newton optimizers for batched training, enabling efficient and scalable solutions for large data-driven problems.
Read the full abstract

All authors Anas Jnini, Elham Kiyani, Khemraj Shukla, Jorge F. Urban, Nazanin Ahmadi Daryakenari, Johannes Muller, Marius Zeinhofer, George Em Karniadakis

Logic

No Countable Basis for Borel Directed Graphs of Dichromatic Number at Least Three

I prove that the Borel directed graphs whose vertex set admits a partition into two Borel acyclic sets form a $\mathbf\Sigma^1_2$-complete set; equivalently, that deciding whether a Borel directed graph has Borel dichromatic number at least~$3$ is a $\mathbf\Pi^1_2$-complete problem. It follows that no countable family of Borel directed graphs can serve as a basis for this class under Borel homomorphism and, more generally, that any basis must be at least as complex as~$\mathbf\Pi^1_2$. The proof lifts the classical NP-completeness reduction of Bokal, Fijavž, Juvan, Kayll, and Mohar to the Borel setting, using the coding framework of Thornton. Combined with a straightforward reduction from undirected to directed coloring problems, this completes the picture for finite Borel chromatic and dichromatic thresholds: for every finite $k$, the set of Borel (directed) graphs admitting a Borel $k$-(di)coloring is $\mathbf\Sigma^1_2$-complete, and in particular admits no countable basis. This contrasts with the uncountable threshold, where a single-element basis exists for Borel chromatic number (Kechris–Solecki–Todorčević) and a continuum-size basis exists for Borel dichromatic number (Raghavan–Xiao).
Read the full abstract

Combinatorics · Cross-listed from cs.GT

Formal specification and behavioral simulation of the holiday gift exchange game

The holiday gift exchange game is a familiar social institution with nontrivial strategic structure. We provide a formal treatment of the game's mechanics, defining the state space, action sets, and the recursive structure of stealing chains; we prove termination and derive an algorithm for counting distinct game trajectories, which grow far faster than the space of possible final allocations. Beyond the base mechanics, we introduce a decorated model incorporating partial information, social costs, and adaptive strategies grounded in discrete choice theory and the frustration-aggression literature. A full factorial simulation of 240,000 games yields three findings of note: implicit social costs are the dominant regulator of aggression, reducing stealing by 27–48% and outweighing both uncertainty and strategic sophistication; partial information, contrary to expectation, slightly increases stealing through asymmetric uncertainty; correlated valuations amplify every behavioral effect, so that consensus about gift quality, rather than the features themselves, is what intensifies competition. The first-player advantage is robust across all conditions.
Read the full abstract

Logic

On 2-generated minimal Taylor algebras of size 4

We prove that any 2-generated minimal Taylor algebra on a domain of size 4 is not simple. In addition, we find all such algebras up to isomorphism and term-equivalence.
Read the full abstract

All authors Zarathustra Brady, Petar {\DJ}apić, Vukašin {\DJ}inović, Petar Marković, Aleksandar Prokić, Veljko Toljić, Vlado Uljarević

Numerical Analysis

Learned Dictionaries with Total Variation and Non-Negativity for Single-Cell Microscopy: Convergence Theory and Deterministic Multi-Channel Cell Feature Unification

We introduce a variational dictionary learning algorithm with hybrid penalization for single-cell microscopy signals. The cost functional couples least-squares data fidelity with total-variation (TV) regularization and a non-negativity constraint, promoting edge-preserving, physically meaningful reconstructions. The learning task is formulated with an explicit unitary constraint on the dictionary, ensuring well-conditioned representations. The optimization is solved by an alternating proximal-gradient scheme; we prove PDHG iterates converge to the regularized minimizer under an explicit step-size condition (tau*sigma < 1/8), and that under a variational source condition (VSC) the regularized solution converges to the true solution at the optimal O(delta) rate with lambda proportional to delta. Beyond reconstruction, we address multi-channel cell feature unification: given five imaging channels of the BSCCM dataset (DPC Left, Right, Top, Bottom, Brightfield), we learn a family of per-channel unitary dictionaries, each adapted to its channel's optical physics, and concatenate the per-channel sparse codes into a single channel-agnostic cell descriptor. This deterministic approach is mathematically transparent, reproducible, and compatible with clinical AI auditability requirements. On BSCCM-tiny (N=1000 cells, K=512 atoms) the framework reaches reconstruction fidelities of 97.06-97.54% on DPC channels and 94.79% on Brightfield, with bit-identical iterates across runs. Biological validation yields unsupervised lymphoid-vs-myeloid separation at ARI=0.575, NMI=0.471 (permutation p<0.0001).
Read the full abstract

Analysis of PDEs

The blow-up rate for a log non-scaling invariant semilinear wave equation in the conformal regime

We consider the blow-up behavior of solutions to the semilinear wave equation $$ \partial_t^2 u - \Delta u = |u|^{p-1}u \ln^a(u^2+2), \ (x,t)\in \mathbb{R}^n \times [0,T),$$ in the conformal case $ p = p_c = 1 + \frac{4}{n-1}$. Previous results in \cite{HZjmaa2020, HZ2022} show that for $ a \in \mathbb{R} $, solutions in the subconformal regime $ p < p_c $ blow up with a Type~I rate at any non-characteristic point. The objective of this work is to extend this blow-up rate to the conformal regime under the assumption $a<0$. We establish an a priori upper bound for any blow-up solution and construct a Lyapunov functional in similarity variables. The resulting functional exhibits only weak dissipation, which necessitates delicate energy arguments to obtain the sharp blow-up rate in the conformal case. To the best of our knowledge, this provides the first result for the blow-up rate in a critical framework for an evolution problem where the scaling symmetry is broken.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Approximate Simulation-Based Verification of Compatibility of the Friedkin-Johnsen Model with Binary Observations

We consider a verification problem for opinion dynamics based on binary observations. The opinion dynamics is governed by a Friedkin-Johnsen (FJ) model, where only a sequence of binary outputs is available instead of the agents' continuous opinions. At every time-step we observe a binarized output for each agent depending on whether the opinion exceeds a fixed threshold. The objective is to verify whether an FJ model with a given set of stubbornness parameters and initial opinions can generate the observed binary outputs up to a small error. The FJ model is formulated as a transition system, and an approximate simulation relation of two transition systems is defined in terms of the proximity of their opinion trajectories and output sequences. We then construct a finite set of abstract FJ models by simplifying the influence matrix and discretizing the stubbornness parameters and the initial opinions. It is shown that the abstraction approximately simulates any concrete FJ model with continuous parameters and initial opinions, and is itself approximately simulated by some concrete FJ model. These results ensure that consistency verification can be performed over the finite abstraction. Specifically, by checking whether an abstract model satisfies the observation constraints, we can conclude whether the corresponding family of concrete FJ models is consistent with the binary observations. Finally, numerical experiments are presented to illustrate the proposed verification framework.
Read the full abstract

All authors Yu Xing, Aneesh Raghavan, Michael T. Schaub, Karl H. Johansson

Dynamical Systems · Cross-listed from nlin.AO

Generalized saddle-node ghosts and their composite structures in dynamical systems

The study of dynamical systems has long focused on the characterization of their asymptotic dynamics such as fixed points, limit cycles and other types of attractors and how these invariant sets change their properties as systems parameters change. More recently, however, the importance of transient dynamics, especially of long transients and sequential transitions between them, has been increasingly recognized in various fields including ecology, neuroscience and cell biology. Among several possible origins of long transients, ghost attractors have received particular attention due to interesting dynamical properties in non-autonomous settings, new theoretical developments, and an increasing number of systems that empirically show dynamics consistent with ghost attractors. Despite this growing interest in transient dynamics generally and ghost attractors in particular, there are significantly fewer theoretical concepts and software tools available to researchers to classify and characterize their underlying mechanisms compared to asymptotic dynamics. To address this gap, we generalize saddle-nodes to account for higher-dimensional center manifolds and provide a definition for their ghost attractors. We then introduce algorithms to specifically identify and characterize ghost attractors and their composite structures such as ghost channels and ghost cycles and show how these concepts and algorithms can be used to gain new insights into the transient dynamics of a wide range of system models focusing on living systems, allowing, e.g., to describe bifurcations of ghosts. The algorithms are implemented in Python and available as PyGhostID, a user-friendly open-source software package.
Read the full abstract

Complex Variables

Voronoi limit measures for iterates of constant-coefficient differential operators on rational functions with simple poles

Bøgvad and Hägg proved that for a rational function with simple poles, the zeros of successive derivatives accumulate on the Voronoi diagram of the pole set, and the normalized zero-counting measures converge to a canonical probability measure supported on this diagram. We extend this result from pure derivatives to iterates of an arbitrary monic constant-coefficient differential operator. Let $h(z)=A(z)/B(z)$ be a reduced rational function, where $B$ is monic of degree $b\ge2$ with distinct zeros $S=\{z_1,\dots,z_b\}$, and let $P(D)=\sum_{j=0}^m c_jD^j$ be a monic constant-coefficient differential operator of order $m\ge1$. After clearing denominators, we can write $P(D)^n(h)=\widetilde A_n/B^{mn+1}$ and study the zeros of the numerator polynomials $\widetilde A_n$. If $r:=\min\{j:c_j\neq0\}$, then (after passing to the proper part of $h$ when $r>0$) the associated zero-counting measures converge vaguely to $$\frac{m(b-1)}{bm-r}\,\mu_S,$$ where $\mu_S$ is the Bøgvad–Hägg probability measure supported on the Voronoi diagram $V_S$. In particular, the limit is a probability measure exactly when $P(D)=D^m$; otherwise a proportion $\frac{m-r}{bm-r}$ of zeros escapes to infinity (in the sense of vague convergence). When $r<m$, the unshifted logarithmic potentials diverge, but an explicit factorial renormalization yields $L^1_{\mathrm{loc}}(\mathbb C)$ convergence to a subharmonic limit with Riesz measure $\frac{m(b-1)}{bm-r}\,\mu_S$. Apart from this scalar factor, the limiting measure is determined solely by the pole configuration; the coefficients of $P(D)$ affect only an additive constant in the limiting potential.
Read the full abstract

All authors Bosco Nyandwi, Christian Hägg, Celestin Kurujyibwami, Leon Fidele Ruganzu Uwimbabazi

Analysis of PDEs

The best constant in the G-N inequality for the mixed local and Nonlocal Laplacian

In this paper, we establish the best constant in the G-N inequality for the mixed local and nonlocal Laplacian. In our problem, classical methods cannot apply directly since regularity results for the operator under study seem to be highly challenging. We build an innovative method that not only enabled us to prove that the optimizer of the best constant is the ground state solution of the equation, but also to establish the best constant.
Read the full abstract

Combinatorics

On the largest strongly connected component of randomly oriented divisor graphs

We introduce the study of randomly oriented divisor graphs. For each $\rho \in [0,1]$, the randomly oriented divisor graph $\mathcal{D}_\rho(N)$ is obtained from the divisor graph on $\{1, 2, \ldots, N\}$ by directing each edge according to divisibility and independently reversing the direction of each edge with probability $\rho$. We study the expected size of the largest strongly connected component, $\textbf{E}[\#\Phi(\mathcal{D}_\rho(N))]$. Our main result gives a lower bound for this quantity in terms of the distribution of values of the divisor function $\tau(n)$. As a consequence, we show that for any fixed $\rho \in (0,1)$, the largest strongly connected component has expected size asymptotic to $N$. To obtain explicit bounds, we prove an effective version of a theorem of Hardy and Ramanujan on the normal order of $\log \tau(n)$, which may be of independent interest.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Graph Signal Diffusion Models for Wireless Resource Allocation

We consider constrained ergodic resource optimization in wireless networks with graph-structured interference. We train a diffusion model policy to match expert conditional distributions over resource allocations. By leveraging a primal-dual (expert) algorithm, we generate primal iterates that serve as draws from the corresponding expert conditionals for each training network instance. We view the allocations as stochastic graph signals supported on known channel state graphs. We implement the diffusion model architecture as a U-Net hierarchy of graph neural network (GNN) blocks, conditioned on the channel states and additional node states. At inference, the learned generative model amortizes the iterative expert policy by directly sampling allocation vectors from the near-optimal conditional distributions. In a power-control case study, we show that time-sharing the generated power allocations achieves near-optimal ergodic sum-rate utility and near-feasible ergodic minimum-rates, with strong generalization and transferability across network states.
Read the full abstract

All authors Yigit Berkay Uslu, Samar Hadou, Shirin Saeedi Bidokhti, Alejandro Ribeiro

Dynamical Systems

Entropy and self-intersection number of geodesic currents on compact hyperbolic surfaces

Let $X$ be a compact hyperbolic surface of genus $g$, and $C$ a geodesic current on $X$. Denote by $h_X(C)$ the measure-theoretic entropy of $C$ with respect to the geodesic flow. Assume that $C$ is ergodic. In this paper, we establish a quantitative upper bound on $h_X(C)$ in terms of its self-intersection number $i(C,C)$ and the systole of $X$. In particular, we show that small self-intersection number forces small entropy.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Star product for qubit states in phase space and star exponentials

In this paper, we formulate the phase space description of qubit systems using coadjoint orbits of $SU(2)$ and the Stratonovich-Weyl correspondence, yielding a deformation quantization on the sphere. The resulting star product reproduces the operator algebra of complexified quaternions and its antisymmetric part induces the Lie-Poisson structure associated with the Kirillov-Kostant-Souriau symplectic form. We show that quantum dynamics can be expressed entirely in phase space through star exponentials of Hamiltonian symbols, leading to an explicit representation of the propagator. Further, we establish the equivalence between the coherent-state path integral formulation on $S^2$ and the algebraic description in terms of star exponentials. Some examples illustrating the construction of the star-exponential functions and the resulting Poisson structure are included.
Read the full abstract

Dynamical Systems

Separating Orbits by Entire Functions

We show that for any free probability measure-preserving action of $\mathbb{C}^{d}$ on a standard probability space, there exists a Borel entire function $F$ such that the factor map $x \mapsto F_{x}$, where $F_{x}(z) = F(z \cdot x)$, is injective. This work builds on a result of Glücksam and Weiss, who constructed non-constant measurable entire functions for such actions. The proof combines a separating cross-section whose cocycle values lie in a countable subgroup with Forstnerič's holomorphic approximation theorem with prescribed critical points.
Read the full abstract

Optimization and Control

End-to-End Learning of Correlated Operating Reserve Requirements in Security-Constrained Economic Dispatch

Operating reserve requirements in security-constrained economic dispatch (SCED) depend strongly on the assumed correlation structure of renewable forecast errors, yet that structure is usually specified exogenously rather than learned for the dispatch task itself. This paper formulates correlated reserve-set design as an end-to-end trainable robust optimization problem: choose the ellipsoidal uncertainty-set shape to minimize robust dispatch cost subject to a target coverage requirement. By profiling the coverage constraint into a shape-dependent radius, the original bilevel problem becomes a single-stage differentiable objective, and KKT/dual information from the SCED solve provides task gradients without differentiating through the solver. For unknown distributions, a four-way train/tune/calibrate/test split combines a smoothed quantile-sensitivity estimator for training with split conformal calibration for deployment, yielding finite-sample marginal coverage under exchangeability and a consistent gradient estimator for the smoothed objective. The same task gradient can also be passed upstream to context-dependent encoders, which we report as a secondary extension. The framework is evaluated on the IEEE~118-bus system with a coupled SCED formulation that includes inter-zone transfer constraints. The learned static ellipsoid reduces dispatch cost by about 4.8% relative to the Sample Covariance baseline while maintaining empirical coverage above the target level.
Read the full abstract

All authors Owen Shen, Hung-po Chao, Haihao Lu, Patrick Jaillet

Logic · Cross-listed from cs.CC

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks

We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old proofs that some SMB algebras induce tractable templates of the reprove that the Constraint Satisfaction Problem. Next, we reprove that, in fact, all SMB algebras induce tractable templates of the Constraint Satisfaction Problem, a result already proved by A. Bulatov. Also, we compare the two general proofs of the CSP Dichotomy and prove they are more similar than initially thought when they are applied to SMB algebras. This paper is the second in the series of papers investigating the SMB algebras and it is a precursor to our further research on the similarities between the proofs of the Dichotomy Theorem.
Read the full abstract

All authors Petar Marković, Miklós Maróti, Ralph McKenzie, Aleksandar Prokić

Optimization and Control

Controllability for semi-discrete semilinear stochastic parabolic operators

In \cite{LPP:2025}, it was shown that, in arbitrary dimension, the spatial semi-discretization of a controlled stochastic parabolic operator is generically not null-controllable. Nevertheless, $\phi$-null controllability results remain attainable. The present paper extends those results to semi-discrete semilinear stochastic operators in arbitrary dimension, whose nonlinearities may also depend on the first-order spatial derivatives. The approach relies on establishing a new Carleman estimate for the adjoint backward stochastic parabolic operator, which yields $\phi$-null controllability for the associated linear system via a duality argument. The semilinear case is handeld by means of a fixed-point argument. As particular cases, our results recover the one-dimensional linear results of \cite{zhao:2024}, the multidimensional linear results of \cite{LPP:2025}, and the semilinear one-dimensional framework of \cite{WZ:2025} in the absence of gradient dependence.
Read the full abstract

Optimization and Control

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective

Electric utility companies perform numerous technical interventions every day. Since it is generally not possible to complete all planned interventions within a single day, companies face two objectives: maximizing the total duration of completed interventions (primary objective) and minimizing the associated operational cost (secondary objective). In this paper, we introduce a multi-objective variant of the technician routing and scheduling problem in which both objectives are optimized in lexicographic order. We propose a compact mixed-integer linear formulation and an extended set-packing-based formulation. To handle the objectives within a single-objective framework, we consider weighted-sum reformulations that preserve lexicographic priorities as well as sequential reformulations that individually optimize each objective while maintaining the optimal value of higher-priority ones. For the extended formulation, we develop an exact column-generation-based algorithm, in which the pricing subproblems are solved via a labeling algorithm based on dynamic programming. As technician schedules are typically generated on a daily basis, the algorithm is designed to deliver high-quality solutions within short computation times (e.g., 5 minutes). Computational experiments on real-life instances provided by the French electric utility company show that the CG-based algorithm proves optimality on a larger number of small instances than the compact formulation and consistently outperforms it on larger instances. In particular, the sequential CG-based variant finds the best-known solutions on more instances and achieves lower mean gaps relative to the best solution found in each instance category.
Read the full abstract

All authors Elise Bangerter, David Schindl, Meritxell Pacheco Paneque, Nour Elhouda Tellache, Rodolphe Griset

Algebraic Geometry

Conjecture I for unirational algebraic groups over imperfect fields

Serre's Conjecture I states that the first Galois cohomology set of any smooth connected linear algebraic group is trivial over a perfect field of cohomological dimension at most 1. We prove that this result remains valid for any unirational algebraic group, dropping the perfection assumption on the field. To do so, we rely on the theory of pseudo-reductive groups, combined with the structure of unirational wound unipotent groups and the recent theory of permawound unipotent groups. Finally, we extend several related results on Galois cohomology associated with the Conjecture.
Read the full abstract

Combinatorics

Equitable coloring of large bipartite graphs

For a graph $G$, the equitable chromatic number of $G$, denoted by $\chi_e(G)$, is the smallest integer $k$ such that $G$ admits a proper $k$-coloring whose color classes differ in size by at most one. We prove that for every $\zeta>41/2$, there exists a constant $c=c(\zeta)\in\mathbb{N}$ such that every bipartite graph $G$ with maximum degree $\Delta(G)\ge c$ and $|V(G)|\ge \zeta\Delta(G)$ satisfies $\chi_e(G)\le \left\lceil\Delta(G)/2\right\rceil+1$. The leading term $\Delta(G)/2$ in this bound is best possible for upper bounds stated solely in terms of $\Delta(G)$ for bipartite graphs. Our proof yields an $O(|V(G)|^2)$-time algorithm for constructing such a coloring.
Read the full abstract