Determinant Formulae of Matrices with Certain Symmetry and Its Applications

In this paper, we introduce formulae for the determinants of matrices with certain symmetry. As applications, we will study the Alexander polynomial and the determinant of a periodic link which is presented as the closure of an oriented 4-tangle.


Introduction
A block matrix is a matrix which is partitioned into submatrices, called blocks, such that the subscripts of the blocks are defined in the same fashion as those for the elements of a matrix [1].Let us consider periodic subject that consists of finite number of units with the same properties, see Figure 1.There are 5 subjects with the same properties which are arranged periodically.The brown color is used to depict their periodical placement, while the green color in the second and third figure presents an extra relationship which is acting between neighbouring two subjects.The matrix encoding the properties of the whole subject can be presented by block matrices.In the first picture in Figure 1, there are a finite number of units which are placed periodically but there are no interaction between units as seen.The matrix for the periodic subject will be of the form Indeed, the determinant of the matrix is (det A) n .
In the second picture in Figure 1, there are a finite number of units which are placed periodically and each unit is affected by neighbouring units as seen.The matrix for such a periodic subject is of the form In [2], the authors showed that the determinant of such a matrix is given by , where D is an r × r matrix.
On the other hand, in the last picture in Figure 1, there are a finite number of units which are placed periodically and each unit is affected by the periodic structure itself (rather than neighbouring units).The matrix for such a periodic object can be presented by a matrix of the form or a matrix of the form The applications in the last section will be helpful to understand the difference between (3) and (4).
In this paper, we will show that the determinant of the matrix (3) is , while the determinant of the matrix (4) is .
As an application, we will find the Alexander polynomial and the determinant of a periodic link (Theorems 4-7).Notice that, if a matrix M is singular, then we define (det(M)) 0 = 1.

Determinants
In this section, we introduce formulae for the determinants of block matrices (3) and (4).Theorem 1.Let A, B, C, and D be matrices of size m × m, m × r, r × m and r × r, respectively and O the zero-matrix.Then , where the number of A's in the diagonal is n and the number of (2D)'s in the diagonal is n − 1 (n ≥ 2).
Proof.The identity can be obtained by elementary determinant calculation.We put the detailed proof at Appendix A for the convenience of readers.
Theorem 2. Let A, B, C, D and E be matrices of size m × m, m × 1, 1 × m, 1 × 1 and 1 × 1, respectively and O the zero-matrix.Then , where the number of A's in the diagonal is n and the number of D + E's in the diagonal is n − 1(n ≥ 2). Proof.

LHS
The identity can be obtained by elementary determinant calculation.The identity (1) comes by adding the kth column to the first column and then, adding the (−1)(the first row) to the kth row for any k = 2, 3, • • • , n, while the identity (2) can be found in Appendix A.

Remark 1.
If A is invertible, then Theorems 1 and 2 can be proved by using the Schur complement.We put those proofs at Appendix B. The Authors appreciate such valuable comments given by our reviewer.

Application: Alexander Polynomials and the Determinants of Periodic Links
We start this section by reviewing results of knot theory which are related with the calculation of the Alexander polynomial and the determinant of a link, see [2][3][4] in detail.
A knot K is an embedding   A Seifert surface for an oriented link L in S 3 is a connected compact oriented surface contained in S 3 which has L as its boundary.The following Seifert algorithm is one way to get a Seifert surface from a diagram D of L.
Let D be a diagram of an oriented link L. In a small neighborhood of each crossing, make the following local change to the diagram; Delete the crossing and reconnect the loose ends in the only way compatible with the orientation.
When this has been done at every crossing, the diagram becomes a set of disjoint simple loops in the plane.It is a diagram with no crossings.These loops are called Seifert circles.By attaching a disc to each Seifert circle and by connecting a half-twisted band at the place of each crossing of D according to the crossing sign, we get a Seifert surface F for L.
The Seifert graph Γ of F is constructed as follows; Associate a vertex with each Seifert circle and connect two vertices with an edge if their Seifert circles are connected by a twisted band.
Note that the Seifert graph Γ is planar, and that if D is connected, so does Γ.Since Γ is a deformation retract of a Seifert surface F, their homology groups are isomorphic: Let T be a spanning tree for Γ.For each edge e ∈ E(Γ) \ E(T), T ∪ {e} contains the unique simple closed circuit T e which represents an 1-cycle in H 1 (F).The set {T e | e ∈ E(Γ) \ E(T)} of these 1-cycles is a homology basis for F. For such a circuit T e , let T + e denote the circuit in S 3 obtained by lifting slightly along the positive normal direction of F. For E(Γ) \ E(T) = {e 1 , • • • , e n }, the linking number between T e i and T + e j is defined by

