Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.03197

Computational Algorithms for Invariant Reduction of Variational Forms

Kostya Druzhkov·Alexey Shevyakov
View original source ↗Read source document ↗Export metadata ↓

Abstract

Symmetry reductions of partial differential equations (PDEs) inherit more geometric structures than other types of reductions: invariant conservation laws, variational structures, and, under suitable conditions, Hamiltonian-type structures of the original model descend to the reduced model through the mechanism of invariant reduction. This paper develops computational algorithms that carry out such reductions explicitly. We use the interpretation of variational $p$-forms as conservation laws of an enlarged system --- the (degree-shifted) tangent system --- consisting of the original equations together with their linearizations, in which the perturbation variables are treated as anticommuting. This allows us to formulate the algorithms using well-known concepts from the theory of conservation laws, naturally adapted to the graded-commutative setting. The reduction of conservation laws, variational $1$-forms, and presymplectic structures thereby becomes a single algorithmic procedure. We present (i) a homotopy-based reduction algorithm for systems of evolution equations, implemented in Maple; (ii) a descent reduction algorithm applicable to general $\ell$-normal systems for $p>0$; and (iii) a simple reduction algorithm available for point symmetries under suitable conditions, including the description of reductions in terms of systems involving fewer independent variables. Examples include nonlinear evolution equations in one and two spatial dimensions, the Laplace equation, the incompressible Euler equations, and the cotangent system of Pavlov's equation.

Explore related subjects

math-phmath.DGmath.MPnlin.SI

Keep this discovery

BibTeXRIS

Kostya Druzhkov, Alexey Shevyakov. 2026-09-02. Computational Algorithms for Invariant Reduction of Variational Forms. https://arxiv.org/abs/2609.03197

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