Preprint
Article

This version is not peer-reviewed.

Notes on Near-Factorizations with Dihedral Quotients

Submitted:

06 October 2026

Posted:

08 October 2026

You are already at the latest version

Abstract
Let G be a finite group admitting an epimorphism onto the dihedral group D2p, where p is an odd prime. We study near-factorizations \( G\setminus\{1\}=S\times T \)through the quotient images of the two factors in the integral group ring Z[D2p]. The quotient images satisfy the identity \( \widehat f(S)\widehat f(T)=|Ker(f)|H-1 \), and the irreducible representations of D2p turn this identity into necessary conditions on the quotient multiplicities: the nontrivial linear character forces the two coset counts of each factor to differ by exactly one, and the two-dimensional representations impose determinant-unit conditions in cyclotomic integer rings. We also derive a Fourier energy identity, a joint energy inequality, and an exact finite system of equations for the quotient multiplicities. Under an explicit orbit-commutativity hypothesis we obtain closed formulas for the orbit norms of the quotient images. Finally, we prove a lifting criterion for near-factorizations of D2p×Cm and give an exact verification procedure.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

Let G be a finite group with identity element 1. A pair ( S , T ) of subsets of G is called a near-factorization of G if | S | ≥ 2 , | T | ≥ 2 , and the multiplication map
μ : S × T ⟶ G ∖ { 1 } , μ ( s , t ) = s t ,
is well-defined and bijective. Equivalently, no product s t with s ∈ S , t ∈ T is equal to 1, and every element of G ∖ { 1 } has exactly one such representation. We write this condition as
G ∖ { 1 } = S × T .
Subject to the same cardinality assumptions, this is equivalent to the group-ring identity
S T = G − 1
in Z [ G ] ; in particular,
| S | | T | = | G | − 1 .
Throughout the paper we keep the standing assumption | S | , | T | ≥ 2 in the definition of a near-factorization. Every “if and only if” criterion below includes this condition explicitly, so that the convention is never silently dropped.
Near-factorizations are closely related to factorizations of finite groups, tilings, perfect codes, Cayley graphs and algebraic combinatorics. The nonabelian case is considerably more difficult because the ambient group ring is generally noncommutative. A foundational study of near-factorizations of finite groups appears in the work of de Caen, Gregory, Hughes and Kreher [2]; further developments can be found in [1,4,5,8].
In this paper we study near-factorizations of finite groups admitting a dihedral quotient. Let p be an odd prime and write
D 2 p = 〈 r , s ∣ r p = s 2 = 1 , s r s = r − 1 〉 .
Suppose that
f : G ⟶ D 2 p
is an epimorphism. The quotient images of the two factors satisfy a rigid identity in Z [ D 2 p ] . We use this identity and the irreducible representations of D 2 p to derive restrictions on the quotient multiplicities.
The main results of the paper are the following.
(i)
We establish the quotient group-ring identity
f ^ ( S ) f ^ ( T ) = | Ker ( f ) | H − 1 .
(ii)
We derive a linear spectral obstruction: the two quotient coset counts of each factor differ by exactly one, and the two factors have opposite imbalances. (The oddness of | S | and | T | already follows from | S | | T | = | G | − 1 .)
(iii)
We derive determinant-unit conditions in cyclotomic integer rings from the two-dimensional irreducible representations of D 2 p . The conditions for the various representations are Galois conjugate and hence equivalent.
(iv)
We prove a Fourier energy identity and a joint energy inequality for the quotient images.
(v)
We formulate an exact finite system of nonnegative integer equations for the quotient multiplicities.
(vi)
Under an explicit orbit-commutativity hypothesis, we obtain closed formulas for the orbit norms of the quotient images.
(vii)
We prove a lifting criterion for direct products D 2 p × C m and give an exact verification procedure.
It is useful to record the logical hierarchy of these results. The quotient identity is an unconditional consequence of the near-factorization property, and the exact quotient coefficient system is equivalent to it at the level of coefficients. The linear, matrix and determinant-unit conditions, as well as the energy identities, are consequences of the quotient identity; they may be used as preliminary filters in computations, but they are not independent of the full coefficient system. By contrast, the orbit-norm formulas require an explicit commutativity hypothesis, which we state precisely and do not claim to be necessary.

2. Preliminaries

2.1. Group-Ring Notation

For a finite group G and a subset A ⊆ G , we identify A with the group-ring element
A = ∑ a ∈ A a ∈ Z [ G ] .
If
A = ∑ g ∈ G a g g , B = ∑ g ∈ G b g g ,
then the coefficient of g in A B is
[ A B ] g = ∑ x y = g a x b y .
Let f : G → H be a group homomorphism. Its linear extension
f ^ : Z [ G ] ⟶ Z [ H ]
is a ring homomorphism. If A ⊆ G , then
f ^ ( A ) = ∑ h ∈ H | A ∩ f − 1 ( h ) | h .
We use standard facts from the representation theory of finite groups; see, for instance, Serre [7].
Definition 1. 
Let f : G → H be a group homomorphism and let A ⊆ G . For h ∈ H , the number
μ A ( h ) = | A ∩ f − 1 ( h ) |
is called the quotient multiplicity of A at h.

2.2. The Dihedral Group

