ON THE UNITS OF THE INTEGRAL GROUP RING Z[G × Cp

Abstract In this paper we exhibit two interlocking sequences in order to study the group ε(X × Y) of based homotopy classes of based self homotopy equivalences of a product X × Y of topological spaces X and Y. These sequences have complementary features, and the interconnectedness facilitates computation. The sequences give new results about ε(X × Y) and unify, generalize, and in some cases correct, existing results in the literature about this group. New results include calculations on the group of self equivalences of a product of suspensions (with applications to a product of Moore spaces, including p localized spheres); some progress in the computation of non-simply-connected rank 2 H-spaces (posed as an open problem in [Ka;problem 5]); and a universal description of ε(S m × S n ) for n > m ≥ 1 as a semidirect product. This last situation includes an example that is not a semidirect product when decomposed in the only other way known (see section 4). 1991 Mathematics Subject Classification: 55P

Cohomology of Semidirect Product Groups

We call a group G with subgroups G1, G2 such that G = G1G2 and both N = G1 ∩ G2 and G1 are normal in G a semidirect product with amalgamated subgroup N. We show that if Gl is a group with Nl ⊲ Gl containing a relative $({m_l},n,{m_l},{{m_l}\over{n}})$‐difference set relative to Nl for l = 1,2, and if there exists a “compatible coupling” from (G2, N2) to (G1, N1), a notion introduced in the paper, then for any i,j ∈ ℕ there exists at least one semidirect product with amalgamated subgroup N ≅ N1 ≅ N2 containing a relative $(m_1^im_2^j,n, m_1^im_2^j, {{m_1^im_2^j}\over {n}})$‐difference set. We say “at least one” to emphasize that the proof is via recursive construction and that different groups may be obtained depending on the choices made at different stages of the recursion. A special case of this result shows that if K is any finite group containing a normal relative ${(m,n,m,}{{m}\over {n}})$‐difference set, then there exists, for each i ∈ ℕ, at least one semidirect product with amalgamated subgroup N containing a relative $({m^i},n,{m^i},{{m_i}\over {n}})$‐difference set. These results suggest that the class of semidirect products with an amalgamated subgroup provides a rich source of new (non‐abelian) semiregular relative difference sets. © 2004 Wiley Periodicals, Inc.

The dynamics and geometry of free group endomorphisms

Presenting an explicit descryption of unit group in the integral group ring of a given non-abelian group is a classical and open problem. Let S3 be a symmetric group of order 6 and C3 be a cyclic group of order 3. In this study, we firstly explore the commensurability in unit group of integral group ring ℤ(S3 × C3) by showing the existence of a subgroup as (F55 ⋊ F3) ⋊ (S3∗× C2) where Fρ denotes a free group of rank ρ. Later, we introduce an explicit structure of the unit group in ℤ(S3 × C3) in terms of semi-direct product of torsion-free normal complement of S3 and the group of units in RS3 where R = ℤ[ω] is the complex integral domain since ω is the primitive 3rd root of unity. At the end, we give a general method that determines the structure of the unit group of ℤ(G × C3) for an arbitrary group G depends on torsion-free normal complement V (G) of G in U(ℤ(G × C3)) in an implicit form. As a consequence, a conjecture which is found in [21] is solved.

In a lecture in Kazan (1977), Goncharov dubbed a number of problems regarding the classification of computable members of various classes of structures. Some of the problems seemed likely to have nice answers, while others did not. At the end of the lecture, Shore asked what would be a convincing negative result. The goal of the present article is to consider some possible answers to Shore's question. We consider structures Д of some computable language, whose universes are computable sets of constants. In measuring complexity, we identify Д with its atomic diagram D(Д), which, via the Godel numbering, may be treated as a subset of ω. In particular, Д is computable if D(Д) is computable. If K is some class, then Kc denotes the set of computable members of K. A computable characterization for K should separate the computable members of K from other structures, that is, those that either are not in K or are not computable. A computable classification (structure theorem) should describe each member of Kc up to isomorphism, or other equivalence, in terms of relatively simple invariants. A computable non-structure theorem would assert that there is no computable structure theorem. We use three approaches. They all give the “correct” answer for vector spaces over Q, and for linear orderings. Under all of the approaches, both classes have a computable characterization, and there is a computable classification for vector spaces, but not for linear orderings. Finally, we formulate some open problems.

Let D=F1 x F2 x... x Fn be a direct product of n free groups F1, F2, * , F* * , ox an automorphism of D which leaves all but one of the noncyclic factors in D pointwise fixed, T an infinite cyclic group and F another free group. Let D x a T be the semidirect product of D and T with respect to a and (D x a T) x aXIdT F the semidirect product of D xa Tand F with respect to the automorphism x id T of D Xa T induced by a. We prove that the Whitehead group of (D xa, T) X 2xidT F and the projective class group of the integral group ring Z((D x a T) X aXidT F) are trivial. These results extend that of [3]. Let G be a group. We denote the Whitehead group of G by Wh G and the projective class group of the integral group ring Z(G) of G by kOZ(G). We recall the definition of semidirect product of groups and the definition of twisted group ring. For undefined terminologies used in the paper, we refer to [3] and [4]. Let oc be an automorphism of G and F a free group generated by {tA}. If w is a word in tA defining an element in F, we denote by Iwl the total exponent sum of the tA appearing in w. The semidirect product G xa F of G and F with respect to a is defined as follows: G x . F=GxF as sets and multiplication in G x . Fis given by (g, w)(g', w') = (go-lwl(g'), ww'), for any (g, w), (g', w') in G x F. In particular, if F is an infinite cyclic group T= (t) generated by t, we have the semidirect product G x a T of G and T with respect to oc. Let R be an associative ring with identity and oc an automorphism of R. Let F be a free group (or free semigroup) generated by {tA}. The otwisted group ring R,[F] of F over R is defined as follows: additively R,[F]=R[F], the group ring of F over R, so that its elements are finite linear combinations of elements in F with coefficients in R. Multiplication in R,[F] is given by (rw)(rIw')=roc-1I1(r')ww', for any rw, r'w' in R,[F]. In particular, if F is a free group (resp. free semigroup) generated by t, we Received by the editors May 25, 1973. AMS (MOS) subject classfiJcations (1970). Primary 13D15, 16A26, 18F25; Secondary 16A06, 16A54.

В 1978 году Р. Мак-Элисом построена первая асимметричная кодовая криптосистема, основанная на применении помехоустойчивых кодов Гоппы, при этом эффективные атаки на секретный ключ этой криптосистемы до сих пор не найдены. К настоящему времени известно много криптосистем, основанных на теории помехоустойчивого кодирования. Одним из способов построения таких криптосистем является модификация криптосистемы Мак-Элиса с помощью замены кодов Гоппы на другие классы кодов. Однако, известно что криптографическая стойкость многих таких модификаций уступает стойкости классической криптосистемы Мак-Элиса. В связи с развитием квантовых вычислений кодовые криптосистемы, наряду с криптосистемамми на решётках, рассматриваются как альтернатива теоретико-числовым. Поэтому актуальна задача поиска перспективных классов кодов, применимых в криптографии. Представляется, что для этого можно использовать некоммутативные групповые коды, т.е. левые идеалы в конечных некоммутативных групповых алгебрах.Для исследования некоммутативных групповых кодов полезной является теорема Веддерберна, доказывающая существование изоморфизма групповой алгебры на прямую сумму матричных алгебр. Однако конкретный вид слагаемых и конструкция изоморфизма этой теоремой не определены, и поэтому для каждой группы стоит задача конструктивного описания разложения Веддерберна. Это разложение позволяет легко получить все левые идеалы групповой алгебры, т.е. групповые коды. В работе рассматривается полупрямое произведение $$Q_{m,n} = (\mathbb{Z}_m \times \mathbb{Z}_n) \leftthreetimes (\mathbb{Z}_2 \times \mathbb{Z}_2)$$ абелевых групп и конечная групповая алгебра $$\mathbb{F}_q Q_{m,n}$$ этой группы. Для этой алгебры при условиях $$n \mid q -1$$ и $$\text{НОД}(2mn, q) = 1$$ построено разложение Веддербёрна. В случае поля чётной характеристики, когда эта групповая алгебра не является полупростой, также получена сходная структурная теорема. Описаны все неразложимые центральные идемпотенты этой групповой алгебры. Полученные результаты используются для алгебраического описания всех групповых кодов над $$Q_{m,n}.$$

In this short note we answer to a question of group theory from arXiv:0910.5080. In that paper the author describes the set of realizable Steinitz classes for so-called $A'$-groups of odd order, obtained iterating some direct and semidirect products. It is clear from the definition that $A'$-groups are solvable $A$-groups, but the author left as an open question whether the converse is true. In this note we prove the converse when only two prime numbers divide the order of the group, but we show it to be false in general, producing a family of counterexamples which are metabelian and with exactly three primes dividing the order. Steinitz classes which are realizable for such groups in the family are computed and verified to form a group.

We study automaton structures, i.e., groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we specifically investigate semigroups generated by partial automata. First, we show that the class of semigroups generated by partial automata coincides with the class of semigroups generated by complete automata if and only if the latter class is closed under removing a previously adjoined zero, which is an open problem in (complete) automaton semigroup theory stated by Cain. Then, we show that no semidirect product (and, thus, also no direct product) of an arbitrary semigroup with a (non-trivial) subsemigroup of the free monogenic semigroup is an automaton semigroup. Finally, we concentrate on inverse semigroups generated by invertible but partial automata, which we call automaton-inverse semigroups, and show that any inverse automaton semigroup can be generated by such an automaton (showing that automaton-inverse semigroups and inverse automaton semigroups coincide).

Any Schur ring is uniquely determined by a partition of the elements of the group. An open question in the study of Schur rings is determining which partitions of the group induce a Schur ring. Although a structure theorem is available for Schur rings over cyclic groups, it is still a difficult problem to count all the partitions. For example, Kovacs, Liskovets, and Poschel determine formulas to count the number of wreath-indecomposable Schur rings. In this paper we solve the problem of counting the number of all Schur rings over cyclic groups of prime power order and draw some parallels with Higman's PORC conjecture.

Legg and Hutter, as well as subsequent authors, considered intelligent agents through the lens of interaction with reward-giving environments, attempting to assign numeric intelligence measures to such agents, with the guiding principle that a more intelligent agent should gain higher rewards from environments in some aggregate sense. In this paper, we consider a related question: rather than measure numeric intelligence of one Legg-Hutter agent, how can we compare the relative intelligence of two Legg-Hutter agents? We propose an elegant answer based on the following insight: we can view Legg-Hutter agents as candidates in an election, whose voters are environments, letting each environment vote (via its rewards) which agent (if either) is more intelligent. This leads to an abstract family of comparators simple enough that we can prove some structural theorems about them. It is an open question whether these structural theorems apply to more practical intelligence measures.

The first part of this chapter treats Lie algebras, beginning with definitions and many examples. The notions of solvable, nilpotent, radical, semisimple, and simple are introduced, and these notions are followed by a discussion of the effect of a change of the underlying field. The idea of a semidirect product begins the development of the main structural theorems for real Lie algebras—the iterated construction of all solvable Lie algebras from derivations and semidirect products, Lie's Theorem for solvable Lie algebras, Engel's Theorem in connection with nilpotent Lie algebras, and Cartan's criteria for solvability and semisimplicity in terms of the Killing form. From Cartan's Criterion for Semisimplicity, it follows that semisimple Lie algebras are direct sums of simple Lie algebras. Cartan's Criterion for Semisimplicity is used also to provide a long list of classical examples of semisimple Lie algebras. Some of these examples are defined in terms of quaternion matrices. Quaternion matrices of size n-by-n may be related to complex matrices of size 2n-by-2n. The treatment of Lie algebras concludes with a study of the finite-dimensional complex-linear representations of sl[(2, ℂ). There is a classification theorem for the irreducible representations of this kind, and the general representations are direct sums of irreducible ones. Section 10 contains a review of the elementary theory of Lie groups and their Lie algebras. The abstract theory as in Chevalley [1946] is summarized, and the correspondence is made with the concrete theory of closed linear groups, where the Lie algebra is obtained as the space of derivatives at t = 0 of smooth curves in the group passing through the identity at t = 0. The section ends with a discussion of the adjoint representation. The remainder of the chapter explores some aspects of the connection between Lie groups and Lie algebras. One aspect is the relationship between automorphisms and derivations. The derivations of a semisimple Lie algebra are inner, and consequently the identity component of the group of automorphisms of a semisimple Lie algebra consists of inner automorphisms. In addition, simply connected solvable Lie groups may be built one dimension at a time as semidirect products with ℝ1, and consequently they are diffeomorphic to Euclidean space. For simply connected nilpotent groups the exponential map is itself a diffeomorphism. The earlier long list of classical semisimple Lie algebras corresponds to a list of the classical semisimple Lie groups. The issue that needs attention for these groups is their connectedness, and this is proved by using the polar decomposition of matrices.

Representative action of the automorphisms of complex analytic groups

We study homogeneous Riemannian manifolds (G / H, g) on which every geodesic is an orbit of a one-parameter subgroup of G. We analyze the algebraic structure of certain minimal sets of vectors of the corresponding Lie algebra g (called “geodesic graphs”) which generate all geodesics through a fixed point. We are particularly interested in the case when the geodesic graphs are of non-linear character. Some structural theorems, many examples and also open problems are presented.