SCIENCE CHINA

Mathematics
. ARTICLES . February 2016 Vol. 59 No. 2: 351–366
doi: 10.1007/s11425-015-5051-z

Norm estimates of ω-circulant operator matrices and

isomorphic operators for ω-circulant algebra
JIANG ZhaoLin1 & XU TingTing1,2,∗

1Department of Mathematics, Linyi University, Linyi 276000, China;

2School of Mathematical Sciences, Shandong Normal University, Ji’nan 250014, China
Email: jzh1208@sina.com, xutingting655@163.com

Received November 28, 2014; accepted January 26, 2015; published online September 8, 2015

Abstract An n × n ω-circulant matrix which has a specific structure is a type of important matrix. Several
norm equalities and inequalities are proved for ω-circulant operator matrices with ω = eiθ (0  θ < 2π) in this
paper. We give the special cases for norm equalities and inequalities, such as the usual operator norm and the
Schatten p-norms. Pinching type inequality is also proposed for weakly unitarily invariant norms. Meanwhile,
we present that the set of ω-circulant matrices with complex entries has an idempotent basis. Based on this
basis, we introduce an automorphism on the ω-circulant algebra and then show different operators on linear
vector space that are isomorphic to the ω-circulant algebra. The function properties, other idempotent bases
and a linear involution are discussed for ω-circulant algebra. These results are closely related to the special
structure of ω-circulant matrices.

Keywords ω-circulant, operator, norm, algebra, basis, isomorphic, function equation, linear involution

MSC(2010) 42B35, 47A50, 47C05, 47C15, 15A60

Citation: Jiang Z L, Xu T T. Norm estimates of ω-circulant operator matrices and isomorphic operators for ω-
circulant algebra. Sci China Math, 2016, 59: 351–366, doi: 10.1007/s11425-015-5051-z

1 Introduction
The circulant matrices [14, 21] especially ω-circulant matrices (especially when ω = eiθ (0  θ < 2π))
play an important role in various fields, such as image processing, communications, signal processing,
encoding, Toeplitz matrix problems, preconditioner, and least squares problems. Circulant digraph is
discussed as presented in [36, 39–41]. Zhang and Zhou [43] showed nested regular polygon solutions for
planar 2N -body problems by using eigenvalues and eigenvectors of circulant matrices. Song et al. [35]
researched shape feature description based on log-polar coordinates and symmetric circulant matrix. The
authors [32, 42] studied low-density parity-check (LDPC) codes closed to cyclic structure. In [28], based
on the properties of ω-circulant matrices, Narasimha showed that the linear convolution required in block
filtering can be decomposed into a sum of skew-cyclic convolutions. Such convolutions can be realized
efficiently with half-length complex transforms when the signals are real. Noschese and Reichel [30]
studied linear systems of equations T x = b with an eiθ -Hermitian Toeplitz matrix T . Then, the property
and the application of eiθ -circulant Strang-type preconditioners are discussed. Kou et al. [25] discussed
the ω-circulant preconditioners for solving the ill-conditioned block Toeplitz systems with tenser structure
by using the preconditioned conjugate gradient (PCG) method. Bertaccini et al. [6] considered a new
∗ Corresponding author


c Science China Press and Springer-Verlag Berlin Heidelberg 2015 math.scichina.com link.springer.com
352 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

class of preconditioners based on ω-circulant matrices for the iterative solution of the linear equations
arising in the numerical solution of ordinary and time-dependent partial differential equations. The
authors [29,31] used the structure of ω-circulant matrices to constructe their new type of preconditioners.
Boman [10] presented a simple derivation of the Moore-Penrose pseudoinverse of k-circulant matrix. They
purposed to derive a formula for the Moore-Penrose pseudoinverse of general n × n k-circulant matrix by
displaying and exploiting the close relationship between the circulants and the k-circulants. Jiang [19]
obtained five methods to judge the singularity of r-circulant matrix and symmetric r-circulant matrix by
the structure of these matrices. Mei [27] investigated the structures of the square roots, then obtained
the classifications of all the square roots of circulant and k-circulant matrices.
Recently, some mathematicians pay attention to the problems of norm estimates for operator matrices
[9, 24], which are widely used in operator theory, mathematical physics, quantum information theory,
and numerical analysis. In [2], norm equalities and inequalities for operator matrices were studied.
Based on the special structures of circulant and skew-circulant operator matrices, they obtained the
results including pinching type inequalities for weakly unitarily invariant norms. Many works about norm
equalities and inequalities of special operator matrices can be seen in [1,8,22,23]. Some authors also focus
on researching the norms of some circulant type matrices. For example, Li et al. [26] showed four kinds
of norms for circulant and left circulant matrix involving special numbers. Zhou and Jiang [44] showed
explicit formulae of spectral norms for g-circulant matrices and proved them. Bose et al. [11] discussed the
convergence in probability and the convergence in distribution of the spectral norms of scaled Toeplitz,
circulant, reverse circulant, symmetric circulant and k-circulant matrices. Shen and Cen [33] considered
the k-Fibonacci {Fk,n }n ∈ N and k-Lucas sequences {Lk,n }n ∈ N . Let A = Cr (Fk,0 , Fk,1 , . . . , Fk,n−1 )
and B = Cr (Lk,0 , Lk,1 , . . . , Lk,n−1 ) be r-circulant matrices. Then, they gave upper and lower bounds
for the spectral norms of matrices A and B. And some bounds for the spectral norms of Hadamard and
Kronecker products of these matrices with the k-Fibonacci and k-Lucas numbers were obtained. In [34],
lower and upper bounds are discussed for the spectral norms of r-circulant matrices, and some bounds
are obtained related to the spectral norms of Hadamard and Kronecker products of these matrices with
the Fibonacci and Lucas numbers. Grafakos et al. [16] showed boundedness of paraproduct operators on
RD-spaces.
As is well-known, it is becoming a hot topic for studying diverse problems of circulant matrices.
Several results were published on the circulant type operators and circulant type algebras. Jiang et
al. [20] displayed the different operators on linear vector space that are isomorphic to the algebra of
n × n complex skew-circulant matrices. Benedetto [3] studied the computational problem of finding the
optimal preconditioner of a given matrix in an algebra related to a fast transform. And ω-circulant
algebra is also considered. Benedetto and Capizzano [5] studied the super optimal Frobenius operators
in several matrix vector spaces and in particular in the circulant algebra, by emphasizing both the
algebraic and geometric properties. They proposed the super optimal operator as a possible regularizing
preconditioner. Wilde [38] displayed algebras of operators which are isomorphic to the algebra of n × n
complex circulant matrices. Chan et al. [13] gave different formulations of the operator, discussed its
algebraic and geometric properties, and computed its operator norms in different Banach algebras of
matrices. With these results, they also gave an efficient algorithm for finding the superoptimal circulant
preconditioner. Fiore and Zellini [15] looked for a unifying approach to representations of a matrix A
as sums of products of matrices belonging to commutative matrix algebras. Some algebras are also
considered in the literature, such as τ , circulant, ε-circulant, Toeplitz triangular algebras. Benedetto and
Capizzano [4] studied the optimal Frobenius operator in a general matrix vector space and in particular
in the multilevel trigonometric matrix vector spaces, by emphasizing both the algebraic and geometric
properties. Cao and Yang [12] studied Hardy spaces HLp (Rn ) associated with operators satisfying k-
Davies-Gaffney estimates. Jiang et al. [18] discussed Orlicz-Hardy spaces associated with operators.
In this paper, we study general norm equalities and inequalities for ω-circulant operator matrices in
Sections 2 and 3. Moreover, the equality conditions in these norm inequalities are also given. Notice
that we extend the research of Bani-Domi and Kittaneh [2], in which norm equalities and inequalities
for circulant operator matrices and skew-circulant operator matrices are the special cases of our results
 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2 353

