Intersective \(S_n\) polynomials with few irreducible factors (Q728470)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Intersective \(S_n\) polynomials with few irreducible factors
scientific article

    Statements

    Intersective \(S_n\) polynomials with few irreducible factors (English)
    0 references
    0 references
    0 references
    20 December 2016
    0 references
    A monic polynomial \(f(x)\in\mathbb Z[x]\) is said to be \textit{intersective} if it has a root modulo all positive integers \(m\), but no rational root. From [the second author, J. Théor. Nombres Bordx. 21, No. 2, 437--439 (2009; Zbl 1259.11104)] we know that if a finite group \(G\) is realizable as a Galois group over \(\mathbb Q\), then it is also realizable as the Galois group of an intersective polynomial. Let \(r(G)\) be the smallest number of irreducible factors of an intersective polynomial realizing \(G\) over \(\mathbb Q\). Let \(s(G)\) be the smallest number of proper subgroups of \(G\) having the property that the union of the conjugates of those subgroups is \(G\) and their intersection is trivial. The normal covering number \(\gamma(G)\) is defined analogously, except that one drops the trivial intersection condition. It is easy to see that \(s(G)=\gamma(G)\) or \(s(G)=\gamma(G)+1\). As a consequence of a proposition in [the second author, Proc. Am. Math. Soc. 136, No. 6, 1955--1960 (2008; Zbl 1195.12007)], \(s(G)\leq r(G)\); it is natural to ask for which \(G\), realizable over \(\mathbb Q\), there is an equality. In the paper under review, the authors study the case \(G=S_n\), for \(n\geq 3\). First of all they show that \(s(S_n)=\gamma(S_n)\) and they introduce a new number \(\gamma'(S_n)\) which turns out to be either equal to \(\gamma(S_n)\) or to \(\gamma(S_n)+1\). Furthermore they prove that \(2\leq \gamma(S_n)\leq r(S_n)\leq \gamma'(S_n)\), for all \(n\geq 3\), and that \(\gamma(S_n)=r(S_n)=\gamma'(S_n)\), in the case \(n\) is odd. In the case of even \(n\), the question about equalities turns out to be much more subtle (and still open in general), as the authors show with their computations for \(n=10\) and \(n=14\).
    0 references
    intersective polynomials
    0 references
    normal covering
    0 references
    symmetric groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references