# one-to-one

(redirected from Injective function)
Also found in: Thesaurus, Encyclopedia, Wikipedia.
Related to Injective function: inverse function, Surjective function

## one-to-one

(wŭn′tə-wŭn′)
1. Allowing the pairing of each member of a class uniquely with a member of another class.
2. Mathematics Relating to or being a correspondence between two sets that assigns to each member of one set exactly one member of the other set.

## one-to-one

1. (of two or more things) corresponding exactly
2. denoting a relationship or encounter in which someone is involved with only one other person: one-to-one tuition.
3. (Mathematics) maths characterized by or involving the pairing of each member of one set with only one member of another set, without remainder
n
a conversation, encounter, or relationship between two people

## one′-to-one′

1. corresponding element by element.
[1870–75]
ThesaurusAntonymsRelated WordsSynonymsLegend:
 Adj. 1 one-to-one - used of relations such that each member of one set is associated with one member of a second setmatched - going well together; possessing harmonizing qualities

Translations

## one-to-one

[ˈwʌntəˈwʌn] one-on-one (US) [wʌnɒnˈwʌn]
A. ADJ [equivalence, correspondence] → exacto; [relationship, conversation] → de uno a uno; [meeting] → entre dos; [teaching] →
on a one-to-one basis [teach] → individualmente; [talk] → de uno a uno
B. ADV [discuss, talk] → de uno a uno

## one-to-one

[ˌwʌntəˈwʌn] adj (correlation) → univoco/a; (relationship) → tra due persone
teaching is on a one-to-one basis → l'insegnamento è organizzato in lezioni individuali
References in periodicals archive ?
i] : 1 [less than or equal to] i [less than or equal to] m} is a linearly independent set, any nontrivial linear combination of whose elements gives an injective function.
An infinite sequence is defined to be an injective function f : Z [right arrow] R.
iii) If f is an intuitionistic fuzzy injective function has an intuitionistic fuzzy [alpha][G.
A boolean circuit over B with two inputs and one output, is a tuple C = (V, E, [alpha], [beta],[omega]), where (V, E) is a finite directed acyclic graph, [alpha]: E [right arrow] N is an injective function, [beta]: V [right arrow] B [union]{[x.
P is a finite, nonempty set of productions of the form P = ([Sigma], [Tau] [Phi]), where [Sigma] is the left-hand side, a subgraph whose nodes are labeled with symbols of N; [Tau] is the right-hand side, a subgraph whose nodes are labeled with symbols of N; and [Phi] is the inheritance function, where [Phi]: [Tau] [right arrow] [Sigma] is a partial, injective function that indicates the nodes of [Tau] that will inherit the connecting edges of the nodes of [Sigma]
We will find an injective function from the set of linear extensions of any fixed acyclic orientation to the set of linear extensions of a bipartite orientation, in such a way that the defined map is surjective if and only if the initial orientation is bipartite.
Let now h : N [right arrow] G be an injective function.

Site: Follow: Share:
Open / Close