{"id":281,"date":"2022-10-20T13:06:45","date_gmt":"2022-10-20T13:06:45","guid":{"rendered":"https:\/\/petermc.net\/blog\/?p=281"},"modified":"2025-08-07T12:11:48","modified_gmt":"2025-08-07T12:11:48","slug":"smmc-2022-a4","status":"publish","type":"post","link":"https:\/\/petermc.net\/blog\/2022\/10\/20\/smmc-2022-a4\/","title":{"rendered":"SMMC 2022 A4"},"content":{"rendered":"

The Simon Marais Mathematics Competition<\/a> happened last weekend. It is a maths competition for undergraduate students across Europe, Asia, Africa and Oceania. This post is about problem A4, which I submitted. I’ll talk a bit about where the problem came from, a generalisation, a conjecture and also provide a solution. The entire paper is available on the Marais website, and solutions should be put up there at some time in the near future.<\/p>\n

Problem (SMMC 2022 A4)<\/strong>
\nLet \"n\" be a positive integer, and let \"q\geq 3\" be an odd integer such that every prime factor of \"q\" is larger than \"n\". Prove that <\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

is an integer that has no prime factor in common with \"\displaystyle{\frac{q-1}{2}}\".<\/p>\n

Origins<\/strong><\/p>\n

Let \"G=GL_n(\mathbb{F}_q)\" and let \"N\" be the subgroup of monomial matrices (a matrix is a monomial matrix if and only if it has exactly one nonzero entry in each row and column). I show below in my solution that this question is equivalent to the fact that the integer \"|G|/|N|\" is coprime to \"(q-1)/2\". Now why would I ever care about that?<\/p>\n

This coprimality fact implies that the cohomology of \"G\" with mod \"(q-1)/2\" coefficients is isomorphic to the cohomology of \"N\" with mod \"(q-1)/2\" coefficients. And I was interested in these cohomology groups because the second cohomology group classifies central extensions, which is what I used to think about back in my PhD days. The group \"N\" feels somewhat more “combinatorial” than \"G\", so it is nice to be able to pass information from \"N\" to \"G\" for free.<\/p>\n

Generalisations<\/strong> (known and conjectural)<\/p>\n

Let \"G\" be a split reductive group over \"\mathbb{F}_q\", which I conflate with its \"\mathbb{F}_q\"-points below in an abuse of notation. Let \"T\" be a maximal split torus and \"N\" its normaliser in \"G\". Then<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

Here \"\Phi^+\" is the set of positive roots and the collection of integers \"\{d_i\}\" are the exponents of the Weyl group. Then the same argument as in my proof below shows that this fraction is an integer, relatively prime to \"\frac{q-1}{2}\".<\/p>\n

If we remove the assumption that \"G\" is split, then I suspect the same conclusion is satisfied, but there is an additional argument needed as the formula for the quotient has additional factors. I have not worked out this argument and really don’t want to resort to case by case arguments, so there is your conjecture (I expect we now need to say \"T\" is a maximal torus containing a maximal split torus).<\/p>\n

Solution<\/strong><\/p>\n

First we show that the fraction in the question is an integer. Since \"q-1\" divides \"q^d-1\" as a polynomial for all \"d\", the statement only depends on the residue class of \"q\" modulo \"n!\". Since every prime factor of \"q\" is greater than \"n\", \"q\" is relatively prime to \"n!\". So by Dirichlet’s theorem on primes in arithmetic progressions, we may assume without loss of generality that \"q\" is prime.<\/p>\n

Let \"G=GL_n(\mathbb{F}_q)\" and let \"N\" be the subgroup of monomial matrices. Then <\/p>\n

  <\/span>   <\/span>\"\[|G|=q^{\frac{n(n-1)}{2}}\prod_{d=1}^n q^d-1 \qquad \mbox{and}\qquad |N|=n!(q-1)^n.\]\"<\/p>\n

By Lagrange’s theorem \"|G|/|N|\" is an integer. Since \"q\" is relatively prime to \"|N|\", we can further divide by the largest power of \"q\" in \"|G|\" and deduce that<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

is an integer.<\/p>\n

Now let \"p\" be a prime dividing \"\frac{q-1}{2}\" and let \"d\" be a positive integer. To conclude, it suffices to show that the fraction<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

has zero \"p\"-adic valuation. Write \"q=1+2m\", then by the binomial theorem,<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

Let \"a=v_p(d)\" and \"b=v_p(m)\". Since \"v_p(i!)=\lfloor\frac{i}{p}\rfloor+\lfloor\frac{i}{p^2}\rfloor+\lfloor\frac{i}{p^3}\rfloor+\cdots <\frac{i}{p-1}\", we get<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

We have the inequality \"v_p(2)-\frac{1}{p-1}\geq \frac{v_p(2)-1}{2}\", so<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

For \"i\geq 2\", we therefore get<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

as \"b\geq 1\" from our assumption that \"p\" divides \"m\".
\nThus in our sum, the term with \"i=1\" has a strictly smaller \"p\"-adic valuation than every other term, so determines the \"p\"-adic valuation of the sum, and we get<\/p>\n

  <\/span>   <\/span>\"\[<\/p>\n

completing the proof.<\/p>\n","protected":false},"excerpt":{"rendered":"

The Simon Marais Mathematics Competition happened last weekend. It is a maths competition for undergraduate students across Europe, Asia, Africa and Oceania. This post is about problem A4, which I submitted. I’ll talk a bit about where the problem came … Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[6],"tags":[],"class_list":["post-281","post","type-post","status-publish","format-standard","hentry","category-maths"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p7V6a7-4x","_links":{"self":[{"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/posts\/281","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/comments?post=281"}],"version-history":[{"count":8,"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/posts\/281\/revisions"}],"predecessor-version":[{"id":433,"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/posts\/281\/revisions\/433"}],"wp:attachment":[{"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/media?parent=281"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/categories?post=281"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/petermc.net\/blog\/wp-json\/wp\/v2\/tags?post=281"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}