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

Dynamical Systems

Reinforcement Learning, Optimal Control, and Bayesian Filtering in Data Assimilation

We give a finite-horizon variational formulation that places Bayesian filtering and smoothing, variational data assimilation, KL-regularized control, and Kalman-type methods inside one mathematically explicit hierarchy. For a discrete-time hidden Markov model and any admissible one-step candidate law $q_t$, We prove $J_t(q_t)=\mathbb{E}_{q_t}\!\left[-\log p(y_t\mid X_t)\right] +\mathrm{KL}\!\left(q_t\|p_t^f\right) =\mathrm{KL}\!\left(q_t\|p_t^a\right)-\log p(y_t\mid y_{0:t-1})$, and, for any admissible path law $q$, $J_{\mathrm{path}}(q)=\mathbb{E}_{q}\!\left[-\sum_{t=0}^{T}\log p(y_t\mid X_t)\right] +\mathrm{KL}\!\left(q\|p(x_{0:T})\right) =\mathrm{KL}\!\left(q\|p(x_{0:T}\mid y_{0:T})\right)-\log p(y_{0:T})$. These identities determine the evidence as the global infimum and make the analysis and smoothing posteriors the unique minimizers whenever those posterior laws belong to the admissible classes. This separates targets that are often conflated: strong- and weak-constraint 4D-Var are MAP estimators under the stated Gaussian assumptions; KL-regularized control recovers the Bayesian posterior only when the passive dynamics, likelihood cost, temperature, and a restrictive representability condition on the policy class are all matched correctly; and the linear-Gaussian specialization yields the Kalman analysis exactly. The ensemble Kalman filter then appears as a Gaussian and finite-ensemble approximation to the forecast-to-analysis map, exact only in the linear-Gaussian infinite-ensemble limit. This framework also clarifies RMSE-based RL data assimilation: such rewards may define effective estimators or pseudo-posteriors, but not exact posterior recovery unless they realize the likelihood-plus-KL objective.
Read the full abstract

Optimization and Control

Nonlinear Stochastic Optimal Control and Optimal Stopping using the Fokker-Planck Transformation

In this paper, we develop a theoretical framework for nonlinear stochastic optimal control problems with optimal stopping by establishing a density-based deterministic representation of the underlying diffusion. For state-independent diffusion, we rewrite the controlled Fokker-Planck equation as a continuity equation driven by a score-corrected velocity field, yielding a deterministic characteristic dynamics that reproduces the marginal law of the stochastic system. Leveraging Stein-type identities, we show that the associated distributional dynamic programming equation admits the same second-order differential operator as the distributional stochastic Hamilton-Jacobi-Bellman formulation. Building on this representation, we formulate an optimal control problem with state-dependent terminal-time assignment and terminal distributional constraints and derive the first-order necessary conditions using variational analysis. We present the conditions both for a common terminal time and for the general case of state-dependent stopping.
Read the full abstract

All authors Akan Selim, Siddhartha Ganguly, Ali Pakniyat, Panagiotis Tsiotras

Monday 13 April

Combinatorics

On Combinatorial Properties of the degenerate Krawtchouk Appell polynomials

The foremost aim of this study is to introduce and study several combinatorial properties and highlight specific aspects of a new class of polynomials sequences known as degenerate Krawtchouk Appell polynomials associated with the degenerate Pascal measure. As applications, the connection that exists between brand-new polynomials, Stirling numbers, scaling operator, translation operator and the orthogonal Bell polynomials has been investigated.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Deterministic Multi-User Identification over Bosonic Channels

We study deterministic multi-user identification over bosonic channels using coherent-state signatures. Each user is assigned a coherent product state under an average energy constraint, and identification is performed by a user-specific binary quantum test. In contrast to classical multi-user identification models based on shared codebooks, this formulation associates each receiver with a geometric signature in high-dimensional phase space. Using metric entropy bounds, we show that the identification capacity exhibits a near-k log k scaling behavior.
Read the full abstract

Analysis of PDEs

Threshold Scattering for the Energy-Critical NLS with a Repulsive Inverse Square Potential

We study the threshold scattering problem for the energy-critical nonlinear Schrödinger equation with a repulsive inverse-square potential $\frac{a}{|x|^2} > 0$ in dimensions $d= 4, 5, 6$. On the energy level surface determined by the ground state of the energy-critical NLS without potential, we show that, despite the absence of a ground state in this setting, a strong form of rigidity persists below the kinetic threshold. Specifically, we prove that any solution on this energy surface with kinetic energy strictly below that of the ground state is global and scatters to zero. Our approach combines refined modulation analysis, a center-translated global Virial estimate, and a bootstrap argument to control the modulation parameters.
Read the full abstract

All authors Zuyu Ma, Yilin Song, Kai Yang, Xiaoyi Zhang

Number Theory

Eta-products, Eichler integrals, and the level-8 Apery limit

We give an independent eta-product derivation of the level-8 Apery limit lim B_n^{(8)}/s_n = (7/32) zeta(3), where s_n = sum_{k=0}^n C(n,k)^2 C(2k,n)^2 and B_n^{(8)} is the rational companion sequence satisfying the same cubic recurrence with initial values B_0^{(8)}=0, B_1^{(8)}=1. This value was identified numerically by Almkvist-van Straten-Zudilin and was proved by Golyshev via Beukers's Atkin-Lehner modular method; it was later recomputed by Golyshev-Kerr-Sasaki in the motivic/normal-function framework. The continued fraction PCF((2n+1)(3n^2+3n+1),-n^6) = 8/(7 zeta(3)) already appears in Batut-Olivier and was later rediscovered by the Ramanujan Machine as conjecture Z1. The contribution of the present paper is an explicit rederivation, in the eta-product normalization, of the already-known level-8 Apery limit. We spell out the eta-product verification of the Wronskian identity, the normalization of the Eichler integral, the residue computation of the Fricke period polynomial, and the elementary continuant conversion.
Read the full abstract

History and Overview of Mathematics

A historical perspective of Tian's evolution algebras

Even if it has been less than a decade and a half since Tian introduced his concept of evolution algebras to represent algebraically non-Mendelian rules in Genetics, their study is becoming increasingly widespread mainly due to their applications to many scientific disciplines. In order to facilitate further research on the topic, this paper deals with the past and present research on these kind of algebras, together with the most relevant topics regarding them.
Read the full abstract

All authors Manuel Ceballos, Raúl Falcón, Juan Núñez-Valdés, Ángel F. Tenorio

Dynamical Systems

Finite Invariant Sets with Bridging Points in Logistic IFS

We investigate iterated function systems (IFS) that randomly alternate between two non-identical one-dimensional maps as simple models of regime-switching dynamical systems. Our primary focus is on finite invariant sets exhibiting “toss-and-catch” dynamics, in which trajectories alternate between fixed points and periodic points of the constituent maps. Using two representative types of low-dimensional nonlinear systems–a pair of logistic maps and a combination of logistic and tent maps–we derive exact parameter conditions for several toss-and-catch structures. The comparison between these systems reveals two distinct mechanisms for finite invariant sets: one mediated by bridging points that connect invariant structures of different maps, and another generated by nontrivial intersections shared by the maps themselves. Notably, we identify invariant sets containing bridging points that are not periodic points of either constituent map. These results demonstrate that switching between simple nonlinear maps can generate invariant structures that do not exist in the constituent systems alone, suggesting a more general mechanism for the emergence of invariant structures in random dynamical systems.
Read the full abstract

All authors Hibiki Kato, Tamotsu Onozaki, Yoshitaka Saiki, Yasumasa Sugita

General Mathematics

Structure and Zero Asymptotics of Differential Operators Associated with ${\Xi}_n$ and ${\Lambda}_n$

We study the second-order differential operators \(\mathcal D_{\Xi}\) and \(\mathcal D_{\Lambda}\) associated with the rescaled polynomial families \((\widetilde{\Xi}_n)\) and \((\widetilde{\Lambda}_n)\), and more generally the polynomial sequences generated by iterating these operators from an arbitrary linear initial datum \(cx-d\). We establish structural properties of \(\mathcal D_{\Xi}\) and \(\mathcal D_{\Lambda}\), including factorizations into first-order operators, weighted divergence forms, formal self-adjointness, and hypergeometric descriptions of the corresponding formal eigenvalue equations. We also show that both operators preserve hyperbolicity, preserve zeros in \((0,b)\) for \(b\ge 1\), and preserve proper position. For the iterated polynomial sequences, we derive explicit closed formulae in terms of the auxiliary families \((\widetilde{\Xi}_n)\) and \((\widetilde{\Lambda}_n)\), prove strict interlacing of consecutive zeros under explicit conditions on \(d/c\), and obtain asymptotic formulae for the normalized logarithmic derivatives. As a consequence, the associated zero counting measures converge weakly to the same limiting probability measure as in the auxiliary case.
Read the full abstract

Numerical Analysis

A strong second-order two-stage explicit/implicit technique with spectral orthogonal basis Galerkin finite element method for two-dimensional Gray-Scott model

This paper proposes a strong second-order two-step explicit/implicit technique with spectral orthogonal basis Galerkin finite element method for solving a two-dimensional Gray-Scott model subject to appropriate initial and boundary conditions. The constructed approach discretizes at the first stage utilizing a second-order explicit method while a second-order implicit scheme is employed at the second phase. The space derivatives are approximated with the Galerkin finite element formulation combined with a spectral orthogonal basis. With this combination, the errors increased at the first stage are balanced by the errors decreased at the second phase so that the stability is maintained. Furthermore, the use of the spectral orthogonal basis minimizes the space errors. Thus, the new computational approach calculates efficiently numerical solutions and preserves a strong stability and high-order accuracy. The theoretical studies indicate that the proposed strategy is unconditionally stable, temporal second-order accurate and spatial $qth$-order convergent using the $L^{\infty}(0,T;[L^{\infty}(\Omega)]^{2})$-norm, where $q$ is an integer greater than or equal $2$. Some numerical examples are performed to confirm the theory and to demonstrate the efficiency of the developed algorithm.
Read the full abstract

Logic

Transitive Extensions of Automorphism Groups of Generic Structures

This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fraïssé sense. The study of transitive extensions has hitherto largely concerned itself with finite permutation groups. Moving beyond the finite realm, we develop combinatorial tools to prove that transitive extensions exist for edge-colored k-hypergraphs only when the number of colors is a power of two and that transitive extensions exist for k-hypertournaments (in the Cherlin sense) only when k is even, among other results.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum chaotic systems: a random-matrix approach

We review the ideas of how random matrix theory has to be properly applied to quantum physics; particularly we focus on how the spectrum has to be properly prepared and the random matrix correctly identified before the random matrix and the physical eigenvalue spectrum can be compared. We explain the ideas of the symmetry classification of symmetric matrix spaces and how that yields Dyson's threefold and Altland-Zirnbauer's tenfold way. We also outline how the joint probability density function of the eigenvalues can be calculated from a given probability density function on the matrix space. Furthermore, we dive into the subtleties of the unfolding procedure. For this purpose, we explain the ideas of the local mean level spacing, the local level spacing distribution and the $k$-point correlation functions. We outline the techniques of orthogonal polynomials, determinantal and Pfaffian point processes and their related Fredholm determinants and Pfaffians as well as the supersymmetry method. Moreover, we relate the local spectral statistics to effective Lagrangians that give the relation to non-linear $\sigma$-models. In all these discussions, we also make brief excursions to non-Hermitian random matrix theory which are useful when studying open quantum systems, for instance.
Read the full abstract

Optimization and Control

Estimating Price Elasticity Matrices

The relationship between demand and prices of a set of products can be modeled as a linear mapping from logarithmic price changes to logarithmic changes in demand. We consider the problem of estimating the coefficient matrix of this mapping, the elasticity matrix, based on observed data consisting of real-valued prices and integer-valued demands. We regularize the estimation problem by imposing a factor model structure, i.e., that the elasticity matrix is diagonal plus low-rank, similar to factor models used for financial returns. Maximizing the likelihood of observations of this model is a bi-convex problem, meaning that there is a partition of the variables in which it is convex in each set when the other is fixed. We propose and compare three methods for finding a locally optimal estimate. The first is based on alternating maximization, and involves solving a sequence of convex problems. The second method exploits efficient gradient computations in a gradient ascent method. The final method is to use a general purpose nonlinear programming method. While all methods give the same result on numerical examples, the gradient ascent method is substantially faster, due to its efficient gradient evaluations. We report the likelihood with different hyper-parameters for synthetic and real-world data, with similar results. For synthetic data, we also report the realized profit when using the elasticity estimate for optimal pricing, which is maximized for the same set of hyper-parameters that also maximizes the likelihood. This paper is accompanied by easy to use open source Python code for fitting elasticity matrices to observed data, using our three numerical methods.
Read the full abstract