(when ω = 1 and ω = −1). Then, we study the operator algebras which are isomorphic to ω-circulant
algebra. In Section 4, a complex n × n ω-circulant matrix is a matrix representation of the group ring
(over C) of the ω-cyclic group. We prove that the set of ω-circulant matrices with complex entries has
an idempotent basis. In Section 5, the algebra of linear operators, which contains functional equations is
isomorphic to ω-circulant algebra by using ω-circulant and idempotent linear operators. Furthermore, we
get a relationship between these operators. In Section 6, we give others ω-circulant algebras. In Section 7,
a linear involution for ω-circulant algebra is considered. Obviously, when ω = 1, ω-circulant algebra is
circulant algebra. Thus the results of this paper are the extension of [38]. When ω = −1, ω-circulant
algebra is skew-circulant algebra. Therefore, this paper is also the extension of [20].

2 Norm equalities for ω-circulant operator matrices

We denote by M (H) the C ∗ -algebra of all bounded linear operators on a complex separable Hilbert
space H. Let H (n) = ⊕n copies H denote the direct sum of n copies of H. If Aj,k j, k = 1, 2, . . . , n are
operators in M (H), then operator matrix (or the partitioned operator) A = [Aj,k ] can be discussed in
M (H (n) ), which is defined by
⎛ n ⎞
k=1 A1k xk
⎜ .. ⎟
Ax = ⎜⎝ .
⎟
⎠
n
k=1 Ank xk

for every vector x = (x1 · · · xn )T ∈ H (n) . If V1 , V2 , . . . , Vn are operators in M (H), we denote the direct
n
sum of them by j=1 Vj for the n × n block diagonal operator matrix, i.e.,
⎛ ⎞
V1
⎜ ⎟

n ⎜ V2 ⎟
⎜ ⎟
Vj = ⎜ .. ⎟.
⎜ . ⎟
j=1 ⎝ ⎠
Vn
If A1 , A2 , . . . , An are operators in M (H), then the ω-circulant operator matrix A can be written as
A = circω (A1 , A2 , . . . , An ). It is the n × n matrix whose first row has entries A1 , A2 , . . . , An and the other
rows are obtained by successive cyclic permutations of these entries, i.e.,
⎛ ⎞
A1 A2 A3 · · · An
⎜ ⎟
⎜ ωAn A1 A2 · · · An−1 ⎟
⎜ ⎟
⎜ . .. .. .. ⎟
circω (A1 , A2 , . . . , An ) = ⎜
⎜ . . . .
..
. .
⎟,
⎟
⎜ ⎟
⎜ ωA3 ωA4 ωA5 · · · A ⎟
⎝ 2 ⎠
ωA2 ωA3 ωA4 · · · A1
where ω = eiθ , 0  θ < 2π.
It is known that circω (A1 , A2 , . . . , An ) = T circ(A1 , ηA2 , . . . , η n−1 An )T ∗ , where
⎛ ⎞
I 0
⎜ ⎟
⎜ ηI ⎟
⎜ ⎟ θi
T =⎜ .. ⎟, for η = e n , 0  θ < 2π.
⎜ . ⎟
⎝ ⎠
0 η n−1 I
Thus, every ω-circulant operator matrix is unitarily equivalent to a circulant operator matrix.
The weakly unitarily invariant norm τ is defined by τ (A) = τ (U AU ∗ ) for all A ∈ M (H) and all unitarily
operator matrices U ∈ M (H). In the following, τ is used to denote the weakly unitarily invariant norm.
354 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

Theorem 2.1. If A1 , A2 , . . . , An are any operators in M (H), then

 n−1

 n
k j−1
τ (circω (A1 , A2 , . . . , An )) = τ (ηδ ) Aj , (2.1)
k=0 j=1

iθ 2πi
where η = e n , δ = e n , ω = eiθ , 0  θ < 2π.
iθ 2πi
Proof. The roots of z n = ω are η, ηδ, ηδ 2 , . . . , ηδ n−1 , where ω = eiθ , η = e n , δ = e n , 0  θ < 2π.
Let U = Un ⊗ I, where
⎛ ⎞
1 1 1 ··· 1
⎜ ⎟
⎜ η ηδ ηδ 2 ··· ηδ n−1 ⎟
⎜ ⎟
1 ⎜ ⎟
Un = √ ⎜ ⎜ η 2
(ηδ) 2
(ηδ 2 2
) · · · (ηδ n−1 2
) ⎟
⎟ .
n⎜ . . . . . ⎟
⎜ .. .. .. .. .. ⎟
⎝ ⎠
η n−1 (ηδ)n−1 (ηδ 2 )n−1 ··· (ηδ n−1 )n−1
n×n

By calculation, we get that U is a unitarily operator in M (H (n) ) and

 n−1

 n
U ∗ circω (A1 , A2 , . . . , An )U = (ηδ k )j−1 Aj .
k=0 j=1

Hence, based on the invariance property of weakly unitarily invariant norms, we obtain
 n−1

 n
τ (circω (A1 , A2 , . . . , An )) = τ (ηδ k )j−1 Aj .
k=0 j=1

p 1
Schatten p-norms [2] have the form Ap = (tr(A∗ A) 2 ) p , for A ∈ M (H), 1  p < ∞. For the n × n
n
block-diagonal operator matrix diag(V1 , V2 , . . . , Vn ), the Schatten p-norms are defined by  j=1 Vj p
n 1
= ( j=1 Vj pp ) p for 1  p < ∞. Synthesizing the norm equality in Theorem 2.1 to the usual operator
norm and to the Schatten p-norms, we have the following corollary.
Corollary 2.2. Let A1 , A2 , . . . , An be any operators in M (H). Then
   
 n 

circω (A1 , A2 , . . . , An ) = max  (ηδ ) Aj 
k j−1
: k = 0, 1, . . . , n − 1

j=1

and

 n−1
n p p1

circω (A1 , A2 , . . . , An )p =  (ηδ k j−1
) A  ,
 j
k=0 j=1 p

for 1  p < ∞.
θi θi
Particularly, when n = 2, circω (A1 , A2 ) = max(A1 + e 2 A2 , A1 − e 2 A2 ) and
θi θi 1
circω (A1 , A2 )p = (A1 + e 2 A2 pp + A1 − e 2 A2 pp ) p

for 1  p < ∞.
Remark 2.3. Here some special cases of Corollary 2.2 are given.
(i) If A ∈ M (H), then
⎛ ⎞ 
 
 A A A ··· A 
⎜ ⎟ 
⎜ ωA A A ··· A ⎟ 
⎜ ⎟ 
⎜ . . .. ..⎟  1−ω
⎜ . .. .. ⎟ = A,
⎜ . . . .⎟  1−η
⎜ ⎟ 
⎜ ωA ωA ωA · · ·
⎝ A ⎟
⎠


 
 ωA ωA ωA · · · A 
n×n
 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2 355
⎛ ⎞ 
 
 A A A ··· A 
⎜ ⎟ 
⎜ ωA A A ··· A ⎟ 
⎜ ⎟   n−1
⎜ .. .. .. ..⎟    1 − ω p 1/p
⎜ .. ⎟  = Ap ,
⎜ . . . . .⎟  1 − ηδ k
⎜ ⎟  k=0
⎜
⎝ ωA ωA ωA · · · A ⎟
⎠


 
 ωA ωA ωA · · · A 
n×n p

iθ 2πi
for 1  p < ∞, where ω = eiθ , η = e n , δ =e n , 0  θ < 2π.
(ii) If A ∈ M (H), then
⎛ ⎞ 
 
 0 A A ··· A 
⎜ ⎟ 
⎜ ωA 0 A ··· A ⎟ 
⎜ ⎟   
⎜ . . .. .. ⎟  η − ω
⎜ . .. ⎟ = 
⎜ . .. . . . ⎟   1 − η A,
⎜ ⎟ 
⎜ ωA ωA ωA ··· A ⎟ 
⎝ ⎠ 
 
 ωA ωA ωA ··· 0 
n×n
⎛ ⎞ 
 
 0 A A ··· A 
⎜ ⎟ 
⎜ ωA 0 A ··· A ⎟ 
⎜ ⎟   n−1  k 
⎜ . .. .. .. ⎟    ηδ − ω p 1/p
⎜ . .. ⎟ =   Ap ,
⎜ . . . . . ⎟   1 − ηδ k 
⎜ ⎟  k=0
⎜ ωA ωA ωA ··· A ⎟ 
⎝ ⎠ 
 
 ωA ωA ωA ··· 0 
n×n

iθ 2πi
for 1  p < ∞, where ω = eiθ , η = e n , δ = e n , 0  θ < 2π.

3 Pinching type inequalities for ω-circulant operator matrices

In this section, our main aim is to discuss the pinching type inequalities for ω-circulant operator matrices.
The pinching type inequality is one of the most important inequalities of operator matrices for weakly

unitarily invariant norm. It asserts that if V = [Vjk ] (j, k = 1, 2, . . . , n), then τ ( nj=1 Vjj )  τ (V ) (please
see [2, 7]).
Theorem 3.1. If A = [Ajk ] is an operator matrix in M (H (n) ), then, for every weakly unitarily
invariant norm,
 n−1

 n
1 k j−1
τ (ηδ ) Vj  τ (A), (3.1)
n
k=0 j=1

where
n
 n
 n−2
 n

V1 = Ajj , V2 = Aj−1,j + e−iθ An1 , V3 = Aj,j+2 + e−iθ Aj,j−(n−2) , ...,
j=1 j=2 j=1 j=n−1
n
 n

Vn−1 = A1,n−1 + A2n + e−iθ Aj−1,j , Vn = A1n + e−iθ Aj,j−1 . (3.2)
j=2 j=2

Proof. Let Lk,n−k = [lrs ] be the n × n operator with

⎧
⎪
⎨I,
⎪ if s − r = k,
lrs = eiθ I, if r − s = n − k,
⎪
⎪
⎩0, otherwise.
356 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

Then we can prove easily that Lk,n−k = [lrs ] is a unitarily operator for all k = 1, 2, 3, . . . , n and
n

Lk,n−k AL∗k,n−k = circω (V1 , V2 , . . . , Vn ) = V,
k=1

where
n
 n
 n−2
 n

V1 = Ajj , V2 = Aj−1,j + e−iθ An1 , V3 = Aj,j+2 + e−iθ Aj,j−(n−2) , ...,
j=1 j=2 j=1 j=n−1
n
 n

Vn−1 = A1,n−1 + A2n + e−iθ Aj−1,j , Vn = A1n + e−iθ Aj,j−1 .
j=2 j=2

