Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 6 May

Probability

Can the $L^1$-$L^\infty$ duality be restored for non-dominated families of probability measures?

The duality $L^{\infty}\simeq (L^{1})'$ frequently breaks down in the presence of model uncertainty, where a single reference measure $P$ is replaced by a non-dominated family of probability measures $\mathcal{P}$. The unavailability of classical measure-theoretic and functional-analytic tools in this regime poses a significant obstacle to developing robust probabilistic frameworks. We show that this duality can be restored for a broad class of robust statistical models by extending the underlying probability space. Specifically, on the extended model, the space $\mathbb{L}^{\infty}(\mathcal{P})$ of $\mathcal{P}$-quasi-surely bounded functions is isometrically isomorphic to the dual of the space of finite signed measures absolutely continuous with respect to at least one element of $\mathcal{P}$. The proposed extension is canonical: it is the smallest $\mathcal{P}$-complete extension of the original $\sigma$-algebra for which $\mathbb{L}^{\infty}(\mathcal{P})$ is the dual of any normed space. Our assumptions encompass several prominent non-dominated settings, including infinite product measures, Gaussian processes, the Black-Scholes model with uncertain constant volatility and drift, robust binomial models, and, more generally, infinite sequences from any parametric model with almost surely estimable parameters. Furthermore, we unify the existing frameworks of Cohen (2012) and Liebrich et al. (2022), demonstrating that our construction is equivalent to the capacity-based approach under mild assumptions satisfied by the aforementioned examples. Finally, we apply our theory to extend Kraft's (1955) characterization of strictly unbiased hypothesis tests to non-dominated cases.
Read the full abstract

Rings and Algebras

Symmetric Bessmertnyĭ Realizations and Field Extension Problems in Characteristic 2 - A Differential Algebra Approach

We present a short, purely algebraic proof of the Symmetric Bessmertnyĭ Realization Theorem in the characteristic $2$ case recently proved in [EOW26]. Symmetric Bessmertnyĭ realizations are Schur complements of affine linear symmetric matrix pencils, and they arise naturally as state-space representations in linear systems theory. In contrast with the algorithmic approach in [EOW26], we use differential algebra: by defining formal partial derivatives on multivariate rational functions over fields of positive characteristic and considering their corresponding field of constants, we obtain scalar criteria for symmetric and homogeneous symmetric realizability in characteristic $2$, effectively reducing the matrix-valued problem to its diagonal entries. As a consequence, we prove a new theorem on the field extension problem for symmetric and homogeneous symmetric Bessmertnyĭ realizations. Finally, in the scalar case, we identify realizable rational functions with vector spaces over appropriate fields of constants and quantify the abundance of counterexamples in characteristic $2$.
Read the full abstract

Combinatorics

An Andrews-Gordon Type Identity Related to Andrews' Parity Consideration

Andrews investigated parity conditions in the Rogers-Ramanujan-Gordon theorem. Under the conditions that even parts or odd parts appear an even number of times, Andrews discovered two Rogers-Ramanujan-Gordon type partition theorems and derived corresponding generating functions. In the Rogers-Ramanujan-Gordon theorem, there are two parameters $k$ and $a$, where $k-1$ is the maximum number of consecutive parts $l$ and $l+1$, and $a-1$ is the maximum number of parts equal to $1$. Andrews' first theorem deals with the case $k\equiv a \;(\rm{mod}\;2)$, while the second theorem concerns the case where $k$ is even and $a$ is odd. These two partition identities have different infinite product forms on the right-hand side. In this paper, we consider the case $k\not\equiv a \;(\rm{mod}\;2)$ and use Bailey's lemma to obtain an Andrews-Gordon type identity whose right-hand side coincides with that of Andrews' identity for the case $k\equiv a \;(\rm{mod}\;2)$. By fixing the number of peaks of the corresponding lattice paths, we also derive a recurrence system whose solution agrees with the product-side generating function. We were unable to find a suitable combinatorial interpretation of the infinite sum form of this expression in terms of partitions, but with the help of lattice paths, we provide an appropriate combinatorial interpretation. Finally, we prove this identity analytically by applying Bailey's lemma.
Read the full abstract