Probability

Integrability of Multispecies Long-Range Swap Models with Species-Dependent Interpolation

We introduce a class of multispecies exclusion processes with long-range swap interactions, incorporating species-dependent interpolation between TASEP-type and drop–push-type dynamics: each species $i$ is assigned a parameter $\mu_i$ governing same-species interactions, resulting in a heterogeneous system in which different species follow distinct microscopic interaction mechanisms. In contrast to previously studied integrable multispecies models, where species dependence typically enters through jump rates, the present framework allows the interaction mechanism itself to depend on the species. Our main result establishes integrability of the model in the binary parameter regime $\mu_i \in \{0,1\}$ for arbitrary species compositions. In the continuous parameter regime $\mu_i \in (0,1)$, we identify several nontrivial classes of species compositions for which integrability is preserved. We further extend the model to include bidirectional motion, going beyond totally asymmetric dynamics. Using the coordinate Bethe ansatz, we prove two-particle reducibility and derive the associated scattering matrix, which is shown to satisfy the Yang–Baxter equation. The resulting scattering matrix exhibits genuinely species-dependent diagonal entries.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Reliability estimation in dependent stress-strength model with Clayton copula and modified Weibull margins

Stress-strength models are widely used to assess the reliability of systems under uncertain conditions. While most studies assume independence between stress and strength variables, such an assumption may be unrealistic in many practical situations where these components are inherently dependent. In this study, we investigate stress-strength reliability under a dependent framework, where both stress and strength variables follow modified Weibull distributions and their dependence is modeled via a Clayton copula. The proposed model allows distinct parameter sets, resulting in a flexible seven-parameter structure that extends Weibull-based models. We consider several estimation procedures for the model parameters and reliability, including two-step maximum likelihood, least squares, weighted least squares, and maximum product of spacings, with interval estimation obtained via asymptotic and bootstrap confidence intervals. The performance of the proposed estimators is evaluated through an extensive Monte Carlo simulation study under various parameter configurations and sample sizes. Finally, the applicability of the proposed model is illustrated using monthly occupancy data from Istanbul's two largest dams, with the Clayton copula capturing their dependence structure. This application demonstrates how stress-strength reliability can inform water management decisions and mitigate inter-regional operational risks.
Read the full abstract

Quantum Algebra

Tensor category of $\mathbb{Z}_2$-orbifold of Heisenberg vertex operator algebra and its applications

In this paper, we prove the category of finite length modules for the $\mathbb{Z}_2$-orbifold $M(1)^+$ of the Heisenberg vertex operator algebra whose simple composition factors are $M(1)^\pm$ or $M(1,\lambda)$ for $\lambda \in \mathbb{C}^\times$ is a vertex and braided tensor category. Our strategy is to show these simple composition factors are $C_1$-cofinite and the category of finite length $M(1)^+$-modules is exactly the category of grading-restricted $C_1$-cofinite modules. We also determine the fusion product decompositions of simple objects and prove the rigidity of this category. As an application of the tensor category structure of $M(1)^+$-modules, we prove the category $\mathcal{C}_{-1}(sp(2n))$ of grading-restricted generalized modules for the simple affine vertex algebra $L_{-1}(sp(2n))$ is semisimple. For this, we first prove $M(1)^+$ and simple affine vertex algebra $L_{-\frac{1}{2}}(sp(2n))$ form a commutant pair in the simple minimal $W$-algebra $W_{-1}^{min}(sp(2n))$ for $n \geq 2$ and determine $W_{-1}^{min}(sp(2n))$ as well as its irreducible modules obtained from quantum Hamilton reduction as decompositions of $M(1)^+ \otimes L_{-\frac{1}{2}}(sp(2n))$-modules, then we show all the highest weight modules for $L_{-1}(sp(2n))$ in $\mathcal{C}_{-1}(sp(2n))$ are irreducible via the quantum Hamilton reduction. We also prove a Schur-Weyl duality between $L_{-1}(sp(2n))$ and $M(1)^+$ by showing they form a commutant pair in the $\mathbb{Z}_2$-orbifold of the rank $n$ $\beta\gamma$ system, and then establish a braided reversed equivalence between the category $\mathcal{C}_{-1}(sp(2n))$ and the full subcategory of $C_1$-cofinite $M(1)^+$-modules consisting of direct sums of irreducible modules $M(1)^\pm$ and $M\big(1, \frac{s}{\sqrt{-2n}}\big)$ for $s \in \mathbb{Z}_{\geq 0}$.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Weakly turbulent dynamics on Schwarzschild-AdS black hole spacetimes

