In-depth combinatorial analysis : Permutations

Permutations
In-depth combinatorial analysis

Author : Louis COMTET

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

Add to my library

2. Permutations

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 can...

You do not have access to this resource.

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? Log in!

Ongoing reading
Permutations

Article included in this offer

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources