No description available.

No description available.

Thesis (Ph. D.)--University of Washington, 2005. / Vita. Includes bibliographical references (p. 84-85).

>Magister Scientiae - MSc / The pursuit of graphs which are vertex-transitive and non-Cayley on groups has been ongoing for some time. There has long been evidence to suggest that such graphs are a very rarety in occurrence. Much success has been had in this regard with various approaches being used. The aim of this thesis is to find such a class of graphs. We will take an algebraic approach. We will define Cayley graphs on loops, these loops necessarily not being groups. Specifically, we will define meta-Cayley graphs, which are vertex-transitive by construction. The loops in question are defined as the semi-direct product of groups, one of the groups being Z₂ consistently, the other being in the class of dihedral groups. In order to prove non-Cayleyness on groups, we will need to fully determine the automorphism groups of these graphs. Determining the automorphism groups is at the crux of the matter. Once these groups are determined, we may then apply Sabidussi's theorem. The theorem states that a graph is Cayley on groups if and only if its automorphism group contains a subgroup which acts regularly on its vertex set. / Chemicals Industries Education and Training Authority (CHIETA)

Let X be a simply connected, compact Riemannian symmetric space. We can represent X as the homogeneous space U/K, where U is a simply connected compact Lie group, and K is the fixed point set of an involution θ of U. Let G be the complexification of U. We consider the intersections of the image of the Cartan embedding Φ : U/K → U ⊂ G : uK → uu⁻ᶿ with the strata of the Birkhoff (or triangular, or LDU) decomposition G = ⫫(w∈W) ∑(G/w), ∑(G/w) = N⁻wHN⁺ relative to a θ-stable decomposition of the Lie algebra, g = n⁻ ⊕h ⊕ n⁺. For a generic element g in this intersection, g ∈ Φ(U/K) ∩ ∑(G/1), this yields a unique triangular factorization g = ldu. Our main contribution is to produce explicit formulas for the diagonal term d in classical cases, using Cayley coordinates (this choice of coordinate is motivated by considerations beyond sheer convenience). These formulas have several applications: 1) we can compute π₀(Φ(U/K) \ ∩ ∑(G/1) ) explicitly; 2) we can compute ʃ(Φ(U/K))ᵃΦ^-iλ (where ᵃΦ is the positive part of d) using elementary techniques in rank 1 cases; 3) they are useful in explicitly calculating Evens-Lu Poisson structures on U=K (see [Caine(2006)]). Our set-up involves choosing specific representations of the various u in su(n;C) that are compatible with θ; that is, θ fixes each of the subspaces n⁻; h; and n⁺ which, in our setup, always consist of strictly lower triangular, diagonal, and strictly upper triangular matrices, respectively. The formulas contain determinants such as det(1 + X), where X is in ip, the -1-eigenspace of θ acting on the Lie algebra u. Due to the relatively sparse nature of these matrices, these determinants are often easily calculable, and we illustrate this with many examples.

No description available.

We investigate weak Cayley table isomorphisms, a generalization of group isomorphisms. Suppose G and H are groups. A bijective map phi : G to H is a weak Cayley table isomorphism if it satisfies two conditions:(1) If x is conjugate to y, then phi(x) is conjugate to phi(y); (2) For all x, y in G, phi(xy) is conjugate to phi(x)phi(y).If there exists a weak Cayley table isomorphism between two groups, then we say that the two groups have the same weak Cayley table.This dissertation has two main goals. First, we wish to find sufficient conditions under which two groups have the same weak Cayley table. We specifically study Frobenius groups and groups which satisfy the Camina pair condition. Second, we consider the group of all weak Cayley table isomorphisms between G and itself. We call this group the weak Cayley table group of G and denote it by W(G). Any automorphism of G is an element of W. The inverse map on G is also an element of W. We say that the weak Cayley table group is trivial if it is generated by the set of all automorphisms of G and the inverse map. Stephen Humphries proved that the symmetric groups S_n, the dihedral groups D_{2n} and the free groups F_n (n not equal to 3) all have trivial weak Cayley table groups. We will investigate the weak Cayley table groups of the alternating groups, certain types of Coxeter groups, the projective special linear groups and certain sporadic simple groups.

We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three. 2. We will prove a general statement that all vertex-transitive maximal triangle-free graphs on <i>n</i> vertices with valency greater than <i>n</i>/3 are 3-colourable. Since Cayley graphs are vertex-transitive, the bound of general graphs also applies to Cayley graphs. 3. Since Cayley graphs for abelian groups arise from vector spaces, we can view the connection set as a set of points in a projective geometry. We will give a characterization of all large complete caps, from which we derive that all maximal triangle-free cubelike graphs on 2ⁿ vertices and valency greater than 2ⁿ/4 are either bipartite or 4-colourable.

In the further development of the string theory, one needs to understand 3 or 4-dimensional volume minimizing subvarieties in 7 or 8-dimensional manifolds. As one example, one would like to understand 4-dimensional volume minimizing cycles in a torus T8. The Cayley calibration form can be used to find all volume minimizing cycles in each homology class of T8. In order to apply the Cayley form to 8-dimensional tori, we need to understand the finite symmetry of the Cayley form, which has a continuous symmetry group Spin(7). We have found one finite symmetry group of order eight generated by three elements. We have also studied the symmetry groups of tori based on the results of H.S.M. Coxeter, and have had a simple description of the four crystallographic groups in O(8). They can be used to classify all finite symmetry groups of the Cayley form.

Let G be a group. A Weak Cayley Table mapping ϕ : G → G is a bijection such that ϕ(g1g2) is conjugate to ϕ(g1)ϕ(g2) for all g1, g2 in G. The set of all such mappings forms a group W(G) under composition. We study W(G) for the seventeen wallpaper groups G.