In the presence of confinement, small-data solutions to nonlinear dispersive equations can exhibit a gradual energy transfer from low to high frequencies, a mechanism driving the emergence of weakly turbulent dynamics. We show that such a forward energy transfer, manifested as arbitrary inflation of higher order Sobolev norms, occurs for small-data solutions of a quasilinear cubic wave equation on the Schwarzschild-AdS black hole exterior with Dirichlet conditions at infinity, for generic values of the mass parameter. This result is motivated by the question of nonlinear stability or instability of Schwarzschild-AdS as a solution to the Einstein vacuum equations, but the strategy of proof applies to a broader class of backgrounds exhibiting stable trapping of null geodesics. As an application, we obtain the analogous norm inflation statement on $\mathbb R \times \mathbb S^3_+$ for generic perturbations of the round metric on the hemisphere $\mathbb S^3_+$ preserving the trapping structure at the boundary.
Read the full abstract

Optimization and Control

A Decomposition Method for LQ Conditional McKean-Vlasov Control Problems with Random Coefficients

We propose a decomposition method for solving a general class of linear-quadratic (LQ) McKean-Vlasov control problems involving conditional expectations and random coefficients, where the system dynamics are driven by two independent Wiener processes. Unlike existing approaches in the literature for these problems, such as the extended stochastic maximum principle and the extended dynamic programming methods, which often involve additional technical complexities and sometimes impose restrictive conditions on control inputs, our approach decomposes the original McKean-Vlasov control problem into two decoupled stochastic optimal control problems, one of which has a constrained admissible control set. These auxiliary problems can be solved using classical methods. We establish an equivalence between the well-posedness and solvability of the auxiliary problems and those of the original problem, and show that the sum of the optimal controls of the auxiliary problems yields the optimal control of the original problem. Moreover, by applying a variational method, we characterize the optimal solution to the McKean-Vlasov control problem via two decoupled sets of (non-McKean-Vlasov) linear forward-backward stochastic differential equations, each corresponding to one of the auxiliary problems. Finally, we show that standard dynamic programming can also be applied to solve the resulting auxiliary problems.
Read the full abstract

Mathematical Physics

Quantum mechanical model for charge excitation: Surface binding and dispersion

By an idealized quantum mechanical model, we formally describe the dispersion of nonretarded electromagnetic waves that express charge density oscillations near a fixed plane in three spatial dimensions (3D) at zero temperature. Our goal is to capture the interplay of microscopic scales that include a confinement length in the emergence of the surface plasmon, a collective low-energy charge excitation in the vicinity of the plane. We start with a time-dependent Hartree-type equation in 3D. This model accounts for particle binding to the plane and the repulsive Coulomb interaction associated with the induced charge density relative to the ground state. By linearizing the equation of motion, we formulate a homogeneous integral equation for the scattering amplitude of the particle wave function in the (z-) coordinate vertical to the plane. For a binding potential proportional to a negative delta function and symmetric-in-z wave function, we apply the Laplace transform with respect to positive z and convert the integral equation into a functional equation that involves several values of the transformed solution. The scattering amplitude and dispersion relation are derived exactly in terms of rapidly convergent series via the Mittag-Leffler theorem. In the semiclassical regime, our result furnishes an asymptotic expansion for the energy excitation spectrum. The leading-order term is found in agreement with the prediction of a classical hydrodynamic model based on a projected-Euler-Poisson system.
Read the full abstract

Statistics Theory

QBIC of SEM for jump-diffusion processes based on high-frequency data

Structural equation modeling (SEM) is a statistical method for analyzing relationships among latent variables. Since SEM is a confirmatory method, the model needs to be specified in advance. In practice, however, statisticians have several candidate models and aim to select the most appropriate one among them. In this paper, we consider model selection in SEM for jump-diffusion processes. We propose a quasi-Bayesian information criterion (QBIC) for the SEM and show that the proposed criterion has model-selection consistency.
Read the full abstract

Analysis of PDEs

$C^{1/5^{-}}$ Convex Integration Solutions of Ideal MHD