All authors Robert X.J. Hao, Xiaorui Niu, Doris D.M. Sang, Diane Y.H. Shi

Dynamical Systems · Cross-listed from cs.CE

From Classical to Quantum-Mechanical Data Assimilation: A Comparison between DATO and QMDA

Data assimilation provides a systematic framework for combining dynamical models with partial and noisy observations to infer the evolving state of a system. In this work, we undertake a comparative study of Data Assimilation with Transfer Operators (DATO) and Quantum Mechanical Data Assimilation (QMDA), focusing on their mathematical formulation, algorithmic structure, and empirical performance. Both methods are first cast within a common operator-theoretic framework, which makes it possible to compare, on a unified basis, their representations of uncertainty, forecast propagation, and assimilation updates. We then analyse their principal similarities and differences with respect to state-space structure, update mechanisms, structural preservation properties, and computational cost. To complement the theoretical analysis, we assess both approaches on benchmark dynamical systems across a range of observational settings, including noisy, sparse, and partially observed regimes. Our results show that, despite their shared operator-theoretic motivation, DATO and QMDA embody substantially different assimilation paradigms, leading to distinct advantages and limitations in terms of interpretability, robustness, and scalability. The present study helps delineate the regimes in which each framework is most effective and offers broader insight into the design of operator-based methodologies for data assimilation.
Read the full abstract

All authors Emanuele Donno, Giovanni Conti, Paolo Oddo, Silvio Gualdi, Luca Mainetti, Giovanni Aloisio

Combinatorics

Spectral radius and perfect k-matchings in t-connected graphs

A $k$-matching of a graph $G$ is a function $f:E(G)\rightarrow\{0,1,2,\ldots,k\}$ with $\sum\limits_{e\in E_G(v)}f(e)\leq k$ for each vertex $v$ of $G$, where $E_G(v)$ is the set of edges incident with $v$ in $G$. A perfect $k$-matching of a graph $G$ is a $k$-matching $f$ satisfying $\sum\limits_{e\in E_G(v)}f(e)=k$ for any vertex $v$ of $G$. A fractional perfect matching of a graph $G$ is a function $f:E(G)\rightarrow [0,1]$ satisfying $\sum\limits_{e\in E_G(v)}f(e)=1$ for any $v\in V(G)$. We denote by $\rho(G)$ the spectral radius of $G$. In this paper, we put forward a tight spectral radius condition for a $t$-connected graph to possess a perfect $k$-matching and a tight spectral radius condition for the existence of a perfect $k$-matching in a $t$-connected graph with a fractional perfect matching.
Read the full abstract

Probability

First server's effect on the expected number of games in tennis

We show that information on the first server influences the expected total number of games and margin in a tennis match under the standard assumption that each player's serve point win probability remains constant, and identify the exact regions, in terms of these probabilities, in which this effect is non-negligible. We confirm numerically that this effect is bounded by at most $0.4$ games at both the set and match level. This translates, for example, to roughly a $9$ percent shift in the probability that a match exceeds $19.5$ games when the players' serve point win probabilities differ by $10$ percent. We complement the analysis with an empirical comparison on professional match data, illustrating the adequacy of the constant-probability assumption for modelling the total number of games.
Read the full abstract

Information Theory

Phased Ultra Massive Array (PUMA)

This paper proposes a novel multiple-access framework, termed the phased ultra massive antenna array (PUMA), which exploits the distinctive spatial flexibility of fluid antenna systems (FAS) at the user equipment (UE). Building upon fluid antenna multiple access (FAMA) and compact ultra-massive antenna array (CUMA), PUMA incorporates a phased array for signal aggregation. This architecture enables the UE to inherently mitigate co-user interference within the spatial domain without necessitating channel state information (CSI) for precoding at the base station (BS) or complex interference cancellation at each UE. A primary advantage of PUMA lies in its hardware efficiency: by implementing phase shifting and signal combining in the analog domain, it achieves high antenna gain while requiring only a minimal number of radio-frequency (RF) chains, potentially a single RF chain. Comprehensive theoretical analysis of the achievable data rate is provided, complemented by extensive simulations that validate the framework. The results demonstrate that PUMA markedly outperforms FAMA and CUMA architectures, particularly for UEs with a single RF chain, offering a robust and scalable solution for interference-insensitive massive connectivity in sixth-generation (6G) systems.
Read the full abstract

