Description Usage Arguments Value See Also
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.
1 | check_f(S_X, k, X_squared)
|
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. |
TRUE/FALSE
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.