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 strict projective limits. 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$ groups.

The existence of 1-factorizations an infinite complete equipartite graph K m [ n ] ${K}_{m}[n]$ (with $m$ parts size $n$ ) admitting a vertex-regular automorphism group G $G$ is known only when = 1 $n=1$ and countable (i.e., for graphs) and, in addition, finitely generated abelian order . In this paper, we show that 1-factorization under the exists if has subgroup H $H$ whose index Furthermore,...

A uniied treatment of parameters relevant to factoring polynomials over nite elds is given. The framework is based on generating functions for describing parameters of interest and on singularity analysis for extracting asymptotic values. An outcome is a complete analysis of the standard polynomial factorization chain that is based on elimination of repeated factors, distinct degree factorizati...

This paper combines input–output analysis with non-negative matrix factorization analysis widely used in the image segmentation and attempts to find the target industrial groups (industrial clusters) in Japan that have intensive CO 2 emissions. We generalized the industrial cluster analysis proposed by Kagawa et al. (2012) to identify environmentally-important industrial clusters from the entir...

using qcd factorization for the hadronic matrix elements, we show that existing data, inparticular the branching ratios br ( b →j/ψk) and br ( b →j/ψπ), can be accounted for in this approach.we analyze the decay b j /k( ) within the framework of qcd factorization. the calculation of therelevant hard-scattering kernels for twist-2 and twist-3 is completed. we calculate this decay in a special...

To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another algorithm numerically splits the input polynomial of the nth degree into two factors balanced in the degrees and with the zero sets separated by the ba...

The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...