Throughout the paper,
D 2 p = 〈 r , s ∣ r p = s 2 = 1 , s r s = r − 1 〉 .
Every element of D 2 p has a unique expression
r a s ε , a ∈ F p , ε ∈ { 0 , 1 } .
The multiplication rule is
( r a s ε ) ( r b s δ ) = r a + ( − 1 ) ε b s ε + δ ,
where the second exponent is reduced modulo 2.
Let
H = ∑ h ∈ D 2 p h
be the full group sum. Since | D 2 p | = 2 p ,
H 2 = 2 p H .
The rotation subgroup is
R = 〈 r 〉 ,
and its other coset is
R s = { r a s : a ∈ F p } .

2.3. Irreducible representations

Let
ζ = e 2 π i / p .
The two one-dimensional representations of D 2 p are
χ + ( r ) = 1 , χ + ( s ) = 1 ,
and
χ − ( r ) = 1 , χ − ( s ) = − 1 .
For 1 ≤ j ≤ ( p − 1 ) / 2 , define
ρ j ( r ) = ζ j 0 0 ζ − j , ρ j ( s ) = 0 1 1 0 .
Then
ρ j ( r a s ε ) = ζ j a 0 0 ζ − j a , ε = 0 , 0 ζ j a ζ − j a 0 , ε = 1 .
The representations
χ + , χ − , ρ 1 , … , ρ ( p − 1 ) / 2
form a complete set of irreducible complex representations of D 2 p .
For every nontrivial irreducible representation θ of D 2 p ,
θ ( H ) = 0 .

3. The Quotient Group-Ring Identity

We begin with the basic identity from which all subsequent restrictions follow.
Theorem 1 
(Quotient identity). Let G be a finite group and let
G ∖ { 1 } = S × T
be a near-factorization. Suppose that
f : G ⟶ D 2 p
is an epimorphism. Put
K = Ker ( f ) , k = | K | .
Then
f ^ ( S ) f ^ ( T ) = k H − 1 in Z [ D 2 p ] .
Proof  of Theorem 2. 
The near-factorization condition gives
S T = G − 1
in Z [ G ] . Since f ^ is a ring homomorphism,
f ^ ( S ) f ^ ( T ) = f ^ ( G ) − 1 .
Every element of D 2 p has exactly k preimages under f. Hence
f ^ ( G ) = k ∑ h ∈ D 2 p h = k H .
Therefore
f ^ ( S ) f ^ ( T ) = k H − 1 .
   □
Lemma 1. 
The element k H − 1 is invertible in Q [ D 2 p ] , with
( k H − 1 ) − 1 = − 1 + k 2 p k − 1 H .
Proof of Lemma 3. 
Using H 2 = 2 p H , we have
( k H − 1 ) − 1 + k 2 p k − 1 H = 1 − k H − k 2 p k − 1 H + 2 p k 2 2 p k − 1 H = 1 .
The same calculation in the reverse order gives the result.    □
Corollary 1. 
With the notation of Theorem 1, put
X = f ^ ( S ) , Y = f ^ ( T ) .
Then X and Y are invertible in Q [ D 2 p ] and
X Y = Y X = k H − 1 .
Proof of Corollary 4. 
By Theorem 1 and Lemma 1, X Y is invertible in Q [ D 2 p ] . The algebra Q [ D 2 p ] is finite-dimensional over Q ; since the composition of the left-multiplication maps
L X L Y = L X Y
is invertible, both L X and L Y are invertible. In particular, there exists U with X U = 1 . Since L X is injective and
X ( U X − 1 ) = 0 ,
we also have U X = 1 . Thus X is a unit, and the same argument applies to Y. Because k H − 1 is central,
Y = X − 1 ( k H − 1 ) = ( k H − 1 ) X − 1 ,
and consequently X Y = Y X .    □
Remark 1. 
The commutativity in Corollary 1 concerns the two specific quotient images X and Y. It does not imply that arbitrary elements of Z [ D 2 p ] commute, nor does it imply that all automorphic translates of X and Y commute.

4. Linear Spectral Obstructions

Let
X = f ^ ( S ) , Y = f ^ ( T ) .
For A ∈ { S , T } define
R A = | { a ∈ A : f ( a ) ∈ R } | ,
and
F A = | { a ∈ A : f ( a ) ∈ R s } | .
Thus
R A + F A = | A | .
Define the coset imbalance
ε ( A ) = R A − F A .
Theorem 2 
(Linear spectral obstruction). Let G ∖ { 1 } = S × T be a near-factorization and let f : G → D 2 p be an epimorphic homomorphism. Then
ε ( S ) ε ( T ) = − 1 .
Consequently,
ε ( S ) , ε ( T ) ∈ { − 1 , 1 } .
Proof of Theorem 6. 
The character χ − satisfies
χ − ( r a s ε ) = ( − 1 ) ε .
Therefore
χ − ( X ) = R S − F S = ε ( S ) ,
and similarly
χ − ( Y ) = R T − F T = ε ( T ) .
Since χ − ( H ) = 0 , applying χ − to (3.1) gives
ε ( S ) ε ( T ) = − 1 .
Both quantities are integers, so they must be 1 and − 1 .    □
Corollary 2. 
Under the assumptions of Theorem 2,
{ R S , F S } = | S | + 1 2 , | S | − 1 2 ,
and
{ R T , F T } = | T | + 1 2 , | T | − 1 2 .
Moreover, the larger of R S , F S occurs in the opposite quotient coset from the larger of R T , F T .
Proof of Corollary 7. 
Equation (4.5) follows from
R S + F S = | S | , R S − F S = ± 1 .
The formula for T is identical. The final assertion follows from
ε ( S ) ε ( T ) = − 1 .
   □
