← Latest papers
🔢 mathematics

Cyclic-by-abelian counterexamples to the second and third Zassenhaus conjectures

This paper constructs a family of finite cyclic-by-abelian groups that provide counterexamples to both the second and third Zassenhaus conjectures, thereby resolving a longstanding problem posed by Margolis and del Río.

Original authors: Brecht Verbeken

Published 2026-08-05
📖 5 min read🧠 Deep dive

Original authors: Brecht Verbeken

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Great Algebraic Heist: When Groups Play Hide-and-Seek

Imagine you are a master locksmith trying to understand the secret blueprints of a massive, complex safe. In the world of mathematics, specifically a field called algebra, these "safes" are called groups. A group is just a collection of objects (like numbers, shapes, or moves in a game) that follow specific rules for combining them. Now, mathematicians discovered a way to turn these groups into a kind of "code" called an integral group ring. Think of this ring as a giant, multi-layered spreadsheet where every possible combination of the group's moves is written down as a unique number.

For decades, mathematicians had a hunch about how these spreadsheets worked. They believed in a set of rules called the Zassenhaus Conjectures. The second and third conjectures were like a promise: "If you find a hidden set of keys (a 'group basis') inside this spreadsheet that looks exactly like the original group, it must be the same set of keys, just shuffled around by a simple rotation." In other words, if you could build a perfect copy of the group inside the code, it would have to be a "twin" of the original, indistinguishable from the real thing if you looked at it through the right mathematical lens. This was a comforting idea, suggesting that the structure of these groups was rigid and unbreakable. But in the world of high-level math, "comforting" often means "waiting to be disproven."

The Paper's Discovery: A Perfect Disguise

In this paper, mathematician Brecht Verbeke pulls off a spectacular algebraic heist. He constructs a specific family of groups (let's call them the Gr groups) and proves that the Zassenhaus Conjectures are actually false for a very important class of them. Verbeke doesn't just find a glitch; he builds a "perfect disguise."

Here is how the trick works. Verbeke creates a group, GrG_r, which is a complex machine made of smaller, rotating gears (cyclic groups) working together. He then uses a special mathematical tool—an automorphism—to rearrange the entire "spreadsheet" (the integral group ring) of this group. This rearrangement is so clever that it creates a new set of keys, called YrY_r, which sits inside the same spreadsheet.

The magic of Verbeke's construction is in the details:

  1. The Perfect Mimic: If you look at the new set of keys (YrY_r) one by one, every single key looks exactly like a key from the original group (GrG_r). If you were to pick up just one key, you would swear it was the original.
  2. The Global Mismatch: However, when you look at the entire set of keys together, they are not the same. It's like having a deck of cards where every single card is a perfect copy of a real card, but the order of the deck is scrambled in a way that cannot be fixed by simply rotating the whole deck.
  3. The Proof: Verbeke proves that there is no way to "rotate" the original group to make it match this new set. The new set is a "normalized group basis" that is not rationally conjugate to the original.

This discovery is a direct hit to the Second and Third Zassenhaus Conjectures. The paper proves that for these specific groups (which are "cyclic-by-abelian," a fancy way of saying they have a very orderly, predictable structure), it is possible to have a group basis that looks like the original group in every individual piece but fails to match the whole.

The "Uniform" Trick and the Smallest Example

What makes this paper particularly impressive is that Verbeke didn't just find one weird example; he found a whole family of them. He took a previous example discovered by a mathematician named Hertweck and generalized it. Hertweck's original example was a bit clunky, but Verbeke showed that you can swap out one part of the machine (a small gear of size 3) for a gear of any size rr, as long as rr doesn't share any factors with the numbers 2, 3, or 5.

This "uniformity" is the paper's secret sauce. It proves that the obstruction (the thing stopping the groups from matching) doesn't depend on the specific size of the gear; it's a fundamental feature of the design.

The paper also gives us the smallest possible version of this "imposter" group. By choosing the smallest valid number for rr (which is 7), Verbeke constructs a group with a total size of 3360. This group has a "derived subgroup" (the part of the machine that does the heavy lifting) of size 420.

Why This Matters

The paper doesn't just say "we found a counterexample." It rigorously proves that the Zassenhaus Conjectures fail for this entire class of groups. It shows that the "simultaneous" nature of the conjecture is the weak point: while every individual element can be matched, the group as a whole cannot.

In the world of math, this is a big deal. It resolves a long-standing question posed by other mathematicians (Margolis and del Río) about whether these orderly "cyclic-by-abelian" groups were safe from such tricks. The answer is a definitive no. The paper confirms that even in the most structured, predictable groups, you can hide a perfect-looking fake that refuses to be revealed as a fake, no matter how you try to rotate the system. It's a reminder that in mathematics, sometimes the whole is truly greater than the sum of its parts, and a perfect local match doesn't guarantee a global truth.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →