996 resultados para finite cyclic group
Resumo:
The purpose of this thesis is to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if it is equivalent under group automorphism to one which has sum precisely IGI when this sum is viewed as an integer. This thesis investigates two major problems, the first of which is referred to as the basic pair problem. This problem seeks to determine conditions for which every zero-sequence of a given length in a finite abelian group has the basic property. We resolve an open problem regarding basic pairs in cyclic groups by demonstrating that every sequence of length four in Zp has the basic property, and we conjecture on the complete solution of this problem. The second problem is a 1988 conjecture of Kleitman and Lemke, part of which claims that every sequence of length n in Zn has a subsequence with the basic property. If one considers the special case where n is an odd integer we believe this conjecture to hold true. We verify this is the case for all prime integers less than 40, and all odd integers less than 26. In addition, we resolve the Kleitman-Lemke conjecture for general n in the negative. That is, we demonstrate a sequence in any finite abelian group isomorphic to Z2p (for p ~ 11 a prime) containing no subsequence with the basic property. These results, as well as the results found along the way, contribute to many other problems in zero-sum theory.
Resumo:
In the present work are described the algorithms that generate all near-rings on finite cyclic groups of order 16 to 29.
Resumo:
Vegeu el resum a l'inici del document del fitxer adjunt
Resumo:
Let ZG be the integral group ring of the finite nonabelian group G over the ring of integers Z, and let * be an involution of ZG that extends one of G. If x and y are elements of G, we investigate when pairs of the form (u(k,m)(x*), u(k,m)(x*)) or (u(k,m)(x), u(k,m)(y)), formed respectively by Bass cyclic and *-symmetric Bass cyclic units, generate a free noncyclic subgroup of the unit group of ZG.
Resumo:
Semigroup Forum, nº76 (2008), pg.579-583
Resumo:
Let D( m, n; k) be the semi-direct product of two finite cyclic groups Z/m = < x > and Z/n = < y >, where the action is given by yxy(-1) = x(k). In particular, this includes the dihedral groups D(2m). We calculate the automorphism group Aut (D(m, n; k)).
Resumo:
Cohomology groups H(s)(Z(n), Z(m)) are studied to describe all groups up to isomorphism which are (central) extensions of the cyclic group Z(n) by the Z(n)-module Z(m). Further, for each such a group the number of non-equivalent extensions is determined. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
Let A be a finitely generated abelian group. We describe the automorphism group Aut(A) using the rank of A and its torsion part p-part A(p). For a finite abelian p-group A of type (k(1),..., k(n)), simple necessary and sufficient conditions for an n x n-matrix over integers to be associated with an automorphism of A are presented. Then, the automorphism group Aut(A) for a finite p-group A of type (k(1), k(2)) is analyzed. (C) 2008 Mathematical Institute Slovak Academy of Sciences.
Resumo:
In this article, we give a method to compute the rank of the subgroup of central units of ZG, for a finite metacyclic group, G, by means of Q-classes and R-classes. Then we construct a multiplicatively independent set u subset of Z(U(ZC(p,q))) and by applying our results, we prove that u generates a subgroup of finite index.
Resumo:
In this paper, we determine the lower central and derived series for the braid groups of the projective plane. We are motivated in part by the study of Fadell-Neuwirth short exact sequences, but the problem is interesting in its own right. The n-string braid groups B(n)(RP(2)) of the projective plane RP(2) were originally studied by Van Buskirk during the 1960s. and are of particular interest due to the fact that they have torsion. The group B(1)(RP(2)) (resp. B(2)(RP(2))) is isomorphic to the cyclic group Z(2) of order 2 (resp. the generalised quaternion group of order 16) and hence their lower central and derived series are known. If n > 2, we first prove that the lower central series of B(n)(RP(2)) is constant from the commutator subgroup onwards. We observe that Gamma(2)(B(3)(RP(2))) is isomorphic to (F(3) X Q(8)) X Z(3), where F(k) denotes the free group of rank k, and Q(8) denotes the quaternion group of order 8, and that Gamma(2)(B(4)(RP(2))) is an extension of an index 2 subgroup K of P(4)(RP(2)) by Z(2) circle plus Z(2). As for the derived series of B(n)(RP(2)), we show that for all n >= 5, it is constant from the derived subgroup onwards. The group B(n)(RP(2)) being finite and soluble for n <= 2, the critical cases are n = 3, 4. We are able to determine completely the derived series of B(3)(RP(2)). The subgroups (B(3)(RP(2)))((1)), (B(3)(RP(2)))((2)) and (B(3)(RP(2)))((3)) are isomorphic respectively to (F(3) x Q(8)) x Z(3), F(3) X Q(8) and F(9) X Z(2), and we compute the derived series quotients of these groups. From (B(3)(RP(2)))((4)) onwards, the derived series of B(3)(RP(2)), as well as its successive derived series quotients, coincide with those of F(9). We analyse the derived series of B(4)(RP(2)) and its quotients up to (B(4)(RP(2)))((4)), and we show that (B(4)(RP(2)))((4)) is a semi-direct product of F(129) by F(17). Finally, we give a presentation of Gamma(2)(B(n)(RP(2))). (C) 2011 Elsevier Inc. All rights reserved.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
2000 Mathematics Subject Classification: 20E18, 12G05, 12F10, 12F99.
Resumo:
2000 Mathematics Subject Classification: 20D60,20E15.
Resumo:
A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.