Remark 2. 
The oddness of | S | and | T | already follows from the cardinality equation
| S | | T | = 2 p k − 1 ,
without any representation theory. The additional content of the linear character argument is the exact coset imbalance
ε ( S ) , ε ( T ) ∈ { − 1 , 1 }
and the fact that the two factors have opposite imbalances.
Remark 3. 
The coset-imbalance conclusion does not depend on the full dihedral structure: if a finite group G admits an epimorphism onto C 2 and G ∖ { 1 } = S × T , then the same sign-character argument applied to the two preimage classes yields ε ( S ) ε ( T ) = − 1 . The dihedral quotient is used below only to combine this obstruction with the other spectral conditions.
When G is itself the dihedral group D 2 p (that is, f is the identity map), the framework of this paper yields necessary conditions for near-factorizations of D 2 p , a case studied in detail by Kreher, Paterson and Stinson [3]; the present paper treats the quotient-multiplicity problem for arbitrary epimorphisms f : G → D 2 p .

5. Two-Dimensional Representations and Units in Cyclotomic Integer Rings

We next derive arithmetic restrictions from the two-dimensional representations of D 2 p .
Theorem 3 
(Determinant-unit obstruction). Let X = f ^ ( S ) and Y = f ^ ( T ) . For 1 ≤ j ≤ ( p − 1 ) / 2 , put
X j = ρ j ( X ) , Y j = ρ j ( Y ) .
Then
X j Y j = − I 2 ,
and
det ( X j ) det ( Y j ) = 1 .
In particular, det ( X j ) and det ( Y j ) are units in Z [ ζ ] .
Proof of Theorem 10. 
Since ρ j is nontrivial,
ρ j ( H ) = 0 .
Applying ρ j to the quotient identity (3.1) gives
X j Y j = − I 2 .
Taking determinants yields
det ( X j ) det ( Y j ) = 1 .
The entries of X j and Y j belong to Z [ ζ ] . Therefore their determinants are algebraic integers. Since their product is 1, each is a unit in Z [ ζ ] .    □
For a ∈ F p , write
x a , 0 = | { u ∈ S : f ( u ) = r a } | , x a , 1 = | { u ∈ S : f ( u ) = r a s } | .
Then
X j = ∑ a ∈ F p x a , 0 ζ j a ∑ a ∈ F p x a , 1 ζ j a ∑ a ∈ F p x a , 1 ζ − j a ∑ a ∈ F p x a , 0 ζ − j a .
Consequently,
det ( X j ) = ∑ a ∈ F p x a , 0 ζ j a ∑ a ∈ F p x a , 0 ζ − j a − ∑ a ∈ F p x a , 1 ζ j a ∑ a ∈ F p x a , 1 ζ − j a .
Corollary 3. 
A necessary condition for the existence of a near-factorization with dihedral quotient D 2 p is that, for every 1 ≤ j ≤ ( p − 1 ) / 2 , the algebraic integer in (5.4) is a unit in Z [ ζ ] .
Remark 4. 
For 1 ≤ j ≤ ( p − 1 ) / 2 , let σ j be the automorphism of Q ( ζ ) with σ j ( ζ ) = ζ j . Then
det ( ρ j ( X ) ) = σ j ( det ( ρ 1 ( X ) ) ) .
Consequently, the determinant-unit conditions for the various j are Galois conjugate, and hence they are equivalent: it suffices to test a single determinant exactly.
Remark 5. 
Let K + = Q ( ζ + ζ − 1 ) . Each
δ j : = det ( ρ j ( X ) ) = ∑ a ∈ F p x a , 0 ζ j a 2 − ∑ a ∈ F p x a , 1 ζ j a 2
is a real algebraic integer, and so is its inverse det ( ρ j ( Y ) ) . Hence
δ j ∈ O K + × .
We do not claim that δ j is totally positive: the displayed difference of two squared moduli may be negative. For background on units in integral group rings and related unit groups, see Sehgal [6].
Remark 6. 
The determinant conditions distinguish quotient profiles that have the same cardinalities and the same coset imbalance. They therefore provide genuinely finer information than the linear character obstruction.

6. Fourier Energy

