Sylow's Theorem and the arithmetic of binomial coefficients

Authors

  • Marco Barlotti
  • Virgilio Pannone

DOI:

https://doi.org/10.1285/i15900932v22n1p83

Keywords:

Sylow's Theorem, Binomial Coefficients

Abstract

We present a result on the existence and the number of subgroups of any given prime-power order containing an arbitrarily fixed subgroup in a finite group (see also [2]). Our proof is an extension of Krull's generalization ([1],1961)of Sylow's theorem, which leads us to consider a new concept (the conditioned binomial coefficient) of independent combinatorial interest.

Downloads

Published

01-01-2003

Issue

Volume 22, Issue 1 (2003)

Section

Articoli

License

Authors who publish with this publication accept all the terms and conditions of the Creative Commons license at the link below.

Gli autori che pubblicano in questa rivista accettano i termini e le condizioni specificate nella licenza Creative Commons di cui al link sottostante.

http://creativecommons.org/licenses/by-nc-nd/3.0/it/legalcode