Information Theory
Non-GRS type MDS and AMDS codes from extended TGRS codes
Meiying Zhang, Shudi Yang and Yanbin Zheng
Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and
quantum codes because of their algebraic properties and excellent error-correcting capabilities. In this paper, we construct a class of extended twisted generalized Reed-Solomon (TGRS) codes and determine the necessary and sufficient conditions for these codes to be MDS or AMDS. Additionally, we prove that these codes are not equivalent to generalized Reed-Solomon (GRS) codes. As an application, under certain circumstances, we compute the covering radii and deep holes of these codes.
Read the full abstract ▾
Analysis of PDEs
Asymptotic models for viscoelastic one-dimensional blood flow
Diego Alonso-Orán, Rafael Granero-Belinchón and Carlos Yanes Pérez
We derive a unidirectional asymptotic model for one-dimensional blood flow in viscoelastic arteries. We prove local well-posedness of strong solutions in Sobolev spaces for general parameters and mean-zero periodic data. In the purely elastic BBM regime we further establish global existence and exponential decay for sufficiently small initial data. We also present a numerical study of the reduced model, including comparisons across different viscoelastic and amplitude regimes, and discuss the observed dynamics in connection with the continuation criterion.
Read the full abstract ▾
Optimization and Control
Intrinsic perturbation scale for certified oracle objectives with epigraphic information
Karim Bounja, Boujemaâ Achchab and Abdeljalil Sakat
We introduce a natural displacement control for minimizer sets of oracle objectives equipped with certified epigraphic information. Formally, we replace the usual local uniform value control of objective perturbations - uncertifiable from finite pointwise information without additional structure - by the strictly weaker requirement of a cylinder-localized vertical epigraphic control, naturally provided by certified envelopes. Under set-based quadratic growth (allowing nonunique minimizers), this yields the classical square-root displacement estimate with optimal exponent 1/2, without any extrinsic assumption.
Read the full abstract ▾
Differential Geometry · Cross-listed from hep-th
Vortex Harmonic Spinors on the Nappi-Witten Space
Calum Ross and Raúl Sánchez Galán
We establish a correspondence between
vortex equations on flat Riemann surfaces and harmonic spinors on the Nappi–Witten space, the group
manifold of a central extension of the Euclidean group $SE(2)$.
Vortex configurations lift naturally to this setting, producing explicit solutions of a twisted Dirac equation. Using the conformal flatness of the Nappi–Witten metric, these solutions induce harmonic spinors on four-dimensional Minkowski space. This yields a
geometric construction of Abelian
magnetic zero-modes on flat Minkowski spacetime from
vortex data.
Read the full abstract ▾
Algebraic Topology
A Global Model Structure for $\mathbb{K}$-Linear $\infty$-Local Systems
Hisham Sati and Urs Schreiber
Parameterized stable homotopy theory organizes local systems of spectra over homotopy types, governed by a "yoga" of six functors. To provide semantics for the recently developed Linear Homotopy Type Theory (LHoTT), good model categories of these spectra are required, preferably monoidal with respect to the external smash product. We focus on the case of parameterized $H\mathbb{K}$-module spectra ($\infty$-local systems), motivated by recent applications of parameterized homotopy to topological
quantum computing. While traditionally treated via dg-categories, we leverage combinatorial model structures on simplicial chain complexes to construct the first dedicated global model structure for $\mathbb{K}$-linear $\infty$-local systems, which offers better control than existing models for general parameterized spectra. In particular, when restricted to base 1-types, our model structure is monoidal with respect to the external tensor product, making it a candidate target semantics for the multiplicative fragment of LHoTT.
Read the full abstract ▾
Probability
Persistence probabilities of autoregressive chains with continuous innovations
Titouan Donnart and Thomas Simon
We consider the persistence probabilities of an autoregressive chain of order one with continuous innovations. In the case of positive drifts, we show that these persistence probabilities are compound-
geometric and satisfy a Baxter-Spitzer factorization generalizing that of the random walk. In the case of negative drifts, we exhibit a discrete Van Dantzig problem, which implies that the Baxter-Spitzer factorization never happens, except in a degenerate case. For positive drifts and log-concave innovations, we show that the first passage time in $(-\infty,0)$ has a log-convex distribution, whereas in the case of negative drifts and log-convex innovations on ${\mathbb R}^+$, it has a log-concave distribution. The case of the bi-exponential innovations is studied in detail, which leads for positive drifts to an additive factorization of the exponential law.
Read the full abstract ▾
Algebraic Geometry
The Pandharipande-Thomas rationality conjecture for superpositive curve classes on projective complex 3-manifolds
Reginald Anderson and Dominic Joyce
Let $X$ be a projective complex 3-
manifold. An effective curve class $\beta\in H_2(X,\mathbb Z)$ is called positive if $c_1(X)\cdot\beta>0$, and superpositive if all the effective summands of $\beta$ are positive. If $X$ is Fano then all curve classes are superpositive. In arXiv:2111.04694 the second author developed a theory of enumerative invariants in abelian categories and wall-crossing formulae. We use this theory to prove
conjectures by Pandharipande and Thomas on the rationality and poles of generating functions of Pandharipande-Thomas invariants of $X$ with descendent insertions, for superpositive curve classes.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.DS
Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
Afrouz Jabal Ameli, Jesper Nederlof and Shengzhe Wang
We provide improved space-time tradeoffs for permutation problems over additively idempotent semi-rings. In particular, there is an
algorithm for the Traveling Salesperson Problem that solves $N$-vertex instances using space $S$ and time $T$ where $S\cdot T \leq 3.1861^{N}$. This improves a previous work by Koivisto and Parviainen [SODA'10] where $S\cdot T \leq 3.9271^N$, and overcomes a barrier they identified, as their bound was shown to be optimal within their framework. To get our results, we introduce a new parameter of a set system that we call the chain efficiency. This relates the number of maximal chains contained in the set system with the cardinality of the system. We show that set systems of high efficiency imply efficient space-time tradeoffs for permutation problems, and give constructions of set systems with high chain efficiency, disproving a
conjecture by Johnson, Leader and Russel [Comb. Probab. Comput.'15].
Read the full abstract ▾
Algebraic Geometry
Stable maps, multiplicities, and compactified Jacobians
Yifan Zhao
Let $C$ be a complex projective integral curve with planar singularities. In this note, we study numerical relations among its versal deformation space,
moduli space of stable maps, and compactified Jacobian. In particular, we correct a statement by Fantechi–Göttsche–van Straten on the multiplicity of the $\delta$-constant stratum of the versal deformation space at $[C]$. We also give a necessary and sufficient condition for the original claim to hold.
Read the full abstract ▾
Dynamical Systems
Computing Families of Periodic Solutions of the 4- and 6-Body Problems Using an Adaptive Gradient-Free Stochastic Method
Oscar Perdomo
In this paper, we numerically compute planar periodic motions of the 4- and 6-body problems. We consider a 4-body configuration formed by two opposite pairs of bodies and a 6-body configuration formed by two equilateral triangles. More generally, for two regular $k$-gons with masses $1$ and $m_2$ in the respective groups, we derive a system of four second-order differential equations for two radial and two angular variables; for $k=2$, the groups are opposite pairs. With $r_1(0)=1$, the periodicity conditions lead to an overdetermined nonlinear system consisting of eight return equations in five unknowns. We show that, for collision-free solutions, four
symmetry conditions at $H=T/2$ imply these eight equations. For prescribed mass ratio and angular advance, we solve the resulting four equations in four unknowns using Newton's method. An adaptive
stochastic black-box procedure, which uses only function evaluations, provides initial approximations. The method searches for solutions by sampling in an anisotropic box whose dimensions adapt using information from previous successful iterations. Exact satisfaction of the return conditions gives a motion that repeats up to rotation and relabeling; an angular advance that is a rational multiple of $2\pi$ then gives a periodic motion. We report numerical examples and check the return residuals of the printed initial conditions using both the reduced equations and independent integrations of the full Cartesian equations.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.DS
Improved space-time tradeoff for TSP via extremal set systems
Justin Dallant and László Kozma
The traveling salesman problem (TSP) is a cornerstone of combinatorial optimization and has deeply influenced the development of algorithmic techniques in both exact and approximate settings. Yet, improving on the decades-old bounds for solving TSP exactly remains elusive: the dynamic program of Bellman, Held, and Karp from 1962 uses $2^{n+O(\log{n})}$ time and space, and the divide-and-conquer approach of Gurevich and Shelah from 1987 uses $4^{n + O(\log^2{n})}$ time and
polynomial space. A straightforward combination of the two
algorithms trades off $T^{n+o(n)}$ time and $S^{n+o(n)}$ space at various points of the curve $ST = 4$. An improvement to this tradeoff when $2 < T < 2\sqrt{2}$ was found by Koivisto and Parviainen (SODA 2010), yielding a minimum of $ST \approx 3.93$. Koivisto and Parviainen show their method to be optimal among a broad class of partial-order-based approaches, and to date, no improvement or alternative method has been found. In this paper we give a tradeoff that strictly improves all previous ones for all $2 < T < 4$, achieving a minimum of $ST < 3.572$. A key ingredient is the construction of sparse set systems (hypergraphs) that admit a large number of maximal chains. The existence of such objects is of independent interest in extremal combinatorics, likely to see further applications. Along the way we disprove a combinatorial
conjecture of Johnson, Leader, and Russell from 2013, relating it with the optimality of the previous tradeoff schemes for TSP. Our techniques extend to a broad class of permutation problems over arbitrary semirings, yielding improved space-time tradeoffs in these settings as well.
Read the full abstract ▾
Numerical Analysis
Long-time behavior of exact and numerical solutions of stochastic evolution equations on the sphere
David Cohen, Björn Müller and Andrea Papini
We investigate the long-time behavior of exact solutions and numerical approximations of linear
stochastic evolution equations defined on the sphere. We focus on three classical models arising in mathematical physics: the
stochastic wave equation, the
stochastic Schrödinger equation, and the
stochastic Maxwell's equations. For these SPDEs, we analyze several widely used time integrators with respect to trace formulas describing the
evolution of physically relevant quantities such as energy, mass, and momentum dependent on the forcing term. In particular, we prove that the forward and backward Euler-Maruyama schemes fail to reproduce the correct long-time behavior of the exact solutions. In addition, we prove that the
stochastic exponential integrator preserves the correct long-time behavior of the physical quantities of interest. Finally, several numerical experiments are provided to illustrate our theoretical findings.
Read the full abstract ▾
Optimization and Control
Parametric Nonconvex Optimization via Convex Surrogates
Renzi Wang, Panagiotis Patrinos and Alberto Bemporad
This paper presents a novel learning-based approach to construct a surrogate problem that approximates a given parametric nonconvex optimization problem. The surrogate function is designed to be the minimum of a finite set of functions, given by the composition of convex and monotonic terms, so that the surrogate problem can be solved directly through parallel convex optimization. As a proof of concept, numerical experiments on a nonconvex path tracking problem confirm the approximation quality of the proposed method.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Optimality Robustness in Koopman-Based Control
Yicheng Lin, Bingxian Wu, Nan Bai et al. (+3 more)
The Koopman operator enables simplified representations for nonlinear systems in data-driven optimal control, but the accompanying uncertainties inevitably induce deviations in the optimal controller and associated value function. This naturally raises the question of how such uncertainty-induced optimality deviation can be quantified and mitigated. To address this problem, we adopt a unified analysis-to-design perspective that connects the characterization of optimality robustness with its improvement through controller design. At the analysis level, we establish a unified treatment of multiple uncertainty sources in Koopman-based control, where approximation error and noisy data are incorporated into a common robustness analysis through a norm-bounded representation. At the design level, we develop a robustness-aware optimal control methodology that provably reduces such optimality deviations, thereby enhancing robustness while explicitly revealing a quantitative trade-off between nominal optimality and robustness. As for practical implementation aspect, we further propose a tractable policy iteration
algorithm, whose well-posedness and convergence are established via vanishing viscosity regularization and
elliptic partial differential equation (PDE) techniques. Numerical examples validate the theoretical findings and demonstrate the effectiveness of proposed methodology.
Read the full abstract ▾
All authors Yicheng Lin, Bingxian Wu, Nan Bai, Yunxiao Ren, Zhongkui Li, Zhisheng Duan
Optimization and Control
Consensus-based optimization with $\alpha$-stable jump processes
Pedro Aceves-Sanchez, Giacomo Albi, Federica Ferrarese et al. (+1 more)
In this paper, we introduce a CBO method that incorporates jumps driven by an $\alpha$-stable
stochastic process within a kinetic framework. This approach naturally induces nonlocal
stochastic effects, enhancing the exploration capabilities of the method. We formulate the dynamics at the particle level, providing a detailed description of the associated
stochastic system and its asymptotic behavior. In particular, by means of a
Fourier-based representation, we derive the corresponding fractional Fokker-Planck equation, which captures the nonlocal
diffusion mechanisms generated by $\alpha$-stable processes. As a central result, we establish a rigorous convergence analysis for the proposed method. Finally, we assess its performance through a series of numerical experiments, highlighting the effectiveness of $\alpha$-stable jump dynamics and their advantages over standard
diffusion based strategies, especially in complex optimization landscapes.
Read the full abstract ▾
All authors Pedro Aceves-Sanchez, Giacomo Albi, Federica Ferrarese, Michael Herty
Complex Variables
Olivier Benoist
We prove that the singular
cohomology with finite coefficients of a finite-dimensional Stein space $S$ is isomorphic to the étale
cohomology of the Stein
algebra $\mathcal{O}(S)$. We deduce that any class in $H^k(S,\mathbb{Z})$ comes from an algebraic variety by pullback by a holomorphic map (if $k\geq 1$), and vanishes on the complement of a nowhere dense closed analytic subset of $S$ (if $k\geq 2$).
Read the full abstract ▾
Number Theory
On the computation of base-change lifts and lifts of Hida families
Iván Blanco-Chacón, Luis Dieulefait and Antti Haavikko
We derive an explicit formula for the Hecke
eigenvalues of a
Hilbert modular form which is a base-change lift of a classical newform to a totally real number field. We show that for a totally real Galois number field $F$ the $L$-function of a base-change lifted form can be factorized as a product of twists of the $L$-function of the underlying classical form over irreducible representations of $\mathrm{Gal}(F / \mathbb{Q})$. Moreover, we use the formula for the Hecke
eigenvalues of a base-change lift to prove the existence of a base-change lift of a Hida family. In particular, we show that a Hida family of classical Hecke eigenforms can be lifted to a formal power series that specializes to the base-change lifts of the Hida family of classical cusp forms.
Read the full abstract ▾
Dynamical Systems · Cross-listed from gr-qc
Persistence and Transition Varieties in Scalar Field Cosmology
Spiros Cotsakis
We develop a unified bifurcation-theoretic description of Friedmann–Robertson–Walker cosmologies with a scalar field, a barotropic fluid of index $\gamma$, and spatial
curvature. For the exponential potential $V(\phi)=V_0e^{\lambda\phi}$, the slope $a=\sqrt{3/2}\,\lambda$ is a distinguished parameter, and the local phase portrait is organised by the loci $|a|=3$, $a^2=3$, $a^2=\tfrac92\gamma$, $\gamma=\tfrac23$, and $\gamma=2$, corresponding to kinetic,
curvature, scalar–fluid exchange, and degeneracy thresholds. For the quadratic potential $V(\phi)=\tfrac12m^2\phi^2$, the effective slope is dynamical. We introduce the bounded variable $\zeta=\arctan\lambda$, obtaining a closed autonomous four-dimensional system in $(X,Y,\Omega_k,\zeta)$ without time-rescaling. This exposes invariant gates, robust
equilibrium continua, and $\gamma$-thresholds controlling loss and recovery of normal hyperbolicity. Near the organising loci we compute translated jets, perform centre(-like) reductions, and derive canonical normal forms governing persistence and transitions. These are assembled into an explicit stratification of the exponential parameter plane and a pull-back stratification for the massive extensions, with physical path maps into the corresponding unfolding charts. The framework shows how fluid and
curvature modes provide deformation directions within the FRW class and yields a regime-level interpretation: slow roll and ultra slow roll arise as persistent attracting balances and nonhyperbolic bottleneck passages, while quadratic invariant slices recover the oscillatory periodic-orbit/invariant-
torus sector. It also organises critical slowing,
curvature leakage, tracker exchange, and admissible sequences of such episodes along massive trajectories.
Read the full abstract ▾
Dynamical Systems
On the loss of upper semi-continuity of metric entropy for $C^{r}$ diffeomorphisms
Xinyu Bai, Wanshan Lin and Xueting Tian
In this article, we give an upper bound estimate for the quantitative loss of upper semicontinuity of metric
entropy for $C^r\:(r>1)$ diffeomorphisms. Building on earlier
entropy estimates and reparametrization methods, we optimize the upper bound estimate with respect to both dimension and asymptotic Lipschitz constant. Motivated by examples of Newhouse and Buzzi, we show that the estimate is sharp.
Read the full abstract ▾
Combinatorics
Forbidding Exactly One Hamming Distance
József Balogh, Ce Chen and Bowen Li
Addressing questions raised in recent papers, we study the $r$-distance graph $H_r(n)$ on the Boolean cube $\{0,1\}^n$, where two vertices are adjacent if their Hamming distance is exactly $r$. For fixed integers $s \ge 2$ and even $r \ge 2$, we determine the asymptotic order of the $s$-independence number $\alpha_s(H_r(n))$, showing that \[ \alpha_s\left(H_r(n)\right)=\Theta\left(\frac{2^n}{n^{r/2}}\right). \] The upper bound is derived via a reduction to extremal problems for sunflower-free set systems, while the lower bound is obtained using algebraic constructions based on BCH codes and constant-weight codes.
Read the full abstract ▾
Functional Analysis
Hartman-Stampacchia theorem, Gale-Nikaido-Debreu lemma, and Brouwer and Kakutani fixed-point theorems
Pascal Gourdel, Cuong Le Van, Ngoc-Sang Pham et al. (+1 more)
This paper uses the Hartman-Stampacchia
theorems as the primary tool to prove the Gale-Nikaidô-Debreu lemmas. It also establishes a cycle of equivalences among the Hartman-Stampacchia
theorems, the Gale-Nikaidô-Debreu lemmas, and Kakutani and Brouwer fixed-point
theorems.
Read the full abstract ▾
All authors Pascal Gourdel, Cuong Le Van, Ngoc-Sang Pham, Cuong Tran Viet
Mathematical Physics
On some topological and spectral properties of kinetic Langevin processes driven by Lévy noises
T Batisse, A Guillin, B Nectoux et al. (+1 more)
We investigate several fundamental properties of kinetic Langevin processes in $\mathbb{R}^{2d}$, defined as solutions to the following system: $$dx\_t = v\_t \, dt, \qquad dv\_t = \mathbf{B}(x\_t, v\_t) \, dt + dL\_t$$ where $(L\_t, t \ge 0)$ is a pure-jump Lévy process. Our analysis covers both the original process and its killed counterpart, where killing occurs upon exiting domains of the form $\mathscr{D} = \mathscr{O} \times \mathbb{R}^d$ for an arbitrary open set $\mathscr{O} \subset \mathbb{R}^d$. Operating within a low-regularity framework - where the drift $\mathbf{B}$ is not assumed to be continuous - we establish key structural and spectral properties for both the associated non-killed and killed
semigroups. These include: the strong Feller property, weak continuity of trajectories with respect to initial conditions, topological irreducibility and the existence of a spectral gap. Furthermore, we prove, in this low-regularity framework, the existence and uniqueness of a weak solution when the driving noise is a rotationally invariant $\alpha$-stable process, when $\alpha \in (1,2)$. For this specific case, we show that the aforementioned properties hold and further establish the existence of densities within certain $L^m$ spaces as well as the Feller $C\_0(\mathbb R^{2d})$-
semigroup property. Finally, we address the existence and uniqueness of stationary and quasi-stationary distributions, proving exponential ergodicity for the non-killed process and exponential convergence to the quasi-stationary limit for the conditioned process. We show that these results extend to every $\alpha \in (0,1]$ when the drift is smooth.
Read the full abstract ▾
All authors T Batisse, A Guillin, B Nectoux, L Wu
Geometric Topology
Minimal Generating Sets of Singular Reidemeister Moves and Their Classification
Noboru Ito and Yuichiro Iwamoto
Singular
knot theory extends classical
knot theory by allowing transverse double points without over/under information, together with singular Reidemeister moves of types IV and V. A central open problem in this theory is to determine the minimal generating sets of oriented singular Reidemeister moves. In this paper, we completely solve this problem. In addition, we establish independence results for singular Reidemeister moves by introducing an invariant that provides obstructions and lower bounds for generating sets, including the independence of type III from types I, II, IV, and V. More precisely, starting from a minimal generating set of ordinary Reidemeister moves of types I–III, we prove that the singular moves admit exactly $96$ distinct inclusion-minimal generating sets, and that these exhaust all possibilities. Our proof introduces a new invariant for singular links, constructed via a projection to self-singular links, which detects the distinction between the two families of type IV moves and provides an obstruction for generating type V moves from types I–IV. We also determine the unoriented case, where the classification collapses to exactly $8$ minimal generating sets.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.AI
ResearchEVO: An End-to-End Framework for Automated Scientific Discovery and Documentation
Zhe Zhao, Haibin Wen, Jiaming Ma et al. (+4 more)
An important recurring pattern in scientific breakthroughs is a two-stage process: an initial phase of undirected experimentation that yields an unexpected finding, followed by a retrospective phase that explains why the finding works and situates it within existing theory. We present ResearchEVO, an end-to-end framework that computationally instantiates this discover-then-explain paradigm. The
Evolution Phase employs LLM-guided bi-dimensional co-
evolution – simultaneously optimizing both algorithmic logic and overall architecture – to search the space of code implementations purely by fitness, without requiring any understanding of the solutions it produces. The Writing Phase then takes the best-performing
algorithm and autonomously generates a complete, publication-ready research paper through sentence-level
retrieval-augmented generation with explicit anti-
hallucination verification and automated experiment design. To our knowledge, ResearchEVO is the first system to cover this full pipeline end to end: no prior work jointly performs principled
algorithm evolution and literature-grounded scientific documentation. We validate the framework on two cross-disciplinary scientific problems –
Quantum Error Correction using real Google
quantum hardware data, and Physics-Informed Neural Networks – where the
Evolution Phase discovered human-interpretable algorithmic mechanisms that had not been previously proposed in the respective domain literatures. In both cases, the Writing Phase autonomously produced compilable LaTeX manuscripts that correctly grounded these blind discoveries in existing theory via RAG, with zero fabricated citations.
Read the full abstract ▾
All authors Zhe Zhao, Haibin Wen, Jiaming Ma, Jiachang Zhan, Tianyi Xu, Ye Wei, Qingfu Zhang
Analysis of PDEs
Fully nonlinear elliptic PDEs in thin domains with oblique-Dirichlet mixed boundary conditions
Isabeau Birindelli, Ariela Briani and Hitoshi Ishii
We consider asymptotic behavior of solutions to the oblique-Dirichlet mixed boundary conditions without the strict monotonicity of the equation in the variable corresponding to the unknown function for "thin domains" i.e. when the N+1 dimensional domains collapse to an N dimensional domain. A global ellipticity condition in the limit equation is introduced.
Read the full abstract ▾
Functional Analysis
A note on attaining diameter two properties in Lipschitz-free spaces
Jaan Kristjan Kaasik
We prove that in Lipschitz-free spaces the strong diameter two property, the diameter two property, and the local diameter two property coincide with their corresponding attaining variants.
Optimization and Control
Scaled Graph Containment for Feedback Stability: Soft-Hard Equivalence and Conic Regions
Eder Baron-Prada, Julius P. J. Krebbekx, Adolfo Anta et al. (+1 more)
Scaled graphs (SGs) offer a
geometric framework for feedback stability analysis. This paper develops containment conditions for SGs within multiplier-defined regions, addressing both circular and conic geometries. For circular regions, we show that soft and hard SG containment are equivalent whenever the associated multiplier is positive-negative. This enables hard stability certification from soft computations alone, bypassing both the positive semidefinite storage constraint and the homotopy condition of existing methods. Numerical experiments on systems with up to 300 states demonstrate computational savings of 15-44 % for the circular containment framework. We further characterize which conic regions are hyperbolically convex, a condition our frequency-domain certificate requires, and demonstrate that such regions provide tighter SG bounds than circles whenever the operator SG is nonsymmetric.
Read the full abstract ▾
All authors Eder Baron-Prada, Julius P. J. Krebbekx, Adolfo Anta, Florian Dörfler
Optimization and Control
Accelerating Full-Scale Nonlinear Model Predictive Control via Surrogate Dynamics Optimization
Perceval Beja-Battais, Guillaume Dupré, Alain Grossetête et al. (+1 more)
Driven by advances in hardware and software technologies, nonlinear model predictive control (NMPC) has gained increasing adoption in both industry and academia over the past decades. However, its practical deployment is often limited by the computational cost of simulating the embedded process model, especially for high-dimensional, multi-time-scale, or nonlinear systems commonly found in real-world applications. Thus, this paper introduces Surrogate Dynamics Optimization (SDO), a warm-start framework for full-scale NMPC to address the limitation of standard initialization strategies. The approach relies on a machine learning surrogate model to solve a lightweight auxiliary problem that approximates the original one. The methodology is reproducible and compatible with inhouse simulation and optimization tools, a key consideration in industrial contexts. Data efficiency of SDO, as well as the impact of surrogate design on the overall performance, are evaluated through a non-trivial simulation case study: 24-hour optimal load-following control of a pressurized water reactor. The results show consistent improvements in NMPC convergence speed within a fixed computational budget, while reducing training data generation costs by two orders of magnitude compared to behavior cloning.
Read the full abstract ▾
All authors Perceval Beja-Battais, Guillaume Dupré, Alain Grossetête, Nicolas Vayatis
Number Theory
Partial sums of random multiplicative functions with supercritical divisor twists
Jad Hamdan
Let $f$ be a Steinhaus random multiplicative function, and for $\alpha\in \mathbb{R}$, let $d_\alpha$ denote the $\alpha$-divisor function. For $\alpha \in (1,2)$ we establish that $$ \mathbb{E}\bigg\{\Big|\frac{1}{\sqrt{x}}\sum_{n\leq x} d_\alpha(n)f(n)\Big|^{2q}\bigg\} \ll \frac{(\log x)^{2q(\alpha-1)}}{(\log\log x)^{3\alpha q/2}(1-\alpha q)+1} $$ uniformly for $q\in [0,1/\alpha]$ and all large $x$. This matches predictions from the theory of supercritical Gaussian multiplicative chaos, and provides an analogue of a seminal result of Harper corresponding to the critical ($\alpha=1$) case. Our approach is based on studying the measure of level sets of an Euler product associated with $f$, and yields a short proof of Harper's upper bound at $\alpha=1$ (implying Helson's
conjecture at $q=1/2$). As an additional application, we obtain a conjecturally sharp bound for the pseudomoments of the Riemann
zeta function in a certain parameter range, showing that $$ \lim_{T\to\infty}\frac{1}{T}\int_T^{2T} \bigg|\sum_{n\leq x}\frac{d_\alpha(n)}{n^{1/2+it}}\bigg|^{2q} \mathrm{d}t \ll \frac{(\log x)^{2q(\alpha-1)}}{(\log\log x)^{3\alpha q/2}}, $$ for $\alpha\in (1,2)$ and small $q>0$. This answers a question of Gerspach.
Read the full abstract ▾
Classical Analysis and ODEs
Some analytic properties of the partial theta function
Vladimir Petrov Kostov
We prove new properties of the zero set of Ramanujan's partial theta function $\theta (q,x):=\sum _{j=0}^{\infty}q^{j(j+1)/2}x^j$, $q\in (-1,0)\cup (0,1)$, $x\in \mathbb{R}$. We show that for each $q\in (0,1)$, there exists a line Re$x=-a$, $a\geq 5$, such that all real zeros of $\theta(q,.)$ lie to its left and all complex zeros to its right. A similar property is proved for $q\in (-1,0)$. For $q\in (0,1)$, there are no real zeros $\geq -6$. For $q\in (-1,0)$, there are no negative zeros $\geq -2.4$ and no positive zeros $\leq 2.4$, except the smallest one.
Read the full abstract ▾