Let
⎛ ⎞
I I I ··· I
⎜ ⎟
⎜ ηI ηδI ηδ 2 I ··· ηδ n−1 I ⎟
⎜ ⎟
1 ⎜ ⎟
U= √ ⎜ η2 I (ηδ)2 I (ηδ 2 )2 I ··· (ηδ n−1 )2 I ⎟ .
n⎜
⎜ .. .. .. .. ..
⎟
⎟
⎜ . . . . . ⎟
⎝ ⎠
η n−1 I (ηδ)n−1 I (ηδ 2 )n−1 I ··· (ηδ n−1 )n−1 I
n×n
n−1 n
Then, according to the proof of Theorem 2.1, we obtain U ∗ V U = k=0 j=1 (ηδ k )j−1 Vj .
Hence, by using the properties of unitarily invariant norms and the triangle inequality, we get
 n−1

 n
1 k j−1
τ (ηδ ) Vj  τ (A).
n
k=0 j=1

Specializing the norm inequality (3.1) to the usual operator norm and to the Schatten p-norms [2, 7],
we get corollary as follows.
Corollary 3.2. If A = [Ajk ] is an operator matrix in M (H (n) ), then
   
1  n 
max 
 (ηδ k j−1
) V 
j : k = 0, 1, . . . , n − 1  A
n j=1

and  n−1  n p 1/p

1  

 (ηδ ) Vj 
k j−1
  Ap
n j=1 p
k=0

for 1  p < ∞, where Vj is given in (3.2).

In Corollary 3.2, when n = 2, the special case is given in the following:
 
 A A12 
1 θi θi  
max(A11 + A22 + e 2 (A12 + e−θi A21 ), A11 + A22 − e 2 (A12 + e−θi A21 ))  
11

2  A21 A22 

and
 
 A A12 
1 θi θi  
(A11 + A22 + e 2 (A12 + e−θi A21 )pp + A11 + A22 − e 2 (A12 + e−θi A21 )pp )1/p  
11

2  A21 A22 
p

for 1  p < ∞.
Notice that the norm inequalities in Theorem 3.1 are sharp. This is demonstrated in the following
proposition.
 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2 357

Proposition 3.3. Let A1 , A2 , . . . , An be any operators in M (H) and A = circω (A1 , A2 , . . . , An ), then
the inequality in Theorem 3.1 becomes an equality.
Proof. If A = circω (A1 , A2 , . . . , An ), then it follows from Theorem 2.1 that
 n−1

 n
τ (circω (A1 , A2 , . . . , An )) = τ (ηδ k )j−1 Aj .
k=0 j=1

Since V1 = nA1 , V2 = nAn , . . . , Vn−1 = nA3 , and Vn = nA2 , it follows that

 n−1


1
τ Dk = τ (circω (A1 , A2 , . . . , An )),
n
k=0

where
n

D0 = η j−1 Vj = n[A1 + ηA2 + · · · + η n−1 An ],
j=1
n

D1 = (ηδ)j−1 Vj = n[A1 + (ηδ)A2 + · · · + (ηδ)n−1 An ],
j=1
..
.
n

Dn−1 = (ηδ n−1 )j−1 Vj = n[A1 + (ηδ n−1 )A2 + · · · + (ηδ n−1 )n−1 An ].
j=1

Proposition 3.4. If A = [Ajk ] is an operator matrix in M (H (n) ), then

 n−1 n 
1 
 k j−1 
Ap =  (ηδ ) V 
j , 1<p<∞
n j=1 p
k=0

if and only if A is ω-circulant matrix.

Proof. In view of Proposition 3.3, it is sufficient to prove the “only if” part. Let Lk,n−k be as in the
n
proof of Theorem 3.1. If Ap = n1  n−1k=0
k j−1
j=1 (ηδ ) Vj p , then it can be got that
L1,n−1 AL∗1,n−1 p = L2,n−2 AL∗2,n−2 p = · · · = L1,n−1 AL∗1,n−1 p = Ap
and
n−1
  
Lk,n−k AL∗k,n−k  = nAp .
p
k=0
Now invoking Clarkson inequalities [17], which asserts that if T1 , T2 , . . . , Tn are any operators in M (H)

such that T1 p = T2 p = · · · = Tn p and nj=1 Tj p = nT1 p for some p with 1 < p < ∞, then
T1 = T2 = · · · = Tn . Thus, it follows that L1,n−1 AL∗1,n−1 = L2,n−2 AL∗2,n−2 = · · · = L1,n−1 AL∗1,n−1 .
Combining with the special structure of the matrix L, we get that A is ω-circulant matrix.
Notice that Proposition 3.4 is not true for the trace norm, which corresponds to the case p = 1, and
for the usual operator norm.

4 Idempotent bases of ω-circulant algebra

An n × n complex ω-circulant matrix with ω = eiθ has the following form:
⎛ ⎞
x0 x1 x2 . . . xn−1
⎜ ⎟
⎜ ωxn−1 x0 x1 . . . xn−2 ⎟
⎜ ⎟
⎜ ⎟
R=⎜ ⎜ ωxn−2 ωxn−1 x0 · · · xn−3 ⎟⎟ , (4.1)
⎜ .. .. .. .. .. ⎟
⎜ . . . . ⎟
. ⎠
⎝
ωx1 ωx2 ωx3 · · · x0
n×n
358 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

where ω = eiθ , 0  θ < 2π.

Let Rn denote the set of ω-circulant matrices with complex entries, i.e., F = C (C denotes the complex
field). We denote by ε the ω-circulant matrix with x1 = 1 and xj = 0 for j = 1. Then εk (the k-th power
of ε, 1  k < n) is the ω-circulant matrix with xk = 1 and xj = 0 for all j = k, ε0 = I (I is the identity
matrix), ε1 = ε, and εn = eiθ I. Therefore, R can be written as
n−1

R= xk εk , (4.2)
k=0

for x0 , x1 , . . . , xn−1 ∈ C. That is to say, ε0 , ε1 , ε2 , . . . , εn−1 form a basis for the ω-circulants Rn . If the
iθ 2jπi iθ 2jπi
jth root of z n = ω is denoted by βj , we have βj = e n e n , where η = e n , δ = e n , j = 0, 1, 2, . . . , n − 1,
0  θ < 2π.
If
n−1
 j
yk = βk xj , for k = 0, 1, . . . , n − 1, (4.3)
j=0

by the eigenvalues of the matrix εi , i = 0, 1, . . . , n − 1, we know that y0 , y1 , . . . , yn−1 are the eigenvalues
of the ω-circulant matrix R.
Proposition 4.1. If Rn has a basis ε0 , ε1 , ε2 , . . . , εn−1 , then it also has another basis M0 , M1 , . . . ,
Mn−1 , where
n−1
1  −j j
Mk = (β ε ), for k = 0, 1, . . . , n − 1. (4.4)
n j=0 k
Proof. Through calculating, these matrices have the following properties:

