On Non-split Abelian Extensions

Two operators or two subgroups of a group will be called I-conjugate whenever they are conjugate under the group of isomorphisms of this group. It is well known that all the cyclic subgroups of highest order contained in any abelian group are I-conjugate. A necessary and sufficient condition that all the cyclic subgroups of any other order contained in an abelian group G of order pmm, p being a prime number, are I-conjugate is that all the invariants of G are equal to each other. When this condition is satisfied we shall prove, in particular, that the number of the subgroups of order pa, a c m , contained in G is equal to the number of its subgroups of index pa. It is known that the ?-subgroup of G is composed of the pth power of every operator of G. The concept of +-subgroup in connection with abelian groups can readily be extended by considering the characteristic subgroup of G composed of the path power of every operator of G. This subgroup may be called the Oa-subgroup of G. It is composed of all the operators of G which are found in each one of its subgroups of index pa, and all the operators of highest order in a 4.-subgroup of G are I-conjugate. In particular, the 0&-subgroup generated by operators of order p is the fundamental characteristic subgroup of G. t In fact, when p > 2 the 0a-subgroup which is generated by operators of order pr is contained in every characteristic subgroup of G which involves operators of order pr. The quotient group of G corresponding to a 4a-subgroup may be called a 0,fi-quotient group. This quotient group is simply isomorphic with the subgroup of G generated bv all its operators whose orders divide p> Hence the following: THEOREM. The number of the subgroups of index pa contained in any abelian