For
Z = ∑ h ∈ D 2 p z h h ∈ C [ D 2 p ] ,
define its coefficient energy by
E ( Z ) = ∑ h ∈ D 2 p | z h | 2 .
For a complex matrix M, let
∥ M ∥ F 2 = ∑ i , j | M i j | 2
denote the squared Frobenius norm.
Theorem 4 
(Fourier energy identity). Let X = f ^ ( S ) . Then
2 p E ( X ) = | S | 2 + | ε ( S ) | 2 + 2 ∑ j = 1 ( p − 1 ) / 2 ∥ ρ j ( X ) ∥ F 2 .
For a near-factorization,
2 p E ( X ) = | S | 2 + 1 + 2 ∑ j = 1 ( p − 1 ) / 2 ∥ ρ j ( X ) ∥ F 2 .
The analogous identities hold for Y = f ^ ( T ) .
Proof of Theorem 15. 
The Plancherel identity for the finite group D 2 p gives
2 p E ( X ) = | χ + ( X ) | 2 + | χ − ( X ) | 2 + ∑ j = 1 ( p − 1 ) / 2 2 ∥ ρ j ( X ) ∥ F 2 .
Now
χ + ( X ) = | S |
and
χ − ( X ) = ε ( S ) .
This proves (6.2). Equation (6.3) follows from
ε ( S ) 2 = 1
by Theorem 2.    □
Corollary 4 
(Energy lower bound). Under the assumptions of Theorem 4,
2 p E ( X ) ≥ | S | 2 + 1 ,
and
2 p E ( Y ) ≥ | T | 2 + 1 .
Remark 7. 
The energy identity (6.2) is a consistency identity for quotient profiles: it holds for the coefficients of any element of Z [ D 2 p ] . The lower bound (6.4) is already implied by the coset-imbalance condition and the Cauchy–Schwarz inequality, and therefore does not provide an additional filter once the linear obstruction has been imposed. Indeed, putting
R = ∑ a ∈ F p x a , 0 , F = ∑ a ∈ F p x a , 1 , n = R + F = | S | ,
Cauchy–Schwarz gives
p ∑ a ∈ F p x a , 0 2 ≥ R 2 , p ∑ a ∈ F p x a , 1 2 ≥ F 2 ,
and hence
2 p E ( X ) ≥ 2 ( R 2 + F 2 ) = ( R + F ) 2 + ( R − F ) 2 = n 2 + 1 ,
where the last equality uses R − F = ± 1 . Thus any profile that passes the linear obstruction automatically satisfies (6.4).
The following proposition records a genuinely joint condition, which uses the relation between the two factors rather than either factor alone.
Proposition 1 
(Joint energy inequality). Let X = f ^ ( S ) and Y = f ^ ( T ) arise from a near-factorization, and set
A = 2 p E ( X ) − | S | 2 − 1 , B = 2 p E ( Y ) − | T | 2 − 1 .
Then
A B ≥ 4 ( p − 1 ) 2 .
Proof of Proposition 18. 
For 1 ≤ j ≤ ( p − 1 ) / 2 put
a j = ∥ ρ j ( X ) ∥ F 2 , b j = ∥ ρ j ( Y ) ∥ F 2 .
By (5.1),
2 = | tr ( ρ j ( X ) ρ j ( Y ) ) | ≤ ∥ ρ j ( X ) ∥ F ∥ ρ j ( Y ) ∥ F ,
so that
a j b j ≥ 4 .
The energy identity gives
A = 2 ∑ j = 1 ( p − 1 ) / 2 a j , B = 2 ∑ j = 1 ( p − 1 ) / 2 b j .
Using the Cauchy–Schwarz inequality once more,
A B = 4 ∑ j a j ∑ j b j ≥ 4 ∑ j a j b j 2 ≥ 4 ( p − 1 ) 2 ,
since a j b j ≥ 2 for each of the ( p − 1 ) / 2 values of j.    □
Remark 8. 
The joint inequality exploits the relation ρ j ( X ) ρ j ( Y ) = − I 2 between the two factors, so it contains more information than the individual lower bound (6.4). It is nevertheless a consequence of the quotient identity via (5.1) and the energy identity, rather than an independent condition on quotient profiles.

7. Exact Quotient Coefficient Equations

For a , b ∈ F p and ε , δ ∈ { 0 , 1 } , define
x a , ε = | { u ∈ S : f ( u ) = r a s ε } | ,
and
y b , δ = | { v ∈ T : f ( v ) = r b s δ } | .
Theorem 5 
(Exact quotient coefficient system). The quotient multiplicities of S and T satisfy
∑ a + ( − 1 ) ε b = c ε + δ ≡ η ( mod 2 ) x a , ε y b , δ = k − 1 1 ( c , η ) = ( 0 , 0 )
for every c ∈ F p and every η ∈ { 0 , 1 } .
Proof of Theorem 20. 
The coefficient of r c s η in
X Y = f ^ ( S ) f ^ ( T )
is
∑ a + ( − 1 ) ε b = c ε + δ ≡ η ( mod 2 ) x a , ε y b , δ
by the multiplication rule (2.1).
The coefficient of r c s η in k H − 1 is
k − 1 1 ( c , η ) = ( 0 , 0 ) .
The result follows.    □
Corollary 5. 
The quotient multiplicities satisfy
∑ a ∈ F p ∑ ε = 0 1 x a , ε = | S | ,
∑ b ∈ F p ∑ δ = 0 1 y b , δ = | T | ,
and
| S | | T | = 2 p k − 1 .
Proof of Corollary 21. 
Equations (7.4) and (7.5) follow from the definitions. Summing (7.3) over all c and η gives
| S | | T | = 2 p k − 1 .
   □
