Results 261 to 270 of about 14,964 (295)
Some of the next articles are maybe not open access.
1970
When we say in analytic geometry that a point has co-ordinates (x, y), the order in which x and y occur, in the symbol (x, y), is important: (1, 2) ≠ (2, 1). For this reason we call (x, y) an ordered pair. Moreover, x and y come from sets; in this case x, y ∈ R. This idea can be generalizedf as follows. Let 𝒰 be a universe.
H. B. Griffiths, P. J. Hilton
openaire +1 more source
When we say in analytic geometry that a point has co-ordinates (x, y), the order in which x and y occur, in the symbol (x, y), is important: (1, 2) ≠ (2, 1). For this reason we call (x, y) an ordered pair. Moreover, x and y come from sets; in this case x, y ∈ R. This idea can be generalizedf as follows. Let 𝒰 be a universe.
H. B. Griffiths, P. J. Hilton
openaire +1 more source
Radicals commuting with cartesian products
Archiv der Mathematik, 1998Given an Abelian group \(G\), the group radical is defined by \(R_G(X)=\bigcap\{\text{Ker }\phi\mid\phi\colon X\to G\}\), for Abelian groups \(X\). This radical does not always commute with infinite direct products (for instance, when \(G=\mathbb{Q}\), it turns into the torsion radical).
Corner, A. L. S., Göbel, Rüdiger
openaire +2 more sources
The determining number of a Cartesian product
Journal of Graph Theory, 2009AbstractA set S of vertices is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G, denoted Det(G), is the size of a smallest determining set. This paper begins by proving that if G=G□⋅□G is the prime factor decomposition of a connected graph then Det(G)=max{Det(G)}.
openaire +2 more sources
The general position number of Cartesian products involving a factor with small diameter
Applied Mathematics and Computation, 2021, Kexiang Xu
exaly