Ring²: Square Operations in Ring Theory

• Ring² is a multifaceted concept denoting square operations on rings, extensions, units, matrices, graph squares, and planar patterns across various mathematical fields.
• Its algebraic manifestations include square-generation in rings with involution and lattice-length 2 extensions, offering concrete criteria for when symmetric squares span the entire ring.
• In coding theory and discrete geometry, Ring² appears in the structure of M₂(Fₚ), cyclic codes, and orthogonal ring patterns, connecting algebraic frameworks to practical applications.

Ring$^2$ is not a single standardized mathematical object. Across algebra, coding theory, graph theory, and discrete geometry, it denotes several square-related constructions: the additive square $S^2$ of the symmetric part of a ring with involution; commutative ring extensions $R\subset S$ of lattice-theoretic length $2$; classes of rings constrained by conditions on $u^2$ for $u\in U(R)$; the square matrix ring $M_2(F_p)$; rings with two commuting square-zero generators; the graph square $R^2$ of a ring graph; and two-dimensional orthogonal ring patterns on square-grid combinatorics (Moskowicz, 2012, Picavet et al., 2018, Udar et al., 16 Feb 2026, Mahmood et al., 8 Aug 2025, Jr. et al., 2014, Kewat et al., 2014, Maffray et al., 2019, Bobenko et al., 2019). The unifying motif is that “square” acts on different layers of structure—elements, distinguished subsets, extensions, matrices, or geometric configurations—so the meaning of Ring$^2$ is context-dependent rather than canonical.

1. Square-generation inside rings with involution

In the setting of an associative unital $F$-algebra $S^2$0 with involution $S^2$1, the most direct reading of Ring$S^2$2 is the additive subgroup $S^2$3, where

$S^2$4

and for subsets $S^2$5, $S^2$6 denotes the additive subgroup generated by all products $S^2$7 with $S^2$8, $S^2$9. Thus $R\subset S$0 is not the literal set of single products; it is the set of all finite sums $R\subset S$1 with $R\subset S$2. Because $R\subset S$3, one always has $R\subset S$4. Herstein’s question asks whether, for a simple ring with involution of the first kind, one has $R\subset S$5 under suitable hypotheses (Moskowicz, 2012).

The strongest universal statement proved in this direction is that if $R\subset S$6 is simple, $R\subset S$7, the involution is of the first kind, and $R\subset S$8 is not commutative, then

$R\subset S$9

The paper also gives two criteria that characterize when the square already suffices. In the simple noncommutative-symmetric setting,

$2$0

and similarly

$2$1

These statements localize the obstruction to square-generation: if suitable commutator or anticommutator data can be forced into $2$2, simplicity upgrades that inclusion to equality. The same framework yields parallel product-generation results for $2$3, $2$4, $2$5, $2$6, $2$7, and $2$8. In the matrix cases considered explicitly—transpose involution on $2$9 and symplectic involution on $u^2$0—the criteria are verified directly, so the symmetric square does generate the full matrix ring (Moskowicz, 2012).

2. Ring$u^2$1 as an extension of length $u^2$2

In commutative algebra, Ring$u^2$3 arises naturally as an extension $u^2$4 whose lattice of intermediate rings has length $u^2$5. If

$u^2$6

then $u^2$7 means that there exists a chain $u^2$8, but no longer chain $u^2$9. The central characterization is that, for a non-minimal extension, the following are equivalent: every proper intermediate ring $u\in U(R)$0 makes $u\in U(R)$1 minimal; every proper intermediate ring $u\in U(R)$2 makes $u\in U(R)$3 minimal; and $u\in U(R)$4. In this sense, Ring$u\in U(R)$5 is exactly the height-$u\in U(R)$6 case in the lattice $u\in U(R)$7 (Picavet et al., 2018).

Such extensions satisfy a sharp dichotomy. Every extension of length $u\in U(R)$8 is either pointwise minimal or simple, and these two possibilities are mutually exclusive. In addition, every length-$u\in U(R)$9 extension is quasi-Prüfer, and the support satisfies

$M_2(F_p)$0

The classification then splits according to support size, integrality, and the canonical decomposition

$M_2(F_p)$1

