Permutations
In-depth combinatorial analysis
Article REF: AF202 V1
Permutations
In-depth combinatorial analysis

Author : Louis COMTET

Publication date: January 10, 2003 | Lire en français

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. Permutations

2.1 The symmetrical group

Recall that a permutation σ of a finite set N, |N|=n , is a bijection of N onto itself. The set of permutations of N is S(N) .

In fact, since the set N is finite, the word bijection...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed?


Ongoing reading
Permutations

Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details