∑
crossing c∈T e i ∩T + e j sign(c).
A Seifert matrix of L associated to F is the n × n matrix M = (m ij ) defined by where E(Γ) \ E(T) = {e 1 , • • • , e n }.A Seifert matrix of L depends on the Seifert surface F and the choice of generators of H 1 (F).
Let M be any Seifert matrix for an oriented link L. The Alexander polynomial ∆ L (t) ∈ Z[t, t −1 ] and determinant of L are defined by For details, see [4,5].
For e, f ∈ E(Γ)\E(T), T e ∩ T f is either an empty set, one vertex or a simple path in the spanning tree T. If T e ∩ T f is a simple path, v 0 and v 1 are two ends of T e ∩ T f , we may assume that the neighborhood of v 0 looks like Figure 4.In other words, the cyclic order of edges incident to v 0 is given by T e ∩ T f , T e , T f with respect to the positive normal direction of the Seifert surface.Also we may assume that the directions of T e and T f are given so that v 0 is the starting point of T e ∩ T f .For, if the direction is reversed, one can change the direction to adapt to our setting so that the resulting linking number changes its sign.In [6], the authors showed the following proposition which is the key tool to calculate the linking numbers for Seifert matrix of a link.
The Alexander polynomial of a knot or a link is the first polynomial of the knot theory [7].The polynomial was reformulate and derived in several different ways over the next 50 years.Perhaps the most satisfying of these is from the homology of the branched cyclic covering space of the knot complement.This reveals the underlying geometry and generalizes to higher dimensions and to a multi-variable version for links.See [4].Many researchers reformulate the Alexander polynomial as a state sum, Kauffman [8] and Conway [9], etc.Recently, many authors interested in the twisted Alexander polynomial and Knot Floer homology, it provides geometric information of a knot or a link, see [10][11][12][13].The Alexander polynomial is categorified by Knot Floer homology, see [14,15].Furthermore, since Alexander polynomial is a topological content of quantum invariants, Alexander polynomial is one of the most important invarinat of knot theory, see [16].
Proposition 1 ([6]).For e, f ∈ E(Γ)\E(T), let p and q denote the numbers of edges in T e ∩ T f corresponding to positive crossings and negative crossings, respectively.Suppose that the local shape of T e ∩ T f in F looks like Figure 4.Then, A link L in the 3-sphere S 3 is called a periodic link of order n (n ≥ 2) if there is an orientation preserving auto-homeomorphism ψ of S 3 which satisfies the following conditions; ψ(L) = L, Fix(ψ), the fixed-point set of ψ, is a 1-sphere disjoint from L and ψ is of period n.The link L/ψ = L * is called the factor link of the periodic link L. We denote Fix(ψ)/ψ by F * .One of an important concern of knot theory is to find the relationship between periodic links and their factor links, see [17,18].In 2011, the authors expressed the Seifert matrix of a periodic link which is presented as the closure of a 4-tangle with some extra restrictions, in terms of the Seifert matrix of quotient link in [2].
Let I be a closed interval [a, b] and k a positive integer.Fix k points in the upper plane I 2 × {b} of the cube I 3 and the corresponding k points in the lower plane I 2 × {a}.A (k, k)-tangle is obtained by embedding oriented curves and some oriented circles in I 3 so that the end points of the curves are the fixed 2k-points.By a 2k-tangle, we mean a (k, k)-tangle.Let T be a 2k-tangle.For an integer n ≥ 2, let T n denote the 2k-tangle obtained by stacking T n-times.The denominator D(T) of T is defined by connecting the top ends of T to the bottom ends by parallel lines, see Figure 5.In particular, if T is a 4-tangle, then the numerator N(T) of T is defined as the last picture in Figure 5. Clearly, D(T n ) is a periodic link of order n whose factor link is D(T).If an orientation is given on D(T), then it induces an orientation of D(T n ).Notice that every (oriented) periodic link can be constructed in this way.
Let T be a 4-tangle and let D(T) denote the denominator of T which is obtained by connecting the top ends and the bottom ends of T by parallel curves α and β.Suppose that D(T) is oriented.Note that the induced orientation at α and β are either opposite or parallel, see Figure 6.
If the induced orientation at α and β are parallel, then α and β are contained in different Seifert circles of D(T).Hence we have the following three cases.

