The Smith Normal Form of the Incidence Matrix of Skew Lines in … · 2013. 9. 28. · The Smith...

The Smith Normal Form of the IncidenceMatrix of Skew Lines in PG(3, q)

Peter Sin, University of Florida

JGT80 Cambridge, September 11, 2013 .

Outline

Skew lines in PG(3,q)

Eigenvalues and invariants

p-filtrations

Proof of Theorem 1

The missing invariants

Reduction to Point-Line Incidence

SNF of a product

Skew lines graph

I Joint work with Andries Brouwer and Josh Ducey.I We consider skewness of pairs of lines in PG(3,q), q = pt .I Get strongly regular graph with parameters

v = q4+q3+2q2+q+1, k = q4, λ = q4−q3−q2+q, µ = q4−q3.

I Under the Klein Correpondence, two lines are skew iff thecorresponding points of the Klein quadric in PG(5,q) arenot orthogonal, i.e, not joined by a line in the quadric.

I Adjacency matrix A, Laplacian L = D − A, D diagonalmatrix of degrees. In our case D = q4I.

Skew lines graph

Smith normal forms

A, L define endomorphisms of the free Z-module on lines.Cokernel of A is called the Smith group and the torsionsubgroup of the cokernel of L is known as the critical groupor sandpile group.The order of the critical group is the number of spanningtrees in the graph.In our case A and L are closely related, and it suffices toconsider the Smith group.We compute it by using its structure as a module forGL(4,q).

Smith normal forms

Outline

p-filtrations

Proof of Theorem 1

SNF of a product

All invariants are powers of p

The adjacency matrix of any SRG(v , k , λ, µ) satisfies

A2 + (µ− λ)A + (µ− k)I = µJ

(J is the all-one matrix)A2 = q4I + (q4 − q3 − q2 + q)A + (q4 − q3)(J − A− I)Eigenvalues of A are q, −q2, and q4 with respectivemultiplicities q4 + q2, q3 + q2 + q, and 1.Replace Z by a suitable p-adic ring R = Zp[ξ], with ξ aprimitive (q4 − 1)-th root of unity.

A2 + (µ− λ)A + (µ− k)I = µJ

Theorem 1Let ei = ei(A) = number of invariant factors in the SmithNormal Form of A which are exactly divisible by pi .

1. e4t = 1.2. ei = 0 for i > 4t and for t < i < 2t , 3t < i < 4t .3. ei = e3t−i for 0 ≤ i < t .4.∑t

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

Thus we are reduced to finding t of the numbers e0, . . . ,et(or the numbers e2t , . . . ,e3t ).

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

i=0 ei = q4 + q2.5.∑3t

i=2t ei = q3 + q2 + q.

Outline

p-filtrations

Proof of Theorem 1

SNF of a product

p-filtrations