Mk2 = Mk , for k = 0, 1, 2, . . . , n − 1, (4.5)

Mk Mi = 0, for k = i, (4.6)
M0 + M1 + M2 + · · · + Mn−1 = I, (4.7)
n−1

εk = βkj Mj , (4.8)
j=0

for k = 0, 1, 2, . . . , n − 1.
Therefore, the idempotents M0 , M1 , . . . , Mn−1 form a basis for Rn , and in equation (4.2) we also get
n−1

R= yk Mk = y0 M0 + y1 M1 + · · · + yn−1 Mn−1 . (4.9)
k=0

Proof of Proposition 4.1 is completed.

As we known that every ω-circulant matrix R ∈ Rn can be written in one and only one way in the
form (4.2), i.e.,

R = x0 I + x1 ε + x2 ε2 + · · · + xn−1 εn−1 . (4.10)

Proposition 4.2. If the function φ : Rn → Rn is defined by

φ(R) = β0 x0 I + β1 x1 ε + · · · + βn−1 xn−1 εn−1 , (4.11)

then φn (R) = eiθ R.

Proof. By computation, we have

φm (R) = β0m x0 I + β1m x1 ε + · · · + βn−1

m
xn−1 εn−1 , (4.12)

i.e., φm replaces xk by βkm xk for m = 0, 1, 2, . . . , n − 1.

Hence, φn (R) = eiθ R.
 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2 359

Then the function φ is an automorphism in Rn that preserves C, where C is embedded in Rn by the

correspondence c → cI for c ∈ C.
Proposition 4.3. If the function Φk : Rn → Rn is defined by
n−1
1  −j j
Φk = β φ , for k = 0, 1, . . . , n − 1, (4.13)
n j=0 k

then the following hold:

Φ2k = Φk , for k = 0, 1, 2, . . . , n − 1, (4.14)

Φk Φj = 0, for k = j, (4.15)
Φ0 + Φ1 + Φ2 + · · · + Φn−1 = φ , 0
(4.16)
β0k Φ0 + β1k Φ1 k
+ · · · + βn−1 Φn−1 = φk , (4.17)
Φk (x0 I + x1 ε + · · · + xn−1 εn−1 ) = xk εk , (4.18)

for k = 0, 1, . . . , n − 1.
Now, we prove the equations (4.14)–(4.18).
n−1
Proof. Since Φk = n1 j=0 βk−j φj , we get that

1 0 −(n−1) n−1 2
Φ2k = [φ + βk−1 φ + βk−2 φ2 + · · · + βk φ ]
n2
1 −(n−1) n−1
= 2 [φ0 + βk−1 φ + βk−2 φ2 + · · · + βk φ
n
−(n−1) n−1
+ βk−1 φ + βk−2 φ2 + · · · + βk φ
−(n−1) n−1
+ βk−n φn + · · · + βk φ
−2(n−1) 2(n−1)
+ βk−n φn + · · · + βk φ ]
= Φk .

Similarly, Φk Φj = 0 for k = j can be obtained.

Afterwards, by calculation, we have
 n−1 n−1 n−1 
1  −j j  −j j  −j
j
Φ0 + Φ1 + · · · + Φn−1 = β φ + β1 φ + · · · + βn−1 φ = φ0 ,
n j=0 0 j=0 j=0

and

β0k Φ0 + β1k Φ1 + β2k Φ2 + · · · + β(n−1)

k
Φn−1
1 0 −(n−1) n−1 k
= [φ + β0−1 φ1 + β0−2 φ2 + · · · + β0 φ ]β0
n
1 −(n−1) n−1 k
+ [φ0 + β1−1 φ1 + β1−2 φ2 + · · · + β1 φ ]β1
n
1 −1 −2 −(n−1)
+ · · · + [φ0 + βn−1 φ1 + βn−1 φ2 + · · · + βn−1 φn−1 ]βn−1
k
n
= φk .

Finally, we have

Φk (x0 I + x1 ε + x2 ε2 + · · · + xn−1 εn−1 )

n−1
1  −j j
= β φ (R)
n j=0 k
360 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

1
= [x0 I + x1 ε + x2 ε2 + · · · + xn−1 εn−1
n
+ βk−1 (β0 x0 I + β1 x1 ε + · · · + βn−1 xn−1 εn−1 ) + · · ·
−(n−1)
+ βk (β0n−1 x0 I + β1n−1 x1 ε + · · · + βn−1
n−1
xn−1 εn−1 )]
= xk εk .

Proof of Proposition 4.3 is completed.

The following theorem can be obtained by Propositions 4.1–4.3.
Theorem 4.4. The algebras can be called ω-circulant algebras, which generated by I, ε, ε2 , . . . , εn−1
n−1
and φ , φ, . . . , φ
0
over C. And they are isomorphic.

5 Functional equations on ω-circulant algebra

Proposition 5.1. Let f : C → C be a linear entire function, then


n−1 n−1
1  −j
 n−1
 
f (c0 I + c1 ε + · · · + cn−1 εn−1 ) = βk f βjl cl εk . (5.1)
n j=0
k=0 l=0

Proof. From [37], we know that

n−1
 n−1

λk = βkj cj , ck = 1/n βk−j λj , (5.2)
j=0 j=0

for k = 0, 1, . . . , n − 1.
Thus, we get
n−1
 n−1
  n−1
k 1  −j
f (ck )ε = f β βj ε k
n j=0 k
k=0 k=0
n−1
 n−1
1  −j
= β f (λj )εk
n j=0 k
k=0


n−1 n−1
1  −j
 n−1
 
= β f βj c l ε k .
l
n j=0 k
k=0 l=0

Hence, the proof of this conclusion is completed.

For any linear entire function f : C → C, equation (5.1) can be written as follows:
n−1

f (c0 I + c1 ε + · · · + cn−1 εn−1 ) = Fk (c0 , c1 , . . . , cn−1 )εk , (5.3)
k=0

where
n−1  n−1
1  −j 
Fk (c0 , c1 , . . . , cn−1 ) = βk f βjl cl , k = 0, 1, 2, . . . , n − 1. (5.4)
n j=0
l=0