Periodic Links with Periodicity in Case I
In Case I and Case II, the numerator N(T) of T is well-defined as an oriented link.In particular, in Case I, the linking number between any Seifert circle of D(T) and the periodic axis F * is always 0, which is equivalent to that lk(C, F * ) = 0 for any Seifert circle C of D(T).For Case I, the authors gave the following criteria for Alexander polynomial of the periodic link D(T n ) by using those of the denominator D(T) and the numerator N(T) of a 4-tangle T. Proposition 2 ([2]).Let L be a periodic link of order n with the factor link L * .Suppose that L = D(T n ) and L * = D(T) for a 4-tangle T. If lk(C, F * ) = 0 for any Seifert circle C of D(T), then the Alexander polynomials of L, L * and N(T) are related as follows; Indeed, to get the result, the authors showed the following proposition and then applied the determinant formula for the matrix (1).
, where B is a column vector, C is a row vector, O is the zero-matrix and the number of block M N(T) is n.

−C
, where B is a row vector, C is a column vector, O is the zero-matrix, the number of block M D(T) is n, and the number of block 2D is n − 1 (n ≥ 2).
Proof.Suppose that the orientations at the end points of the curves in T are opposite and the two outer arcs of D(T) are contained in different Seifert circles.Without loss of generality, we may assume that T looks like T as seen in Figure 8 that obtained from T by applying the Reidemeister move II between the left two outer curves and the right two outer curves of T, respectively.Note that D(T ), N(T ) and D(T n ) are ambient isotopic to D(T), N(T) and D(T n ), respectively.The Seifert graphs Γ D(T ) and Γ N(T ) of D(T ) and N(T ) are of the form in Figure 9, in which spanning trees τ D(T ) and τ N(T ) of Γ D(T ) and Γ N(T ) are given by dotted edges in Figure 9. Notice that Γ N(T ) is obtained from Γ D(T ) by identifying the left vertex u to the right vertex v in Γ D(T ) as shown in the right picture in Figure 9.The corresponding Seifert matrix Furthermore, the linking number between T e i and T + e j in N(T ) is equal to the linking number between T e i and T + e j in D(T ) From now on, we will try to find a Seifert matrix M D(T n ) of D(T n ).The Seifert graph Γ D(T n ) of D(T n ) consists of n copies of Γ D(T ) whose final vertices u and v are used to connect the copies of Γ D(T ) as shown in Figure 10.Let d p be the corresponding pth copy of d for all p = 1, 2, • • • , n in Γ D(T n ) .By removing (n − 1)-copies of the edge d, e.g., d 2 , d 3 , • • • , d n in Figure 10, we get a spanning tree τ D(T n ) of Γ D(T n ) .Indeed, ).If p = q, since T e p i and T e q j do not intersect, m i p j q (D(T n )) = 0 for all i, j = 1, 2, • • • , k, by Proposition 1.Hence, On the other hand, since T d p lies in the 1st copy and pth copy of T e i ∩ T d p , we have lk(T e Since T is connected, the generator T d p runs through 2 copies, in each of which the self linking number of T d is equal to D for all p = 2, 3, • • • , n.Furthermore, since the orientations at the end points of the curves in T are opposite, D is even.Hence, lk( Because generators T d p and T d q meet in the just 1st copy. Hence by using Theorem 1, we get the following result.Theorem 3. Let L be a periodic link of order n (n ≥ 2) with the factor link L * .Suppose that L = D(T n ) and L * = D(T) for a 4-tangle T in Case II.Then the Alexander polynomials of D(T n ), D(T) and N(T) are related as follows; Proof.By the definition of the Alexander polynomial of a link and by Lemma 1, we have Since the result in Theorem 3 (Case II) equals that in Proposition 2 (Case I), we can summarize them as Theorem 4. Let L be a periodic link of order n (n ≥ 2) with the factor link L * .Suppose that L = D(T n ) and L * = D(T) for a 4-tangle T whose numerator N(T) is defined.Then the Alexander polynomials of L, L * and N(T) are related as follows; Theorem 5. Let L be a periodic link of order n (n ≥ The Seifert matrices of N(T) and D(T) are given by .
By the direct calculation, one can see that the Alexander polynomials of D(T) and N(T) are By using Theorem 3, we get the Alexander polynomial of D(T 3 ); Finally, one can get det(D(T 3 )) = 3(14)(33) 2 = 45738 by Theorem 5 because det(D(T)) = 14 and det(N(T)) = 33.

Periodic Links with Periodicity in Case III
In Case III, recall that the orientation of T is given as the left of Figure 12 so that there exist exactly two Seifert circles C 1 and C 2 in D(T) such that lk(C 1 , F * ) = lk(C 2 , F * )(= ±1).Note that the orientation of T cannot be extended to an orientation of N(T).Define T + and T − by adding a positive crossing and a negative crossing at the bottom of T respectively, as shown in Figure 12.
, where B is a row vector, C is a column vector, O is the zero-matrix, E = D + 1, the number of block M D(T) is n and the number of block (D + E) is n − 1.
Proof.Since the process of the proof is similar to that of Theorem 3, we will give briefly sketch of the proof.
Proof.By the definition of the Alexander polynomial of a link and by Lemma 2, we have In general, the determinant of D(T n ) cannot be calculated by using Theorem 6 because |det(A + B)| = |det A| + |det B|.But we can calculate the determinant of D(T n ) under certain conditions.Theorem 7. Let L be a periodic link of order n (n ≥ 2) with the factor link L * .Suppose that L = D(T n ) and where m is the size of a Seifert matrix of D(T).
From the definition of the determinant of a link, Theorem 2 and Lemma 2, if the Seifert matrix M D(T) of D(T) is an m × m matrix and (−1) The identity (1) comes by the condition (−1) Example 2. Consider the oriented 4-tangle T in Figure 15, which is a 4-tangle in Case III.
T D(T) The Seifert matrices of D(T), D(T + ) and D(T − ) are given by .
By direct calculation, one can see that the Alexander polynomials of D(T), D(T + ) and D(T − ) are By using Theorem 6, we get the Alexander polynomial of D(T 3 ); Remark 2. In Theorem 7, the condition (−1) 15, which is a 4-tangle in Case III.By direct calculation, one can see that the determinant of D(T 3 ) = 500.The result is the same with det(D(T 3 )) = 5{(−10) 2 + (−10)(0) + (0) 2 } in Theorem 7. We can easily check this example satisfies the condition.Consider the oriented 4-tangle T in Figure 16, which is a 4-tangle in Case III. .
By direct calculation, one can see that the Alexander polynomials of D(T), D(T + ) and D(T − ) are By using Theorem 6, we get the Alexander polynomial of D(T 3 );

LHS
= (1) The reasons for the identities (1)-( 5) are the following; (1) Add the kth column to the first column and then, add (−1)(the first row) to the kth row for any It is the end of the proof of Theorem 1.

Proof of Theorem 2. To prove det
, where the number of A's and the number of (D + E)'s in the diagonal are n − 1 (n ≥ 2), we proceed by the mathematical induction on n, the number of block A. It is clear that Assume that the formula is true for n − 2 (n ≥ 3).It is well-known that the determinant can be obtained by adding the determinants of the following two matrices.
By simple calculation, one can calculate their determinants.Indeed, the determinant of the first matrix (I) is The reasons for the identities (1)-(4) are the following;      With the very same tools and by following the same steps, Theorem 2 can be proven as well.

Figure 1 .
Figure 1.Type of periodic subject.
called a component of the link L. Two links L and L are equivalent (or ambient isotopic) if one can be transformed into the other via a deformation of R 3 upon itself.A diagram of a link L is a regular projection image p(L) from the link L into R 2 such that the over-path and the under-path at each double points of p(L) are distinguished.There are examples of a knot and a link in Figure2.Two link diagrams are equivalent if one can be transformed into another by a finite sequence of Reidemeister moves in Figure3.

Figure 2 .
Figure 2. A trefoil knot diagram and a Hopf link diagram.
Case I: The orientations at the end points of the curves in T are opposite and the two outer arcs α and β of D(T) are contained in the same Seifert circle, see the first picture in Figure7.Case II: The orientations at the end points of the curves in T are opposite and the two outer arcs of D(T) are contained in different Seifert circles, see the second picture in Figure7.Case III: The orientations at the end points of the curves in T are parallel, see the last picture in Figure7.

Proposition 3 .
If T is a 4-tangle in Case I, then there exist Seifert matrices M D(T) , M N(T) , and M D(T n ) of D(T), N(T), and D(T n ), respectively, such that M D(T) = M N(T) B C D and

3. 2 .
Periodic Links with Periodicity in Case II In Case II, there is a Seifert circle C of D(T) such that lk(C, F * ) = 0.In fact lk(C 1 , F * ) = −lk(C 2 , F * )(= ±1) where C 1 and C 2 denote Seifert circles in D(T) containing α and β, respectively.Lemma 1.If T is a 4-tangle in Case II, then there exist Seifert matrices M D(T) , M N(T) and M D(T n ) of D(T), N(T) and D(T n ), respectively, such that M N(T) = M D(T) B C D and

Figure 12 .Lemma 2 .
Figure 12.T + and T − .Lemma 2. If T is a 4-tangle in Case III, then there exist Seifert matrices M D(T) , M D(T + ) , M D(T − ) and M D(T n ) of D(T), D(T + ), D(T − ) and D(T n ), respectively, such that The Seifert graphs Γ D(T ) , Γ D(T + ) and Γ D(T − ) of D(T ), D(T + ) and D(T − ) are of the form in Figure 13, in which spanning trees τ D(T ) , τ D(T + ) and τ D(T − ) of Γ D(T ) Γ D(T + ) and Γ D(T − ) are given by dotted edges in Figure 13.The Seifert graph Γ D(T n ) of D(T n ) consists of n copies of Γ D(T ) whose the end vertices u and v are used to connect the copies of Γ D(T ) as shown in Figure 14.Let d p be the corresponding pth copy of d for all p = 1, 2, • • • , n in D(T n ).Notice that by the construction of D(T n ), d and d * correspond to the same edge in D(T n ), where d and d * were new edges in Figure 13.By removing (n − 1)-copies of the edge d (or d * ) in Γ D(T ) , e.g., d 2 , d 3 , • • • , d n in Figure 14, we get a spanning tree τ D(T n ) of D(T n ).

Figure 15 .
Figure 15.Example for Case III.

1 ,
while the determinant of the second matrix (II) is

1 . 1 , 1 A 1 , 2 A 2 , 1 A 2
Add (−1){the (2n − 2)th column} to the kth column for any k= n, n + 1, • • • , 2n − 3.Therefore the determinant of our matrix is given by n By using this result, we can prove Theorem 2. so that, by putting together the latter relation and det(A 1,1 ) = {det(A)} n , we obtain det(X) = det A a 11 a 12 a 13 a 14 a 15 a 21 a 22 a 23 a 24 a 25 a 31 a 32 a 33 a 34 a 35 a 41 a 42 a 43 a 44 a 45 a 51 a 52 a 11 a 54 a 55