🔢 mathematics

Sums of units in finite rings and applications to Cayley graphs

This paper investigates the additive generation of finite rings by their units, establishing connections to the connectedness of gcd-graphs, perfect state transfer, and equation solvability over finite fields, while also exploring generalizations involving normalized units.

Original authors: Ján Mináč, Tung T. Nguyen, Nguyen Duy Tân

Published 2026-07-02

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Ján Mináč, Tung T. Nguyen, Nguyen Duy Tân

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 a vast, complex city called The Ring. This city is made up of buildings (numbers) and roads (operations). In this city, there is a special group of VIPs called Units. These are the buildings that have a "key" allowing them to unlock doors to other parts of the city.

The big question this paper asks is simple: Can you get from any building in the city to any other building just by combining these VIPs?

In math terms, can you write any number in the ring as a sum of these special "Unit" numbers? The authors, Ján Mináč, Tung T. Nguyen, and Nguyễn Duy Tân, explore this question for "finite rings" (cities with a limited number of buildings) and discover some surprising rules about how these cities are connected.

Here is a breakdown of their findings using everyday analogies:

1. The "Two-Key" Rule

The authors start by asking: Can every building be reached by adding just two VIPs together?

The Discovery: They found a simple "litmus test" for this. If your city (ring) doesn't have a tiny, boring sub-city called F2 (which only has two buildings: 0 and 1) as a separate, isolated piece, then yes, you can reach everywhere using just two VIPs.
The Analogy: Think of the city as a giant puzzle. If the puzzle doesn't contain a specific, tiny, broken piece (the F2 sub-city), then the whole puzzle is connected. You can build any shape using just two special tiles.
The Graph Connection: They also looked at a map of the city called a Cayley Graph. If you can reach everywhere with two VIPs, this map is a single, connected web. If you can't, the map is broken into isolated islands.

2. The "Normalized" VIPs

Sometimes, you aren't allowed to use all VIPs. Maybe you are only allowed to use VIPs that wear a specific badge (called "Normalized Units").

The Challenge: The authors asked: If we restrict our VIPs to only those with a specific badge, can we still reach every building?
The Matrix City: In cities made of grids (Matrix Rings), they proved that even with these restricted VIPs, you can still reach everywhere using just two of them. It's like saying, "Even if we only use VIPs who are left-handed, we can still build the whole city."
The Group City: In cities built from groups (Group Rings), the answer depends on the size of the group and the type of city. Sometimes you need more than two VIPs; sometimes two is enough.

3. The Field Extension Puzzle

One of the most detailed parts of the paper looks at cities that are "extensions" of smaller cities (like building a skyscraper on top of a small house).

The Goal: They wanted to know the minimum number of normalized VIPs needed to build any building in the new, larger city.
The Result: They created a precise chart.
- If the new city is very tall (high dimension), you only need 2 VIPs.
- If it's a medium-sized expansion, you might need 3.
- In some tricky, specific cases, you need 4.
The Metaphor: Imagine trying to fill a bucket with water using only specific types of cups. The authors figured out exactly how many cups you need based on the size of the bucket and the shape of the cups. They found that for most situations, 2 or 3 cups are enough, but for certain weirdly shaped buckets, you need a 4th cup to finish the job.

4. The "Quantum Ghost" Connection

The final part of the paper connects this math to Quantum Physics and Perfect State Transfer (PST).

The Concept: Imagine a "quantum ghost" trying to teleport instantly from one building to another in the city. For this to happen perfectly, the city's layout (the graph) must have very specific, rigid properties.
The Finding: The authors proved that if your city follows the "Sum of Units" rules they discovered (meaning it is well-connected and you can build everything from VIPs), then this quantum teleportation is impossible.
The Analogy: It's like saying, "If a city is so well-connected that you can walk anywhere using just two types of steps, then a ghost cannot magically teleport from one corner to the other." The very connectivity that makes the city accessible to normal people prevents the "ghost" from doing its magic trick.

Summary

In short, this paper is a detective story about connectivity.

It identifies exactly when a mathematical city is fully connected using its special "Unit" numbers.
It calculates the minimum number of these units needed to build any part of the city.
It uses these rules to prove that in these well-connected cities, a specific type of quantum teleportation (Perfect State Transfer) can never happen.

The authors show that the structure of these abstract number systems is deeply linked to the shape of their maps and the laws of quantum movement.

Technical Summary: Sums of Units in Finite Rings and Applications to Cayley Graphs

Problem Statement
The paper investigates the additive generation of finite rings by specific subsets of their unit groups. Historically, this problem was framed by Skornyakov, who asked whether every element in a von Neumann regular ring (excluding those with $\mathbb{F}_2$ as a quotient) is a sum of units. While the commutative case was settled in prior literature via graph-theoretic connections (specifically the connectedness of unitary Cayley graphs), this work extends the inquiry to non-commutative finite rings and generalizes the generating set.

The authors examine two primary variations:

Sums of Units: Determining which elements in a finite ring $R$ can be expressed as the sum of exactly $n$ units ( $R^\times$ ).
Sums of Normalized Units: Investigating the $n$ -sum property where the generating set is restricted to specific subgroups of units, such as normalized units in matrix rings, group rings, or finite field extensions (defined via norm maps).

A central motivation for this study is the relationship between the additive generation of a ring by a set $S$ and the connectedness of the associated Cayley graph $\Gamma(R, S)$ . The paper further explores how these algebraic properties influence the existence of Perfect State Transfer (PST) on such graphs.

Methodology
The authors employ a synthesis of algebraic techniques (Jacobson radicals, Artin-Wedderburn decomposition, group ring structures) and graph-theoretic arguments (connectedness, bipartiteness, spectral analysis).

Algebraic Decomposition: For finite rings, the authors utilize the semisimplification $R_{ss} \cong \prod M_{n_i}(\mathbb{F}_i)$ to reduce problems to matrix rings over finite fields. They analyze the Jacobson radical and lifting properties to extend results from semisimple rings to general finite rings.
Graph-Theoretic Correspondence: The paper leverages the established equivalence that a ring $R$ is additively generated by a set $S$ if and only if the Cayley graph $\Gamma(R, S)$ is connected. This allows the authors to translate algebraic generation problems into questions about graph connectivity and bipartiteness.
Spectral Analysis: In the context of Perfect State Transfer, the authors restrict their study to $\mathbb{Z}/m$ -symmetric Frobenius rings. They utilize character theory and supercharacter theory to analyze the spectrum of Cayley graphs, specifically examining the abelian group generated by differences of vertices that yield identical eigenvalues.
Explicit Constructions: For specific cases (e.g., matrix rings and field extensions), the authors provide constructive proofs using determinant identities, Gauss elimination, and character sum estimates (including Weil bounds) to demonstrate the existence of solutions to specific sum equations.

Key Contributions and Results

1. Characterization of the 2-Sum Property in Finite Rings
The paper provides a comprehensive set of equivalent conditions for a finite ring $R$ to possess the 2-sum property (every element is a sum of two units):

$R$ has no quotient isomorphic to $\mathbb{F}_2$ .
$R$ contains at least one "exceptional unit" (a unit $u$ such that $1-u$ is also a unit).
The unitary Cayley graph $G_R$ is not bipartite.
The authors prove that if $R$ has the 2-sum property, any quotient $R'$ also possesses it, though the converse does not generally hold. They also classify exactly which elements in a finite ring are sums of two units, showing that an element $x$ is a sum of two units if and only if its image in the semisimple quotient lies in the kernel of the projection onto the $\mathbb{F}_2$ -factors.

2. Sums of Normalized Units
The authors generalize Skornyakov's problem to subsets $S \subset R^\times$ , specifically focusing on "normalized units":