All authors Hanjiang Hong, Kai-Kit Wong, Xusheng Zhu, Chenguang Rao, Dazhi He, Hyundong Shin

Numerical Analysis

Update-Magnitude State Redistribution (UM-SRD): A Shut-off Extension of Weighted SRD for Cut-Cell Methods

Berger & Giuliani (2024) developed a provably stable weighted state redistribution (SRD) algorithm for cut-cell meshes. A key limitation of their method is that, although flux redistribution naturally vanishes when updates are small, SRD continuously applies redistribution even when the flux balance is zero, preventing exact steady-state preservation and potentially introducing unnecessary dissipation in smooth regions. This work introduces Update-Magnitude State Redistribution (UM-SRD), which blends the SRD operator with the identity operator via a smooth, locally-defined scalar indicator of the finite-volume update magnitude. UM-SRD preserves conservation and reduces exactly to the base scheme when the finite-volume update is exactly zero in a small-cell neighborhood. For a one-dimensional model problem with a single small cut cell, we prove UM-SRD is total variation diminishing under the same CFL condition as the base upwind scheme, show the local truncation error modification is higher-order in smooth regions with the unnormalized indicator, and show that the normalized implementation preserves first-order accuracy. Numerical experiments demonstrate convergence toward first order on smooth 1D and 2D advection tests, confirm shut-off behaviour, verify non-oscillatory properties, provide numerical evidence that UM-SRD stabilizes the base scheme near a small cut cell where the base scheme diverges, and confirm exact steady-state preservation. The algorithm reuses existing weighted SRD infrastructure, adding only a local blending mechanism, making it practical for cut-cell finite-volume codes.
Read the full abstract

Probability

Branching Brownian motion with rank-based selection and reaction-diffusion equations

