Parallel translates of represented matroids

https://doi.org/10.1016/j.aam.2021.102176Get rights and content

Abstract

Given an F-represented matroid (M,ρ) with the ground set [m], the representation ρ naturally defines a hyperplane arrangement Aρ. We will study its parallel translates Aρ,g of Aρ for all gFm. Its intersection semi-lattices L(Aρ,g) and the characteristic polynomials χ(Aρ,g,t) will be classified by the intersection lattice of the derived arrangement Aδρ, which is a hyperplane arrangement associated with the derived matroid (δM,δρ) and also known as the discriminantal arrangement in the literature. As a byproduct, we obtain a comparison result and a decomposition formula on the characteristic polynomials χ(Aρ,g,t).

Introduction

Our matroid terminology and notation will follow Oxley [11]. For a field F, let M be an F-represented matroid of rank r with the ground set [m]={1,2,,m}, and let ρ:[m]Fn be a matroid representation of M and write ρ(i)=ρi, i[m]. Denote by the pair (M,ρ) an F-represented matroid. Associated with (M,ρ), the hyperplane arrangement Aρ consists of hyperplanes Hi:ρix=0 for all i[m]. We are interested in classifying all parallel translates Aρ,g={Hρ1,g1,,Hρm,gm} of Aρ, where g=(g1,,gm) is a vector in Fm and the hyperplanes Hρi,gi are defined by the equationsHρi,gi:ρix=gi,1im. A vector is understood as either a row vector or a column vector, depending on its meaning in the context. Our motivation is the work of Athanasiadis [2] on deformations of hyperplane arrangements and the work of Oxley-Wang [12] on derived matroids.

Given a hyperplane arrangement A in a vector space V. The characteristic polynomial of A isχ(A,t):=XL(A)μ(V,X)tdimX, where L(A) is the intersection semi-lattice whose members are all possible nonempty intersections of hyperplanes of A, including V, ordered by the reverse of set inclusion, and μ is the Möbius function on L(A); see [10], [15], [16]. Our classification about the parallel translates Aρ,g with gFm is to classify the semi-lattices L(Aρ,g) and the characteristic polynomials χ(Aρ,g,t). When g=0, denote Aρ=Aρ,0 whose characteristic polynomial χ(Aρ,t) is the characteristic polynomial χ(M,t) of the matroid M (see [13], [16], [17]). So Aρ,g is a parallel translate of Aρ.

Rota first introduced the concept of derived matroids to investigate “dependencies among dependencies” of matroids at the Bowdoin College Summer 1971 NSF Conference on Combinatorics. In 1980, Longyear [8] studied the derived matroids δM when M is F2-represented. For any field F, Oxley and Wang [12] gave a specific definition of the derived matroid of an F-represented matroid (M,ρ). Let C(M) denote the set of all circuits of M. The derived matroid (δM,δρ) is an F-represented matroid of rank r(δM)=mr(M) with the ground set C(M) such that(δρ)(I)=cI for IC(M), where the circuit vector cI=(c1,c2,,cm) in Fm is unique (up to a non-zero scalar multiple) and defined by i=1mciρi=0, where ci0 if and only if iI. Similar as Aρ, the hyperplane arrangement Aδρ in Fm is defined byAδρ={HI|IC(M)},whereHI:cIx=0 and called the derived arrangement of (M,ρ).

In 1989, Manin and Schechtman [9] introduced the discriminantal arrangement to characterize the general position parallel translates of an affine hyperplane arrangement in general position, known as Manin-Schechtman arrangement. In 1994, Falk [6] shown that neither combinatorial nor topological structure of the discriminantal arrangement is independent of the original arrangement, that is, in matroid language, the derived matroid (δM,δρ) depends on the representation ρ of the original matroid M, confirmed in [12, page 4-6]. In 1997, Bayer and Brandt [3] studied the discriminantal arrangements without general position assumptions on the original arrangement. It is easily seen from [3, Theorem 2.4] that the discriminantal arrangement is exactly the derived arrangement defined above. Please see [1], [7], [14] for more study on discriminantal arrangements.