Matrix Rings: They prove that for $n \ge 2$ , every matrix in $M_n(\mathbb{F})$ is the difference of two matrices in $SL_n(\mathbb{F})$ , implying the 2-sum property with respect to $\pm SL_n(\mathbb{F})$ .
Group Rings: They establish conditions under which the $n$ -sum property lifts from a field $F$ to the group ring $F[G]$ . Specifically, if $F$ has the $n$ -sum property, then $F[G]$ has the $n$ -sum property with respect to the preimage of the unit group under the augmentation map, provided $G$ is a $p$ -group (where $p = \text{char}(F)$ ) or $|G|$ is invertible in $F$ .
Finite Field Extensions: A significant contribution is the complete classification of the minimal $n$ $n$ (denoted $m(L/F)$ $m (L / F)$ ) for which a finite field extension $L/F$ $L / F$ is additively generated by the set of normalized units $U^\pm_{L/F} = \{u \in L^\times \mid N(u) = \pm 1\}$ $U_{L / F}^{\pm} = {u \in L^{\times} ∣ N (u) = \pm 1}$ .
- $m(L/F) = 2$ if $[L:F] \ge 3$ , or if $[L:F]=2$ and $q \in \{2, 3\}$ .
- $m(L/F) = 3$ if $[L:F]=2$ , $q \notin \{2, 3\}$ , and specific modular conditions on $q$ are met (e.g., $q \equiv 0 \pmod 3$ ).
- $m(L/F) = 4$ in the remaining quadratic cases.
  The authors provide sharp bounds, proving that for any non-trivial finite extension, the Cayley graph $\Gamma(L, U^\pm_{L/F})$ is connected.

3. Applications to Cayley Graphs and Perfect State Transfer
The paper applies these algebraic results to the study of Perfect State Transfer (PST) on Cayley graphs:

Connectedness of GCD-Graphs: Using the classification of elements that are sums of two units, the authors provide a complete characterization of when a gcd-graph $\Gamma(R, S)$ is connected. The graph is connected if and only if the two-sided ideals generated by the elements of $S$ sum to $R$ and a specific "cube-like" graph over the $\mathbb{F}_2$ -quotient is connected.
Non-Existence of PST: The authors prove a general theorem: If a finite ring $R$ $R$ has the $n$ $n$ -sum property with respect to a subgroup $U \subset R^\times$ $U \subset R^{\times}$ (containing $-1$), then any $U$ $U$ -unitary Cayley graph $\Gamma(R, S)$ $Γ (R, S)$ admits no Perfect State Transfer.
- The proof relies on showing that the abelian group generated by differences of vertices with identical eigenvalues ( $\Delta$ ) equals the entire ring $R$ . By the non-degeneracy of the associated character, this forces the transfer distance to be zero, which contradicts the definition of PST between distinct vertices.
- As a direct corollary, gcd-graphs over rings with the 2-sum property (which includes all finite rings not having $\mathbb{F}_2$ as a quotient) do not exhibit PST.
- This result is extended to the graphs $\Gamma(L, U^\pm_{L/F})$ studied in Section 3, proving they never admit PST.

Significance and Claims
The paper claims to resolve Skornyakov's question for all finite rings (commutative or not) by linking the algebraic property of additive generation to the geometric property of graph connectedness. It offers a "sharp" answer to the minimal number of normalized units required to generate finite field extensions, a problem previously approached via generalized Paley graphs but now solved with precise arithmetic conditions.

Furthermore, the work establishes a strong negative result regarding quantum information: the presence of the $n$ -sum property in the underlying ring structure is a sufficient condition to rule out Perfect State Transfer on the associated Cayley graphs. This connects deep algebraic structures (unit groups, norms) directly to the spectral properties governing quantum walks, providing a tool to identify graphs that are unsuitable for specific quantum state transfer protocols. The authors note that their results intersect algebra, number theory, and graph theory, offering a unified framework for these diverse areas.