「Bijection」の共起表現(1語右で並び替え)

For a B-stopper, the function g is a bijection between its elements in B and its elements i

er theorem, which asserts the existence of a bijection between A and B given that injections exist

s A and B are equinumerous if there exists a bijection between them, in which case we write .

d its successor have the same cardinality (a bijection can be set up between the two by simply send

der isomorphic, that is, when there exists a bijection f: X → Y such that both f and its inverse ar

provides a monotone bijection from the former to the latter); the half-clo

tension may be viewed as an order-preserving bijection from a partially ordered set P to a chain C

both injective and surjective, but the term bijection generally only applies to total functions.

h, i.e. (154)(23), hence its square is not a bijection, hence this cannot represent a group.

This kind of bijection is commonly called "edge-preserving bijectio

In the case when the bijection is a mapping of a graph onto itself, i.e., w

One way to code all integers is to set up a bijection, mapping integers (0, 1, -1, 2, -2, 3, -3, .

All operators are subject to the Bijection Principle (first proposed by Koopman and Spo

set has size nn−2, so the existence of this bijection proves Cayley's formula, i.e. that there are

These numbers are in bijection with infinite continued fractions of the for

ulo negative Legendrian stabilizations is in bijection with the set of transverse knots.

「Bijection」の共起表現一覧(1語右で並び替え)