Let T be the unit circle,(mu) be a Borel probability measure on T and (phi) be a bounded Lebesgue measurable function on T. in this paper we consider the weighted composition operator W(phi) on L^2(T,mu) defined by W(phi)f:=(phi)*(f(circle)(tau)), f in L^2(T), where (tau) is the map (tau)(z)=z^2, z in T. We will study the von Neumann-Wold decomposition of W(phi) when W(phi) is an isometry and (mu)<< m,where m is the normalized Lebesgue measure on T.

Compressed Sensing (CS) is a framework where we measure data through a non-adaptive linear mapping with far fewer measurements that the ambient dimension of the data. This is made possible by the exploitation of the inherent structure (simplicity) in the data being measured. The central issues in this framework is the design and analysis of the measurement operator (matrix) and recovery algorithms. Restricted isometry constants (RIC) of the measurement matrix are the most widely used tool for the analysis of CS recovery algorithms. The addition of the subscripts 1 and 2 below reflects the two RIC variants developed in the CS literature, they refer to the ℓ1-norm and ℓ2-norm respectively. The RIC2 of a matrix A measures how close to an isometry is the action of A on vectors with few nonzero entries, measured in the ℓ2-norm. This, and related quantities, provide a mechanism by which standard eigen-analysis can be applied to topics relying on sparsity. Specifically, the upper and lower RIC2 of a matrix A of size n × N is the maximum and the minimum deviation from unity (one) of the largest and smallest, respectively, square of singular values of all (N/k)matrices formed by taking k columns from A. Calculation of the RIC2 is intractable for most matrices due to its combinatorial nature; however, many random matrices typically have bounded RIC2 in some range of problem sizes (k, n,N). We provide the best known bound on the RIC2 for Gaussian matrices, which is also the smallest known bound on the RIC2 for any large rectangular matrix. Our results are built on the prior bounds of Blanchard, Cartis, and Tanner in Compressed Sensing: How sharp is the Restricted Isometry Property?, with improvements achieved by grouping submatrices that share a substantial number of columns. RIC2 bounds have been presented for a variety of random matrices, matrix dimensions and sparsity ranges. We provide explicit formulae for RIC2 bounds, of n × N Gaussian matrices with sparsity k, in three settings: a) n/N fixed and k/n approaching zero, b) k/n fixed and n/N approaching zero, and c) n/N approaching zero with k/n decaying inverse logarithmically in N/n; in these three settings the RICs a) decay to zero, b) become unbounded (or approach inherent bounds), and c) approach a non-zero constant. Implications of these results for RIC2 based analysis of CS algorithms are presented. The RIC2 of sparse mean zero random matrices can be bounded by using concentration bounds of Gaussian matrices. However, this RIC2 approach does not capture the benefits of the sparse matrices, and in so doing gives pessimistic bounds. RIC1 is a variant of RIC2 where the nearness to an isometry is measured in the ℓ1-norm, which is both able to better capture the structure of sparse matrices and allows for the analysis of non-mean zero matrices. We consider a probabilistic construction of sparse random matrices where each column has a fixed number of non-zeros whose row indices are drawn uniformly at random. These matrices have a one-to-one correspondence with the adjacency matrices of fixed left degree expander graphs. We present formulae for the expected cardinality of the set of neighbours for these graphs, and present a tail bound on the probability that this cardinality will be less than the expected value. Deducible from this bound is a similar bound for the expansion of the graph which is of interest in many applications. These bounds are derived through a more detailed analysis of collisions in unions of sets using a dyadic splitting technique. This bound allows for quantitative sampling theorems on existence of expander graphs and the sparse random matrices we consider and also quantitative CS sampling theorems when using sparse non mean-zero measurement matrices.

Bimetric theory is an extension to general relativity that introduces a secondary symmetric rank-two tensor field. This secondary spin-2 field is also dynamical, and to avoid the Boulware-Deser ghost issue, the interaction between the two fields is obtained through a potential that involes the matrix square-root of the tensors. This square-root “quantity” is a linear transformation, herein referred to as the square-root isometry. In this work we explore the conditions for the existence of the square-root isometry and its group properties. Morever we study the conditions for the simultaneous 3+1 decomposition of two fields, and then, in terms of null-cones, give the (local) causal relations between fields coupled by the square-root isometry. Finally, we show the algebraic equivalency of bimetric theory and its vielbein formulation up to a one-to-one map relating the respective parameter spaces over the real numbers. / Den bimetriska teorin är en utökning av den allmänna relativitetsteorin som introducerar ett sekundärt symmetriskt tensorfält av rang-två. Det här sekundära spin-2 fältet är också dynamiskt, och för att undvika Boulware-Deser spöke, erhålls vaxelverkan mellan de två fältena genom en potential som er baserad på kvadratrotsmatris av två tensorfält. Den “kvadratroten” är en linjär avbildning som kallas kvadratrotsisometri. I detta arbete utforskas förutsättningar för existensen av kvadratrotsisometrin och ges dess egenskaper i termer av gruppteori. Därutöver utforskas förutsättningarna för den samtidiga 3+1 dekompositionen av två tensorfält och sedan, i termer av ljuskoner, ges de (lokala) kausala relationerna för tensorfält kopplade genom kvadratrotsisometrin. Slutligen bevisas den algebraiska ekvivalensen mellan den bimetriska teorin och dess vielbein formulering upp till en bijektiv relation mellan respektive parameterutrymmen över de reella talen. / <p>Summarizes the results from the project done between March 2014 and November 2014.</p>