We consider a family of branching-selection particle systems in which particles branch at time dependent rate $r$ and are killed with a probability which is dependent on their rank via some function $\psi$. We show that, under fairly minimal conditions, the hydrodynamic limit of such a system is given by the reaction-diffusion equation $U_t = \frac12 U_{xx} + r(t)G(U)$ with nonlinearity $G(U)$ which is a function of $\psi$. This is a significant generalisation of the well-studied $N$-BBM process, and is similar to the family of `$(b,D)$-BBM' processes described by Groisman & Soprano-Loto (arXiv:2008.09460). On the one hand, this allows us to understand common reaction-diffusion equations as limits of interacting particle systems with simple descriptions. On the other hand, the asymptotic behaviour of solutions of the reaction-diffusion PDEs can help us predict the asymptotic properties of the associated particle systems. We give general conditions under which the branching-selection particle system has an asymptotic velocity, and describe the velocity up to order $(\log N)^{-2}$; furthermore, we describe the connection between this velocity and the spreading speeds and travelling waves of the corresponding reaction-diffusion equation. This provides a partial weak selection principle.
Read the full abstract

Algebraic Geometry

Geometry of multilinear varieties over infinite fields and its applications

Multilinear varieties, defined as the sets of rational points of varieties cut out by multilinear functions, were first introduced and studied by Gowers and Milićević[Proc. Edinb. Math. Soc., 2021] for finite $\mathbb{K}$. In this paper, we investigate multilinear varieties over infinite fields from a geometric perspective. We establish two fundamental results: a codimension formula for the Zariski closure of a multilinear variety, and the existence of a high-dimensional irreducible subvariety passing through any given $\mathbb{K}$-rational point. These results serve as a geometric foundation for analyzing various ranks of tensors and homogeneous polynomials, including partition rank, analytic rank, geometric rank, (collective) strength and (collective) Birch rank. As applications, we resolve the Adiprasito-Kazhdan-Ziegler conjecture [arXiv:2102.03659, 2021] on the stability of partition rank for perfect infinite fields. We thereby settle the stability conjecture for collective strength [Selecta Math., 2024], as well as the conjecture on the linear equivalence between strength and Birch rank [arXiv:2410.00248, 2024] for such fields. Moreover, our results immediately yield a strengthening of the theorems of Bik-Draisma-Snowden [arXiv:2401.02067, 2024] and Lampert-Snowden [arXiv:2406.18498, 2024], for multilinear varieties over infinite fields.
Read the full abstract

Combinatorics · Cross-listed from quant-ph

W-state graphs: Structure and Algorithms

We study the class of edge-coloured graphs arising from the graph-theoretic representation of quantum photonic experiments that generate multipartite W-states. Abstracting away physical amplitudes and phases, we introduce W-state graphs: matching-covered graphs equipped with a half-edge 2-colouring such that every perfect matching contains exactly one bichromatic edge and every vertex is incident with a red half-edge. Our main contribution is a complete structural characterization of W-state graphs. We show that a graph is a W-state graph if and only if each of its 3-connected components is a W-cone, a simple and rigid building block defined by a universal vertex and a factor-critical base. This characterization implies that no W-state graph is simple and yields a recognition algorithm running as fast as verifying whether a graph is matching-covered. We also show that the natural generalization to Dicke states encounters a complexity barrier: verifying one of the two Dicke state conditions is itself coNP-complete, resolving an open problem of Vardi and Zhang [IJCAI 2023]. Our results place W-state graphs firmly within classical matching theory and precisely delineate the combinatorial structures capable of realizing idealized W-states in the experiment-graph framework.
Read the full abstract

Dynamical Systems

Residual stratification and the Cantor-Bendixson structures of dual algebraic coframes

We introduce a notion of residual derivative for elements of a preordered set, a construction that generalizes both the Frattini subgroup in algebra and the Cantor-Bendixson derivative in T1 topological spaces. For dual algebraic coframes with topologies compatible with order, we establish a partial correspondence between the Cantor-Bendixson structure of the lattice and the residual derivatives of its elements. Within this framework, we provide a complete characterization of the first two Cantor-Bendixson levels in terms of the lattice's residual structure. This provides a unified lens through which to study the Cantor-Bendixson structures of topological spaces across domains ranging from algebra to functional analysis and dynamics, facilitating the transfer of analytic techniques between them.
Read the full abstract

Optimization and Control

Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions

Recent LLM-driven discoveries have renewed interest in geometric packing problems. In this paper, we study several classes of such packing problems through the lens of modern global nonlinear optimization. Starting from comparatively direct nonlinear formulations, we consider packing circles in squares and fixed-perimeter rectangles, packing circles into minimum-area ellipses, packing regular polygons into regular polygons, and packing Platonic solids into Platonic solids. For ellipse packing, we derive a novel containment formulation based on the S-lemma. For polygon and Platonic solid packing, we develop compact non-overlap formulations based on the Farkas lemma and study several natural modeling variants computationally. Using off-the-shelf global optimization solvers, namely FICO Xpress and SCIP, we obtain numerous new incumbent solutions as well as first solutions for previously unstudied variants without any problem-specific solver modifications beyond writing down the models. Our computational results analyze the impact of various formulation choices. Beyond the individual packing results, the paper illustrates a broader point. It provides further evidence that global nonlinear optimization has matured into an increasingly practical model-and-solve technology for highly nonconvex problems.
Read the full abstract

All authors Timo Berthold, Dominik Kamp, Gioni Mexi, Sebastian Pokutta, Imre Polik

Combinatorics

Energy and Vertex Energy of Modified Divisor Prime Graphs

This paper investigates the energy and vertex energy of the modified divisor prime graph $G^*_{Dp}(n)$, which is distinguished from the standard divisor prime graph by the inclusion of a self-loop at the vertex $1$. To facilitate this analysis, we introduce a generalized definition of vertex energy for graphs with self-loops and demonstrate its mathematical consistency.
Read the full abstract

Combinatorics

Cofinality of Regular Tournaments

We show that the class of all finite regular tournaments is cofinal in the class of finite tournaments. In addition, we establish cofinality results for certain special subclasses of regular tournaments. We also provide an algorithm for constructing these regular tournaments.
Read the full abstract

All authors Omar Hatem, Sara Mohamed, Isabel Müller, Daoud Siniora

Numerical Analysis

Convergence analysis of Schwarz-like methods for degenerate elliptic-parabolic equations

Convergence is proven for Schwarz-like methods applied to degenerate elliptic-parabolic equations with a $p$-structure. This family of PDEs, e.g., arises when modelling nonlinear diffusion processes. The Schwarz-like approximation methods are based on decomposing the space-time domain into overlapping subdomains, which enables parallel implementations. The methods are derived by introducing a pseudo-time component and applying time integrators of splitting type, which are time stepped towards infinity. This approach of decomposing the space-time domain is related to Schwarz waveform relaxation methods, but the methods considered here have the advantage that they can be proven to converge when applied to nonlinear parabolic, or even degenerate elliptic-parabolic, PDEs. We prove convergence by deriving a nonlinear framework based on the abstract theory for monotone operators and the existence theory for degenerate elliptic-parabolic equations.
Read the full abstract

Analysis of PDEs

Existence of detonation wave solutions to the piston problem for the Zeldovich-von Neumann-Döring combustion model

In this paper, we study detonation wave solutions to one-dimensional piston problem for the Zeldovich-von Neumann-Döring (ZND) combustion model with a one-step exothermic chemical reaction. As a special type of shock wave, the position of the detonation wave is unknown, which make our model to be a free boundary problem.~The global existence of detonation wave solutions to this free boundary problem is proved. Compared with previous result~\cite{Lai}, we do not impose any dissipation conditions on the equations and the boundaries.
Read the full abstract

Dynamical Systems

Stability and Bifurcation Analysis of Fractional Delay Differential Equation with a Delay-dependent Coefficient

This paper investigates the stability of different regions in the $(k,\gamma)$-plane for a class of fractional delay differential equations given by \begin{equation} D^{\alpha} x(t) = -\gamma x(t) + g\big(x(t - \tau_1)\big) - e^{-\gamma \tau_2}\, g\big(x(t - \tau_1 - \tau_2)\big), \qquad 0 < \alpha \le 1, \end{equation} where $k = g'(0)$. The primary focus is on the stability of the trivial equilibrium of the corresponding linearized system. A detailed stability and bifurcation analysis is carried out for the particular case $\tau_1 = 0$ and $\tau_2 \ge 0$. Furthermore, a general result is established for the case $\tau_1 > 0$, $\tau_2 \ge 0$, which holds for all values of $\alpha$ and $\tau_1$. In addition, illustrative examples are provided in the form of stability diagrams in the $(\tau_1,\tau_2)$-plane for fixed values of $\alpha$, $k$, and $\gamma$. These diagrams are generated using appropriate numerical methods to visualize the stability regions and to support the theoretical results.
Read the full abstract

Analysis of PDEs

Renormalized Solution for the Nonlinear Parabolic Problem with Lower Order Terms

In this paper, we consider the following problem: \[ \begin{cases} -\nabla\cdot A(x,u,\nabla u) + H(x,u,\nabla u) = f(x), & x \in \Omega, u = 0, & x \in \partial \Omega, \end{cases} \] in a bounded open set \( \Omega \subset \mathbb{R}^N \). We have established certain gradient estimates and proved the existence of a renormalized solution for the equation.
Read the full abstract

Algebraic Topology

Higher Smooth Surgery Structure Sets of Complex Projective Spaces, Part I

This is the first of the two articles where we determine the higher smooth surgery structure sets of complex projective spaces (up to some extension problems) and the forgetful map to their topological versions in low dimensions. In this part, we concentrate on the free subgroup, where we obtain information in all dimensions. In the second part, we study the torsion.
Read the full abstract

Analysis of PDEs

Non-uniqueness for a differential equation

Let $f(t,x),M(t,x)\in C([0,1]^2)$ with $M(t,x)>0$. We consider differential equations of the form \[ \frac{\partial f}{\partial t}(t,x)=\frac{M(t,x)f(t,x)-M(t,0)f(t,0)}{x},\quad x>0. \] For a fixed positive weight $M$, we ask whether the condition $f(0,x)=0$ forces $f\equiv 0$. We show the answer is negative for smooth functions: there exist $f(t,x),M(t,x)\in C^{\infty}([0,1]^2)$ with $f(0,x)=0$, $f(t,0)\not\equiv 0$, and $M(t,x)>0$ satisfying the above equation. However, we show that for a Borel-Laplace class of $M(t,x)$, the equation does have uniqueness. We relate this to uniqueness/non-uniqueness theorems for weighted Laplace transforms. A key example originated in an output by ChatGPT-5.5-Pro.
Read the full abstract

Numerical Analysis

An Adaptive Finite Element Method Based on Generalized Barycentric Coordinates

This work derives a posteriori error estimate of polygonal finite element methods based on Wachspress barycentric coordinates. In particular, we prove that the classical residual-based a posteriori error estimator is both an upper and lower bounds for the discretization error. The analysis relies a Scott-Zhang type interpolation and homogeneity arguments for rational functions on polygonal elements. Numerical experiments on square and L-shaped domains demonstrate the effectiveness of the adaptive algorithm.
Read the full abstract

Probability

Revisiting the logical independence

It has been widely acknowledged that probabilistic independence and logical independence cannot be coherently reconciled. By bridging these two notions, this paper addresses three long-standing problems that have puzzled the field of probability theory: Should probability be defined prior to independence, or independence prior to probability? How ought independence to be formulated for signed measures and families of probability measures? Why do the conclusions of classical limit theorems remain valid even when practical scenarios violate their underlying assumptions? By introducing logical independence and $\sigma$-logical independence, we establish the probability extension theorem. This result not only demonstrates that independence ought to be defined before probability, but also endows logical independence with probabilistic machinery, thereby rendering it computationally tractable in the same manner as probabilistic independence. Then, we investigate how independence should be defined when multiple measures are involved. Finally, we prove that limit theorems can hold true under two intuitive conditions: $\sigma$-logical independence and identical range of random variables.
Read the full abstract

Combinatorics

An Intersection-Weighted Erdős-Ko-Rado Theorem

We consider an Erdős-Ko-Rado type sum that weights each member of a uniform family according to its smallest intersection with the rest of the family. We prove that once the ground set is sufficiently large this sum is at most one, with equality exactly for stars. This simultaneously generalizes the usual Erdős-Ko-Rado theorem for every intersection threshold $t$ and $n$ sufficiently large. As a consequence we also obtain an extension of Hilton's theorem on cross-intersecting families.
Read the full abstract

Geometric Topology

Cobordism-equivalence for codimension-one submanifolds

We show that two hypersurfaces in a manifold are related by a sequence of embedded cobordisms if and only if they represent the same homology class. By applying handle decompositions we turn these cobordisms into a sequence of embedded surgeries. Specializing to Seifert surfaces we obtain a conceptual proof that two Seifert surfaces of a fixed link are related by tube attachments and tube removals.
Read the full abstract

All authors Stefan Friedl, Tobias Hirsch, Clayton McDonald, José Pedro Quintanilha, Daniel Zach

Information Theory

Distance Distributions Between Nodes in Concentric Disk-Annulus or Sphere-Shell Regions

This letter derives closed-form expressions for the probability density function of the distance between two nodes located in heterogeneous concentric geometries, namely a disk or sphere and a surrounding annulus or spherical shell. Two scenarios are considered: (i) both nodes are independently distributed in different regions, disk or sphere and annulus or shell, and (ii) one node is static in the outer region while the other follows the stationary distribution of the random waypoint model in the inner region. The resulting expressions provide a tractable analytical tool for performance evaluation in concentric wireless regions.
Read the full abstract

All authors Nicholas Vaiopoulos, Alexander Vavoulas, Harilaos G. Sandalidis, Konstantinos K. Delibasis

Optimization and Control · Cross-listed from cs.LG

Bilinear Mamba-Koopman Neural MPC for Varying Dynamics

Koopman-based neural MPC models generate time-varying dynamics from historical data, but preserve convexity by enforcing that the system operator is independent of the current control input. This conditional independence constraint limits adaptation to changing dynamics within a single MPC horizon, particularly under time-varying conditions and under stale-plan execution. We propose Bilinear Mamba-Koopman Neural MPC, a minimal extension that introduces control-dependent coupling in the latent dynamics, allowing the effective operator to adapt to the current input. The resulting model is a strict generalization of the standard linear, conditional-independence formulation, adds less than 1% parameters through a low-rank structure, and admits exact model Jacobians that enable efficient Sequential Convex Programming (SCP) with monotone-descent and KKT convergence results under standard trust-region assumptions. Across CartPole and RSCP benchmarks in time-invariant and time-varying regimes, the proposed model matches or improves forecasting accuracy on every cell when training noise is averaged out, with strict gains where control-state coupling is structurally present. Its main closed-loop gains appear in the RSCP TV task, where iterative SCP improves adaptation within the horizon and substantially stabilizes training; in CartPole TV, the gains are modest but consistent. In delayed re-planning experiments on the time-varying variants, the bilinear model degrades more gracefully under stale-plan execution, maintaining a consistent advantage on CartPole TV and a substantially larger robustness margin on RSCP TV. These results show that control-dependent latent dynamics provide a simple and effective mechanism for robust MPC under varying conditions.
Read the full abstract

Number Theory

Statistics of the Genus Number of $S_3 \times C_q$ and $D_4$-fields

The genus number of a number field is a fundamental invariant which measures the contribution of ramification to its ideal class group. In this paper, we establish the statistics for the genus number for $S_3\times C_q$-fields for $q\neq 3$ a prime number, $D_4$-fields and pure quartic fields. We also obtain precise results on the average and higher moments of the genus distribution within the family of $S_3\times C_q$-fields. Finally, based on heuristics, we formulate a conjecture identifying families for which one should expect the genus density to be zero, i.e., only a density zero subset of fields in the family attains any fixed genus number.
Read the full abstract

Mathematical Physics · Cross-listed from astro-ph.HE

Exact solutions, trajectories and radiation patterns in the classical relativistic Störmer problem

We investigate the relativistic generalization of the classical Störmer problem, which describes the motion of charged particles in a purely magnetic dipole field. By incorporating special relativistic effects, the particle dynamics is governed by a strongly nonlinear system of second-order differential equations derived from the Lorentz force law. We present a rigorous and fully covariant derivation of the relativistic equations of motion, together with the associated conservation laws. An exact solution for planar motions is obtained in parametric form, providing analytical insight into the structure of the trajectories. In addition, we perform a detailed numerical analysis of the particle dynamics across both nonrelativistic and relativistic regimes, exploring a range of initial conditions and highlighting the impact of relativistic corrections. The electromagnetic radiation emitted by the accelerated charges is also examined. We compute the time dependence of the total radiated power and determine the corresponding frequency spectrum. Our results provide a comprehensive characterization of magnetic dipole–type radiation associated with Störmer-like motion. In particular, the power spectral density consistently exhibits distinct peaks, indicating the presence of preferred frequency bands in the emitted radiation.
Read the full abstract

Numerical Analysis

Improving accuracy of finite element solutions by smoothing

This paper develops a smoothing-based postprocessing method for improving the accuracy of finite element solutions. The method applies a few smoothing iterations, such as damped Jacobi, symmetrized Gauss-Seidel, or preconditioned conjugate gradient, with the initial guess being the current finite element solution embedded in an augmented finite element space. The resulting procedure is algebraic, easy to implement, and applicable to high-order and three-dimensional discretizations. For symmetric and positive-definite problems, we show that the accuracy of the smoothed solutions is improved by a smoothing factor under additive and multiplicative smoothers. This smoothing factor decays exponentially during the first few smoothing steps. The effectiveness of the proposed method is numerically demonstrated using the Poisson, Maxwell, biharmonic and Helmholtz equations.
Read the full abstract