2013
DOI: 10.1007/s10208-013-9153-0
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Moving Frames and Discrete Integrable Systems

Abstract: Group based moving frames have a wide range of applications, from the classical equivalence problems in differential geometry to more modern applications such as computer vision.Here we describe what we call a discrete group based moving frame, which is essentially a sequence of moving frames with overlapping domains. We demonstrate a small set of generators of the algebra of invariants, which we call the discrete Maurer-Cartan invariants, for which there are recursion formulae. We show that this offers signif… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
63
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 32 publications
(68 citation statements)
references
References 37 publications
0
63
0
1
Order By: Relevance
“…We refer the reader to Refs. for the theoretical foundations and further examples. Definition Let G act (locally) freely and regularly on J [ n ] .…”
Section: Equivariant Moving Framesmentioning
confidence: 99%
See 4 more Smart Citations
“…We refer the reader to Refs. for the theoretical foundations and further examples. Definition Let G act (locally) freely and regularly on J [ n ] .…”
Section: Equivariant Moving Framesmentioning
confidence: 99%
“…As it is well‐known from the differential theory of equivariant moving frames, the exterior derivative and the invariantization map ι do not commute, dιιd.Similarly, the shift operators and the invariantization map ι do not commute, boldSiιιboldSi,i=1,,p. Example To illustrate the noncommutativity relations (18), let us revisit Example . Based on the cross‐section , dιnfalse(xnfalse)=dfalse(0false)=0.On the other hand, ιndfalse(xnfalse)=ϖnn=Δxndxn+Δundunfalse(normalΔxnfalse)2+false(normalΔunfalse)2.Similarly, for the shift operator boldS, which maps n to n+1, we have Sιnfalse(xnfalse)=Sfalse(0false)=0,while ιnSfalse(xnfalse)=ιnfalse(xn+1false)=Kn.…”
Section: Recurrence Relationsmentioning
confidence: 99%
See 3 more Smart Citations