Cayley graph in the context of Arthur Cayley


Cayley graph in the context of Arthur Cayley

Cayley graph Study page number 1 of 1

Play TriviaQuestions Online!

or

Skip to study material about Cayley graph in the context of "Arthur Cayley"


⭐ Core Definition: Cayley graph

In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract structure of a group. Its definition is suggested by Cayley's theorem (named after Arthur Cayley), and uses a specified set of generators for the group. It is a central tool in combinatorial and geometric group theory. The structure and symmetry of Cayley graphs make them particularly good candidates for constructing expander graphs.

↓ Menu
HINT:

👉 Cayley graph in the context of Arthur Cayley

Arthur Cayley FRS (/ˈkli/; 16 August 1821 – 26 January 1895) was an English mathematician who worked mostly on algebra. He helped found the modern British school of pure mathematics, and was a professor at Trinity College, Cambridge for 35 years.

He postulated what is now known as the Cayley–Hamilton theorem—that every square matrix is a root of its own characteristic polynomial, and verified it for matrices of order 2 and 3. He was the first to define the concept of an abstract group, a set with a binary operation satisfying certain laws, as opposed to Évariste Galois' concept of permutation groups. In group theory, Cayley tables, Cayley graphs, and Cayley's theorem are named in his honour, as well as Cayley's formula in combinatorics.

↓ Explore More Topics
In this Dossier

Cayley graph in the context of Automorphism

In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms of an object forms a group, called the automorphism group. It is, loosely speaking, the symmetry group of the object.

View the full Wikipedia page for Automorphism
↑ Return to Menu

Cayley graph in the context of Conjugation (group theory)

In mathematics, especially group theory, two elements and of a group are conjugate if there is an element in the group such that This is an equivalence relation whose equivalence classes are called conjugacy classes. In other words, each conjugacy class is closed under for all elements in the group.

Members of the same conjugacy class cannot be distinguished by using only the group structure, and therefore share many properties. The study of conjugacy classes of non-abelian groups is fundamental for the study of their structure. For an abelian group, each conjugacy class is a set containing one element (singleton set).

View the full Wikipedia page for Conjugation (group theory)
↑ Return to Menu

Cayley graph in the context of Quaternion

In mathematics, the quaternion number system extends the complex numbers. Quaternions were first described by the Irish mathematician William Rowan Hamilton in 1843 and applied to mechanics in three-dimensional space. The set of all quaternions is conventionally denoted by ('H' for Hamilton) or by H. Quaternions are not quite a field because, in general, multiplication of quaternions is not commutative. Quaternions provide a definition of the quotient of two vectors in a three-dimensional space. Quaternions are generally represented in the form

View the full Wikipedia page for Quaternion
↑ Return to Menu

Cayley graph in the context of Geometric group theory

Geometric group theory is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups can act non-trivially (that is, when the groups in question are realized as geometric symmetries or continuous transformations of some spaces).

Another important idea in geometric group theory is to consider finitely generated groups themselves as geometric objects. This is usually done by studying the Cayley graphs of groups, which, in addition to the graph structure, are endowed with the structure of a metric space, given by the so-called word metric.

View the full Wikipedia page for Geometric group theory
↑ Return to Menu

Cayley graph in the context of Symmetric group

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group defined over a finite set of symbols consists of the permutations that can be performed on the symbols. Since there are ( factorial) such permutation operations, the order (number of elements) of the symmetric group is .

Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set.

View the full Wikipedia page for Symmetric group
↑ Return to Menu

Cayley graph in the context of Free group

In mathematics, the free group FS over a given set S consists of all words that can be built from members of S, considering two words to be different unless their equality follows from the group axioms (e.g. st = suut but st for s,t,uS). The members of S are called generators of FS, and the number of generators is the rank of the free group.An arbitrary group G is called free if it is isomorphic to FS for some subset S of G, that is, if there is a subset S of G such that every element of G can be written in exactly one way as a product of finitely many elements of S and their inverses (disregarding trivial variations such as st = suut).

A related but different notion is a free abelian group; both notions are particular instances of a free object from universal algebra. As such, free groups are defined by their universal property.

View the full Wikipedia page for Free group
↑ Return to Menu