Vacuum spacetimes of embedding class two

Doubt is cast on the much quoted results of Yakupov that the torsion vector in embedding class two vacuum space-times is necessarily a gradient vector and that class 2 vacua of Petrov type III do not exist. The rst result is equivalent to the fact that the two second fundamental forms associated with the embedding necessarily commute and has been assumed in most later investigations of class 2 vacuum space-times. Yakupov stated the result without proof, but hinted that it followed purely algebraically from his identity: Rijkl Ckl = 0 where Cij is the commutator of the two second fundamental forms of the embedding.From Yakupov's identity, it is shown that the only class two vacua with non-zero commutator Cij must necessarily be of Petrov type III or N. Several examples are presented of non-commuting second fundamental forms that satisfy Yakupovs identity and the vacuum condition following from the Gauss equation; both Petrov type N and type III examples occur. Thus it appears unlikely that his results could follow purely algebraically. The results obtained so far do not constitute denite counter-examples to Yakupov's results as the non-commuting examples could turn out to be incompatible with the Codazzi and Ricci embedding equations. This question is currently being investigated.

Riemann-Hilbert Problems with Canonical Normalization and Families of Commuting Operators

2010 Mathematics Subject Classification: 35Q15, 31A25, 37K10, 35Q58.

Effects of commuting and mode of transportation on performance, affect, cardiovascular activity, and frustration tolerance

It was hypothesized that making a commute elevates blood pressure, causes negative affect, reduces frustration tolerance, and impairs performance on simple and complex cognitive tasks. This hypothesis was tested by varying choice and type of commute in an experiment in which 168 volunteers were randomly assigned to one of six experimental conditions. The behavior of subjects who drove 30 miles or rode on a bus for the same distance were compared with the reactions of students who did not commute. Multivariate analyses of variance indicated that subjects who made the commute showed lower frustration tolerance and deficits on complex cognitive task performance. Commuting also raised pulse and systolic blood pressure. Multivariate analyses of covariance (MANCOVA) were performed in an effort to identify physiological and emotional reactions that may mediate these relations. No mediational relationships were uncovered. ^

Rota’s universal operators and invariant subspaces in Hilbert spaces

A Hilbert space operator is called universal (in the sense of Rota) if every operator on the Hilbert space is similar to a multiple of the restriction of the universal operator to one of its invariant subspaces. We exhibit an analytic Toeplitz operator whose adjoint is universal in the sense of Rota and commutes with a quasi-nilpotent injective compact operator with dense range. In articular, this new universal operator invites an approach to the Invariant Subspace Problem that uses properties of operators that commute with the universal operator.

Expedition in Data and Harmonic Analysis on Graphs

The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and prove that the translation operator to the i’th node is invertible if and only if all eigenvectors are nonzero on the i’th node. Because of this dependency on the support of eigenvectors we study the characteristic set of Laplacian eigenvectors. We prove that the Fiedler vector of a planar graph cannot vanish on large neighborhoods and then explicitly construct a family of non-planar graphs that do exhibit this property. We then prove original results in modern analysis on graphs. We extend results on spectral graph wavelets to create vertex-dyanamic spectral graph wavelets whose support depends on both scale and translation parameters. We prove that Spielman’s Twice-Ramanujan graph sparsifying algorithm cannot outperform his conjectured optimal sparsification constant. Finally, we present numerical results on graph conditioning, in which edges of a graph are rescaled to best approximate the complete graph and reduce average commute time.

Braid groups, mapping class groups, and Torelli groups

This thesis discusses subgroups of mapping class groups of particular surfaces. First, we study the Torelli group, that is, the subgroup of the mapping class group that acts trivially on the first homology. We investigate generators of the Torelli group, and we give an algorithm that factorizes elements of the Torelli group into products of particular generators. Furthermore, we investigate normal closures of powers of standard generators of the mapping class group of a punctured sphere. By using the Jones representation, we prove that in most cases these normal closures have infinite index in the mapping class group. We prove a similar result for the hyperelliptic mapping class group, that is, the group that consists of mapping classes that commute with a fixed hyperelliptic involution. As a corollary, we recover an older theorem of Coxeter (with 2 exceptional cases), which states that the normal closure of the m-th power of standard generators of the braid group has infinite index in the braid group. Finally, we study finite index subgroups of braid groups, namely, congruence subgroups of braid groups. We discuss presentations of these groups and we provide a topological interpretation of their generating sets.

Quantum kernels for unattributed graphs using discrete-time quantum walks

In this paper, we develop a new family of graph kernels where the graph structure is probed by means of a discrete-time quantum walk. Given a pair of graphs, we let a quantum walk evolve on each graph and compute a density matrix with each walk. With the density matrices for the pair of graphs to hand, the kernel between the graphs is defined as the negative exponential of the quantum Jensen–Shannon divergence between their density matrices. In order to cope with large graph structures, we propose to construct a sparser version of the original graphs using the simplification method introduced in Qiu and Hancock (2007). To this end, we compute the minimum spanning tree over the commute time matrix of a graph. This spanning tree representation minimizes the number of edges of the original graph while preserving most of its structural information. The kernel between two graphs is then computed on their respective minimum spanning trees. We evaluate the performance of the proposed kernels on several standard graph datasets and we demonstrate their effectiveness and efficiency.

Rota's universal operators and invariant subspaces in Hilbert spaces

A Hilbert space operator is called universal (in the sense of Rota) if every operator on the Hilbert space is similar to a multiple of the restriction of the universal operator to one of its invariant subspaces. We exhibit an analytic Toeplitz operator whose adjoint is universal in the sense of Rota and commutes with a quasi-nilpotent injective compact operator with dense range. In particular, this new universal operator invites an approach to the Invariant Subspace Problem that uses properties of operators that commute with the universal operator.