Let F = R/(p).For L ≤ R`, set L = (L + pR`)/pR`.η : Rm → Rn, R-module homomorphismMi(η) = {x ∈ Rm | η(x) ∈ piRn}Ni(η) = {p−iη(x) | x ∈ Mi(η)} (and N−1(η) = {0})Rm = M0(η) ⊇ M1(η) ⊇ · · ·N0(η) ⊆ N1(η) ⊆ · · ·Fm = M0(η) ⊇ M1(η) ⊇ · · ·N0(η) ⊆ N1(η) ⊆ · · · .

p-filtrations

LemmaLet η : Rm → Rn be a homomorphism of free R-modules offinite rank. Then, for i ≥ 0,

ei(η) = dimF

(Mi(η)/Mi+1(η)

)= dimF

(Ni(η)/Ni−1(η)

Outline

p-filtrations

Proof of Theorem 1

SNF of a product

Split off the all-one vector

V , a 4-dimensional vector space over Fq

Lr = set of subspaces of dimension r in V

View A as an R-module map A : RL2 → RL2 .1 =

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

(1)A = q41Let A′ = A|Y2 (or its matrix in some basis).e4t(A) = e4t(A′) + 1ei(A) = ei(A′) for i 6= 4t .

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

∑x∈L2

Y2 ={∑

x∈L2axx ∈ RL2

∣∣∣ ∑x∈L2ax = 0

}RL2 = R1⊕ Y2

SRG equation

A(A + (q2 − q)I) = q3I + (q4 − q3)JOn Y2, A′(A′ + (q2 − q)I) = q3I.Let P and Q be unimodular, with D = PA′Q−1 diagonal.Then

Q(A′ + (q2 − q)I)P−1 = q3D−1,

SRG equation

Q(A′ + (q2 − q)I)P−1 = q3D−1,

SRG equation

Q(A′ + (q2 − q)I)P−1 = q3D−1,

Q(A′ + (q2 − q)I)P−1 = q3D−1

ei(A′) = 0 for i > 3t .e4t(A) = 1ei(A′ + (q2 − q)I) = e3t−i(A′)for 0 ≤ i ≤ 3t .

Q(A′ + (q2 − q)I)P−1 = q3D−1

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

ei(A′) = ei(A′ + (q2 − q)I) = e3t−i(A′), for 0 ≤ i < tSet E := Frac(R)⊗R RL2

Eλ := λ-eigenspace for A in E .Eq ∩ RL2 and E−q2 ∩ RL2 are pure R-submodules of Y2.Eq ∩ RL2 ⊆ Nt(A|Y2) and E−q2 ∩ RL2 ⊆ M2t(A|Y2).

q4 + q2 = dimF(Eq ∩ ZL2p ) ≤ dimF Nt(A′) =

t∑i=0

ei(A′)

q3+q2+q = dimF(E−q2 ∩ ZL2p ) ≤ dimF M2t(A′) =

3t∑i=2t

ei(A′).

Since (q4 + q2) + (q3 + q2 + q) = dimF Y2, we must haveequalities throughout, so ei(A) = 0 for all other i .

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

t∑i=0

ei(A′)

3t∑i=2t

ei(A′).

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

t∑i=0

ei(A′)

3t∑i=2t

ei(A′).

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

t∑i=0

ei(A′)

3t∑i=2t

ei(A′).

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

t∑i=0

ei(A′)

3t∑i=2t

ei(A′).

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

t∑i=0

ei(A′)

3t∑i=2t

ei(A′).

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

t∑i=0

ei(A′)

3t∑i=2t

ei(A′).

Proof of Theorem 1

A′ ≡ A′ + (q2 − q)I (mod pt)

t∑i=0

ei(A′)

3t∑i=2t

ei(A′).

RemarkI Proof uses only the SRG equation, so Theorem 1 is valid

for all SRGs with the same parameters. For q = 2, thereare 3854 such SRGs (Spence).

I When q = p, the Smith group is determined once we knowe0 = rankp A. When q = 2, our A is the unique one withrank2 A = 6.

RemarkI Proof uses only the SRG equation, so Theorem 1 is valid

for all SRGs with the same parameters. For q = 2, thereare 3854 such SRGs (Spence).

I When q = p, the Smith group is determined once we knowe0 = rankp A. When q = 2, our A is the unique one withrank2 A = 6.

Outline

p-filtrations

Proof of Theorem 1

SNF of a product

Statement of Theorem 2

[3]t = {(s0, . . . , st−1) | si ∈ {1,2,3} for all i}For s = (s0, . . . , st−1) ∈ [3]t

λi = psi+1 − si ,

(subscripts mod t) and

λ = (λ0, . . . , λt−1)

For an integer k , set dk to be the coefficient of xk in theexpansion of (1 + x + · · ·+ xp−1)4. Set d(s) =

∏t−1i=0 dλi .

Theorem 2Let ei = ei(A) denote the multiplicity of pi as an elementarydivisor of A.Then, for 0 ≤ i ≤ t ,

e2t+i =∑

s∈H(i)

H(i) ={(s0, . . . , st−1) ∈ [3]t

∣∣d(s) 6= 0 and #{j |sj = 2} = i}.

Example, q = 9

(1 + x + x2)4 =1 + 4x + 10x2 + 16x3 + 19x4 + 16x5 + 10x6 + 4x7 + x8

H(0) = {(11), (13), (31), (33)},H(1) = {(21), (23), (12), (32)}, H(2) = {(22)}.e4 = d(11) + d(13) + d(31) + d(33) = 202e5 = d(21) + d(23) + d(12) + d(32) = 256e6 = d(22) = 361

Table: The elementary divisors of the incidence matrix of lines vs.lines in PG(3,9), where two lines are incident when skew.

Elem. Div. 1 3 32 34 35 36 38

Multiplicity 361 256 6025 202 256 361 1

GL(4, q)-modules

Theorem (Bardoe-S, 2000)

(a) The F GL(4,q)-permutation module FL1 = F1⊕ Y 1 ismultiplicity-free and the composition factors of Y 1correspond to

H = {s ∈ [3]t | d(s) 6= 0}.

and d(s) gives the dimension.(b) If we define the partial order s ≤ s′ iff si ≤ s′i for all i , then

the lattice of order ideals is isomorphic to theF GL(4,q)-submodule lattice of Y 1.

GL(4, q)-modules

RemarkEach subquotient of the F GL(4,q)-module Y 1 determines asubset of H correponding to its composition factors.

Outline

p-filtrations

Proof of Theorem 1

SNF of a product

B := the incidence matrix with rows indexed by L1 andcolumns indexed by L2, where incidence again meanszero intersection.

BtB = (q3+q2)I+(q3+q2−q−1)A+(q3+q2−q)(J−A−I).

(1)BtB = q4(q2 + q + 1)(q + 1)1,ei(BtB) = ei(BtB|Y2) for i 6= 4t .BtB = −[A + (q2 − q)I] + q2I + (q3 + q2 − q)JOn Y2, BtB = −[A + (q2 − q)I] + q2I.ei((BtB)|Y2) = ei(A′ + (q2 − q)I) = e3t−i(A), for 0 ≤ i ≤ t .

Invariants of B

The ei(B) were previously calculated.

Theorem (Chandler-S-Xiang, 2006)Set B′ := B|Y1 : Y1 → Y2.(a) The composition factors of Mk (B′)/Mk+1(B′) correspond

to the set

Hk (2) = {s ∈ H|exactly k of the sj are equal to 1}.

(b) The composition factors of N`(B′t)/N`−1(B′

t) correspondto

`H(2) = {s ∈ H|exactly ` of the sj are equal to 3}.

Outline

p-filtrations

Proof of Theorem 1

SNF of a product

Idea of proof for Theorem 2

Problem is to relate invariants of BtB to those of B.Suppose that we can diagonalize Bt and B by:

PBtE−1 = D2,1

andEBQ−1 = D1,2

with the same E in both equations.Then we can diagonalize the product:

PBtBQ−1 = Dr ,1D1,s,

In general is not possible to find such a matrix E .

PBtE−1 = D2,1

andEBQ−1 = D1,2

PBtE−1 = D2,1

andEBQ−1 = D1,2

PBtE−1 = D2,1

andEBQ−1 = D1,2

Left and right SNF Bases

For a homomorphism η : Rm → Rn, consider basesB ⊆ Rm and C ⊆ Rn for which the matrix of η is in diagonalform.Call B a left SNF basis for η and C a right SNF basis.Lifting bases from the M-filtration

M0(η) ⊇ M1(η) ⊇ · · · ⊇ M`(η) ) ker(η)