For any $0\leq \gamma < 1/5$, we construct weak solutions $(v, B, p )$ of the Ideal MHD Equations which do not conserve the total kinetic energy, the cross-helicity and lie in $C^\gamma(\mathbb{T}^3\times\mathbb{R})$. In the spirit of Arnold's formulation of ideal hydrodynamics, a solution is thought of as a path of volume-preserving diffeomorphisms; the proof is then based on the interplay between classical convex integration techniques and geometric constructions at the level of the Lie algebra of this Lie group. Our work substantially extends the recent work of and building on the recent work of Enciso, Peñafiel-Tomás and Peralta-Salas.
Read the full abstract

Statistics Theory

Adaptivity of the NPMLE to finitely discrete mixing distributions in Gaussian/Poisson mixtures

We study the nonparametric maximum likelihood estimator (NPMLE) for Gaussian and Poisson mixture models, assuming the support of the true mixing distribution lies in a fixed bounded set. In this setting, we establish exact parametric rates for both, marginal density estimation and the posterior mean when the true mixing distribution is finitely discrete. Moreover, we show that the NPMLE attains the optimal demixing rate previously known for overparameterized finite mixture models. Finally, we identify a new adaptivity phenomenon for inference: the likelihood ratio test statistic is asymptotically tight if and only if the true mixing distribution is finitely discrete.
Read the full abstract

Optimization and Control

Resilience Quantification and its Support for Operational Resilience

We present a method to quantify a system's resilience capacity, i.e., the set of degradation magnitudes for which all functional requirements remain satisfied. These requirements come from human stakeholders (e.g., operators, planners) who define the acceptable performance envelope. By representing the resilience capacity in degradation space, we obtain an application – agnostic resilience metric (e.g., capacity volume). To approximate the capacity efficiently in high-dimensional spaces, we pair machine-learning classifiers with entropy-based active sampling, reducing costly feasibility tests. The learned model then drives diagnosis (current health estimation) and prognostics (health-state forecasting) that estimates useful life. These two steps can be complemented by a reconfiguration step implemented by human operators to prolong the system's functionality. An illustrative case study, i.e., a manufacturing production line meeting weekly human set part demand, demonstrates the proposed workflow.
Read the full abstract

Algebraic Geometry

Semiorthogonal decompositions and components of derived categories of orthogonal Grassmannian fibrations

Kuznetsov showed that for a flat quadric fibration $\mathcal{Q}$ over a smooth base $S$, $\mathrm{D}^b(\mathcal{Q})$ admits a semiorthogonal decomposition where one of the components is the derived category of the sheaf of even parts of a Clifford algebra $\mathrm{D}^b(S,\mathcal{C}l_0)$. \par As progress towards a generalization, we show that for a quadric fibration with a fairly minor condition on the rank of the quadric fibers, the category $\mathrm{D}^b(S,\mathcal{C}l_0)$ embeds fully faithfully into the derived category of the relative orthogonal Grassmannian $\mathrm{D}^b(\mathrm{OGr}(k,\mathcal{Q}))$. When $k = 2$, we use this to produce a semiorthogonal decomposition of $\mathrm{D}^b(\mathrm{OGr}(2,\mathcal{Q}))$ up to a residual category; we compute this residual category in the smooth case and produce a conjecture for in the case of a pencil of quadrics with smooth base locus.
Read the full abstract

Number Theory

On the $K$-extensions between Serre weights for unramified $\mathrm{GL}_3$

Let $p\geq5$ be a prime number. Let $L$ be a finite unramified extension of $\mathbb{Q}_p$ with ring of integers $\mathcal{O}_L$ and residue field $\mathbb{F}_q$. Given two Serre weights for $\mathrm{GL}_3(\mathbb{F}_q)$, we prove that in most cases the extensions between them for $\mathrm{GL}_3(\mathcal{O}_L)$ modulo the center coincide with their $\mathrm{GL}_3(\mathbb{F}_q)$-extensions.
Read the full abstract

Optimization and Control

Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing

We propose a new pricing strategy for column generation (CG), referred to as Template pricing. This method is motivated by the desire to coordinate solutions of different pricing subproblems in order to accelerate the convergence of the CG process and simultaneously obtain good quality integer feasible solutions. Instead of finding a column with the optimal reduced cost, Template pricing tries to maximize the similarity of columns with a given template vector, while restricting the search to columns with suitable reduced cost. We present an exact and heuristic method (based on Lagrangian relaxation) to efficiently solve the Template pricing problem. We conduct extensive computational experiments on benchmark instances of the Generalized Assignment Problem (GAP). Our results demonstrate that Template pricing can significantly accelerate the CG algorithm, especially in the presence of significant degeneracy, where several benchmark GAP instances solved over 1000x faster than Dantzig pricing, and over 100x with adaptive dual-smoothing. Template pricing allows us to achieve CG optimal bounds on all 1735 ISA instances, finding stronger bounds in 43% and improved integer solutions in 9% of these instances than previously released.
Read the full abstract

Information Theory

Vectorized Gaussian Belief Propagation for Near Real-Time Fully-Distributed PMU-Based State Estimation

Electric power systems require accurate, scalable, distributed, and near real-time state estimation (SE) to support reliable monitoring and control under increasingly complex operating conditions. Limited monitoring capabilities can lead to inefficient operation and, in extreme cases, large-scale disturbances such as blackouts. To address these challenges, this paper proposes a vectorized Gaussian belief propagation (GBP) framework for phasor measurement unit-based SE, formulated over factor graphs and specifically designed to support distributed and near real-time monitoring. The proposed framework includes multivariate and fusion-based GBP formulations. The multivariate formulation jointly models related state variables and their measurement relationships, while the fusion-based formulation reduces factor graph complexity by combining multiple measurements associated with the same set of variables, resulting in a structure that more closely reflects the underlying electrical coupling of the power system. The resulting algorithms operate in a fully distributed manner at the bus level and achieve fast convergence and high estimation accuracy, often within a few iterations, as demonstrated by numerical results on systems ranging from 60 to 13659 buses, where the fusion-based formulation achieves single-digit millisecond iteration times on the largest test case.
Read the full abstract

All authors Mirsad Cosovic, Armin Teskeredzic, Antonello Monti, Dejan Vukobratovic

Optimization and Control

On Asymptotic and Finite-Time Stabilization of Bilinear Systems

This manuscript addresses the analysis and design of feedback laws for the stabilization of bilinear control systems in infinite-dimensional spaces. It first examines weak, strong, and polynomial stabilization within a Hilbert space framework, emphasizing the role of observability conditions. It then studies exponential stabilization in Banach spaces, highlighting the additional challenges arising from the lack of a Hilbertian structure. Finally, it introduces finite-time stabilization, presenting recent results and open problems within the broader context of nonlinear infinite-dimensional control theory. Several applications are also discussed.
Read the full abstract

Optimization and Control

Integral equations for the optimal boundary surface of a mean-field game of capacity expansion

We prove that the optimal boundary surface that splits the action and inaction regions in a mean-field game of capacity expansion studied in (Campi et al.,\ Ann.\ Appl.\ Probab.,\ 32(5),\, pp.\,3674-3717, 2022) is the unique continuous solution of a nonlinear integral equation of Volterra type. In order to do that, we first establish continuity of the optimal surface. Then we develop an extension of Itô's formula which weakens assumptions required in the existing literature on the first-order time-derivative and/or second-order space derivative of the value function. The paper also provides an algorithm for the numerical solution of the integral equation and we compute optimal controls numerically for the mean-field game.
Read the full abstract

Metric Geometry

The Four Color Theorem meets Shapes of Polyhedra

We consider solutions to the $4$-color problem for the vertices of sphere triangulations with degree sequence $6,...,6,4,4,4,4,4,4$. We sort these solutions into combinatorial types and show that each generic type $\tau$ is parametrized by the set of integer lattice points inside a rational polyhedral convex cone ${\cal C\/}_{\tau}$ of dimension at least 4. There is an integral quadratic form $Q_{\tau}$ on ${\cal C\/}_{\tau}$ whose diagonal part, evaluated on a lattice point, is $3$ times the number of triangles in the corresponding triangulation. We relate this structure to the octahedral stratum of Thurston's moduli space of flat cone structures on the sphere.
Read the full abstract

2604.12059 · 13 Apr · 1. This paper is still a bit rough and preliminary. 2. This paper has a big companion java program. You don't need to use the program to understand the paper, but all the insights in the paper came from the program. 3. This version corrects a few things I got wrong in the previous version, most notable that the coloring space has dimension >=4 rather than always =4