15,853 research outputs found

    The Large Davenport Constant I: Groups with a Cyclic, Index 2 Subgroup

    Get PDF
    Let GG be a finite group written multiplicatively. By a sequence over GG, we mean a finite sequence of terms from GG which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be ordered so that their product is the identity element of GG. The small Davenport constant d(G)\mathsf d (G) is the maximal integer ℓ\ell such that there is a sequence over GG of length ℓ\ell which has no nontrivial, product-one subsequence. The large Davenport constant D(G)\mathsf D (G) is the maximal length of a minimal product-one sequence---this is a product-one sequence which cannot be factored into two nontrivial, product-one subsequences. It is easily observed that d(G)+1≤D(G)\mathsf d(G)+1\leq \mathsf D(G), and if GG is abelian, then equality holds. However, for non-abelian groups, these constants can differ significantly. Now suppose GG has a cyclic, index 2 subgroup. Then an old result of Olson and White (dating back to 1977) implies that d(G)=12∣G∣\mathsf d(G)=\frac12|G| if GG is non-cyclic, and d(G)=∣G∣−1\mathsf d(G)=|G|-1 if GG is cyclic. In this paper, we determine the large Davenport constant of such groups, showing that D(G)=d(G)+∣G′∣\mathsf D(G)=\mathsf d(G)+|G'|, where G′=[G,G]≤GG'=[G,G]\leq G is the commutator subgroup of GG

    Factorizations of finite groups by conjugate subgroups which are solvable or nilpotent

    Get PDF
    We consider factorizations of a finite group GG into conjugate subgroups, G=Ax1⋯AxkG=A^{x_{1}}\cdots A^{x_{k}} for A≤GA\leq G and x1,…,xk∈Gx_{1},\ldots ,x_{k}\in G, where AA is nilpotent or solvable. First we exploit the split BNBN-pair structure of finite simple groups of Lie type to give a unified self-contained proof that every such group is a product of four or three unipotent Sylow subgroups. Then we derive an upper bound on the minimal length of a solvable conjugate factorization of a general finite group. Finally, using conjugate factorizations of a general finite solvable group by any of its Carter subgroups, we obtain an upper bound on the minimal length of a nilpotent conjugate factorization of a general finite group

    A characterization of class groups via sets of lengths

    Full text link
    Let HH be a Krull monoid with class group GG such that every class contains a prime divisor. Then every nonunit a∈Ha \in H can be written as a finite product of irreducible elements. If a=u_1⋅…⋅u_ka=u\_1 \cdot \ldots \cdot u\_k, with irreducibles u_1,…u_k∈Hu\_1, \ldots u\_k \in H, then kk is called the length of the factorization and the set L(a)\mathsf L (a) of all possible kk is called the set of lengths of aa. It is well-known that the system L(H)={L(a)∣a∈H}\mathcal L (H) = \{\mathsf L (a) \mid a \in H \} depends only on the class group GG. In the present paper we study the inverse question asking whether or not the system L(H)\mathcal L (H) is characteristic for the class group. Consider a further Krull monoid H′H' with class group G′G' such that every class contains a prime divisor and suppose that L(H)=L(H′)\mathcal L (H) = \mathcal L (H'). We show that, if one of the groups GG and G′G' is finite and has rank at most two, then GG and G′G' are isomorphic (apart from two well-known pairings).Comment: The current version is close to the one to appear in J. Korean Math. Soc., yet it contains a detailed proof of Proposition 2.4. The content of Chapter 4 of the first version had been split off and is presented in ' A characterization of Krull monoids for which sets of lengths are (almost) arithmetical progressions' by the same authors (see hal-01976941 and arXiv:1901.03506
    • …
    corecore