combinatorics

Documentation

Index

• func HookLength(partition []int, primeMod int) int
• func IntegerPartitions(n int) [][]int
• func InversePermutation[T constraints.Integer](permutation []T) []T
• func RobinsonSchenstedMapping(permutation []int) (p, q [][]int)

Functions

func HookLength

func HookLength(partition []int, primeMod int) int

func IntegerPartitions

func IntegerPartitions(n int) [][]int

Computes integer partitions, each partition is weakly increasing

func InversePermutation

func InversePermutation[T constraints.Integer](permutation []T) []T

func RobinsonSchenstedMapping

func RobinsonSchenstedMapping(permutation []int) (p, q [][]int)

Using code from: codeforces.com/blog/entry/98167