Distance magic graphs [formula omitted

We study properties of a group, abelian group, ring, or monoid $B$ which (a) guarantee that every homomorphism from an infinite direct product $\prod_I A_i$ of objects of the same sort onto $B$ factors through the direct product of finitely many ultraproducts of the $A_i$ (possibly after composition with the natural map $B\to B/Z(B)$ or some variant), and/or (b) guarantee that when a map does so factor (and the index set has reasonable cardinality), the ultrafilters involved must be principal. A number of open questions, and topics for further investigation, are noted.

In the paper, necessary and sufficient conditions for an Abelian group A to be isomorphic to the endomorphism group End(A) are obtained. The classes of periodic Abelian groups, divisible Abelian groups, nonreduced Abelian groups, and reduced algebraically compact Abelian groups are considered. For certain classes of Abelian groups, the isomorphism problem for a group and its endomorphism group is solved under the assumption that the endomorphism group itself has the corresponding property.

The Abelian group, also known as the exchange group, is a class of groups which satisfy the exchange law. This paper reviews Abelian groups from the perspective of mappings and gives sufficient and necessary conditions for a group to be an Abelian group under several special mappings.

Motivated by the recent result that left-orderability of a group $G$ is intimately connected to circular orderability of direct products $G \times \mathbb{Z}/n\mathbb{Z}$, we provide necessary and sufficient cohomological conditions that such a direct product be circularly orderable. As a consequence of the main theorem, we arrive at a new characterization for the fundamental group of a rational homology 3-sphere to be left-orderable. Our results imply that for mapping class groups of once-punctured surfaces, and other groups whose actions on $S^1$ are cohomologically rigid, the products $G \times \mathbb{Z}/n\mathbb{Z}$ are seldom circularly orderable. We also address circular orderability of direct products in general, dealing with the cases of factor groups admitting a bi-invariant circular ordering, and iterated direct products whose factor groups are amenable.

In this chapter we develop the algebra underlying multirate filter structures over free abelian groups of finite rank. Suppose A is a free abelian group of rank N. Each subgroup Δ of A is a free abelian group of rank n ≤ N. The basis theorem describes how Δ sits in A in the sense that it characterizes the quotient group A/Δ. This quotient group can be a finite abelian group a free abelian group of finite rank the direct product of a finite abelian group and a free abelian group of finite rank.

First, we give a necessary and sufficient condition for a torsion-free rank-one subgroup of an arbitrary abelian group to be purifiable in a given group and show that all pure hulls of a purifiable torsion-free rank-one subgroup are isomorphic. Next, we show that if a $T(G)$-high subgroup A of an abelian group $G$ is purifiable in $G$, then there exists a subgroup $T'$ of $T(G)$ such that $G=H\oplus T'$ for every pure hull $H$ of $A$ in $G$. An abelian group $G$ is said to be a strongly ADE decomposable group if there exists a purifiable $T(G)$-high subgroup of $G$. We present an example $G$ such that not all $T(G)$-high subgroups of a strongly ADE decomposable group G are purifiable in $G$. Moreover, we characterize the strongly ADE decomposable groups of torsion-free rank 1. Finally, we use previous results to give a necessary and sufficient condition for an abelian group of torsion-free rank 1 to be splitting.

The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Matthews and Sumner that every 4-connected claw-free graph is hamiltonian. Towards the hamiltonian line graph problem, we proved that every 3-edge-connected, essentially 4-edge-connected graph G has a spanning eulerian subgraph, if for every pair of adjacent vertices u and v, dG(u) + dG(v) ≥ 9. A straight forward corollary is that every 4-connected, essentially 6-connected line graph with minimum degree at least 7 is hamiltonian.;We also investigate graphs G such that the line graph L(G) is hamiltonian connected when L( G) is 4-connected. Ryjacek and Vrana recently further conjectured that every 4-connected line graph is hamiltonian-connected. In 2001, Kriesell proved that every 4-connected line graph of a claw free graph is hamiltonian connected. Recently, Lai et al showed that every 4-connected line graph of a quasi claw free graph is hamiltonian connected, and that every 4-connected line graph of an almost claw free graph is hamiltonian connected. In 2009, Broersma and Vumer discovered the P3-dominating (P3D) graphs as a superfamily that properly contains all quasi claw free graphs, and in particular, all claw-free graphs. Here we prove that every 4-connected line graph of a P3D graph is hamiltonian connected, which extends several former results in this area.;R. Gould [15] asked what natural graph properties of G and H are sufficient to imply that the product of G and H is hamiltonian. We first investigate the sufficient and necessary conditions for G x H being hamiltonian or traceable when G is a hamiltonian graph and H is a tree. Then we further investigate sufficient and necessary conditions for G x H being hamiltonian connected, or edge-pancyclic, or pan-connected.;The problem of group colorings of graphs is also investigated in this dissertation. Group coloring was first introduced by Jeager et al. [21]. They introduced a concept of group connectivity as a generalization of nowhere-zero flows. They also introduced group coloring as a dual concept to group connectivity. Prior research on group chromatic number was restricted to simple graphs, and considered only Abelian groups in the definition of chi g(G). The behavior of group coloring for multigraphs is different to that of simple graphs. Thus we extend the definition of group coloring by considering general groups (both Abelian groups and non-Abelian groups), and investigate the properties of chig for multigraphs

Assuming the Axiom of Constructibility, necessary and sufficient conditions are given for the vanishing of Ext\ for rings A of global dimension 1.Using Martin's Axiom, the necessity of these conditions is shown not to be a theorem of ZFC.Applications are given to abelian group theory, including a partial solution (assuming V = L) to a problem of Baer on the splitting of abelian groups.Some independence results in abelian group theory are also proved.Introduction.In a remarkable recent paper [22], S. Shelah proved that Whitehead's problem is unsolvable in ordinary set theory (Zermelo-Frankel set theory with the Axiom of Choice).More precisely, he proved that two different answers to the problem are obtained when set theory is extended by adding two different axioms: the Axiom of Constructibility and Martin's Axiom.(See Theorem 4.1.)Shelah's arguments were specific to Whitehead's problem and nonhomological in character.In this paper we extend Shelah's techniques in order to obtain some general results about the vanishing of ExtA (for modules over a ring A of global dimension 1) in different models of set theory, and we apply them to some specific problems in abelian group theory.Assuming the Axiom of Constructibility we obtain necessary and sufficient conditions for the vanishing of ExtA (Theorems 1.2 and 1.5).To state the result in.a special case: if C and A are abelian groups of cardinality N,, Ext(C, A) -0 if and only if C is the union of an increasing chain of countable subgroups [Cv\v < «,} such that the chain is smooth (i.e., C0 -U"<oC, for aii iimit ordinals a) and satisfies Ext(C0, A) = 0 and E\i(Cv+x/Cv,A) = 0 for all v < K,.Although the sufficiency of this condition is an easy consequence of classical homological algebra (see Theorem 1.2), the proof of necessity makes use of the Axiom of Constructibility (Theorem 1.5).The necessity of this condition is not provable in ordinary set theory; in particular the condition is not necessary when Martin's Axiom is assumed ( §3).

Let C be an Abelian group. A class X of Abelian groups is called a CE•H-class if, for every groups A, B ∈ X, the isomorphisms E•(A) ≅ E•(B) and Hom(C, A) ≅ Hom(C, B) imply the isomorphism A ≅ B. In the paper, necessary and sufficient conditions on a completely decomposable torsion-free Abelian group C are described under which a given class of torsion-free Abelian groupsisa CE•H-class.

On some operations and density of m-polar fuzzy graphs

Let G be a connected complex Lie group. Then there exists the smallest closed complex subgroup G0 of G such that G/G0 is a Stein group (Morimoto). Moreover G0 is a connected abelian Lie group and every holomorphic function on G0 is a constant. G0 is called an (H, C)-group or a toroidal group. Every connected complex abelian Lie group is isomorphic to the direct product G0 × Cm × C*n, where G0 is an (H,C)-group.

We give some necessary and sufficient conditions for the equivalency of the following two properties for a Moufang loop Q: Q over the nucleus Q/N is an abelian group and Q over the center is a group. We study those properties of Moufang loops which guarantee that L(y, x) is in the automorphism group of the loop. These imply numerous statements, among them there are well-known old results.

In 1951, Horn obtained a sufficient condition for an arithmetical class to be closed under direct product. A natural question which arose was whether Horn's condition is also necessary. We obtain a negative answer to that question.We shall discuss relational systems of the formwhere A and R are non-empty sets; each element of R is an ordered triple 〈a, b, c〉, with a, b, c ∈ A.1 If the triple 〈a, b, c〉 belongs to the relation R, we write R(a, b, c); if 〈a, b, c〉 ∉ R, we write (a, b, c). If x0, x1 and x2 are variables, then R(x0, x1, x2) and x0 = x1 are predicates. The expressions (x0, x1, x2) and x0 ≠ x1 will be referred to as negations of predicates.We speak of α1, …, αn as terms of the disjunction α1 ∨ … ∨ αn and as factors of the conjunction α1 ∧ … ∧ αn. A sentence (open, closed or neither) of the formwhere each Qi (if there be any) is either the universal or the existential quantifier and each αi, l is either a predicate or a negation of a predicate, is said to be in prenex disjunctive normal form.