Cyclic group | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted Cn, that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a generator of the group. Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order n is isomorphic to the additive group of Z/nZ, the integers modulo n. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group is a direct product of cyclic groups. Every cyclic group of prime order is a simple group, which cannot be broken down into smaller groups. In the classification of finite simple groups, one of the three infinite classes consists of the cyclic groups of prime order. The cyclic groups of prime order are thus among the building blocks from which all groups can be built. For any element g in any group G, one can form the subgroup that consists of all its integer powers: ⟨g⟩ = , called the cyclic subgroup generated by g. The order of g is |⟨g⟩|, the number of elements in ⟨g⟩, conventionally abbreviated as |g|, as ord(g), or as o(g). That is, the order of an element is equal to the order of the cyclic subgroup that it generates, A cyclic group is a group which is equal to one of its cyclic subgroups: G = ⟨g⟩ for some element g, called a generator of G. For a finite cyclic group G of order n we have G = , where e is the identity element and gi = gj whenever i ≡ j (mod n); in particular gn = g0 = e, and g−1 = gn−1. An abstract group defined by this multiplication is often denoted Cn, and we say that G is isomorphic to the standard cyclic group Cn.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (11)

Related people (1)

Related concepts (169)

Related courses (25)

Related lectures (155)

Learning dynamical systems with bifurcations

Aude Billard, Farshad Khadivar, Ilaria Lauzana

Trajectory planning through dynamical systems (DS) provides robust control for robots and has found numerous applications from locomotion to manipulation. However, to date, DS for controlling rhythmic

2021

Extensive amenability and a Tits alternative for topological full groups

Nóra Gabriella Szoke

This dissertation investigates the amenability of topological full groups using a property of group actions called extensive amenability. Extensive amenability is a core concept of several amenability

EPFL2019

Generators of split extensions of Abelian groups by cyclic groups

Luc Guyot

2018

MATH-310: Algebra

Study basic concepts of modern algebra: groups, rings, fields.

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how

MATH-113: Algebraic structures

Le but de ce cours est d'introduire et d'étudier les notions de base de l'algèbre abstraite.

Finite Abelian Groups

Covers Cauchy's theorem, classification of finite abelian groups, direct product properties, and more.

Proper Actions and Quotients

Covers proper actions of groups on Riemann surfaces and introduces algebraic curves via square roots.

Anonymous Authorization: Privacy Engineering Toolbox

Covers anonymous authorization, zero-knowledge proofs, attribute-based credentials, and practical issues in anonymous authentication.

Conjugacy class

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.

Finite group

In abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. Important examples of finite groups include cyclic groups and permutation groups. The study of finite groups has been an integral part of group theory since it arose in the 19th century.

Cyclic group