Combinatorics and Graph Theory

    

Making Derangements Using Element Swaps

Authors: Pranjal Jain

The aim of the article is to show that there always exists a sequence of swaps of elements, which when applied to a derangement (of n>3 elements) will go through all derangements of n elements, with an additional constraint that all swaps in this sequence produce a derangement (not necessarily one which hasn't appeared before in the sequence).

Comments: 16 Pages.

Download: PDF

Submission history

[v1] 2020-08-26 10:32:36

Unique-IP document downloads: 594 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus