Parallel translates of represented matroids
Introduction
Our matroid terminology and notation will follow Oxley [11]. For a field , let M be an -represented matroid of rank r with the ground set , and let be a matroid representation of M and write , . Denote by the pair an -represented matroid. Associated with , the hyperplane arrangement consists of hyperplanes for all . We are interested in classifying all parallel translates of , where is a vector in and the hyperplanes are defined by the equations 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 in a vector space V. The characteristic polynomial of is where is the intersection semi-lattice whose members are all possible nonempty intersections of hyperplanes of , including V, ordered by the reverse of set inclusion, and μ is the Möbius function on ; see [10], [15], [16]. Our classification about the parallel translates with is to classify the semi-lattices and the characteristic polynomials . When , denote whose characteristic polynomial is the characteristic polynomial of the matroid M (see [13], [16], [17]). So is a parallel translate of .
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 -represented. For any field , Oxley and Wang [12] gave a specific definition of the derived matroid of an -represented matroid . Let denote the set of all circuits of M. The derived matroid is an -represented matroid of rank with the ground set such that where the circuit vector in is unique (up to a non-zero scalar multiple) and defined by , where if and only if . Similar as , the hyperplane arrangement in is defined by and called the derived arrangement of .
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 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 , consider the restriction of to X, denoted , which is a hyperplane arrangement in X consisting of the hyperplanes of X, where and . Let be the complement of . We have the disjoint decomposition [16, page 410] Indeed, for each , assuming , we have . Below are our main results. Theorem 1.1 Geometric Characterization If vectors for some , then
Theorem 1.2 Uniform Comparison Theorem Under the notations of (4), if for , then
Theorem 1.3 Decomposition Formula Under the notations of (4), if is a finite field of q elements, then If is an infinite field, then Example 1.4 Consider the uniform matroid represented over by The associated arrangement consists of hyperplanes in . For convenience we assume that the ground set of is . It is obvious that for each i, is a circuit. The corresponding circuit vectors are and the derived arrangement is in . The intersection lattice consists of flats , with . By routine calculations, we can obtain the characteristic polynomials and As Theorem 1.2, Theorem 1.3, we have the coefficient comparison for , and the decomposition formula
Section snippets
Proofs of main results
Let be a hyperplane arrangement in an n-dimensional vector space V. A subset is said to be affine independent (with respect to ) if and Likewise, a subset J of is said to be affine dependent if and . Subsets with are irrelevant to affine independence and affine dependence. An affine circuit is a minimal affine dependent subset I of , that is, I is affine dependent and any proper subset of I is
Applications
Consider , the uniform matroid with the ground set and of rank 1. For any - representation ρ of M, we have , the cycle matroid of the complete graph . Without loss of generality, assume the representation with . Its derived arrangement is We say a partition of if and , and denote by the number of parts in P. For two partitions and of [n], we say is
References (17)
On characteristic polynomials of subspace arrangements
J. Comb. Theory, Ser. A
(2000)- et al.
On valuations, the characteristic polynomial, and complex subspace arrangements
Adv. Math.
(1998) The circuit basis in binary matroids
J. Number Theory
(1980)- et al.
Discriminantal arrangement, minors of Plücker matrix and hypersurfaces in Grassmannian Gr(3,n)
C. R. Math. Acad. Sci. Paris
(2017) The largest intersection lattice of a discriminantal arrangement
Beitr. Algebra Geom.
(1999)A combinatorial reciprocity theorem for hyperplane arrangements
Can. Math. Bull.
(2010)- et al.
Discriminantal arrangements, fiber polytopes and formality
J. Algebraic Comb.
(1997) A note on discriminantal arrangements
Proc. Am. Math. Soc.
(1994)