check_permutations: Check if Switch is bijective.
In quhomology: Calculation of Homology of Quandles, Racks, Biquandles and Biracks
Description
Usage
Arguments
Details
Value
See Also
Description
This function checks if a given Switch 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
Arguments
B
All elements in set after up/down operation.
Details
checks that the number of unique words of length 2 in the set is the same after up/down operation as before.
Value
TRUE/FALSE
See Also
quhomology documentation built on May 1, 2019, 8:44 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value See Also
Description
This function checks if a given Switch 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 |
Arguments
B |
All elements in set after up/down operation. |
Details
checks that the number of unique words of length 2 in the set is the same after up/down operation as before.
Value
TRUE/FALSE
See Also
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.