Cartesian product


Also found in: Thesaurus, Encyclopedia, Wikipedia.

Cartesian product

n.
A set of all pairs of elements (x, y) that can be constructed from given sets, X and Y, such that x belongs to X and y to Y.

Cartesian product

n
1. (Mathematics) maths logic the set of all ordered pairs of members of two given sets. The product A × B is the set of all pairs <a, b> where a is a member of A and b is a member of B. Also called: cross product
2. (Logic) maths logic the set of all ordered pairs of members of two given sets. The product A × B is the set of all pairs <a, b> where a is a member of A and b is a member of B. Also called: cross product
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.Cartesian product - the set of elements common to two or more sets; "the set of red hats is the intersection of the set of hats and the set of red things"
set - a group of things of the same kind that belong together and are so used; "a set of books"; "a set of golf clubs"; "a set of teeth"
Translations
kartézský součin
kartesisches ProduktKreuzprodukt
karteesinen tulo
Kartezijev produkt
cartesisch productkruisproduct
References in periodicals archive ?
We define the Cartesian product of these two SNSs by A x B [member of] SNS (X x Y) such that
So, we may think of [Q.sub.d] as the union of [G.sub.1], [G.sub.2] joined by a dimension cut, where each of [G.sub.1], [G.sub.2] is the Cartesian product of a (d - 3)-cube with [Q.sub.2].
The only difference with the pointing operation considered in [6] is at the end of the recursion, where instead of a new terminal of size 0, the pointing operation is equal to the cartesian product of [y.sub.i] with such a terminal of size 0.
Then, a Cartesian Product pf [[psi].sub.K] and [[OMEGA].sub.L], denoted by [[psi].sub.K] [??] [[OMEGA].sub.L], is defined as;
Furthermore, the cartesian product of Q-NSGs is defined and some pertinent properties are examined.
Let us consider the cartesian product X x X equipped with the product sigma algebra.
Mordeson and Peng [5] defined join, union, Cartesian product, and composition of two fuzzy graphs.
Cartesian Product. Consider finite directed graphs A and B, with [n.sub.A] and [n.sub.B] vertices, respectively.
We characterize those graphs G for which the Cartesian product G * H is an efficient open domination graph when H is a complete graph of order at least 3 or a complete bipartite graph.
In this paper, motivated by the operations on (crisp) graphs, such as Cartesian product, composition, union and join, we define the operations of Cartesian product, composition, union and join on strong interval valued neutrosophic graphs and investigate some of their properties.
We now recall the cartesian product of two graphs [GAMMA] and [SIGMA].
A cartesian product of two graphs G1 and G2 is the graph G1 G2 such that its vertex set is a cartesian product of V(G1) and V(G2) i.e.