When $M_2(F_p)$2, the lattice $M_2(F_p)$3 has either $M_2(F_p)$4 or $M_2(F_p)$5 elements, and the extension is simple. In the $M_2(F_p)$6-crucial integral case, the possibilities divide into $M_2(F_p)$7-closed, seminormal infra-integral, subintegral, and mixed cases. The $M_2(F_p)$8-closed local case reduces to the residual field extension $M_2(F_p)$9. For a finite separable field extension $R^2$0, length $R^2$1 is characterized by the distinct principal subfields $R^2$2: one has $R^2$3 exactly when $R^2$4 and

$R^2$5

A major corollary is that every simple ring extension of length $R^2$6 has FIP, whereas the co-pointwise minimal cases are exactly the source of possible non-FIP behavior (Picavet et al., 2018).

3. Square conditions on units: $R^2$7-$R^2$8 and $R^2$9-UNJ rings

A different interpretation of Ring$^2$0 focuses on the squares of units. One recent class is that of $^2$1-$^2$2 rings, defined by

$^2$3

where

$^2$4

This condition is weaker than $^2$5, $^2$6-$^2$7, and $^2$8-$^2$9, but it still imposes strong structure. Every homomorphic image and every finite direct product of $F$0-$F$1 rings is again $F$2-$F$3; if $F$4, then $F$5 is $F$6-$F$7 iff $F$8 is $F$9-$S^2$00; every corner ring $S^2$01 and every unit-closed subring of a $S^2$02-$S^2$03 ring is again $S^2$04-$S^2$05. The theory also gives precise classification results: a division ring is $S^2$06-$S^2$07 iff it is $S^2$08 or $S^2$09; a local ring is $S^2$10-$S^2$11 iff its residue field is $S^2$12 or $S^2$13; and a semisimple ring is $S^2$14-$S^2$15 iff it is a finite product of copies of $S^2$16 and $S^2$17. By contrast,

$S^2$18

The paper also proves

$S^2$19

thereby locating the new class exactly between older unit conditions and radical structure (Udar et al., 16 Feb 2026).

A closely related generalization is the class of $S^2$20-UNJ rings, defined by

$S^2$21

This includes every $S^2$22-$S^2$23, $S^2$24-$S^2$25, and UNJ ring, but the converses fail. The class is stable under finite direct products, several quotient constructions, upper triangular matrix constructions, trivial extensions, skew and truncated polynomial extensions, and certain Morita contexts. It is not stable under full matrix amplification: $S^2$26 Its semisimple shadow is again extremely small: a division ring is $S^2$27-UNJ iff it is $S^2$28 or $S^2$29, and a semilocal ring is $S^2$30-UNJ exactly when

$S^2$31

In stronger structural settings, the square condition forces polynomial identities. For regular rings,

$S^2$32

For semi-potent rings, the conditions “$S^2$33 is 2-UNJ”, “$S^2$34 is 2-UJ”, and “$S^2$35 is tripotent” become equivalent (Mahmood et al., 8 Aug 2025).

4. Square matrix rings and square-zero generators in coding theory

In algebraic coding theory, Ring$S^2$36 appears literally as the square matrix ring

$S^2$37

the full $S^2$38 matrix ring over the prime field. This ring is treated as a finite Frobenius ring, and its coding-theoretic structure is organized through a quadratic-field embedding

$S^2$39

where $S^2$40 is irreducible over $S^2$41. The resulting subring $S^2$42 yields the decomposition

$S^2$43

with $S^2$44, and also a nilpotent presentation

$S^2$45

The paper derives the homogeneous weight on $S^2$46, introduces the Bachoc weight

$S^2$47

and constructs a left $S^2$48-module isometry

$S^2$49

that transports cyclic codes over the noncommutative matrix ring to additive cyclic codes over the chain ring $S^2$50 while preserving distance. Under $S^2$51, a cyclic code of length $S^2$52 over $S^2$53 has the form

$S^2$54

with

$S^2$55

This is a genuinely noncommutative Ring$S^2$56 theory centered on $S^2$57 itself (Jr. et al., 2014).

A second coding-theoretic usage concerns the non-chain local ring

$S^2$58

whose defining feature is the presence of two commuting nilpotents of index $S^2$59. Every element has unique form

$S^2$60

the ring has cardinality $S^2$61, maximal ideal $S^2$62, and is not a chain ring because $S^2$63 is not principal. Cyclic codes over

$S^2$64

admit a unique four-generator canonical form

$S^2$65

with divisibility chain

$S^2$66

