GNU social JP
  • FAQ
  • Login
GNU social JPは日本のGNU socialサーバーです。
Usage/ToS/admin/test/Pleroma FE
  • Public

    • Public
    • Network
    • Groups
    • Featured
    • Popular
    • People

Untitled attachment

Download link

Notices where this attachment appears

  1. Embed this notice
    John Carlos Baez (johncarlosbaez@mathstodon.xyz)'s status on Sunday, 23-Feb-2025 07:25:36 JST John Carlos Baez John Carlos Baez

    HARDCORE MATH POST

    I knew a guy named John McKay who had a crazy good ability to perceive patterns in math. He came up with amazing results, but also some even more amazing conjectures which turned out to be true. One was recently proved by Britta Späth and Marc Cabanes. It took 20 years of hard work, and in the process they fell in love and started a family. Their proof is massive and requires studying lots of special cases. I hope it's correct! It's way too hard for me to understand.

    But I understand the statement.

    If you have a finite group G whose cardinality |G| is divisible by p, there's a largest power of p that divides |G|, say pᵏ, and G is guaranteed to have a subgroup of cardinality pᵏ. This is called a 'Sylow p-subgroup' of G. There may be more than one, but they're all conjugate - so they all look alike in a very strong sense.

    McKay made a conjecture about this. Understanding it requires knowing a bit more stuff, which I'll happily explain if you ask.

    Here's what it says:

    For any finite group K, let n(K) be the number of irreducible complex representations of K whose dimension is not divisible by p. Let G be any finite group, and let N be the normalizer of a Sylow p-subgroup of G. Then n(G) = n(N).

    (Here I count isomorphic representations as the same.)

    Now the sensible way to prove this would be to set up a recipe to turn any irreducible complex representation of G whose dimension isn't divisible by p into one for N, and vice versa. But nobody knows how to do that, in general! So the only known proof requires separately studying tons of cases... which is really scary.

    So: mysteries remain here.

    https://www.quantamagazine.org/after-20-years-math-couple-solves-major-group-theory-problem-20250219/

    In conversation about 4 months ago from mathstodon.xyz permalink
  2. Embed this notice
    LukeAlmighty 🇨🇿 (lukealmighty@gameliberty.club)'s status on Friday, 23-Feb-2024 22:39:55 JST LukeAlmighty 🇨🇿 LukeAlmighty 🇨🇿

    This is scary.

    So many people are repeating this line. Well, THERE ARE DRUNK PEOPLE AT THE BAR. AND IT STINKS!!!

    Why would ANYONE want to meet people at bar is beyond my understanding.

    In conversation Friday, 23-Feb-2024 22:39:55 JST from gameliberty.club permalink
  3. Embed this notice
    LukeAlmighty 🇨🇿 (lukealmighty@gameliberty.club)'s status on Saturday, 17-Feb-2024 11:16:45 JST LukeAlmighty 🇨🇿 LukeAlmighty 🇨🇿
    in reply to

    @alex
    To be fair, VR sets are insanely expensive, and their reputation as a fragile and incompatible mess is quite scary.

    So, I am still waiting for a VR set, that I feel like won't be just a dead weight in my room 2 months from now. And, the entire market died before a single product got to that point.

    In conversation Saturday, 17-Feb-2024 11:16:45 JST from gameliberty.club permalink
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.