Definition 2. 
Fix positive integers p , k , n S , n T , where p is an odd prime, n S , n T ≥ 2 , and n S n T = 2 p k − 1 . A pair of nonnegative integer arrays
( x a , ε ) a ∈ F p , ε ∈ { 0 , 1 } , ( y b , δ ) b ∈ F p , δ ∈ { 0 , 1 }
is called a quotient-feasible profile if
∑ a , ε x a , ε = n S , ∑ b , δ y b , δ = n T ,
and the arrays satisfy the coefficient equations (7.3).
The linear condition in Theorem 2 and the determinant-unit conditions in Theorem 3 are consequences of quotient feasibility. They may nevertheless be used as preliminary filters before solving the full coefficient system.
Lemma 2. 
For every quotient-feasible profile,
0 ≤ x a , ε ≤ k , 0 ≤ y b , δ ≤ k
for all a , b ∈ F p and ε , δ ∈ { 0 , 1 } .
Proof of Lemma 23. 
Since Y ≠ 0 , there exists v ∈ D 2 p with y v ≥ 1 . For any h ∈ D 2 p , the coefficient [ X Y ] h v of h v in X Y satisfies
x h y v ≤ [ X Y ] h v .
By the quotient identity, [ X Y ] h v ≤ k for every element of D 2 p . Hence x h ≤ k ; the bound for the y b , δ is identical.    □
Proposition 2 
(Finite feasibility). Fix p, k, n S and n T . There are only finitely many quotient-feasible profiles. The existence of a near-factorization
G ∖ { 1 } = S × T
with quotient D 2 p implies the existence of such a profile.
Proof of Proposition 24. 
By Lemma 2, each variable x a , ε and y b , δ is a nonnegative integer bounded by k. Thus only finitely many arrays are possible. The preceding theorems give necessary equations for every near-factorization.    □
Remark 9. 
The quotient-feasibility conditions are necessary but are not sufficient in general. They record how many elements of S and T lie in each quotient fiber, but they do not record the positions of those elements inside the fibers of f.

8. Orbit Norms Under Explicit Commutativity

