in this paper we illustrate recent results about factorizations of finite groups into conjugate subgroups. the illustrated results are joint works with john cannon, dan levy, attila mar'oti and iulian i. simion.

In this note, we provide a short and self-contained proof that the braid group on n strands acts transitively on the set of reduced factorizations of a Coxeter element in a Coxeter group of finite rank n into products of reflections. We moreover use the same argument to also show that all factorizations of an element in a parabolic subgroup of W also lie in this parabolic subgroup.

0. Introduction 1 1. Quasideterminants and Quasiminors 3 1.1. Definition of quasideterminants 3 1.2. Elementary properties of quasideterminants 4 1.3. Noncommutative Sylvester formula 5 1.4. Quasi-Plücker coordinates and Gauss LDU -factorization 5 1.5. Positive quasiminors 6 2. Basic factorizations in GLn(F) 7 3. Examples 11 3.1. A factorization in the Borel subgroup of GL3(F) 11 3.2. A factori...

In this paper, we classify finite quasiprimitive permutation groups with a metacyclic transitive subgroup, solving problem initiated by Wielandt in 1949. It also involves the classification of factorizations almost simple factor.

Let G be a finite almost simple group with socle G0. A (nontrivial) factorization of is an expression the form G=HK, where factors H and K are core-free subgroups. There extensive literature on factorizations groups, important applications in permutation theory algebraic graph theory. In recent paper, Xia second-named author describe groups solvable factor H. Several infinite families arise con...

Classes of‎ ‎Abaffy-Broyden-Spedicato (ABS) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎The algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎Here‎, ‎we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW‎ ‎factorizations of a nonsingular matrix as well as...

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,...

Character polynomials are used to study the restriction of a polynomial representation general linear group its subgroup permutation matrices. A simple formula is obtained for computing inner products class functions given by character polynomials. symmetric and alternating tensors computed using generating with Eulerian factorizations. These compute Weyl modules, which exhibit duality. By taki...

LetF be a 2-factorization of the complete graphKv admitting an automorphism groupG acting primitively on the set of vertices. IfF consists of Hamiltonian cycles, thenF is the unique, up to isomorphisms, 2-factorization ofKpn admitting an automorphism group which acts 2-transitively on the vertex-set, see [A. Bonisoli, M. Buratti, G. Mazzuoccolo, Doubly transitive 2-factorizations, J. Combin.Des...