The Generalized Moment Problem with Complexity Constraint
✍ Scribed by Christopher I. Byrnes; Anders Lindquist
- Publisher
- SP Birkhäuser Verlag Basel
- Year
- 2006
- Tongue
- English
- Weight
- 627 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0378-620X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Recently, the generalized conjugacy problem(GCP) in braid groups was introduced as a candidate for cryptographic one-way function. A GCP in a braid group can be transformed into a GCP in a general linear group by the Burau representation. We study the latter problem induced in this way.
## Abstract In this paper, we characterize the complex sequences (__z~n~__)~__n__~ which satisfy the following condition: For each complex sequence (__a~n~__)~__n__~, there exists a function __f__ such that the functions __t^z^~n~f__(__t__) are Lebesgue integrable and __a~n~__ = ∫ __t^z^~n~f__(__t_
## Abstract The article is devoted to the solution of the infinite‐dimensional variant of the complex moment problem, and to the uniqueness of the solution. The main approach is illustrated for the best explanation on the one‐dimensional case. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)