RELATION BETWEEN STATISTICS OF PERMUTATIONS

dc.contributor.authorFayziyev Sh.
dc.date.accessioned2025-07-30T03:48:03Z
dc.date.available2025-07-30T03:48:03Z
dc.date.issued2013
dc.description.abstractPermutations have a remarkably rich combinatorial structure. Part of the reason for this is that a permutation of a finite set can be represented in many equivalent ways, including as a word (sequence), a function, a collection of disjoint cycles, a matrix, etc. Each of these representations suggests a host of natural invariants (or "statistics"), operations, transformations, structures, etc., that can be applied to or placed on permutations. The fundamental statistics, operations, and structures on permutations include descent set (with numerous specializations), excedance set, cycle type, records, subsequences, composition (product), partial orders, simplicial complexes, probability distributions, etc. This paper contains topics that relates to the main part and definitions to understand the main part of this work. In the main part, we consider statistics of permutations, equidistributions of them.
dc.identifier.citationFayziyev Sh / RELATION BETWEEN STATISTICS OF PERMUTATIONS / 6M060100-Science mathematics / 2013
dc.identifier.urihttps://repository.sdu.edu.kz/handle/123456789/1827
dc.language.isoen
dc.publisherfaculty of engineering and natural sciences
dc.subjectdisjoint cycles
dc.subjectpermutation
dc.subjectequidistribution
dc.titleRELATION BETWEEN STATISTICS OF PERMUTATIONS
dc.typeThesis

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Fayziyev Shavkat.pdf
Size:
1.98 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
12.6 KB
Format:
Item-specific license agreed to upon submission
Description:

Collections