Login | Register

Coherent states based on the Euclidean group

Title:

Coherent states based on the Euclidean group

Deptula, Renata (2004) Coherent states based on the Euclidean group. PhD thesis, Concordia University.

[thumbnail of NR04041.pdf]
Preview
Text (application/pdf)
NR04041.pdf - Accepted Version
1MB

Abstract

This work is a contribution to the general theory of frames, using group representations. Specifically, we use the theory of generalized coherent states for semidirect product groups to construct coherent states for the three dimensional Euclidean group, starting from a representation of this group, induced from a representation of the subgroup H = [Special characters omitted.] {604} SO (2). Families of continuous coherent states are explicitly constructed for two specific choices of sections from the coset space w = E (3)/(T 3 {604} SO 3 (2)) to the group. We also discuss admissibility conditions for the existence of continuous frames for the general class of affine sections. Next we propose a discretization procedure for these continuous frames. Once again we obtain general admissibility conditions for the existence of frames and in particular, tight frames. Explicit examples are worked out.

Divisions:Concordia University > Faculty of Arts and Science > Mathematics and Statistics
Item Type:Thesis (PhD)
Authors:Deptula, Renata
Pagination:vi, 71 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:Ph. D.
Program:Mathematics
Date:2004
Thesis Supervisor(s):Ali, Twareque S
Identification Number:QC 6.4 C56D47 2004
ID Code:8346
Deposited By: Concordia University Library
Deposited On:18 Aug 2011 18:22
Last Modified:13 Jul 2020 20:04
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top