In this dissertation we consider several problems in classical complex analysis and operator theory. In the first part we study basis properties of a system of complex exponentials with a given frequency sequence. We show that most of these basis properties can be characterized in terms of the invertibility properties of certain Toeplitz operators. We use this reformulation to give a metric description of the radius of l2-dependence. Using similar methods we solve the classical Beurling gap problem in the case of separated real sequences. In the second part we consider the classical Polýa-Levinson problem asking for a description of all real sequences with the property that every zero type entire function which is bounded on such a sequence must be a constant function. We first give a description in terms of injectivity of certain Toeplitz operators and then use this to give a metric description of all such sequences. In the last part we study the spectral changes of a partial isometry under unitary perturbations. We show that all the spectra can be described in terms of the characteristic function of the partial isometry that is being perturbed. Our main tool in the proofs is a Herglotz-type representation for generalized spectral measures. We furthermore use this representation to give a new proof of the classical Naimark's dilation theorem and to generalize Aleksandrov's disintegration theorem.

Let P and Q be two idempotents, we review the results about the equivalence between the invertibility of a linear combination aP +bQ and that of P +Q, where a and b are any nonzero complex numbers with a + b eq 0. It is possible to extend the results to the case P and Q are square-zero elements. However, we will show that these extensions are impossible in general for P and Q being partial isometries or n-potents with n geq 3. We will show in case P and Q are square-zero elements, the invertibility of P +Q is equivalent to that of aP +bQ for nonzero a, b.

We study isometric maps between Teichmüller spaces and bounded symmetric domains in their Kobayashi metric. We prove that every totally geodesic isometry from a disk to Teichmüller space is either holomorphic or anti-holomorphic; in particular, it is a Teichmüller disk. However, we prove that in dimensions two or more there are no holomorphic isometric immersions between Teichmüller spaces and bounded symmetric domains and also prove a similar result for isometric submersions. / Mathematics

This thesis details a method of enumerating bases of hyperplane arrangements up to symmetries. I consider here automorphisms, geometric symmetries which leave the set of all points contained in the arrangement setwise invariant. The algorithm for basis enumeration described in this thesis is a backtracking search over the adjacency graph implied on the bases by minimum-ratio simplex pivots, pruning at bases symmetric to those already seen. This work extends Bremner, Sikiri c, and Sch urmann's method for basis enumeration of polyhedra up to symmetries, including a new pivoting rule for nding adjacent bases in arrangements, a method of computing automorphisms of arrangements which extends the method of Bremner et al. for computing automorphisms of polyhedra, and some associated changes to optimizations used in the previous work. I include results of tests on ACEnet clusters showing an order of magnitude speedup from the use of C++ in my implementation, an up to 3x speedup with a 6-core parallel variant of the algorithm, and positive results from other optimizations.

In this thesis we generalize the problem of phase retrieval of vector to that of multi-vector. The identification of the multi-vector is done up to some special classes of isometries in the space. We give some upper and lower estimates on the minimal number of multi-linear operators needed for the retrieval. The results are preliminary and far from sharp.

In this dissertation we study a special sub-collection of Polish metric spaces: complete separable ultrametric spaces. Polish metric spaces have been studied for quite a long while, and a lot of results have been obtained. Motivated by some of earlier research, we work on the following two main parts in this dissertation. In the first part, we show the existence of Urysohn Polish R-ultrametric spaces, for an arbitrary countable set R of non-negative numbers, including 0. Then we give point-by-point construction of a countable R-ultra-Urysohn space. We also obtain a complete characterization for the set R which corresponding to a R-Urysohn metric space. From this characterization we conclude that there exist R-Urysohn spaces for a wide family of countable R. Moreover, we determine the complexity of the classification of all Polish ultrametric spaces. In the second part, we investigate the isometry groups of Polish ultrametric spaces. We prove that isometry group of an Urysohn Polish R-ultrametric space is universal among isometry groups of Polish R-ultrametric spaces. We completely characterize the isometry groups of finite ultrametric spaces and the isometry groups of countable compact ultrametric spaces. Moreover, we give some necessary conditions for finite groups to be isomorphic to some isometry groups of finite ultrametric spaces.

We present two approaches towards a characterization of the complete Pick property. We first discuss the lurking isometry method used in a paper by J.A. Ball, T.T. Trent, and V. Vinnikov. They show that a nondegenerate, positive kernel has the complete Pick property if $1/k$ has one positive square. We also look at the one-point extension approach developed by P. Quiggin which leads to a sufficient and necessary condition for a positive kernel to have the complete Pick property. We conclude by connecting the two characterizations of the complete Pick property. / Master of Science