TOPICS
Search

Cycle


A cycle has several distinct meanings in mathematics. Some describe a return to a starting point, while others are defined using a boundary operator or classes associated with algebraic varieties.

In graph theory, a graph cycle follows edges back to its initial graph vertex, with no other repeated vertices. A cycle graph is a graph consisting of a single graph cycle.

A permutation cycle describes distinct symbols permuted in a cyclic order. For example, (1 2 3) sends 1 to 2, 2 to 3, and 3 to 1. A map cycle is a periodic trajectory under repeated application of a map. A group cycle records successive powers of an element of a finite group, returning to the identity element.

In homology, a homology cycle is an element z of a chain complex whose boundary is zero, d(z)=0. Cycles modulo homology boundaries define homology groups.

In algebraic geometry, an algebraic cycle is a finite formal linear combination of irreducible closed subvarieties, usually with integer coefficients. A Hodge cycle is instead a rational cohomology class of type (p,p) on a smooth projective complex algebraic variety. The Hodge conjecture relates Hodge cycles to the cohomology classes of algebraic cycles.


See also

Algebraic Cycle, Cycle Graph, Graph Cycle, Group Cycle, Hodge Cycle, Homology Cycle, Map Cycle, Permutation Cycle

Explore with Wolfram|Alpha

References

Deligne, P. "The Hodge Conjecture." Clay Mathematics Institute. https://www.claymath.org/wp-content/uploads/2022/06/hodge.pdf.Hatcher, A. "Homology." https://pi.math.cornell.edu/~hatcher/AT/ATch2.pdf.Stacks Project. "Cycles." Tag 0AZ9. https://stacks.math.columbia.edu/tag/0AZ9.

Cite this as:

Weisstein, Eric W. "Cycle." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Cycle.html

Subject classifications