It is easy to know that F0 , F1 , . . . , Fn−1 satisfy the following functional equation:

Fk (βc0 , β1 c1 , β2 c2 , . . . , βn−1 cn−1 ) = βk Fk (c0 , c1 , . . . , cn−1 ), (5.5)

θi 2kπi
for βk = e n e n , 0  θ < 2π, k = 0, 1, 2, . . . , n − 1, and c0 , c1 , . . . , cn−1 ∈ C.
 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2 361

(5.5) is related to the ω-circulant algebra also in another way. Now we define the function F by
n−1  n−1
1  −j 
F (c0 , c1 , . . . , cn−1 ) = βk f βjl cl , k = 0, 1, 2, . . . , n − 1. (5.6)
n j=0
l=0

Let U = {F | F : Cn → C} and let the linear operator N : U → U be defined by

N (F )(c0 , c1 , . . . , cn−1 ) = F (β0 c0 , β1 c1 , β2 c2 , . . . , βn−1 cn−1 ), (5.7)

i.e.,

N (F ) = βk F. (5.8)

Let N j (j = 0, 1, . . . , n − 1) denote the operation N composed with itself j times, then

N j (F )(c0 , c1 , c2 , . . . , cn−1 ) = F (β0j c0 , β1j c1 , β2j c2 , . . . , βn−1

j
cn−1 ), (5.9)
jθi
where N j = e n N 0 if and only if n divides j.
Based on (5.1)–(5.9), we get the following theorem:
Theorem 5.2. Linear combinations of the operators N 0 , N 1 , . . . , N n−1 over C form an ω-circulant
algebra.
Now we show other operators according to the properties of operators N 0 , N 1 , . . . , N n−1 .
Proposition 5.3. Let the operators Q0 , Q1 , . . . , Qn−1 : U → U be defined by taking
1 0 −(n−1) n−1
Qk = (N + βk−1 N 1 + · · · + βk N ), (5.10)
n
for k = 0, 1, 2, . . . , n − 1. Then we obtain the following properties for the operators Q0 , Q1 , . . . , Qn−1:

Q2k = Qk , for l = 0, 1, 2, . . . , n − 1, (5.11)

Qk Qj = 0, if k = j, (5.12)
Q0 + Q1 + · · · + Qn−1 = N , 0
(5.13)
(n−1) k
Q 0 + βk Q 1 + βk2 Q2 + ···+ βk Qn−1 =N , (5.14)

for k = 0, 1, 2, . . . , n − 1.
By simple computation, we can acquire properties (5.11)–(5.14). Properties (5.11)–(5.14) are similar
to those of the functions M0 , M1 , . . . , Mn−1 and Φ0 , Φ1 , . . . , Φn−1 .
Notice that a function F in U satisfies (5.5) if and only if F ∈ RanQk (RanQk denotes the range of
the operator Qk ). Furthermore, (5.11)–(5.14) above imply that U = RanQ0 ⊕ RanQ1 ⊕ · · · ⊕ RanQn−1 ,
each function Fk , k = 0, 1, 2, . . . , n − 1, defined by equation (5.4) is in RanQk .
Moreover,

F0 + F1 + · · · + Fn−1 = f (c0 + β0 c1 + · · · + β0n−1 cn−1 ). (5.15)

Thus, we have

Fk = Qk (f (c0 + β0 c1 + · · · + β0n−1 cn−1 )). (5.16)

6 Other ω-circulant algebras

According to (5.9) and (5.10), we define a function g: Cn → C, then
n−1
1  −j
Qk (g)(c0 , c1 , . . . , cn−1 ) = β g(β0j c0 + β1j c1 + · · · + βn−1
j
cn−1 ), (6.1)
n j=0 k
362 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

for k = 0, 1, 2, . . . , n − 1.
If we define the entire linear function f by f : Rn → Rn , where Rn is the set of ω-circulant matrices,
then there are functions f0 , f1 , f2 , . . . , fn−1 : Cn → C such that
 n−1
 n−1

f ck ε k = fk (c0 , c1 , c2 , . . . , cn−1 )εk . (6.2)
k=0 k=0

Hence, from equation (5.13), we get

 n−1
 n−1
 n−1
  n−1
n−1 
k
f ck ε = Qk+i (fk )εk = Qk+i (fk )εk . (6.3)
k=0 k=0 i=0 i=0 k=0

Proposition 6.1. Let V = {f | f : Rn → Rn , where Rn is the set of ω-circulant matrices}. For

f ∈ V , define qi (f ) and gi such that
 n−1
 n−1

qi (f ) ck ε k = Qk+i (fk )εk (6.4)
k=0 k=0

and
n−1

gi = Qk+i (fk ), (6.5)
k=0

for i = 0, 1, 2, . . . , n − 1 and k + i taken modulo n. Then the properties of qi can be obtained:

qi2 = qi for i = 0, 1, 2, . . . , n − 1, (6.6)

qi qj = 0 if i = j, (6.7)
(q0 + q1 + q2 + · · · + qn−1 )(f ) = f, f ∈ V. (6.8)

Proof. Based on (5.11) and (5.12),

Qk+i (gi ) = Qk+i (fk ), (6.9)

for k = 0, 1, 2, . . . , n − 1; i = 0, 1, 2, . . . , n − 1 and k + i taken modulo n.

We substitute equation (6.9) into equation (6.4), then
 n−1
 n−1

qi (f ) ck ε k = Qk+i (gi )εk , (6.10)
k=0 k=0

for i = 0, 1, 2, . . . , n − 1 and k + i taken modulo n.

By calculation, we can show that

qi2 = qi for i = 0, 1, 2, . . . , n − 1, (6.11)

qi qj = 0 if i = j, (6.12)
(q0 + q1 + q2 + · · · + qn−1 )(f ) = f, f ∈ V. (6.13)

Proof of Proposition 6.1 is completed.

According to the results we discussed above, we get the following theorem.
Theorem 6.2. Let q0 , q1 , q2 , . . . , qn−1 satisfy (6.4), then these operators are orthogonal projections
on V . Adding the identity function on V , they generate an ω-circulant algebra over C.
Proposition 6.3. The projections qi (f ) have another formula, which can be written in the following:
 n−1
 n−1  n−1
k 1  −ik −k k  l
qi (f ) ck ε = δ φ fφ cl ε , (6.14)
n
k=0 k=0 l=0
2πi
where δ = e n .
 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2 363