gives a left SNF basis. The N-filtration gives right SNFbasis.

M0(η) ⊇ M1(η) ⊇ · · · ⊇ M`(η) ) ker(η)

LemmaThere exists a basis B of RL1 that is simultaneously a left SNFbasis for B and a right SNF basis for Bt .

GL(4,q) has a cyclic subgroup S acting transitively on L1,hence all S-isotypic components of RL1 have rank 1.Taking a generator of each component, we get a basis I ofRL1 compatible with both the M-filtration for B and theN-filtration for Bt .I is both a left SNF basis for B and a right SNF basis forBt .

Theorem 2Let ei = ei(A) denote the multiplicity of pi as an elementarydivisor of A. Then, for 0 ≤ i ≤ t ,

e2t+i = et−i(BtB) =∑

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

s∈H(i)

Note H(i) =⋃

k+`=t−i Hk (2) ∩ `H(2).

Thank you for your attention!

References

Matthew Bardoe and Peter Sin, The permutation modules forGL(n + 1,Fq) acting on Pn(Fq) and Fn−1

q , J. London Math. Soc.(2) 61 (2000), no. 1, 58–80.

David B. Chandler, Peter Sin, and Qing Xiang, The invariantfactors of the incidence matrices of points and subspaces inPG(n,q) and AG(n,q), Trans. Amer. Math. Soc. 358 (2006),no. 11, 4935–4957 (electronic).

Noboru Hamada, On the p-rank of the incidence matrix of abalanced or partially balanced incomplete block design and itsapplications to error correcting codes, Hiroshima Math. J. 3(1973), 153–226.

Eric S. Lander, Symmetric designs: An algebraic approach,Cambridge University Press, 1983, London Math. Soc. LectureNotes 74.

Joseph John Rushanan, TOPICS IN INTEGRAL MATRICESAND ABELIAN GROUP CODES (SMITH NORMAL FORM(SNF), QUADRATIC, DUADIC, Q-CODES), ProQuest LLC, AnnArbor, MI, 1986, Thesis (Ph.D.)–California Institute ofTechnology.

Peter Sin, The elementary divisors of the incidence matrices ofpoints and linear subspaces in Pn(Fp), J. Algebra 232 (2000),no. 1, 76–85.

Peter Sin, The p-rank of the incidence matrix of intersectinglinear subspaces, Des. Codes Cryptogr. 31 (2004), no. 3,213–220.

Qing Xiang, Recent progress in algebraic design theory, FiniteFields Appl. 11 (2005), no. 3, 622–653.

Qing Xiang, Recent results on p-ranks and Smith normal formsof some 2-(v , k , λ) designs, Coding theory and quantumcomputing, Contemp. Math., vol. 381, Amer. Math. Soc.,Providence, RI, 2005, pp. 53–67.

The Smith Normal Form of the Incidence Matrix of Skew Lines in … · 2013. 9. 28. · The Smith...

Documents

Representasi Graph Isomorfisme - Heri Risdianto's Weblog fileRepresentasi graph: 1. Adjacency list 2. Adjacency matrix 3. Incidence matrix Contoh: undirected graph Adjacency list 1:

Skew Measurement

Implementation of parallel randomized algorithm for skew-symmetric matrix game

3. Matrices...3. Matrices • Introduction • Matrix • Types of Matrices • Operations on Matrices • Transpose of a Matrix • Symmetric and Skew Symmetric Matrices What are

Implementing Useful Clock Skew Using Skew Groups

The Cboe Skew Index - Skew

Rank aggregation via skew-symmetric matrix completion

CSE 248 Skew 1Kahng, UCSD 2011 CSE248 Spring 2011 Skew

3.3-V RoboClock Low Voltage Programmable Skew Clock Buffer...LEVEL) SKEW SELECT MATRIX 4F0 4F1 3F0 3F1 2F0 2F1 1F0 1F1 4Q0 4Q1 3Q0 3Q1 2Q0 2Q1 1Q0 1Q1 FILTER PHASE FREQ DET Logic Block

Input-State Incidence Matrix of Boolean Control Networks and Its …lsc.amss.ac.cn/~dcheng/preprint/bn_isim.pdf · 2013. 1. 22. · input-state incidence matrix is also used to reveal

Graphs, Matrices and Generalized Inverse › ... › Day5_Session_1_Lecture_KMPK.pdf · Contents 1 Introduction 2 Some Properties of Incidence Matrices 3 Minors of incidence matrix

Diagonal matrix, triangular matrix, symmetric and skew-symmetric …mathsci.kaist.ac.kr/~schoi/sumlinsec3_6.pdf · 2009-05-20 · If every diagonal entry is not zero, then the matrix

skew design

Skew Heaps

1-04 15-16_BCA...symmetric matrices Matrix Algebra: Types of Matrices — Matrix addition and subtraction - Matrix . row matrix. column matrix, Symmetric and skew Unit — I : Matrix

files.stupidsid.comfiles.stupidsid.com/university_papers/engineering/ELEC/4/...... Show that every square matrix can be uniquely expressed as the sum of a Hermitian matrix and a Skew-Hermitian

Skew Angle

Skew Stuff

BRAIDED SKEW MONOIDAL CATEGORIES · skew monoidal categories are also called left skew.) If Cis skew monoidal then there are induced right skew monoidal structures on the opposite

Georgia Skew