The previous sections do not require any commutativity assumption beyond the consequences of the quotient identity. We now describe a conditional orbit-norm reduction.
Let q be a primitive root modulo p. Define
α ( r ) = r q , α ( s ) = s .
This extends to an automorphism of D 2 p of order p − 1 .
Definition 3 
(Orbit-commutativity). Let X , Y ∈ Z [ D 2 p ] . We say that ( X , Y ) satisfies the orbit-commutativity condition if
[ α i ( X ) , α j ( X ) ] = 0 ,
[ α i ( Y ) , α j ( Y ) ] = 0 ,
and
[ α i ( X ) , α j ( Y ) ] = 0
for all 0 ≤ i , j ≤ p − 2 .
Remark 10. 
The hypothesis is partly redundant in the present setting. Put C = k H − 1 , X i = α i ( X ) and Y i = α i ( Y ) . By the quotient identity, Y i = X i − 1 C ; since C is central and invertible in Q [ D 2 p ] , the conditions [ X i , X j ] = 0 for all i , j imply [ X i , Y j ] = 0 and [ Y i , Y j ] = 0 automatically. We keep the symmetric formulation for clarity.
Under this hypothesis, define
N α ( X ) = ∏ i = 0 p − 2 α i ( X ) , N α ( Y ) = ∏ i = 0 p − 2 α i ( Y ) .
Lemma 3 
(Orbit invariance). If ( X , Y ) satisfies the orbit-commutativity condition, then
α ( N α ( X ) ) = N α ( X ) , α ( N α ( Y ) ) = N α ( Y ) .
Proof of Lemma 28. 
Since α p − 1 = id , applying α to N α ( X ) cyclically permutes its factors:
α ( N α ( X ) ) = α ( X ) α 2 ( X ) … α p − 2 ( X ) X .
The factors commute by hypothesis, so the product is unchanged: α ( N α ( X ) ) = N α ( X ) . The argument for N α ( Y ) is the same.    □
Theorem 6 
(Conditional orbit-norm product). Let
X = f ^ ( S ) , Y = f ^ ( T ) ,
and suppose that ( X , Y ) satisfies the orbit-commutativity condition. Then
N α ( X ) N α ( Y ) = 1 + d H ,
where
d = ( 2 p k − 1 ) p − 1 − 1 2 p .
In particular d is a nonnegative integer: since gcd ( 2 p k − 1 , 2 p ) = 1 and φ ( 2 p ) = p − 1 , Euler’s theorem gives ( 2 p k − 1 ) p − 1 ≡ 1 ( mod 2 p ) .
Proof of Theorem 29. 
Since α ( H ) = H , the quotient identity gives
α i ( X ) α i ( Y ) = k H − 1
for every i. By the orbit-commutativity condition, all factors can be reordered, and therefore
N α ( X ) N α ( Y ) = ∏ i = 0 p − 2 α i ( X Y ) = ( k H − 1 ) p − 1 .
Using H 2 = 2 p H , one obtains
( k H − 1 ) p − 1 = 1 + ( 2 p k − 1 ) p − 1 − 1 2 p H .
This proves (8.6).    □
Theorem 7 
(Explicit orbit norms). Let X = f ^ ( S ) and Y = f ^ ( T ) , and suppose that ( X , Y ) satisfies the orbit-commutativity condition. Then
N α ( X ) = 1 + | S | p − 1 − 1 2 p H ,
and
N α ( Y ) = 1 + | T | p − 1 − 1 2 p H .
Proof of Theorem 30. 
The automorphism α fixes 1 and s, and acts transitively on
{ r a : 1 ≤ a ≤ p − 1 }
and on
{ r a s : 1 ≤ a ≤ p − 1 } .
By Lemma 3, N α ( X ) is α -invariant, so there exist integers x 1 , x 2 , x 3 , x 4 with
N α ( X ) = x 1 · 1 + x 2 s + x 3 ∑ a = 1 p − 1 r a + x 4 ∑ a = 1 p − 1 r a s .
The coefficients of X are nonnegative, and both α and multiplication in Z [ D 2 p ] preserve nonnegativity; hence x i ∈ Z ≥ 0 .
Put
u = x 1 − x 3 , v = x 2 − x 4 .
Using
∑ a = 1 p − 1 ζ a = − 1 ,
we obtain
ρ 1 ( N α ( X ) ) = u v v u .
Let
δ = det ( ρ 1 ( X ) ) .
By Theorem 3, δ is a real unit in Z [ ζ ] . Let q be the primitive root used in (8.1). For each i,
det ( ρ 1 ( α i ( X ) ) ) = σ q i ( δ ) ,
where σ t ( ζ ) = ζ t . Therefore
det ( ρ 1 ( N α ( X ) ) ) = ∏ i = 0 p − 2 σ q i ( δ ) = N Q ( ζ ) / Q ( δ ) .
The conjugates of the real algebraic integer δ pair up as equal nonzero real numbers, σ t ( δ ) = σ − t ( δ ) ; hence the norm of δ is a product of positive real numbers. Being the norm of a unit, it equals ± 1 , and therefore
N Q ( ζ ) / Q ( δ ) = 1 .
Consequently,
u 2 − v 2 = 1 .
Since u , v ∈ Z , it follows that
( u , v ) = ( 1 , 0 ) or ( − 1 , 0 ) .
On the other hand, χ − is a ring homomorphism fixed by α , so
χ − ( N α ( X ) ) = χ − ( X ) p − 1 = ε ( S ) p − 1 = 1 ,
because ε ( S ) ∈ { − 1 , 1 } and p − 1 is even. When v = 0 , that is x 2 = x 4 ,
χ − ( N α ( X ) ) = x 1 + ( p − 1 ) x 3 − p x 4 = u + p ( x 3 − x 4 ) .
If u = − 1 , then p ( x 3 − x 4 ) = 2 , contradicting the fact that p is an odd prime. Hence
u = 1 , v = 0 ,
and then x 3 = x 4 , so that
x 1 = x 3 + 1 , x 2 = x 3 = x 4 .
Applying the augmentation map to (8.10),
x 1 + x 2 + ( p − 1 ) ( x 3 + x 4 ) = 1 + 2 p x 3 = | S | p − 1 .
Since | S | | T | = 2 p k − 1 , we have gcd ( | S | , p ) = 1 ; together with the oddness of | S | , this gives gcd ( | S | , 2 p ) = 1 . As φ ( 2 p ) = p − 1 , Euler’s theorem yields
x 3 = | S | p − 1 − 1 2 p ∈ Z ≥ 0 ,
and therefore
N α ( X ) = ( x 3 + 1 ) · 1 + x 3 s + x 3 ∑ a = 1 p − 1 r a + x 3 ∑ a = 1 p − 1 r a s = 1 + x 3 H .
This proves (8.8). The proof of (8.9) is identical.    □
Corollary 6 
(Four-parameter form). Under the hypotheses of Theorem 7, write
N α ( X ) = x 1 · 1 + x 2 s + x 3 ∑ a = 1 p − 1 r a + x 4 ∑ a = 1 p − 1 r a s ,
and
N α ( Y ) = y 1 · 1 + y 2 s + y 3 ∑ a = 1 p − 1 r a + y 4 ∑ a = 1 p − 1 r a s .
Then the eight parameters are nonnegative integers and are uniquely determined by
x 1 = 1 + | S | p − 1 − 1 2 p , x 2 = x 3 = x 4 = | S | p − 1 − 1 2 p ,
and
y 1 = 1 + | T | p − 1 − 1 2 p , y 2 = y 3 = y 4 = | T | p − 1 − 1 2 p .
Proposition 3 
(Four-parameter consistency equations). Under the hypotheses of Theorem 7, the parameters above satisfy the coefficient equations
x 1 + x 2 + ( p − 1 ) ( x 3 + x 4 ) = | S | p − 1 ,
y 1 + y 2 + ( p − 1 ) ( y 3 + y 4 ) = | T | p − 1 ,
x 1 y 1 + x 2 y 2 + ( p − 1 ) ( x 3 y 3 + x 4 y 4 ) = d + 1 ,
x 1 y 2 + x 2 y 1 + ( p − 1 ) ( x 3 y 4 + x 4 y 3 ) = d ,
x 1 y 3 + x 2 y 4 + x 3 y 1 + x 4 y 2 + ( p − 2 ) ( x 3 y 3 + x 4 y 4 ) = d ,
x 1 y 4 + x 2 y 3 + x 3 y 2 + x 4 y 1 + ( p − 2 ) ( x 3 y 4 + x 4 y 3 ) = d .
Proof of Proposition 32. 
Equations (8.13) and (8.14) are the augmentation equations used above.
For the remaining equations, use the multiplication rules
s 2 = 1 ,
s ∑ a = 1 p − 1 r a = ∑ a = 1 p − 1 r a s ,
∑ a = 1 p − 1 r a 2 = ( p − 1 ) 1 + ( p − 2 ) ∑ a = 1 p − 1 r a ,
and
∑ a = 1 p − 1 r a ∑ a = 1 p − 1 r a s = ( p − 1 ) s + ( p − 2 ) ∑ a = 1 p − 1 r a s .
Comparing coefficients in (8.6) yields (8.15)–(8.18).    □
Remark 11. 
The four-parameter system is a consistency check rather than a search problem with four free parameters: by Corollary 6, all eight parameters are determined by the explicit formulas of Theorem 7, and one verifies directly that the equations above are satisfied.
Remark 12. 
The orbit-norm formulas are conditional. In particular, the fact that α is an automorphism does not by itself permit arbitrary rearrangement of the factors in the orbit products. The stated commutativity hypothesis is sufficient to justify the rearrangement used in the proofs; we do not claim that it is necessary for the resulting norm identities.

