Permutation groups with a cyclic two-orbits subgroup and monodromy groups of Laurent polynomials

In this paper, we generalize the work of [20] to every finite Abelian group so as to obtain a new upper bound for the little cross number in the general case, which no longer depends

Indeed, it is shown in [Nag04] that this upper bound, computed using a type system, has a purely geometric interpretation (it is the spectral radius of a random walk on the tree

Thus, we recommend the integration of new digital devices which are used in their daily lives mainly the iPad in teaching and fostering the reading proficiency of students of

We give the coefficients of the irreducible characters of the symmetric group that contribute to the number of cycles of a permutation, considered as a class function of

Keywords: non-equivalent colorings; graphical Bell number; extremal theory; fixed maximum degree..

Ilias, Immersions minimales, premiere valeur propre du Lapla- cien et volume conforme, Mathematische Annalen, 275(1986), 257-267; Une ine- galit´e du type ”Reilly” pour

But it was proved that the only group satisfying in this equality is the group mentioned in the case(b) of part (I) of Theorem 1.1, which described in Example 2.3.. We now show

We will see that every transitive permutation group G with bounded movement equal to m, such that G is not a 2-group but in which every non- identity element has the movement m or m