Proof. According to (6.4), we have

 n−1
 n−1

k
qi (f ) ck ε = Qk+i (fk )εk
k=0 k=0

n−1 n−1
1  −j

= β(k+i) fk (β0j c0 , β1j c1 , . . . , β(n−1)
j
cn−1 ) εk
n j=0
k=0
n−1  n−1 
1   −j −ij
= βk δ fk (β0j c0 , β1j c1 , . . . , β(n−1)
j
cn−1 ) εk
n j=0
k=0
n−1
  n−1

1
= δ −ij φ−j f βkj ck εk
n j=0 k=0
n−1
  n−1

1
= δ −ij φ−j f φj ck ε k .
n j=0 k=0

Since φ is a function Rn → Rn , namely one-to-one and onto, this result can be rewritten in the form
 n−1
 n−1
1  −ik −k k
qi (f ) ck ε k = δ φ fφ , (6.15)
n
k=0 k=0

for all functions f ∈ V . Finally, it can be shown that f φ = δ i φf if and only if f ∈ Ranqi .
Theorem 6.4. For each f ∈ V and every i = 0, 1, 2, . . . , n − 1, there exists only one function gi such
that the following equation holds:
 n−1
 n−1

k
qi (f ) ck ε = Qk+i (gi )εk , (6.16)
k=0 k=0

for i = 0, 1, 2, . . . , n − 1 and k + i taken modulo n.

Proof. By utilizing equations (5.11) and (5.12), we can obtain Qk+i (gi ) = Qk+i (fk ), for k = 0, 1, 2,
. . . , n − 1, i = 0, 1, 2, . . . , n − 1 and k + i taken modulo n.
Assume that there exists another function gi∗ : Cn → C such that
n−1
 n−1

qi (f ) = Qk+i (gi )εk = Qk+i (gi∗ )εk .
k=0 k=0

Because I, ε, ε2 , . . . , εn−1 is a basis of Rn , then Qk+i (gi ) = Qk+i (gi∗ ) for k = 0, 1, . . . , n − 1. Based on
equation (5.13), we get
n−1
 n−1

gi = Qk+i (gi ) = Qk+i (gi∗ ) = gi∗ . (6.17)
k=0 k=0

Thus, g is unique. Therefore, there is an isomorphism between functions gi : Cn → C and functions

n−1 i k
k=0 Qk+i (gi )ε in Ranqi .

All of the results are as follows: Let ϕ = {f | f : C → C} with f an entire function and U = {f | f :
Cn → C}. Let I be a monomorphism ϕ → U n defined by I(f ) = (f (c0 + β0 c1 + · · · + β0n−1 cn−1 ), 0, . . . , 0).
Let τ be a monomorphism ϕ → V defined by
 n−1
 n−1
  n−1

τ (f ) ck ε k = Qn (f (c0 + β0 c1 + · · · + β0n−1 cn−1 ))εk = f ck ε k . (6.18)
k=0 k=0 k=0

Based on equations (5.3), (5.4), and (5.16), there exists an isomorphism μ : U n → V defined by
 n−1
 n−1
 n−1

μ(g0 , g1 , g2 , . . . , gn−1 ) ck ε k = Qk+i (gi )εk . (6.19)
k=0 i=0 k=0
364 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

7 A linear involution for ω-circulant algebra

Assume g is a function Rn → Rn given by
n−1

g= g i εi , (7.1)
i=0

where gi is given by equation (6.5). Then, (7.1) can be written as

  n−1
n−1  
g= Qk+i (fk ) εi . (7.2)
i=0 k=0

If V denotes the space of functions f : Rn → Rn and f is an element of V , then there exists a set of n
n−1
functions f0 , f1 , . . . , fn−1 : Cn → C such that f = k=0 fk εk (like (6.2)). Let us switch the k and the i
in the right-hand side of (7.2). Now let the function ϑ : V → V be defined by
 n−1
 n−1
  n−1

ϑ fk εk = Qk+i (fi ) εk . (7.3)
k=0 k=0 i=0

Theorem 7.1. According to equations (5.11)–(5.13), we get that ϑ is a linear involution on V .

Proof. By using equations (5.11)–(5.13), we have
  n−1
 n−1
 n−1
  n−1
 
k
ϑ ϑ fk ε = Qk+i Qi+l (fl ) εk
k=0 k=0 i=0 l=0
  n−1
n−1  
= Qk+i εk
k=0 i=0
n−1

= fk εk ,
k=0

i.e., ϑ2 = ϑ0 (the identity function on V ). Thus, ϑ is a linear involution on V .

Consider the set K = {aϑ0 + bϑ | a, b ∈ C}, i.e., linear combinations over C of ϑ0 and ϑ (note that
0 0
ϑ = ϑ0 ). We know that K is a 2 × 2 complex circulant algebra; ϑ 2+ϑ and ϑ 2−ϑ are idempotent elements
2

of K, i.e., they are projections on V .

Now, we give the special case.
Example 7.2. If n = 2, then ε2 = eiθ I. Let f and g be two functions C2 → C. Then

ϑ(If (c0 , c1 ) + εg(c0 , c1 ))

I
= [f (c0 , c1 ) + β0−1 f (β0 c0 , β1 c1 ) + g(c0 , c1 ) + β1−1 g(β0 c0 , β1 c1 )]
2
ε
+ [f (c0 , c1 ) + β1−1 f (β0 c0 , β1 c1 ) + g(c0 , c1 ) + β2−1 g(β0 c0 , β1 c1 )],
2
θi 2jπi
where, βj = e 2 e 2 , 0  θ  2π, j = 0, 1.

Acknowledgements This work was supported by National Natural Science Foundation of China (Grant Nos.
11301251 and 11301252) and the Applied Mathematics Enhancement Program of Linyi University, China.

References
1 Audenaert K. A norm compression inequality for block partitioned positive semidefinite matrices. Linear Algebra
Appl, 2006, 413: 155–176
 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2 365

