On the inverse problem of the discrete calculus of variations

Abstract

In this paper we present an algorithm to find the discrete Lagrangian for an autonomous recurrence relation of arbitrary even order $2k$ with $k>1$. The method is based on the existence of a set of differential operators called annihilation operators which can be used to convert a functional equation into a system of linear partial differential equations. This completely solves the inverse problem of the calculus of variations in this setting.

29 pages

References in corpus (5)

• Lagrangians Galore
• Jacobi's Last Multiplier and Lagrangians for Multidimensional Systems
• Darboux integrability of trapezoidal $H^4$ and $H^6$ families of lattice equations I: First integrals
• Rational Maps with Invariant Surfaces
• Poisson brackets of mappings obtained as (q,-p) reductions of lattice equations

Cited by in corpus (4)

• Neural activity in quarks language: Lattice Field Theory for a network of real neurons
• Bi-rational maps in four dimensions with two invariants
• Coalgebra symmetry for discrete systems
• Discrete-time systems in quasi-standard form and the ${\mathfrak{h}}_6$ coalgebra symmetry