Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 252 for “"cayley"”.
-
Cayley Numbers
In a certain sense Cayley numbers and quaternions over the reals are generalizations of complex numbers. One can define complex numbers by means of ordered pairs of real numbers. (They can also be obtained by adjoining an imaginary solution i of the equation x2+ l = 0 to the real numbers.) …
-
Average Cayley genus for Cayley maps with dihedral groups
… and let Delta be a generating set for Gamma. A Cayley map associated with Gamma and Delta is an oriented 2-cell embedding of the Cayley graph GDelta (Gamma) such that the rotation of arcs emanating from each vertex is determined by a unique cyclic permutation of generators and their inverses. A …
-
The Weak Cayley Table and the Relative Weak Cayley Table
… and Sehgal developed the idea of a weak Cayley table map between groups. The set of all weak Cayley table maps from one group to itself also has a group structure, which we will call the weak Cayley table group. We will examine the weak Cayley table group of AGL(1; p) and the dicyclic …
-
Extremal Cayley Graphs
… m elements. Let A be a nonempty subset of Γ. The Cayley digraph of Γ generated by A, denoted by Cay (Γ, A), is the digraph with vertex set Γ and arc set {uv | u-1v ∈ A}. A simple example of a Cayley digraph is the n-Cube. A Cayley digraph can be considered as a graphical representation of a finite …
-
Colouring Cayley Graphs
… 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 …
-
Cayley-Dickson Loops
In this dissertation we study the Cayley-Dickson loops, multiplicative structures arising from the standard Cayley-Dickson doubling process. More precisely, the Cayley-Dickson loop Qn is the multiplicative closure of basic elements of the algebra constructed by n applications of the doubling …
-
Weak Cayley Table Isomorphisms
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, …
-
Automata on Cayley Graphs
… two properties of a tape must, in fact, be the Cayley graph of a suitable group. Recent investigations by various authors have begun to shed some light on what promises to be intimate connections between the geometry of a Cayley graph and the group-theoretic properties of the underlying group.
-
State Transfer & Strong Cospectrality in Cayley Graphs
… prove various results about these properties in Cayley graphs. We consider how big a set of pairwise strongly cospectral vertices can be in a graph. We prove an upper bound on the size of such a set in normal Cayley graphs in terms of the multiplicities of the eigenvalues of the graph. We then …
-
Cayley Graphs of Groups and Their Applications
Cayley graphs are graphs associated to a group and a set of generators for that group (there is also an associated directed graph). The purpose of this study was to examine multiple examples of Cayley graphs through group theory, graph theory, and applications. We gave background material on groups …
-
Weak Cayley Table Groups of Crystallographic Groups
Let G be a group. A weak Cayley table isomorphism $\phi$: G $\rightarrow$ G is a bijection satisfying two conditions: (i) $phi$ sends conjugacy classes to conjugacy classes; and (ii) $\phi$(g1)$\phi$(g2) is conjugate to $\phi$(g1g2) for all g1, g2 in G. The set of all such mappings forms a group …
-
Weak Cayley Table Groups of Wallpaper Groups
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.
-
Cayley graphs of order 6pq are Hamiltonian
… is a Hamiltonian cycle in the corresponding Cayley graph on G with connecting set S.
-
Curvas e superfícies dianodais de Cayley-Halphen
… geral, o nono deve pertencer à curva dianodal de Cayley. Neste trabalho abordamos diferentes métodos de construção da curva dianodal. Estudamos também a superfície dianodal, lugar geométrico de um oitavo ponto duplo isolado de superfícies quárticas de CP³. Estes assuntos são relacionados com as …
-
The Directed Forest Complex of Cayley Graphs
… in Γ. We study the directed forest complex of Cayley graphs of finite groups. The homology of DF(Γ) contains information about the graph, Γ and about the group, G. The ultimate goal is to classify DF(Γ) up to homotopy, compute its homology, and interpret the findings in terms of properties of …
-
Algorithms for Permutation Groups and Cayley Networks
Bases, subgroup towers and strong generating sets (SGSs) have played a key role in the development of algorithms for permutation groups. We analyze the computational complexity of several problems involving bases and SGSs, and we use subgroup towers and SGSs to construct dense networks with …
-
Uniform Mixing on Cayley Graphs over Z_3^d
This thesis investigates uniform mixing on Cayley graphs over Z_3^d. We apply Mullin's results on Hamming quotients, and characterize the 2(d+2)-regular connected Cayley graphs over Z_3^d that admit uniform mixing at time 2pi/9. We generalize Chan's construction on the Hamming scheme H(d,2) to the …
-
Splines on Cayley Graphs of the Symmetric Group
… spline rings where the underlying graph is the Cayley graph of a symmetric group generated by a collection of transpositions. These rings generalize the GKM construction for equivariant cohomology rings of flag, regular semisimple Hessenberg, and permutohedral varieties. These cohomology rings …
-
Hamilton decompositions of 6-regular abelian Cayley graphs
… that does not possess a Hamilton path. For the Cayley graphs, a subclass of vertex-transitive graphs, the following conjecture was made: Weak Lovász Conjecture: Every nontrivial, finite, connected Cayley graph is hamiltonian. The Chen-Quimpo Theorem proves that Cayley graphs on abelian groups …
Page 1 of 13