2 Bani-Domi W, Kittaneh F. Norm equalities and inequalities for operator matrices. Linear Algebra Appl, 2008, 429:
57–67
3 Benedetto F D. Gram matrices of fast algebras have a rank structure. SIAM J Matrix Anal Appl, 2009, 31: 526–545
4 Benedetto F D, Capizzano S S. Optimal multilevel matrix algebra operators. Linear Multilinear Algebra, 2000, 48:
35–66
5 Benedetto F D, Capizzano S S. A note on the super optimal matrix algebra operators. Linear Multilinear Algebra,
2002, 50: 343–372
6 Bertaccini D, Ng M K. Block ω-circulant preconditioners for the systems of differential equations. Calcolo, 2003, 40:
71–90
7 Bhatia R. Matrix Analysis. New York: Springer-Verlag, 1997
8 Bhatia R, Kahan W, Li R. Pinchings and norms of scaled triangular matrices. Linear Multilinear Algebra, 2002, 50:
15–21
9 Bhatia R, Kittaneh F. Norm inequalities for partitioned operators and an application. Math Ann, 1990, 287: 719–726
10 Boman E C. The Moore-Penrose pseudoinverse of an arbitrary, square, k-circulant matrix. Linear Multilinear Algebra,
2002, 50: 175–179
11 Bose A, Hazra R S, Saha K. Spectral norm of circulant-type matrices. J Theoret Probab, 2011, 24: 479–516
p
12 Cao J, Yang D C. Hardy spaces HL (Rn ) associated with operators satisfying k-Davies-Gaffney estimates. Sci China
Math, 2012, 55: 1403–1440
13 Chan R, Jin X Q, Yeung M C. The circulant operator in the Banach algebra of matrices. Linear Algebra Appl, 1991,
149: 41–53
14 Davis P. Circulant Matrices. New York: Wiley, 1979
15 Fiore C D, Zellini P. Matrix decompositions using displacement rank and classes of commutative matrix algebras.
Linear Algebra Appl, 1995, 229: 49–99
16 Grafakos L, Liu L G, Yang D C. Boundedness of paraproduct operators on RD-spaces. Sci China Math, 2010, 53:
2097–2114
17 Hirzallah O, Kittaneh F. Non-commutative Clarkson inequalities for n-tuples of operators. Integral Equations Operator
Theory, 2008, 60: 369–379
18 Jiang R J, Yang D C, Zhou Y. Orlicz-Hardy spaces associated with operators. Sci China Ser A, 2009, 52: 1042–1080
19 Jiang Z L. Singularity for two circulant type matrices. J Math Pract Theory, 1995: 52–58
20 Jiang Z L, Xu T T, Lu F L. Isomorphic operators and functional equations for the skew-circulant algebra. Abstr Appl
Anal, 2014, 2014: 418194
21 Jiang Z L, Zhou Z X. Circulant Matrices. Chengdu: Chengdu Technology University Publishing Company, 1999
22 King C. Inequalities for trace norms of 2 × 2 block matrices. Commun Math Phys, 2003, 242: 531–545
23 King C, Nathanson M. New trace norm inequalities for 2 × 2 blocks of diagonal matrices. Linear Algebra Appl, 2004,
389: 77–93
24 Kissin E. On Clarkson-McCarthy inequalities for n-tuples of operators. Proc Amer Math Soc, 2007, 135: 2483–2495
25 Kou K I, Sin V K, Jin X Q. A note on the fast algorithm for block Toeplitz systems with tensor structure. Appl Math
Comput, 2006, 126: 187–197
26 Li J, Jiang Z L, Lu F L. Determinants, norms, and the spread of circulant matrices with Tribonacci and generalized
Lucas numbers. Abstr Appl Anal, 2014, 2014: 381829
27 Mei Y. Computing the square roots of a class of circulant matrices. J Appl Math, 2012, 2012: 647623
28 Narasimha M J. Linear convolution using skew-cyclic convolutions. IEEE Signal Processing Letters, 2007, 14: 173–176
29 Ng M K, Lin F R, Chan R H. Construction of preconditioners for Wiener-Hopf equations by operator splitting. Appl
Math Comput, 1995, 72: 77–96
30 Noschese S, Reichel L. Generalized circulant Strang-type preconditioners. Numer Linear Algebra Appl, 2012, 19: 3–17
31 Potts D, Steidl G. Preconditioners for ill-conditioned Toeplitz systems constructed from positive kernel. SIAM J Sci
Comput, 2001, 22: 1741–1761
32 Ren P Y, Yuan Q, Wang R, et al. Low complexity construction for quasi-cyclic low-density parity-check codes by
Progressive-Block Growth. Sci China Inf Sci, 2011, 54: 371–380
33 Shen S Q, Cen J M. On the spectral norms of r-circulant matrices with the k-Fibonacci and k-Lucas numbers. Int J
Contemp Math Sci, 2010, 5: 569–578
34 Shen S Q, Cen J M. On the bounds for the norms of r-circulant matrices with the Fibonacci and Lucas numbers. Appl
Math Comput, 2010, 216: 2891–2897
35 Song R X, Li C H, Wang Y N, et al. Shape feature description based on log-polar coordinates and symmetric circulant
matrix (in Chinese). Sci Sin Math, 2014, 44: 815–822
n
  
36 Su W L, Luo H P, Li Q. Lower bounds for multicolor classical Ramsey numbers R(q, q, . . . , q). Sci China Ser A, 1999,
42: 1019–1024
366 Jiang Z L et al. Sci China Math February 2016 Vol. 59 No. 2

37 Wilde A C. Differential equations involving circulant matrices. Rocky Mountain J Math, 1983, 13: 1–13
38 Wilde A C. Algebras of operators isomorphic to the circulant algebra. Proc Amer Math Soc, 1989, 105: 808–816
39 Xu J M. Designing of optimal double loop networks. Sci China Ser E, 1999, 42: 462–469
40 Xu J M, Liu Q. An infinite family of 4-tight optimal double loop networks. Sci China Ser A, 2003, 46: 139–143
41 Zhang F J, Yong X R. Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in
circulant digraphs and graphs. Sci China Ser A, 1999, 42: 264–271
42 Zhang G H, Wang X M. A class of quasi-cyclic LDPC codes from B2 (mod m) sequences. Sci China Inf Sci, 2011, 54:
1645–1653
43 Zhang S Q, Zhou Q. Nested regular polygon solutions for planar 2N -body problems. Sci China Ser A, 2002, 45:
1053–1058
44 Zhou J W, Jiang Z L. The spectral norms of g-circulant matrices with classical Fibonacci and Lucas numbers entries.
Appl Math Comput, 2014, 233: 582–587