we define a new function-valued inner product on l2(g), called ?-bracket product, where g is a locally compact abelian group and ? is a topological isomorphism on g. we investigate the notion of ?-orthogonality, bessel's inequality and ?-orthonormal bases with respect to this inner product on l2(g).

let $pounds$ be the category of locally compact abelian groups and $a,cin pounds$. in this paper, we define component extensions of $a$ by $c$ and show that the set of all component extensions of $a$ by $c$ forms a subgroup of $ext(c,a)$ whenever $a$ is a connected group. we establish conditions under which the component extensions split and determine lca groups which are component projective. ...

‎given an integer $n$‎, ‎we denote by $mathfrak b_n$ and $mathfrak c_n$ the classes of all groups $g$ for which the map $phi_{n}:gmapsto g^n$ is a monomorphism and an epimorphism of $g$‎, ‎respectively‎. ‎in this paper we give a characterization for groups in $mathfrak b_n$ and for groups in $mathfrak c_n$‎. ‎we also obtain an arithmetic description of the set of all integers $n$ such that a gr...

‎the number of factorizations of a finite abelian group as the product of two subgroups is computed in two different ways and a combinatorial identity involving gaussian binomial coefficients is presented‎.

we prove that the class of profinite groups $g$ that have a factorization $g=ab$‎ ‎with $a$ and $b$ abelian closed subgroups‎, ‎is closed under taking inverse limits‎ ‎of surjective inverse systems‎. ‎this is a generalization of a recent result by k. h. hofmann and f. g. russo‎. ‎as an application we reprove their generalization of iwasawa's structure theorem for‎ ‎quasihamiltonian pro-$p$...

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

We deal with some pcf, (posible cofinality theory) investigations mostly motivated by questions in abelian group theory. We concentrate on applications to test problems but we expect the combinatorics will have reasonably wide applications. We almost always answer the test problem which is proving the existence of ℵω-free abelian groups with trivial dual, i.e., with no non-trivial homomorphisms...

It is shown that if in the factorization of a finite cyclic group each factor has either prime power order or order equal to the product of two primes then one factor must be periodic. This is shown to be the best possible result of this type.  2004 Elsevier Inc. All rights reserved.