For each XL(Aδρ), consider the restriction of Aδρ to X, denoted Aδρ/X, which is a hyperplane arrangement in X consisting of the hyperplanes HIX of X, where HIAδρ and XHI. Let M(Aδρ/X)=XHI:XHIAδρH be the complement of Aδρ/X. We have the disjoint decomposition [16, page 410]Fm=XL(Aδρ)M(Aδρ/X). Indeed, for each xFm, assuming X=xHIAδρHI, we have xM(Aδρ/X). Below are our main results.

Theorem 1.1 Geometric Characterization

If vectors g,hM(Aδρ/X) for some XL(Aδρ), thenL(Aρ,g)L(Aρ,h)andχ(Aρ,g,t)=χ(Aρ,h,t).

When gM(Aδρ), the arrangement Aρ,g is in general position, exactly the same as the arrangement studied by Bayer and Brandt [3]. Theorem 1.1 says that χ(Aρ,g,t) are the same polynomial for all gM(Aδρ/X), denoted by χ(X,t). For convenience let us writeχ(Aρ,g,t)=χ(X,t)=k=0r(1)kak(X)tnk,gM(Aδρ/X).

Theorem 1.2 Uniform Comparison Theorem

Under the notations of (4), if XY for X,YL(Aδρ), thenak(X)ak(Y),0kr.

Theorem 1.3 Decomposition Formula

Under the notations of (4), if F is a finite field of q elements, thenXL(Aδρ)χ(X,q)χ(Aδρ/X,q)=qn(q1)m. If F is an infinite field, thenXL(Aδρ)χ(X,t)χ(Aδρ/X,t)=tn(t1)m.

To end this section, we give a small example to illustrate the above theorems.

Example 1.4

Consider the uniform matroid U2,4 represented over R byρ1=(1,0),ρ2=(0,1),ρ3=(1,1),ρ4=(1,1). The associated arrangement Aρ consists of hyperplanes Hi:ρix=0 in R2. For convenience we assume that the ground set of U2,4 is E={ρi|i=1,2,3,4}. It is obvious that for each i, Ii=E{ρi} is a circuit. The corresponding circuit vectors arecI1=(0,2,1,1),cI2=(2,0,1,1),cI3=(1,1,0,1),cI4=(1,1,1,0), and the derived arrangement is Aδρ={HIi:cIix=0|i=1,2,3,4} in R4. The intersection lattice L(Aδρ) consists of flats V=R4,HI1,HI2,HI3,HI4, W=i=14HIi with WHIiV. By routine calculations, we can obtain the characteristic polynomialsχ(Aδρ/V,t)=t44t3+3t2,χ(Aδρ/HIi,t)=t3t2,χ(Aδρ/W,t)=t2, andχ(V,t)=t24t+6,χ(HIi,t)=t24t+5,χ(W,t)=t24t+3. As Theorem 1.2, Theorem 1.3, we have the coefficient comparison ak(W)ak(HIi)ak(V) for k=0,1,2,i=1,2,3,4, and the decomposition formulaXL(Aδρ)χ(X,t)χ(Aδρ/X,t)=t2(t1)4.

Section snippets

Proofs of main results

Let A={H1,,Hm} be a hyperplane arrangement in an n-dimensional vector space V. A subset J[m] is said to be affine independent (with respect to A) if jJHj andr(jJHj):=ndim(jJHj)=|J|. Likewise, a subset J of [m] is said to be affine dependent if jJHj and r(jJHj)<|J|. Subsets J[m] with jJHj= are irrelevant to affine independence and affine dependence. An affine circuit is a minimal affine dependent subset I of [m], that is, I is affine dependent and any proper subset of I is

Applications

Consider M=U1,n, the uniform matroid with the ground set [n] and of rank 1. For any F- representation ρ of M, we have δMM(Kn), the cycle matroid of the complete graph Kn. Without loss of generality, assume the representation ρ:[n]F with ρ(i)=ρi=1. Its derived arrangement Aδρ isAδρ={Hi,j|1i<jn}whereHi,j:xi=xj. We say P={S1,,Sk} a partition of [n] if SiSj= and [n]=i=1kSi, and denote by l(P)=k the number of parts in P. For two partitions P={S1,,Sk} and P={S1,,Sk} of [n], we say P is

References (17)

There are more references available in the full text version of this article.

Cited by (0)

1

Supported by the National Natural Science Foundation of China (Grant No. 11871204).

View full text