This is a terminal based program to do various comparisions on permutations (defined on symmetric groups) and also to find the set of all reduced word representing a permutation. A word is basically a ...

ABSTRACT: Several classes of permutation polynomials of the form over finite fields are presented in this paper, which is a further investigation on a recent work of Li et al.

Eulerian polynomials have long occupied a central role in combinatorics, encapsulating critical information about permutation statistics. In their classical formulation, these polynomials encode the ...

You are given two strings s and t such that every character occurs at most once in s and t is a permutation of s. The permutation difference between s and t is defined as the sum of the absolute ...

ABSTRACT: If is a permutation of , the graph has vertices where xy is an edge of if and only if (x, y) or (y, x) is an inversion of . Any graph isomorphic to is ...