2000 character limit reached
On the structure of finitely generated shift-invariant subspaces
Published 9 May 2016 in math.CA | (1605.02456v2)
Abstract: A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an element of the finitely generated shift-invariant subspace as a linear combination of Fourier transformations of generators. An estimate for the norms of those coefficients is derived. For the proof a sort of orthogonalization procedure for generators is used which reminds the well known Gram-Schmidt orthogonalization process.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.