9. A Lifting Criterion

Let
C m = Z / m Z
be written additively. Let
L h , M h ⊆ C m ( h ∈ D 2 p )
be subsets. Define
S = { ( h , a ) : h ∈ D 2 p , a ∈ L h } ,
and
T = { ( h , b ) : h ∈ D 2 p , b ∈ M h } .
The correct criterion records the number of representations of each element rather than the elements occurring in the sumsets L u + M v ; the latter lose multiplicity information (see Remark 13).
Theorem 8 
(Lifting criterion). Assume
∑ h ∈ D 2 p | L h | ≥ 2 , ∑ h ∈ D 2 p | M h | ≥ 2 .
Then the sets S and T defined by (9.1)–(9.2) form a near-factorization of D 2 p × C m if and only if, for every q ∈ D 2 p and every c ∈ C m ,
∑ u , v ∈ D 2 p u v = q ∑ a , b ∈ C m a + b = c 1 1 L u ( a ) 1 1 M v ( b ) = 1 − 1 1 { 1 } ( q ) 1 1 { 0 } ( c ) .
Proof of Theorem 35. 
The left-hand side of (9.3) counts the ordered pairs
( ( u , a ) , ( v , b ) ) ∈ S × T
whose product equals ( q , c ) , because
( u , a ) ( v , b ) = ( u v , a + b ) .
The right-hand side is 1 for every nonidentity element of D 2 p × C m and 0 for the identity. Together with the two size assumptions, this is exactly the definition of a near-factorization.    □
Corollary 7. 
Under the assumptions of Theorem 8,
| S | | T | = 2 p m − 1 .
Proof of Corollary 36. 
Summing the counting identity (9.3) over all q ∈ D 2 p and all c ∈ C m counts every pair in S × T exactly once, so the left-hand side sums to | S | | T | . The right-hand side sums to
( 2 p − 1 ) m + ( m − 1 ) = 2 p m − 1 .
   □
Remark 13. 
The plain-sumset formulation
⊎ u v = q ( L u + M v ) = C m , q ≠ 1 , C m ∖ { 0 } , q = 1
is not sufficient: it records which elements occur in each sumset but not how many representations each element has. For example, take m = 4 , L 1 = { 0 , 1 } , L h = ⌀ for h ≠ 1 , and M 1 = { 1 , 2 } , M h = { 0 , 2 } for h ≠ 1 . Then each q admits exactly one nonempty sumset, with
L 1 + M 1 = { 1 , 2 , 3 } = C 4 ∖ { 0 } , L 1 + M q = C 4 ( q ≠ 1 ) ,
so the sumset condition holds for every q. Nevertheless
( 1 , 0 ) ( 1 , 2 ) = ( 1 , 1 ) ( 1 , 1 ) = ( 1 , 2 )
gives two representations of the same element, and
| S | | T | = 2 · 4 p = 8 p ≠ 8 p − 1 = | D 2 p × C 4 | − 1 .
Thus the sumset version is not a criterion for a near-factorization; the multiplicity information in (9.3) is essential.

10. An Exact Verification Procedure

The following proposition formalizes the computational verification of a proposed near-factorization.
Proposition 4 
(Exact verification). Let G be a finite group and let S , T ⊆ G with | S | , | T | ≥ 2 . Then ( S , T ) is a near-factorization of G if and only if the following conditions hold:
(i) 
| S | | T | = | G | − 1 ;
(ii) 
the product map
μ : S × T ⟶ G , μ ( s , t ) = s t ,
is injective;
(iii) 
1 ∉ μ ( S × T ) .
Proof of Proposition 38. 
If ( S , T ) is a near-factorization, all three conditions are immediate.
Conversely, condition (iii) implies that im ( μ ) ⊆ G ∖ { 1 } . By (i) and (ii), im ( μ ) has cardinality | S | | T | = | G | − 1 , which is the cardinality of G ∖ { 1 } . Hence im ( μ ) = G ∖ { 1 } , and every nonidentity element has a unique representation as a product from S × T . Together with | S | , | T | ≥ 2 , this is the definition of a near-factorization.    □
For
G = D 2 p × C m ,
the multiplication can be implemented using
( r a s ε , z i ) ( r b s δ , z j ) = r a + ( − 1 ) ε b s ε + δ , z i + j ,
where the exponents are reduced modulo p, 2 and m, respectively.
A GAP implementation is given below. It is assumed that S and T are lists of elements of G without repetitions.
products := [];
for s in S do
for t in T do
Add(products, s*t);
od;
od;
if Length(S) >= 2
and Length(T) >= 2
and Size(Set(products)) = Length(products)
and Set(products)
= Difference(Set(Elements(G)), [One(G)]) then
Print("Verified near-factorization\n");
else
Print("Verification failed\n");
fi;
The cardinality and injectivity checks are sufficient only when the identity is also excluded from the product set. Comparing the image with G ∖ { 1 } directly, as in the code above, provides an exact check that detects errors in the representation of the group elements or the multiplication law; the size conditions | S | , | T | ≥ 2 are part of the definition and must be checked separately.

