check_f: Check if the function is bijective

Description Usage Arguments Value See Also

Description

This function checks if a given up or down action is bijective. This is done via checking that the order of the codomain is the same as the order of the domain of the function.

Usage

1
check_f(S_X, k, X_squared)

Arguments

S_X

All words of length 2 in a given set after up/down operation.

k

Order of set.

X_squared

All words of length 2 in a given set.

Value

TRUE/FALSE

See Also

check_permutations, check_YB


quhomology documentation built on May 1, 2019, 8:44 p.m.