The paper computes free rank, rank, minimal spanning sets, code size, and Hamming distance, and proves that the Hamming distance is controlled by the bottom torsion component

$S^2$67

Its Gray map

$S^2$68

is a distance-preserving isometry from Lee distance on $S^2$69 to Hamming distance on $S^2$70, and the Gray image of a cyclic code is $S^2$71-quasi-cyclic. For $S^2$72 and $S^2$73, the construction yields all ternary optimal codes of length $S^2$74 except the code with parameters $S^2$75 (Kewat et al., 2014).

5. Graph-theoretic Ring$S^2$76 and the square of a ring graph

In graph theory, a ring is a graph whose vertex set is partitioned into $S^2$77 nonempty sets

$S^2$78

such that each $S^2$79 is a clique, each $S^2$80 is anticomplete to all nonconsecutive bags, some vertex of each $S^2$81 is complete to $S^2$82, and the vertices of $S^2$83 are linearly ordered by domination. Hyperholes are the special case in which every vertex of $S^2$84 is complete to $S^2$85. The main theorem states that if $S^2$86 is a $S^2$87-ring, then

$S^2$88

Even rings are perfect, and there is an $S^2$89 algorithm that either returns an optimal coloring or certifies that the input is not a ring (Maffray et al., 2019).

The same paper isolates several direct consequences for the graph square $S^2$90. If $S^2$91 has ring partition $S^2$92, then in $S^2$93 a vertex of $S^2$94 can be adjacent only to vertices in

$S^2$95

Moreover, for every $S^2$96, the bags $S^2$97 and $S^2$98 are complete to each other in $S^2$99. This yields a $R\subset S$00-local cyclic structure for the square. A plausible implication is that $R\subset S$01 is naturally compared with a blow-up of $R\subset S$02, and for hyperholes this comparison is exact in the sense recorded in the paper’s synthesis (Maffray et al., 2019).

6. Two-dimensional ring patterns and square-grid geometry

In discrete differential geometry, Ring$R\subset S$03 appears in an entirely different sense: orthogonal ring patterns in the plane. Here one starts with a cell complex $R\subset S$04 formed from a subset of quadrilaterals of the square lattice $R\subset S$05, and each vertex carries a ring consisting of an inner circle $R\subset S$06 of signed radius $R\subset S$07 and an outer circle $R\subset S$08 of radius $R\subset S$09, both concentric. Neighboring rings satisfy crossed orthogonality conditions, and each elementary square satisfies a touching condition involving two inner circles and two outer circles. Orthogonality forces all rings in a connected pattern to have the same area,

$R\subset S$10

so one may write

$R\subset S$11

The central result is that the $R\subset S$12-variables satisfy exactly the same interior equation as orthogonal circle patterns: $R\subset S$13 Thus orthogonal ring patterns are governed by the same integrable equation as orthogonal circle patterns (Bobenko et al., 2019).

Because the equation depends only on differences $R\subset S$14, the shift

$R\subset S$15

produces a one-parameter family of orthogonal ring patterns. After rescaling, the limit $R\subset S$16 yields the ordinary orthogonal circle pattern with radii $R\subset S$17, while $R\subset S$18 yields its dual with radii $R\subset S$19. The paper constructs ring-pattern analogues of the Doyle spiral, Erf, and $R\subset S$20 functions, and develops a variational principle with Hessian

$R\subset S$21

This gives existence and uniqueness for Dirichlet boundary data and a one-parameter family for Neumann boundary data. In this geometric setting, Ring$R\subset S$22 is a planar square-grid annular geometry interpolating between a circle pattern and its dual (Bobenko et al., 2019).

The cumulative picture is therefore plural rather than singular. In one direction, Ring$R\subset S$23 means $R\subset S$24, the square-generated additive span of symmetric elements, with the central problem of deciding when $R\subset S$25. In another, it means a height-$R\subset S$26 extension $R\subset S$27. In radical theory it encodes constraints on unit squares such as $R\subset S$28 or $R\subset S$29. In coding theory it points either to the square matrix ring $R\subset S$30 or to rings with two commuting square-zero generators. In graph theory it refers to the square $R\subset S$31 of a ring graph, and in discrete geometry to ring patterns on square-grid combinatorics. The notation is therefore best understood as a family resemblance built around “square” operations on ring-theoretic or ring-like objects, not as a single universally fixed definition.