11. Discussion and Further Questions

The results above provide three levels of information.
First, the quotient group-ring identity
f ^ ( S ) f ^ ( T ) = k H − 1
is an unconditional consequence of the near-factorization property. At the level of coefficients it is equivalent to the exact quotient coefficient system of Section 7.
Second, the irreducible representations of D 2 p yield unconditional spectral and arithmetic obstructions. The linear representation forces a precise coset imbalance of the two factors; the oddness of the two cardinalities already follows from the cardinality equation (Remark 2). The two-dimensional representations impose determinant-unit conditions in cyclotomic integer rings, which detect information invisible to the cardinality equations; the unit conditions for the various representations are Galois conjugate and hence equivalent (Remark 4). The Fourier energy identity is a consistency identity for quotient profiles: the individual lower bound it yields is already implied by the linear condition and the Cauchy–Schwarz inequality (Remark 7), whereas the joint energy inequality of Proposition 1 uses the relation between the two factors. All of these conditions are consequences of the quotient identity and may be used as preliminary filters; they are not independent of the full coefficient system.
Third, the exact quotient coefficient system provides a finite bilinear integer model. It is suitable for bounded integer feasibility, backtracking and exhaustive computation, but it is not a direct linear integer programming model; a linearization, or the strategy of fixing one array and solving for the other, would be needed for standard integer programming solvers. It is a necessary quotient-level test, but additional information is required to lift a quotient profile to actual subsets of a given extension group (Remark 9).
The orbit-norm reduction gives closed formulas for the orbit norms when the orbit-commutativity hypothesis is available. It should not, however, be interpreted as an unconditional characterization of all near-factorizations: the group ring of D 2 p is noncommutative, and the stated commutativity hypothesis is used only as a sufficient condition.
Several questions remain open. It would be interesting to determine families for which the spectral conditions and the exact quotient system are sufficient. Another problem is to classify quotient-feasible profiles for small primes p and small kernel sizes k. The lifting criterion in Theorem 8 also suggests a systematic construction method for near-factorizations of direct products and, more generally, semidirect products.

Author Contributions

Conceptualization, Z.L. Z.; methodology, Z.L. Z. , Y.J. W. and D.L. T.; software,D.L. T.; validation, Z.L. Z. and D.L. T.; formal analysis, Z.L. Z. ,Y.J. W. and D.L. T.; investigation,Z.L. Z.; resources, Y.J. W.; data curation, Z.L. Z. and D.L. T.; writing—original draft preparation, Z.L. Z.; writing—review and editing, Y.J. W.; visualization, Z.L. Z. ,Y.J. W. and D.L. T.; supervision, Z.L. Z. and Y.J. W. ; project administration, Z.L. Z. and Y.J. W.; funding acquisition,Y.J. W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by [National Natural Science Foundation of China], grant number [12401021]

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The research presented in this manuscript is purely theoretical. No experimental or numerical datasets were generated or analyzed during the current study. All mathematical derivations, proofs, and results are contained within the manuscript.

Acknowledgments

During the preparation of this study, the authors used [GPT-6 ASTRA] for the purposes of assisting with the formulation of parts of the proofs and language polishing. The authors have reviewed and edited the output and take full responsibility for the content of this publication.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Bacsó, G.; Héthelyi, L. H.; Sziklai, P. New near-factorizations of finite groups. Stud. Sci. Math. Hung. 2008, 45, 493–510. [Google Scholar] [CrossRef]
  2. de Caen, D.; Gregory, D. A.; Hughes, I. G.; Kreher, D. L. Near-factors of finite groups. Ars. Comb. 1990, 29, 53–63. [Google Scholar]
  3. Kreher, D. L.; Paterson, M. B.; Stinson, D. R. Near-factorizations of dihedral groups. Des. Codes Cryptogr. 2025, 93, 5015–5038. [Google Scholar] [CrossRef]
  4. Pecher, A. Partitionable graphs arising from near-factorizations of finite groups. Discret. Math. 2003, 269, 191–218. [Google Scholar] [CrossRef]
  5. Pecher, A. Cayley partitionable graphs and near-factorizations of finite groups. Discret. Math. 2004, 276, 295–311. [Google Scholar] [CrossRef]
  6. Sehgal, S. K. Units in Integral Group Rings; Longman Scientific & Technical: Harlow, 1993. [Google Scholar]
  7. Serre, J.-P. Linear Representations of Finite Groups; Springer-Verlag: New York, 1977. [Google Scholar]
  8. Szabó, S.; Sands, A. D. Factoring Groups into Subsets; Chapman and Hall/CRC: Boca Raton, 2009. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.