Algebraic Representation of Additive Structures with an Infinite Number of Components
✍ Scribed by Ronald Hübner; Reinhard Suck
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 255 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0022-2496
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G
The 1-chromatic number / 1 (S) of a surface S is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. It is proved that if 4n+3 is a prime number, n 0, then / 1 (N 8(2n+1) 2) =R(N 8(2n+1) 2) where R(S)=w 1 2 (9+-81&
Let Q 1 , Q 2 # Z[X, Y, Z] be two ternary quadratic forms and u 1 , u 2 # Z. In this paper we consider the problem of solving the system of equations (1) Q 2 (x, y, z)=u 2 in x, y, z # Z with gcd(x, y, z)=1. According to Mordell [12] the coprime solutions of can be presented by finitely many expr