Bijective

Some articles on bijective:

Combinatorial Principles - Bijective Proof
... Bijective proofs prove that two sets have the same number of elements by finding a bijective function (one-to-one correspondence) from one set to the other ...
Bijection, Injection And Surjection - Bijection
... A function is bijective if it is both injective and surjective ... A bijective function is a bijection (one-to-one correspondence) ... A function is bijective if and only if every possible image is mapped to by exactly one argument ...
Ax–Grothendieck Theorem - Related Results
... IV There, it is proved that a radicial S-endomorphism of a scheme X of finite type over S is bijective (10.4.11), and that if X/S is of finite presentation, and the ... map of n-dimensional affine space over a finitely generated extension of Z or Z/pZ is bijective with a polynomial inverse raional over the same ring (and therefore bijective on affine space ... rational map of n-dimensional affine space over a Hilbertian field is generically bijective with a rational inverse defined over the same field ...
Bijective Proof
... In combinatorics, bijective proof is a proof technique that finds a bijective function f A → B between two finite sets A and B, thus proving that they ...
Hexavigesimal - Bijective Base 26
... Using bijective numeration, it is possible to operate in base 26 without a zero it uses digits "A" to "Z" to represent one to twenty-six and has no zero ... The following algorithm (in Java) will allow you to convert a 0 based number string to a Bijective Base 26 number ...