Combinatorics and Graph Theory


Introducing: Second-Order Permutation

Authors: Bassey Godwin Bassey

In this study we answer questions that have to do with finding out the total number of ways of arranging a finite set of symbols or objects directly under a single line constraint set of finite symbols such that common symbols between the two sets do not repeat on the vertical positions. We go further to study the outcomes when both sets consist of the same symbols and when they consist of different symbols. We identify this form of permutation as 'second-order permutation' and show that it has a corresponding unique factorial which plays a prominent role in most of the results obtained. This has been discovered by examining many practical problems which give rise to the emergence of second-order permutation. Upon examination of these problems, it becomes clear that a directly higher order of permutation exist. Hence this study aims at equipping mathematics scholars, educators and researchers with the necessary background knowledge and framework for incorporating second-order permutation into the field of combinatorial mathematics.

Comments: 29 Pages.

Download: PDF

Submission history

[v1] 2019-01-24 10:02:02

Unique-IP document downloads: 52 times 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. 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