THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.
|
|
- Aileen Carroll
- 5 years ago
- Views:
Transcription
1 THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection lattice of a discriminantal arrangement based on an essential arrangement of n linear hyperplanes in R k. An important ingredient in the proof is Crapo's characterization of the matroid of circuits of the conguration of n generic points in R k. 1. Introduction Let A be an arrangement of n linear hyperplanes in R k with normal vectors i for 1 i n. Assume that the vectors i span R k, so that A is essential. The discriminantal arrangement B(A) based on A [11, 1] is the arrangement of linear hyperplanes in R n with normal vectors the distinct, nonzero vectors of the form (1) S = k+1 X i=1 (?1) i det ( s1 ; : : : ; si?1 ; si+1 ; : : : ; sk+1 ) e si ; where S = fs 1 < s 2 < < s k+1 g ranges over all subsets of [n] := f1; 2; : : : ; ng with k + 1 elements and the e j are the standard coordinate vectors in R n. We are primarily concerned with a conjecture of Bayer and Brandt [1] about the intersection lattice [13, x2.1] L(B(A)) of B(A), the main combinatorial invariant of B(A). Bayer and Brandt call A very generic if for all r, the number of elements of L(B(A)) of rank r is the largest possible for a discriminantal arrangement based on an essential arrangement of n linear hyperplanes in R k. They denote by P (n; k) the collection of all sets of the form fs 1 ; S 2 ; : : : ; S m g, where the S i are subsets of [n], each of cardinality at least k + 1, such that j [ i2i S i j > k + X i2i (js i j? k) for all I [m] with jij 2. They partially order P (n; k) by letting S T if every subset in S is contained in some subset in T. Note that P (n; 1) is isomorphic to the lattice of partitions of [n]. The following appears as Conjecture 4.3 in [1]. Date: June 23, The present research was carried out while the author was a Hans Rademacher Instructor at the University of Pennsylvania. 1
2 2 CHRISTOS A. ATHANASIADIS Conjecture 1.1. (Bayer and Brandt [1]) Let n k There exist arrangements of n hyperplanes in R k which are very generic. Moreover, the intersection lattice of the discriminantal arrangement based on any very generic arrangement of n hyperplanes in R k is isomorphic to P (n; k). The discriminantal arrangement was originally dened when the hyperplanes of A are in general position, meaning that any k of the vectors i are linearly independent, by Manin and Schechtman [11], who initiated the study of its complement. Manin and Schechtman remarked [11, p. 292] that although B(A) depends on the original arrangement A (see also Falk [9]), its intersection lattice depends only on n and k if A lies in a Zariski open subset of the space of all arrangements of n linear hyperplanes in general position in R k. They gave a description of this lattice, which we denote by L(n; k), for k + 1 n k + 3 [11, p. 292] (see also [13, p. 205]) and implicitly suggested the problem of describing L(n; k) for other values of n. From a dierent perspective, unkown in the literature of discriminantal arrangements, the matroid of circuits of the conguration of n points 1, 2 ; : : :, n in R k, realized by the vectors S, has been introduced by Crapo [4]. Crapo characterized this matroid M(n; k) when the coordinates of the vectors i are generic indeterminates [5] as the Dilworth completion D k (B n ) of the kth lower truncation of the Boolean algebra of rank n (see e.g. Crapo and Rota [6, x7], Mason [12] or Brylawski [3, x7]). The lattice L(n; k) is the geometric lattice of ats of M(n; k). For recent related work, see Crapo and Rota [7]. In the present paper we rst dene precisely the Zariski open set O(n; k) that the hypothesis of Manin and Schechtman on A refers to, in order to clarify this point (see [9, p. 1222]). We refer to an arrangement A in O(n; k) as suciently general. We use ideas from matroid theory [10] to show (Theorem 2.3) that any arrangement A in O(n; k) is very generic and moreover, that it maximizes the f-vector of B(A) or, equivalently, the f-vector of the corresponding ber zonotope [2, x4]. It follows that very generic arrangements exist and that the lattice which Conjecture 1.1 refers to coincides with L(n; k). Finally we show (Theorem 3.2) that Crapo's characterization [5, x6] of M(n; k) implies that its lattice of ats L(n; k) is isomorphic to P (n; k). Equivalently, the lattice of ats of the Dilworth completion D k (B n ) is isomorphic to P (n; k). This has been observed earlier for k = 1 [6, Proposition 7.9] [12, x2.5] and completes the proof of Conjecture Sufficiently general arrangements Let A be an essential arrangement of n linear hyperplanes in R k, as in the beginning of the introduction, with normal vectors i = ( ij ) k j=1 for 1 i n. For each set S = fs 1 ; S 2 ; : : : ; S m g of (k + 1)-subsets of [n] with m n, we denote by A S the m n matrix whose (r; j) entry is the jth coordinate of the vector Sr in R n. Let be the sum of the squares of the m m minors of the matrix A S, considered as a p S
3 THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT 3 polynomial in the indeterminates ij. Thus p S is an element of the ring R[x ij ] and p S ( ij ) = 0 if and only if the vectors S1 ; S2 ; : : : ; Sm are linearly dependent. Denition 2.1. We call A suciently general if p S ( ij ) 6= 0 for all S for which the polynomial p S is not identically zero. We denote by O(n; k) the space of suciently general arrangements. The set O(n; k) is a nonempty Zariski open subset of the space of all arrangements of n linear hyperplanes in general position in R k. Apparently, and in view of the following easy proposition, it is the Zariski open set that Manin and Schechtman refer to. Proposition 2.2. If A is restricted in the set O(n; k) then the matroid realized by the vectors S, and hence the intersection lattice L(n; k) as well as the f-vector of B(A), depend only on n and k. Proof. Indeed, a set S = fs 1 ; S 2 ; : : : ; S m g indexes an independent subset of the set of vectors f S g if and only if the polynomial p S is not identically zero. We now use the idea of weak maps of matroids [10] to show that any arrangement in O(n; k) is very generic, in the sense of Bayer and Brandt. A dierent application of the same technique was recently given by Edelman [8]. Theorem 2.3. If A is in O(n; k) then B(A) has maximum f-vector and intersection lattice with all rank sets of maximum size among all discriminantal arrangements based on an essential arrangement of n linear hyperplanes in R k. Proof. Let A 0 be any essential arrangement of n linear hyperplanes in R k with corresponding data 0 i, 0 ij and 0 S. The map S! 0 S denes a weak map [10] of the matroids M and M 0, realized by the sets of vectors f S g and f 0 g respectively. S Indeed, if the f 0 g for S S 2 S are linearly independent then p S( 0 ij) 6= 0, so p S is not identically zero and hence the f S g for S 2 S are also linearly independent. The result follows from the fact that the Whitney numbers of both kinds of M 0 are bounded above by those of M whenever there is a weak map of matroids M! M 0 (see Proposition and Corollary in [10]). 3. The intersection lattice We rst recall some useful notation from [7]. A set S = fs 1 ; S 2 ; : : : ; S m g of subsets of [n] is an antichain if none of the subsets contains another. For such an antichain S we let (S) = ( [ S2S S)? X S2S (S); where (S) = max(0; jsj? k). Thus S 2 P (n; k) if each S i has cardinality at least k + 1 and (F) > 0 for all F S with jfj 2. If T = ft 1 ; T 2 ; : : : ; T p g is another antichain, we let S T if for each i there exists a j such that S i T j.
4 4 CHRISTOS A. ATHANASIADIS We assume that A is in O(n; k) and think of L(n; k) as the geometric lattice spanned by the vectors S. The matroid M(n; k) realized by these vectors, to which we have refered in Proposition 2.2, has been characterized by Crapo [5, x6] and was shown to be isomorphic to the Dilworth completion D k (B n ) [6, x7] [12] of the kth lower truncation of the Boolean algebra of rank n. The Dilworth completion D k (B n ) is a matroid on the set of all (k + 1)-subsets of [n] which can be described explicitly in terms of its bases, independent sets and circuits. We keep our discussion as selfcontained as possible. The following result is equivalent to Theorem 2 in [5, x6]. Theorem 3.1. (Crapo [5]) Let S 1 ; S 2 ; : : : ; S m be (k + 1)-subsets of [n]. The vectors S1, S2 ; : : : ; Sm are linearly independent if and only if (2) j [ i2i S i j k + jij for all I [m] or, in other words, if S = fs 1 ; S 2 ; : : : ; S m g satises (F) 0 for all F S. Proof. The elegant argument in the proof of Theorem 2 in [5, x6] shows that S := f S1 ; S2 ; : : : ; Sm g is a basis if and only if (F) 0 for all F S and m = n? k. It suces to show that if S satises (2) then S is contained in a basis. This follows by an application of Hall's marriage theorem to the sets S i? [k]. In the remaining of this section we show that this characterization of M(n; k) implies that its lattice of ats L(n; k) is isomorphic to the poset P (n; k), dened in the introduction. For an antichain S = fs 1 ; S 2 ; : : : ; S m g of subsets of [n] we denote by V S the linear span of the vectors S for all (k + 1)-subsets S of [n] such that S S i for some 1 i m. If S = fsg, where S has any cardinality, we write V S instead of V S. Note that dim V S = (S), which clearly implies the \only if" direction of Theorem 3.1. We let '(S) = V S if S 2 P (n; k). Theorem 3.2. The map ' : P (n; k)! L(n; k) is an isomorphism of posets. We give the proof after we establish a few lemmas. Lemma 3.3. Let S be an antichain L with the properties jsj k + 1 for all S 2 S, (F) 0 for all F S and V S = V S2S S. If S is not in P (n; k) then there exists an antichain S 0 with the same three properties as S and such that V S 0 = V S, js 0 j < jsj and S S 0. Proof. By assumption, (F) = 0 for some F S with at least two elements. Let U be the union of the elements of F. Since V F V U for all F 2 F, the sum of the V F is direct and their dimensions (F ) sum to the dimension (U) of V U, we have V U = M V F :
5 THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT 5 Replace the subsets F 2 F in S with their union U to get the desired antichain S 0. The property (E) 0 for P all E S 0 follows from the corresponding property of S and the fact that (U) = F (F ). 2F Lemma 3.4. If S and T are any antichains with S T and (F) 0 for all F S, then X S2S (S) X T 2T (T ): Proof. We induct on the cardinality of S. Choose a set T 2 T so that the subfamily F = ff 2 S : F T g is nonempty. Then X X X [ X (S) = (F ) + (S) ( F ) + (S) S2S S 2 S?F S2S?F X (T ) + (S): S 2 S?F Since S? F T? ft g, induction completes the proof. Lemma 3.5. If S 2 P (n; k), T is a subset of [n] with jt j k + 1 and frg S for all R T with jrj = k + 1, then ft g S. Proof. This follows from the denition of P (n; k) by an easy induction. We now prove Theorem 3.2 and thus complete the proof of Conjecture 1.1. Proof of Theorem 3.2. The map ' is clearly order preserving. We rst show that it is surjective. Let V be a linear space in L(n; k). Choose a basis f S1, S2 ; : : : ; Sm g of V, where the S i are (k + 1)-subsets of [n] and let S = fs 1 ; S 2 ; : : : ; S m g, so that V = V S. If S 2 P (n; k) then '(S) = V. If not then Lemma 3.3 applies and produces a sequence of antichains S S 1 S 2 with V = V S1 = V S2 =. Since this procedure reduces m at each step, it terminates. The last antichain T in the sequence is in P (n; k) and satises '(T ) = V. Next we show that ' is injective. Suppose on the contrary that '(S) = '(T ) for two distinct families S; T 2 P (n; k). We may assume that T S is invalid. By Lemma 3.5 there exists a (k + 1)-set R contained in some subset in T but not contained in any S 2 S. Since R 2 V S, we can choose a minimal family F S of (k + 1)-subsets such that f F : F 2 Fg is independent and R lies in its span. Theorem 3.1 and the minimality of F imply that [! ( F ) [ R < jfj + 1:
6 6 CHRISTOS A. ATHANASIADIS On the other hand ( [ F ) jfj; S by independence of the F. Hence R [ F F and 2F ( F ) = jfj: Let E be the subfamily consisting of the subsets E 2 S which contain some S F 2 F and E 0 be the family obtained from E by intersecting all sets in E with F F, so 2F that F E 0. We have [ [ X X (3) ( E 0 ) = ( F ) = (F ) (E 0 ); E 0 2E 0 E 02E 0 where the inequality follows from Lemma 3.4. It follows that (4) ( [ E2E E) X E2E (E); since adding elements to each E 0 preserves the inequality (3). By the choice of R, E has cardinality at least 2. Hence (4) contradicts the fact that S 2 P (n; k). Finally we show that the inverse of ' is order preserving. Let S; T 2 P (n; k) be such that '(S) = V S V T = '(T ). Choose a basis f S : S 2 S 0 g for V S and complete it to a basis f S : S 2 T 0 g of V T, where S 0 T 0 are families of (k + 1)- subsets of [n]. Apply Lemma 3.3 successively to S 0 to nd an S 1 2 P (n; k) with S 0 S 1 and '(S 1 ) = V S = '(S). Then apply the same lemma to S 1 [ (T 0? S 0 ) to nd a T 1 2 P (n; k) with S 1 T 1 and '(T 1 ) = V T = '(T ). By injectivity of ' we get S = S 1 and T = T 1 so S T, as desired. The following is a corollary of Theorem 3.2 and the fact that the operation S 7! S 0 of Lemma 3.3 preserves the quantity P S2S (S). Corollary 3.6. The poset P (n; k) is a geometric lattice with rank function r(s) = X S2S (S): Acknowledgement. I wish to thank Margaret Bayer, Henry Crapo, Victor Reiner, Gian-Carlo Rota and Neil White for helpful discussions and useful references.
7 THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT 7 References [1] M. Bayer and K.A. Brandt, Discriminantal arrangements, ber polytopes and formality, J. Alg. Combin. 6 (1997), 229{246. [2] L.J. Billera and B. Sturmfels, Fiber polytopes, Annals of Math. 135 (1992), 527{549. [3] T. Brylawski, Constructions, Chapter 7 in: \Theory of Matroids" (N. White ed.), pp. 127{ 223, Encyclopedia of Mathematics, Vol. 26, Cambridge University Press, [4] H. Crapo, Concurrence geometries, Advances in Math. 54 (1984), 278{301. [5] H. Crapo, The combinatorial theory of structures, in: \Matroid theory" (A. Recski and L. Lovasz eds.), Colloq. Math. Soc. Janos Bolyai Vol. 40, pp. 107{213, North-Holland, Amsterdam-New York, [6] H. Crapo and G.-C. Rota, On the Foundations of Combinatorial Theory: Combinatorial Geometries, preliminary edition, M.I.T. press, Cambridge, MA, [7] H. Crapo and G.-C. Rota, The resolving bracket, in: \Invariant methods in discrete and computational geometry" (N. White ed.), pp. 197{222, Kluwer Academic Publishers, Dordrecht, [8] P.H. Edelman, Ordering points by linear functionals, Preprint dated March 11, [9] M. Falk, A note on discriminantal arrangements, Proc. Amer. Math. Soc. 122 (1994), 1221{ [10] J.P.S. Kung and H.Q. Nguyen, Weak maps, Chapter 9 in: \Theory of Matroids" (N. White ed.), pp. 254{271, Encyclopedia of Mathematics, Vol. 26, Cambridge University Press, [11] Y.I. Manin and V.V. Schechtman, Arrangements of hyperplanes, higher braid groups and higher Bruhat orders, in: \Algebraic Number Theory { in honor of K. Iwasawa", pp. 289{308, Advanced Studies in Pure Math. Vol. 17, [12] J.H. Mason, Matroids as the study of geometrical congurations, in \Higher combinatorics" (M. Aigner ed.), pp. 133{76, Reidel, Dordrecht{Boston, MA, [13] P. Orlik and H. Terao, Arrangements of Hyperplanes, Grundlehren 300, Springer-Verlag, New York, NY, Christos A. Athanasiadis, Department of Mathematics, University of Pennsylvania, 209 South 33rd Street, Philadelphia, PA , USA address: athana@math.upenn.edu
Hodge theory for combinatorial geometries
Hodge theory for combinatorial geometries June Huh with Karim Adiprasito and Eric Katz June Huh 1 / 48 Three fundamental ideas: June Huh 2 / 48 Three fundamental ideas: The idea of Bernd Sturmfels that
More informationH A A}. ) < k, then there are constants c t such that c t α t = 0. j=1 H i j
M ath. Res. Lett. 16 (2009), no. 1, 171 182 c International Press 2009 THE ORLIK-TERAO ALGEBRA AND 2-FORMALITY Hal Schenck and Ştefan O. Tohǎneanu Abstract. The Orlik-Solomon algebra is the cohomology
More informationPARKING FUNCTIONS. Richard P. Stanley Department of Mathematics M.I.T Cambridge, MA
PARKING FUNCTIONS Richard P. Stanley Department of Mathematics M.I.T. -75 Cambridge, MA 09 rstan@math.mit.edu http://www-math.mit.edu/~rstan Transparencies available at: http://www-math.mit.edu/~rstan/trans.html
More informationThe Gaussian coefficient revisited
The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationOrlik-Solomon Algebras and Tutte Polynomials
Journal of Algebraic Combinatorics 10 (1999), 189 199 c 1999 Kluwer Academic Publishers. Manufactured in The Netherlands. Orlik-Solomon Algebras and Tutte Polynomials CARRIE J. ESCHENBRENNER Independent
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationalgebras Sergey Yuzvinsky Department of Mathematics, University of Oregon, Eugene, OR USA August 13, 1996
Cohomology of the Brieskorn-Orlik-Solomon algebras Sergey Yuzvinsky Department of Mathematics, University of Oregon, Eugene, OR 97403 USA August 13, 1996 1 Introduction Let V be an ane space of dimension
More informationThe Erdős-Moser Conjecture
The Erdős-Moser Conjecture An Application of Linear Algebra to Combinatorics Richard P. Stanley M.I.T. The function f(s, α) Let S R, #S
More informationGeneric section of a hyperplane arrangement and twisted Hurewicz maps
arxiv:math/0605643v2 [math.gt] 26 Oct 2007 Generic section of a hyperplane arrangement and twisted Hurewicz maps Masahiko Yoshinaga Department of Mathematice, Graduate School of Science, Kobe University,
More informationAnnihilators of Orlik Solomon Relations
Advances in Applied Mathematics 28, 231 249 (2002) doi:10.1006/aama.2001.0779, available online at http://www.idealibrary.com on Annihilators of Orlik Solomon Relations Graham Denham 1 and Sergey Yuzvinsky
More informationINITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F
INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal
More informationarxiv:math/ v1 [math.co] 3 Sep 2000
arxiv:math/0009026v1 [math.co] 3 Sep 2000 Max Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department San Francisco State University San Francisco, CA 94132 sergei@sfsu.edu
More informationShellability of Interval Orders
Shellability of Interval Orders Louis J. Billera and Amy N. Myers September 15, 2006 Abstract An finite interval order is a partially ordered set whose elements are in correspondence with a finite set
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More information1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5
J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix
More informationA Generalization of Rota s NBC Theorem
A Generalization of Rota s NBC Theorem Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 48824-1027 April 9, 2003 Key Words: broken circuit, characteristic polynomial,
More informationTUTTE POLYNOMIALS OF q-cones
TUTTE POLYNOMIALS OF q-cones JOSEPH E. BONIN AND HONGXUN QIN ABSTRACT. We derive a formula for the Tutte polynomial t(g ; x, y) of a q-cone G of a GF (q)-representable geometry G in terms of t(g; x, y).
More informationAn Introduction to Transversal Matroids
An Introduction to Transversal Matroids Joseph E Bonin The George Washington University These slides and an accompanying expository paper (in essence, notes for this talk, and more) are available at http://homegwuedu/
More informationZaslavsky s Theorem. As presented by Eric Samansky May 11, 2002
Zaslavsky s Theorem As presented by Eric Samansky May, 2002 Abstract This paper is a retelling of the proof of Zaslavsky s Theorem. For any arrangement of hyperplanes, there is a corresponding semi-lattice
More informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationExtremal Cases of the Ahlswede-Cai Inequality. A. J. Radclie and Zs. Szaniszlo. University of Nebraska-Lincoln. Department of Mathematics
Extremal Cases of the Ahlswede-Cai Inequality A J Radclie and Zs Szaniszlo University of Nebraska{Lincoln Department of Mathematics 810 Oldfather Hall University of Nebraska-Lincoln Lincoln, NE 68588 1
More informationCanonical systems of basic invariants for unitary reflection groups
Canonical systems of basic invariants for unitary reflection groups Norihiro Nakashima, Hiroaki Terao and Shuhei Tsujie Abstract It has been known that there exists a canonical system for every finite
More informationHADAMARD DETERMINANTS, MÖBIUS FUNCTIONS, AND THE CHROMATIC NUMBER OF A GRAPH
HADAMARD DETERMINANTS, MÖBIUS FUNCTIONS, AND THE CHROMATIC NUMBER OF A GRAPH BY HERBERT S. WILF 1 Communicated by Gian-Carlo Rota, April 5, 1968 The three subjects of the title are bound together by an
More informationSHELLABILITY AND HIGHER COHEN-MACAULAY CONNECTIVITY OF GENERALIZED CLUSTER COMPLEXES
ISRAEL JOURNAL OF MATHEMATICS 167 (2008), 177 191 DOI: 10.1007/s11856-008-1046-6 SHELLABILITY AND HIGHER COHEN-MACAULAY CONNECTIVITY OF GENERALIZED CLUSTER COMPLEXES BY Christos A. Athanasiadis Department
More informationAngewandte Mathematik und. Informatik. Universitat zu Koln. Oriented Matroids from Wild Spheres. W. Hochstattler
Angewandte Mathematik und Informatik Universitat zu Koln Report No. 95.200 Oriented Matroids from Wild Spheres by W. Hochstattler 1995 W. Hochstattler Universitat zu Koln Weyertal 86-90 D{50931 Koln Germany
More informationAsymptotics of generating the symmetric and alternating groups
Asymptotics of generating the symmetric and alternating groups John D. Dixon School of Mathematics and Statistics Carleton University, Ottawa, Ontario K2G 0E2 Canada jdixon@math.carleton.ca October 20,
More informationarxiv:math/ v1 [math.co] 2 Jan 2004
arxiv:math/0401006v1 [math.co] 2 Jan 2004 GEOMETRICALLY CONSTRUCTED BASES FOR HOMOLOGY OF PARTITION LATTICES OF TYPES A, B AND D ANDERS BJÖRNER1 AND MICHELLE WACHS 2 Dedicated to Richard Stanley on the
More informationFinite homogeneous and lattice ordered effect algebras
Finite homogeneous and lattice ordered effect algebras Gejza Jenča Department of Mathematics Faculty of Electrical Engineering and Information Technology Slovak Technical University Ilkovičova 3 812 19
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationSemimatroids and their Tutte polynomials
Semimatroids and their Tutte polynomials Federico Ardila Abstract We define and study semimatroids, a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We
More informationTUTTE POLYNOMIALS OF GENERALIZED PARALLEL CONNECTIONS
TUTTE POLYNOMIALS OF GENERALIZED PARALLEL CONNECTIONS JOSEPH E. BONIN AND ANNA DE MIER ABSTRACT. We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections
More information16 Chapter 3. Separation Properties, Principal Pivot Transforms, Classes... for all j 2 J is said to be a subcomplementary vector of variables for (3.
Chapter 3 SEPARATION PROPERTIES, PRINCIPAL PIVOT TRANSFORMS, CLASSES OF MATRICES In this chapter we present the basic mathematical results on the LCP. Many of these results are used in later chapters to
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationTHE BUCHBERGER RESOLUTION ANDA OLTEANU AND VOLKMAR WELKER
THE BUCHBERGER RESOLUTION ANDA OLTEANU AND VOLKMAR WELKER arxiv:1409.2041v2 [math.ac] 11 Sep 2014 Abstract. We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in
More informationThe symmetric group action on rank-selected posets of injective words
The symmetric group action on rank-selected posets of injective words Christos A. Athanasiadis Department of Mathematics University of Athens Athens 15784, Hellas (Greece) caath@math.uoa.gr October 28,
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationAbstract. We show that a proper coloring of the diagram of an interval order I may require 1 +
Colorings of Diagrams of Interval Orders and -Sequences of Sets STEFAN FELSNER 1 and WILLIAM T. TROTTER 1 Fachbereich Mathemati, TU-Berlin, Strae des 17. Juni 135, 1000 Berlin 1, Germany, partially supported
More informationRigid monomial ideals
Rigid monomial ideals Timothy B.P. Clark and Sonja Mapes February 10, 011 Abstract In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 11
18.312: Algebraic Combinatorics Lionel Levine Lecture date: March 15, 2011 Lecture 11 Notes by: Ben Bond Today: Mobius Algebras, µ( n ). Test: The average was 17. If you got < 15, you have the option to
More informationEuler characteristic of the truncated order complex of generalized noncrossing partitions
Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong and C. Krattenthaler Department of Mathematics, University of Miami, Coral Gables, Florida 33146,
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationOn Linear Subspace Codes Closed under Intersection
On Linear Subspace Codes Closed under Intersection Pranab Basu Navin Kashyap Abstract Subspace codes are subsets of the projective space P q(n), which is the set of all subspaces of the vector space F
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationDepth of some square free monomial ideals
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 1, 2013, 117 124 Depth of some square free monomial ideals by Dorin Popescu and Andrei Zarojanu Dedicated to the memory of Nicolae Popescu (1937-2010)
More informationPRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM
PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM ALEX FINK 1. Introduction and background Consider the discrete conditional independence model M given by {X 1 X 2 X 3, X 1 X 3 X 2 }. The intersection axiom
More informationOn the Homological Dimension of Lattices
On the Homological Dimension of Lattices Roy Meshulam August, 008 Abstract Let L be a finite lattice and let L = L {ˆ0, ˆ1}. It is shown that if the order complex L satisfies H k L 0 then L k. Equality
More informationHOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID?
HOW IS A CHORDAL GRAPH LIKE A SUPERSOLVABLE BINARY MATROID? RAUL CORDOVIL, DAVID FORGE AND SULAMITA KLEIN To the memory of Claude Berge Abstract. Let G be a finite simple graph. From the pioneering work
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationSystems of Linear Equations
LECTURE 6 Systems of Linear Equations You may recall that in Math 303, matrices were first introduced as a means of encapsulating the essential data underlying a system of linear equations; that is to
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationCoins with arbitrary weights. Abstract. Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to
Coins with arbitrary weights Noga Alon Dmitry N. Kozlov y Abstract Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the
More informationIMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationLIMITING CASES OF BOARDMAN S FIVE HALVES THEOREM
Proceedings of the Edinburgh Mathematical Society Submitted Paper Paper 14 June 2011 LIMITING CASES OF BOARDMAN S FIVE HALVES THEOREM MICHAEL C. CRABB AND PEDRO L. Q. PERGHER Institute of Mathematics,
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
More informationPure O-Sequences and Matroid h-vectors
Pure O-Sequences and Matroid h-vectors The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Ha, Huy Tai, Erik Stokes, and Fabrizio
More information2-Distance Problems. Combinatorics, 2016 Fall, USTC Week 16, Dec 20&22. Theorem 1. (Frankl-Wilson, 1981) If F is an L-intersecting family in 2 [n],
Combinatorics, 206 Fall, USTC Week 6, Dec 20&22 2-Distance Problems Theorem (Frankl-Wilson, 98 If F is an L-intersecting family in 2 [n], then F L k=0 ( n k Proof Let F = {A, A 2,, A m } where A A 2 A
More informationDISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS
DISTRIBUTIVE LATTICES ON GRAPH ORIENTATIONS KOLJA B. KNAUER ABSTRACT. Propp gave a construction method for distributive lattices on a class of orientations of a graph called c-orientations. Given a distributive
More informationOn an algebra related to orbit-counting. Peter J. Cameron. Queen Mary and Westeld College. London E1 4NS U.K. Abstract
On an algebra related to orbit-counting Peter J. Cameron School of Mathematical Sciences Queen Mary and Westeld College London E1 4NS U.K. Abstract With any permutation group G on an innite set is associated
More informationStructural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.
I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann
More informationSTABLY FREE MODULES KEITH CONRAD
STABLY FREE MODULES KEITH CONRAD 1. Introduction Let R be a commutative ring. When an R-module has a particular module-theoretic property after direct summing it with a finite free module, it is said to
More informationOrdering Events in Minkowski Space
Ordering Events in Minkowski Space Richard P. Stanley 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 e-mail: rstan@math.mit.edu version of 26 May 2005 Abstract Let
More informationLECTURE 3 Matroids and geometric lattices
LECTURE 3 Matroids and geometric lattices 3.1. Matroids A matroid is an abstraction of a set of vectors in a vector space (for us, the normals to the hyperplanes in an arrangement). Many basic facts about
More informationK-theoretic analog of Postnikov Shapiro algebra distinguishes graphs
Journal of Combinatorial Theory, Series A 148 (2017) 316 332 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series A www.elsevier.com/locate/jcta K-theoretic analog of Postnikov
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationA Generalization of Semimodular Supersolvable Lattices
A Generalization of Semimodular Supersolvable Lattices Curtis Bennett Department of Mathematics and Statistics Bowling Green State University Bowling Green, OH 43403 Bruce E. Sagan Department of Mathematics
More informationarxiv: v2 [math.co] 10 Sep 2010
THE SHI ARRANGEMENT AND THE ISH ARRANGEMENT arxiv:1009.1655v2 [math.co] 10 Sep 2010 DREW ARMSTRONG AND BRENDON RHOADES Abstract. This paper is about two arrangements of hyperplanes. The first the Shi arrangement
More informationarxiv: v2 [math.co] 3 Jan 2019
IS THE SYMMETRIC GROUP SPERNER? arxiv:90.0097v2 [math.co] 3 Jan 209 LARRY H. HARPER AND GENE B. KIM Abstract. An antichain A in a poset P is a subset of P in which no two elements are comparable. Sperner
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #17 11/05/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #17 11/05/2013 Throughout this lecture k denotes an algebraically closed field. 17.1 Tangent spaces and hypersurfaces For any polynomial f k[x
More informationProjective Schemes with Degenerate General Hyperplane Section II
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 44 (2003), No. 1, 111-126. Projective Schemes with Degenerate General Hyperplane Section II E. Ballico N. Chiarli S. Greco
More informationLECTURE 6 Separating Hyperplanes (preliminary version)
88 R. STANLEY, HYPERPLANE ARRANGEMENTS LECTURE 6 Separating Hyperplanes (preliminary version) Note. This is a preliminary version of Lecture 6. Section 6.5 in particular is unfinished. (See the proof of
More informationON CONTRACTING HYPERPLANE ELEMENTS FROM A 3-CONNECTED MATROID
ON CONTRACTING HYPERPLANE ELEMENTS FROM A 3-CONNECTED MATROID RHIANNON HALL Abstract. Let K 3,n, n 3, be the simple graph obtained from K 3,n by adding three edges to a vertex part of size three. We prove
More informationLinear independence, a unifying approach to shadow theorems
Linear independence, a unifying approach to shadow theorems by Peter Frankl, Rényi Institute, Budapest, Hungary Abstract The intersection shadow theorem of Katona is an important tool in extremal set theory.
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationMAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS
MAXIMAL PERIODS OF (EHRHART QUASI-POLYNOMIALS MATTHIAS BECK, STEVEN V. SAM, AND KEVIN M. WOODS Abstract. A quasi-polynomial is a function defined of the form q(k = c d (k k d + c d 1 (k k d 1 + + c 0(k,
More informationLINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday
LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field
More informationALGEBRAIC GEOMETRY I - FINAL PROJECT
ALGEBRAIC GEOMETRY I - FINAL PROJECT ADAM KAYE Abstract This paper begins with a description of the Schubert varieties of a Grassmannian variety Gr(k, n) over C Following the technique of Ryan [3] for
More informationCOMMUTATIVE/NONCOMMUTATIVE RANK OF LINEAR MATRICES AND SUBSPACES OF MATRICES OF LOW RANK
Séminaire Lotharingien de Combinatoire 52 (2004), Article B52f COMMUTATIVE/NONCOMMUTATIVE RANK OF LINEAR MATRICES AND SUBSPACES OF MATRICES OF LOW RANK MARC FORTIN AND CHRISTOPHE REUTENAUER Dédié à notre
More informationELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS
ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS J. WARNER SUMMARY OF A PAPER BY J. CARLSON, E. FRIEDLANDER, AND J. PEVTSOVA, AND FURTHER OBSERVATIONS 1. The Nullcone and Restricted Nullcone We will need
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More information2: LINEAR TRANSFORMATIONS AND MATRICES
2: LINEAR TRANSFORMATIONS AND MATRICES STEVEN HEILMAN Contents 1. Review 1 2. Linear Transformations 1 3. Null spaces, range, coordinate bases 2 4. Linear Transformations and Bases 4 5. Matrix Representation,
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationTOPOLOGICAL REPRESENTATIONS OF MATROIDS
JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0894-0347(XX)0000-0 TOPOLOGICAL REPRESENTATIONS OF MATROIDS E. SWARTZ 1. Introduction One of the foundations of oriented
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationOn the Length of a Partial Independent Transversal in a Matroidal Latin Square
On the Length of a Partial Independent Transversal in a Matroidal Latin Square Daniel Kotlar Department of Computer Science Tel-Hai College Upper Galilee 12210, Israel dannykot@telhai.ac.il Ran Ziv Department
More informationCounting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL
Counting and Constructing Minimal Spanning Trees Perrin Wright Department of Mathematics Florida State University Tallahassee, FL 32306-3027 Abstract. We revisit the minimal spanning tree problem in order
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
More informationQuantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for en
Quantum logics with given centres and variable state spaces Mirko Navara 1, Pavel Ptak 2 Abstract We ask which logics with a given centre allow for enlargements with an arbitrary state space. We show in
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationFormal power series rings, inverse limits, and I-adic completions of rings
Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely
More informationarxiv: v1 [math.co] 3 Aug 2009
GRAPHS WHOSE FLOW POLYNOMIALS HAVE ONLY INTEGRAL ROOTS arxiv:0908.0181v1 [math.co] 3 Aug 009 JOSEPH P.S. KUNG AND GORDON F. ROYLE Abstract. We show if the flow polynomial of a bridgeless graph G has only
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR. 1. Introduction
ON LINEAR CODES WHOSE WEIGHTS AND LENGTH HAVE A COMMON DIVISOR SIMEON BALL, AART BLOKHUIS, ANDRÁS GÁCS, PETER SZIKLAI, AND ZSUZSA WEINER Abstract. In this paper we prove that a set of points (in a projective
More information