← Latest papers
🔢 mathematics

Minimal Dimensions of Maximal Commutative Matrix Algebras and Sharp Courter-Type Bounds

This paper establishes sharp lower bounds for the dimensions of maximal commutative subalgebras in Mn(K)M_n(K), proving that the dimension is at least nn for all n13n \le 13 while demonstrating that Courter's n=14n=14 example is the first exceptional case and providing explicit infinite families of optimal algebras for all n14n \ge 14.

Original authors: Małgorzata Nowak-Kępczyk

Published 2026-05-05
📖 4 min read🧠 Deep dive

Original authors: Małgorzata Nowak-Kępczyk

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

Imagine you have a giant box of n×nn \times n Lego bricks. In the world of mathematics, these bricks represent matrices (grids of numbers). Usually, when you try to build a structure where every piece fits perfectly with every other piece without clashing (a "commutative" structure), the biggest, most stable tower you can build has a height equal to the size of your box (nn).

For a long time, mathematicians thought this was the absolute rule: You can't build a stable, maximal tower smaller than the size of the box.

However, in 1961, a mathematician named Courter found a loophole. He built a tower in a box of size 14 that was only 13 units high. It was a tiny, secret room inside a huge mansion that somehow held its own. The question that has puzzled mathematicians since then is: Is Courter's 14-box the only exception? Or are there smaller secret rooms hiding in boxes of size 10, 11, or 12?

This paper by Małgorzata Nowak-Kępczyk answers that question and shows how to build an infinite number of these secret rooms.

The Detective Work: Ruling Out the Small Boxes

The author acts like a detective investigating the "crime scene" of small matrix sizes.

  1. The Old Clue: Previously, there was a rough estimate (by Laffey) that said, "The tower must be at least this big," but the estimate was so loose it allowed for secret rooms in boxes as small as size 7 or 8.
  2. The New Evidence: The author uses a specific mathematical "blueprint" (called a signature) to analyze how these towers are built. She breaks every tower down into three layers: a top layer, a middle layer, and a bottom layer.
  3. The Verdict: By crunching the numbers on these layers, she proves that for any box size up to 13, it is mathematically impossible to build a tower smaller than the box itself. The "secret rooms" simply cannot exist in sizes 1 through 13.
  4. The First Exception: The first time a secret room can exist is in the box of size 14. Courter's original example is not just a fluke; it is the very first possible instance, and it is already as small as mathematically possible.

The Construction Kit: The "Stack" Method

Once the author confirmed that the secret rooms start at size 14, she didn't just stop there. She wanted to know: Can we build these tiny towers in every size larger than 14?

She invented a construction technique called the "Stack Construction."

Think of it like building with specific types of Lego bricks:

  • The Seed (E): A special, compact block of size 9 that is the most efficient "starter" for these tiny towers.
  • The Courter Block (C): The famous size-14 block.
  • The Diagonal Brick (D): A simple, standard block used to fill in gaps.

The magic of the Stack is how these blocks combine. When you stack two of these special towers on top of each other, they don't just add their heights together. Because they share a "foundation" (the identity matrix and the core structure), they overlap slightly.

  • The Analogy: Imagine stacking two tents. If you just put one on top of the other, you'd expect the height to be double. But with these special tents, the poles interlock so perfectly that the total height is less than the sum of the two individual heights. You save space with every stack.

Using this "Stack" method, the author proves that for any box size nn starting from 14, you can build a maximal commutative tower that is smaller than nn. She provides the exact recipe (how many "Seed" blocks and "Diagonal" bricks to use) to build the smallest possible tower for every single size.

The Big Picture

The paper concludes with a clear map of the landscape:

  • Sizes 1 to 13: No exceptions. The tower must be at least as big as the box.
  • Size 14: The first exception appears (Courter's example).
  • Sizes 15 and up: An infinite family of exceptions exists. You can build a tower smaller than the box for every single size, and the author has shown exactly how to build the most efficient one for each.

In short, Courter's discovery wasn't a lonely, isolated accident. It was the first member of a vast, infinite family of mathematical structures that the author has now fully mapped out and explained how to construct.

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 →