n 2 R. SHAW Department of Mathematics, University of Hull, Hull HU6 7RX, United Kingdom 19 August 2005
|
|
- Erick Harvey
- 6 years ago
- Views:
Transcription
1 The Grassmannian G 1;n; has polynomial degree 1 n R. SHAW r.shaw@hull.ac.uk Department of Mathematics, University of Hull, Hull HU6 7RX, United Kingdom 19 August 005 Abstract The Grassmannian G 1;n; of lines of PG(n; ); which is a subset of the points of the projective space PG(N; ); N = n+1 1; is proved to have polynomial degree n 1: 1 Introduction and background The notation and terminology will be the same as in the earlier papers [5] and [6]. In particular, for V n+1 = V (n + 1; ); we deal with the bivector space ^V n+1 ; of dimension n+1 ; with the associated projective space P(^ V n+1 ) = PG(N; ), where N := N n = n+1 1; and with the Grassmannian G 1;n; S := PG (0) (N; ): The natural action of A GL(n + 1; ) upon V N+1 := ^V n+1 is by T A = ^A : a ^ b 7! Aa ^ Ab. Now, for n > 3; the subgroup G(G 1;n; ) of GL(N + 1; ) which stabilizes G 1;n; is the isomorphic image under T of GL(n + 1; ). Consequently the space F (S) of functions S! GF() will be viewed as a GL(n+1; )-space under the action L de ned by (L A f)(x) = f(t 1 A x); A GL(n + 1; ); x S: (1.1) In the following we write N n = n + d n where d n := N n n = n 1: Note therefore, see [5, Theorem 1.5], that F dn = C n ; F n = C dn : (1.) We denote by Q 1;n; F (S) the characteristic function ((G 1;n; ) c ) of the complement (within the set S) of G 1;n; : So the Grassmannian has equation Q 1;n; (x) = 0: The reduced degree of the polynomial function Q 1;n; is termed the polynomial degree of G 1;n; : Much of the material in [5] was concerned with amassing evidence in support of the following conjecture. 1
2 Conjecture A. For all n 3 the Grassmannian G 1;n; has polynomial degree d n = n 1: That is Q 1;n; F dn F dn 1; equivalently, by equation (1.), Q 1;n; C n C n+1 : This conjecture is just the q = special case of a G 1;n;q conjecture in [1]. In the present paper we will settle conjecture A in the a rmative by proving the theorem: Theorem 1.1 For all n 3 the Grassmannian G 1;n; has polynomial degree d n = n 1: That is Q 1;n; F dn F dn 1 (= C n C n+1 ): See section.5 for a brief description of the origins of the present paper. 1.1 Background results Of relevance to the task of proving Theorem 1.1 are the following results from [5]. Concerning R.1, a choice of basis fe 1 ; e ; :::; e n+1 g for V n+1 gives rise to a product basis fe i ^ e j g 1i<jn+1 for V N+1 = ^V n+1 ; and hence to a simplex of reference for PG(N; ): R.1. Denote by F s the set consisting of those functions (X c ) for which X is a face of the simplex of reference of (projective) dimension N s: Then, for 1 r N; F 1 [ F [ ::: [ F r (1.3) is a basis for C N r (and hence is a basis for F r ): R.. Q 1;n; F dn if and only if jx \ G 1;n; j is odd for each d n - at X in PG(N; ): R.3. Q 1;n; F dn if and only if jx \ G 1;n; j is odd for each simplicial at of (projective) dimension d n : R.4. Suppose that there exists a family of d n - ats of PG(N; ) such that (i) f(x c )g X = C dn, and (ii) each X meets G 1;n; in an odd number of points: Then G 1;n; has polynomial degree d n : Commentary. For R.1 see the Simplex Basis Theorem of [5, Theorem 1.8]. (See also [5, Section 1..(iv)].) For R. see [3] or [5, Theorem 1.7]. The result R.3 follows from R.1, R.; cf. [5, C.5 of Theorem.1]. For R.4 see [5, P.3 of Theorem 3.4]. 1. Using simple graphs on n + 1 vertices As in [5] and [6] it helps to make use of certain (simple) graphs = (V n ; E) having vertex set V n := f1; ; ::: ; n+1g and edge set E: Along with we also need its complement = (V n ; E): Using a product basis fe i ^ e j g 1i<jn+1 for V N+1 = ^V n+1 ; a point x = 1i<jn+1 x ij e i ^ e j S has coordinates (x ij ) 1i<jn+1 : To each edge E = ij := fi; jg E of a (simple) graph = (V n ; E) let us associate
3 (i) the coordinate x E := x ij (= x ji ); and hence the hyperplane x E = 0; (ii) the basis element e E := e i ^ e j for V N+1 : Given a graph = (V n ; E) let X E denote the at having coordinate equations x E = 0; each E E; and set Y (E) := hfe E g EE i: Then x Y ( E) if and only if x = P EE x Ee E, that is if and only if x E = 0; for each E E: Hence X E = Y ( E): To each graph = (V n ; E) of size jej = r we will also associate the monomial function m E := EE x E of degree r: One basis for F r is 1 [ [ ::: [ r ; where s = fm E g jej=s ; (1.4) and, setting E := ((X E ) c ); another is the simplex basis F 1 [ F [ ::: [ F r ; where F s = f E g jej=s : (1.5) Often we will be dealing with edge sets E n of size je n j = n; observe that in this case je n j = n+1 n = d n + 1; and so each Y (E n ) = X En is a d n - at. Proof of Theorem 1.1 Our proof of Theorem 1.1 will appeal to R.4 of section 1.1; accordingly it will have the following two stages. Stage 1: we nd a GL(n + 1; )-orbit n of d n - ats of PG(N; ) such that the functions (X c ); X n ; span the whole of F n = C dn : Stage : we show that a at X n meets G 1n; in an odd number of points. In e ecting stage 1 of the proof it helps to consider the transforms L A m E of the monomials m E by various elements A of GL(n + 1; ); see eq. (1.1). In particular suppose that we restrict A to belong to the subgroup G 0 = Sym(n + 1) of GL(n + 1; ) which e ects all permutations of the basis fe 1 ; e ; :::; e n+1 g for V n+1. Then each of the sets r is stable under such L A, and so decomposes into G 0 -orbits, one for each isomorphism class of graphs (V n ; E) of size r:.1 Using transvections Also, for distinct elements a; b V n = f1; ; ::: ; n + 1g the transvection J(a; b) GL(n + 1; ) with e ect J(a; b)e i = e i ; i 6= b; and J(a; b)e b = e a + e b (.1) will be of use. For convenience, put T (a; b) := T J(a;b) and L(a; b) := L J(a;b). Note that if x ^V n+1 then x 0 = T (a; b)x reads in terms of coordinates x 0 ij = x ij ; if i 6= a; j 6= a; and also if ij = ab; x 0 aj = x aj + x bj ; if j 6= b: (.) 3
4 For future use let us note two consequences of this last coordinate transformation. First observe that for some monomials m E of degree r some of the linear combination m E + L(a; b)m E will be of degree r 1: For example, since (x 3 ) = x 3 ; we have x 13 x 3 + L(1; )(x 13 x 3 ) = x 3 : (.3) Secondly consider the monomial m Pn where P n denotes the path P n = f1; 3; 34; ::: n n + 1g (.4) of length jp n j = n: (Caution: in the literature a path of length n is sometimes denoted P n+1 :) It follows from (.) that if Pn 0 1 denotes the path of length n 1 which is obtained from P n by replacing the two edges fi 1; ig and fi; i + 1g by the new edge fi 1; i + 1g then m Pn + L(i; i + 1)m Pn = m En ; where E n = P 0 n 1 [ fi; i + 1g: (.5) By making use of the degree-lowering property of transvections exempli- ed by (.3) one may demonstrate the following: if along with the particular set n of monomials m E of degree n we consider also their transforms L A m E under elements A of GL(n + 1; ) then the resulting set S n of elements of F n generates the whole of F n : Lemma.1 Setting S n := fl A ( n )g AGL(n+1;) = fl A m E g AGL(n+1;);jEj=n ; then S n = F n : Proof. From the basis (1.4) for F n ; the lemma follows once we show that each of the monomials m E 0 of degree je 0 j < n lies in S n : Consider a monomial m E 0 of degree je 0 j = n 1: We need to consider two possibilities for its associated graph (V n ; E 0 ) : (i) there exists a vertex of valency 0; (ii) each of the n + 1 vertices has valency 1: Suppose (i) holds. Then (up to graph isomorphisms) we may suppose that E 0 contains no edge 1i; but does contain the edge 3: Setting E = f13g [ E 0 ; it follows, cf. equation (.3), that m E + L(1; )m E = m E 0: Suppose (ii) holds. In which case there exists a vertex of valency 1 (indeed there exist at least 4 such vertices). So (up to graph isomorphisms) we may suppose that E 0 contains the edge 13; but that 1i = E 0 ; i 6= 3; and also 3 = E 0 : Setting E = f3g [ E 0 ; it follows, cf. equation (.3), that m E + L(1; )m E = m E 0: So we have shown that each monomial m E 0 of degree je 0 j = n 1 lie in S n : From this last, it follows by a similar argument that each monomial m E 0 of degree n lie in S n ; and similarly for the monomials m E 0 of degrees n 3; n 4; :::. 4
5 Remark. The monomial function m E = EE x E depends of course upon our choice of coordinates x E = x ij for V N+1 via our choice of basis B n = fe 1 ; e ; :::; e n+1 g for V n+1 In the following it will help at times to make explicit this dependence upon B n by adopting the fuller notation m E (B n ): If for A GL(n + 1) we write A B n := fae 1 ; Ae ; :::; Ae n+1 g then observe that L A (m E (B n )) = m E ( A B n ): (.6). Stage 1 of the proof We aim to show that stages 1 and can be accomplished by choosing n to be the GL(n + 1; )-orbit of the d n - at X Pn : Lemma.3 (i) The GL(n + 1; )-orbit (X Pn ) of (X c P n ) spans F n : (ii) The GL(n + 1; )-orbit (m Pn ) of the monomial m Pn spans F n : Proof. For the d n - at X En = Y ( E n ) we have, see for example [6, Eq. (.4ii)], (X c E n ) = m En + (terms of degree < n): Consequently the two parts of the lemma are equivalent, and so it su ces to prove part (ii), namely that the orbit (m Pn ) of the particular path monomial m Pn = x 1 x 3 :::x n n+1 ; (.7) of degree n; spans the whole of F n : By Lemma.1 this will follow provided we can show that m En lies in (m Pn ) for a representative E n of each isomorphism class of graph (V n ; E n ) of size je n j = n: We proceed by induction upon n; adopting H n as inductive hypothesis: H n : if je n j = n; then m En (B n ) is a linear combination of path monomials m Pn ( A B n ) for various A GL(n + 1; ): (Recall (.6).) Certainly H holds, since if n = then fx 1 x 3 ; x 13 x 3 ; x 1 x 13 g is a basis for F consisting of path monomials. To show that H n 1 implies H n we consider, for a given m En (B n ); two cases: Case A. There exists a vertex i V n of valency 1. Case B. There exists a vertex i V n of valency 0. The two cases are not mutually exclusive, but together they cover all possibilities for the graph (V n ; E n ); since if case A does not apply then certainly case B does. If case A holds then without loss of generality we may suppose that the vertex n + 1 has valency 1 and is joined to vertex 1; whence m En (B n ) = x 1 n+1 m En 1 (B n 1 ) for some edge set E n 1 of size n 1 which uses the vertex set V n 1 = f1; ; ::: ; ng: By the inductive hypothesis H n 1 the monomial m En 1 (B n 1 ) is a linear combination of path monomials m Pn 1 (Bn 0 1 ) for various bases Bn 0 1 = fe0 1 ; e0 ; :::; e0 ng for V n : Consider one resulting 5
6 term x 1 n+1 m Pn 1 (Bn 0 1 ): Now x 1 n+1 is a linear combination of coordinates x 0 i n+1 with respect to the basis B0 n = Bn 0 1 [ fe n+1g: So, if case A applies, the induction goes through provided we can show that m En lies in (m Pn ) for those edge sets E n just of the kind E n = P n 1 [ fi n + 1g; for some i V n 1 : (.8) That this is so follows from the previous result (.5). If case B holds then without loss of generality we may suppose that the vertex n + 1 has valency 0 and that 1 E n : Consider the edge set En 0 which is obtained from E n by replacing the edge 1 by a new edge f1; n + 1g: Observing that m En = m E 0 n + L(n + 1; )m E 0 n we see that case B reduces to case A since the vertex n + 1 has valency 1 for the edge set En. 0.3 Stage of the proof Lemma.4 The d n - at X Pn meets G 1;n; in an odd number of points. Proof. We adopt the notation and terminology used in [6, Section.3]. So from [6, Lemma.8] we have jx Pn \G 1;n; j = p(p n )+q(p n ); where p(p n ) and q(p n ) are respectively the number of dyads and triads for the graph (V n ; P n ): Setting p n := p(p n ) and q n := q(p n ) the following recurrence relations are easily derived : p n = p n 1 + p n + n 1 1; q n = q n 1 + q n + p n ; (.9) see section.3.1 below. Consequently h n := p n + q n satis es h n = h n 1 + h n + n 1 1; (.10) from which it immediately follows that h n is odd for all n:.3.1 Derivation of the recurrence relations (.9) First take note of the following: (i) each dyad f; g for the graph (V n ; P n ) gives rise to three dyads for (V n ; P n ); namely to f; g; f [ fn + 1g; gg and f; [ fn + 1gg; (ii) dyads for (V n 1 ; P n 1 ) which are not dyads for (V n ; P n ) are of the form f [ fng; g for some dyad f; g for (V n ; P n ); such dyads give rise to two dyads for (V n ; P n ); namely to f[fng; g and f[fn; n+1g; g; (iii) each subset of V n gives rise to the dyad f; fn + 1gg for (V n ; P n ): Since every dyad for (V n ; P n ) arises in one of the mutually exclusive ways (i), (ii), (iii), it follows that p n = 3p n +(p n 1 p n )+ n 1 1; and so we have obtained the rst of the relations (.9): p n = p n 1 + p n + n 1 1: Secondly take note of the following: (i) each triad f; ; g for (V n ; P n ) gives rise to four triads for (V n ; P n ); 6
7 namely to f; ; g; f [ fn + 1g; ; g; f; [ fn + 1g; g and f; ; [ fn + 1gg; (ii) triads for (V n 1 ; P n 1 ) which are not triads for (V n ; P n ) are of the form f [ fng; ; g for some triad f; ; g for (V n ; P n ); such triads give rise to two triads for (V n ; P n ); namely to f[fng; ; g and f[fn; n+ 1g; ; g; (iii) each dyad f; g for the graph (V n ; P n ) gives rise to the triad f; ; fn + 1gg for (V n ; P n ): Since every triad for (V n ; P n ) arises in one of the mutually exclusive ways (i), (ii), (iii), it follows that q n = 4q n + (q n 1 q n ) + p n ; and so we have obtained the second of the relations (.9): q n = q n 1 + q n + p n :.4 Completion of the proof, and a graph theory corollary By R.4 of section 1.1, Theorem 1.1 now follows from Lemmas.3(i) and.4. In [6] conjecture A was translated into an equivalent conjecture in graph theory: see [6, Conjecture.1]. Consequently this graph theory conjecture now becomes a theorem: Theorem.5 If = (V; E) is any nite simple graph such that jej < jvj then p( ) + q( ) is odd. Here p( ) denotes the total number of subgraphs of which are isomorphic to K a;b for some a; b satisfying a b > 0; and q( ) denotes the total number of subgraphs of which are isomorphic to K a;b;c for some a; b; c satisfying a b c > 0:.5 Acknowledgements and history The author thanks Johannes Maks for sending him, in January 004, a copy of the Glynn/Maks/Casse paper [1]. Their paper contained a conjecture about the polynomial degree of the Grassmannian G 1;n;q of lines of PG(n; q): However, for n > 3 and q > no evidence was provided in [1] for the G 1;n;q conjecture. In the binary q = case Glynn, Maks & Casse conjectured that G 1;n; has polynomial degree d n ; but even in this binary case for n > 3 the only evidence given in [1] for the conjecture was the n = 4 result for G 1;4; obtained by Shaw and Gordon in 1994: see [4]. In fact a little more supporting evidence was available, since in 1994 N.A. Gordon obtained by computer the polynomial degree in the further two cases (n; q) = (5; ) and (n; q) = (4; 3): This extra evidence was communicated to Glynn, Maks & Casse in February 004. Provoked by the paucity of supporting evidence for the Glynn/Maks/Casse conjecture, even in the binary case, the present author combined with N.A. Gordon to test the binary conjecture for other values of n: Using some new 7
8 theoretical results, and aided by the computer, we were able to show, in April 004, that the binary conjecture held up also in the cases n = 6 and n = 7: This further evidence for the binary conjecture was eventually included in the paper [5], and a copy of this was sent to Glynn, Maks & Casse in February 005. Towards the end of 004 the author came to the view that in order to prove the binary conjecture, and not merely produce hard-won evidence for it in particular cases, perhaps the best hope was that, for each n; there exists one kind of GL(n + 1; )-orbit n of d n - ats of PG(N; ) such that the functions (X c ); X n ; span the whole of F n = C dn : See [5, Section 4..3]. In a working document of December 004 the author conjectured that the ats X Pn in Lemma.3 were just what were needed. For some low values of n he checked the requisite spanning property by using transvections as in sections.1,., but at this stage failed to do so for general n: However he was able to prove for general n that the d n - ats X Pn had the requisite odd intersection with G 1;n;, as in the above Lemma.4. The proof of this was as above, using the recurrence relations (.9). The author expresses his thanks to N.A. Gordon for carrying out computer checks, in early 005, on the accuracy of the relations (.9). In the spring of 005 the author developed some interesting links with graph theory: see the preprint [6], written prior to the 0th British Combinatorial Conference, Durham (10-15 July, 005). (See Theorem.5 above for one outcome of these links.) In [6, Section.3] it was shown how to compute the intersection numbers jx Pn \ G 1;n; j by simpler combinatorial methods than those employed in [5]. Using these, N.A. Gordon was able to check by computer the binary conjecture in the further case n = 8: Immediately upon returning from Durham the author set about proving for general n his conjecture concerning the d n - ats X Pn ; and he quickly arrived at the proof by induction given above in section.. In early August 005 he sent news of his consequent proof of the binary conjecture to Glynn, Maks & Casse. In return, J.G. Maks replied that they, also in July 005, had been able to prove the binary conjecture, as in their revised document []. An important ingredient of the work in [5] and [6] was frequent appeal to the simplex basis (1.5). The Glynn/Maks/Casse proof also makes crucial use of the simplex basis and, in essence, of result R.3 of section 1.1, see [, Theorem 16, Proof]. Nevertheless the two proofs of the binary conjecture are distinct. Indeed, the Glynn/Maks/Casse proof has two notable virtues: rstly it is of a nicely geometric nature, and secondly it is much shorter than the one in section above. The brevity of their proof arises from their appeal to a certain geometrical lemma, see [, Lemma 15]. With the aid of this lemma they are able to deal with the intersections X E \ G 1;n; for edge sets E of size d n all in the same way, with no need for separate consideration of the di erent isomorphism classes of such edge sets. 8
9 References [1] David G. Glynn, Johannes G. Maks, L.R.A. (Rey) Casse, The polynomial degree of the Grassmannian G(n; 1; q) of lines in nite projective space PG(n; q); preprint (July, 003). [] Revised version of [1], (July, 005) [3] R. Shaw, A characterization of the primals in PG(m; ), Des. Codes Cryptogr. (199), [4] R. Shaw and N.A. Gordon, The lines of PG(4; ) are the points of a quintic in PG(9; ), J. Combin. Theory (A), 68 (1994), [5] R. Shaw and N.A. Gordon, The polynomial degree of the Grassmannian G(1; n; ); to appear in Des. Codes Cryptogr., accessible from: [6] R. Shaw, Grassmann and Segre varieties over GF(): some graph theory links, preprint prior to BCC0, Durham (July 005), accessible from: 9
Abstract. 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 informationHAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent
HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent, Seth Oldham, Kate Sharkey, and Dave Witte Abstract.
More informationMODEL ANSWERS TO HWK #3
MODEL ANSWERS TO HWK #3 1. Suppose that the point p = [v] and that the plane H corresponds to W V. Then a line l containing p, contained in H is spanned by the vector v and a vector w W, so that as a point
More informationV (v i + W i ) (v i + W i ) is path-connected and hence is connected.
Math 396. Connectedness of hyperplane complements Note that the complement of a point in R is disconnected and the complement of a (translated) line in R 2 is disconnected. Quite generally, we claim that
More information1 The Well Ordering Principle, Induction, and Equivalence Relations
1 The Well Ordering Principle, Induction, and Equivalence Relations The set of natural numbers is the set N = f1; 2; 3; : : :g. (Some authors also include the number 0 in the natural numbers, but number
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
More informationTransversal Designs in Classical Planes and Spaces. Aiden A. Bruen and Charles J. Colbourn. Computer Science. University of Vermont
Transversal Designs in Classical Planes and Spaces Aiden A. Bruen and Charles J. Colbourn Computer Science University of Vermont Burlington, VT 05405 U.S.A. Abstract Possible embeddings of transversal
More information21-301, Spring 2019 Homework 5 Solutions
21-301, Spring 2019 Homewor 5 Solutions Michael Anastos Not to be published without written consent of the author or the instructors of the course. (Please contact me if you find any errors!) Problem 1
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationClassi cation of partial spreads in PG(4; 2)
Classi cation of partial spreads in PG(4; 2) Neil A. Gordon a, Ron Shaw b and Leonard H. Soicher c a Department of Computer Science, b Department of Mathematics, University of Hull, Hull HU6 7RX, UK n.a.gordon@hull.ac.uk,
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More informationSets with two associative operations
CEJM 2 (2003) 169{183 Sets with two associative operations Teimuraz Pirashvili A.M. Razmadze Mathematical Inst. Aleksidze str. 1, Tbilisi, 380093, Republic of Georgia Received 7 January 2003; revised 3
More informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More informationMonochromatic and Rainbow Colorings
Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,
More informationBase subsets of polar Grassmannians
Journal of Combinatorial Theory, Series A 114 (2007) 1394 1406 www.elsevier.com/locate/jcta Base subsets of polar Grassmannians Mark Pankov Department of Mathematics and Information Technology, University
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationComputability-Theoretic Properties of Injection Structures
Computability-Theoretic Properties of Injection Structures Douglas Cenzer 1, Valentina Harizanov 2 and Je rey B. Remmel 3 Abstract We study computability-theoretic properties of computable injection structures
More informationSection 33 Finite fields
Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)
More informationA characterization of the finite Veronesean by intersection properties
A characterization of the finite Veronesean by intersection properties J. Schillewaert, J.A. Thas and H. Van Maldeghem AMS subject classification: 51E0, 51A45 Abstract. A combinatorial characterization
More informationCELLULAR HOMOLOGY AND THE CELLULAR BOUNDARY FORMULA. Contents 1. Introduction 1
CELLULAR HOMOLOGY AND THE CELLULAR BOUNDARY FORMULA PAOLO DEGIORGI Abstract. This paper will first go through some core concepts and results in homology, then introduce the concepts of CW complex, subcomplex
More informationBasic Concepts of Group Theory
Chapter 1 Basic Concepts of Group Theory The theory of groups and vector spaces has many important applications in a number of branches of modern theoretical physics. These include the formal theory of
More informationMATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT
MATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT MANOEL LEMOS AND JAMES OXLEY Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp April 28, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct nonempty
More information9 - The Combinatorial Nullstellensatz
9 - The Combinatorial Nullstellensatz Jacques Verstraëte jacques@ucsd.edu Hilbert s nullstellensatz says that if F is an algebraically closed field and f and g 1, g 2,..., g m are polynomials in F[x 1,
More informationNOTES ON POLYNOMIAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
NOTES ON POLYNOMIAL REPRESENTATIONS OF GENERAL LINEAR GROUPS MARK WILDON Contents 1. Definition of polynomial representations 1 2. Weight spaces 3 3. Definition of the Schur functor 7 4. Appendix: some
More informationAdjoint Representations of the Symmetric Group
Adjoint Representations of the Symmetric Group Mahir Bilen Can 1 and Miles Jones 2 1 mahirbilencan@gmail.com 2 mej016@ucsd.edu Abstract We study the restriction to the symmetric group, S n of the adjoint
More information4. Images of Varieties Given a morphism f : X Y of quasi-projective varieties, a basic question might be to ask what is the image of a closed subset
4. Images of Varieties Given a morphism f : X Y of quasi-projective varieties, a basic question might be to ask what is the image of a closed subset Z X. Replacing X by Z we might as well assume that Z
More informationCharacterizations of the finite quadric Veroneseans V 2n
Characterizations of the finite quadric Veroneseans V 2n n J. A. Thas H. Van Maldeghem Abstract We generalize and complete several characterizations of the finite quadric Veroneseans surveyed in [3]. Our
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 informationConnectivity of Cayley Graphs: A Special Family
Connectivity of Cayley Graphs: A Special Family Joy Morris Department of Mathematics and Statistics Trent University Peterborough, Ont. K9J 7B8 January 12, 2004 1 Introduction Taking any finite group G,
More informationThe integers. Chapter 3
Chapter 3 The integers Recall that an abelian group is a set A with a special element 0, and operation + such that x +0=x x + y = y + x x +y + z) =x + y)+z every element x has an inverse x + y =0 We also
More informationON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS
ON SIZE, CIRCUMFERENCE AND CIRCUIT REMOVAL IN 3 CONNECTED MATROIDS MANOEL LEMOS AND JAMES OXLEY Abstract. This paper proves several extremal results for 3-connected matroids. In particular, it is shown
More informationThe concentration of the chromatic number of random graphs
The concentration of the chromatic number of random graphs Noga Alon Michael Krivelevich Abstract We prove that for every constant δ > 0 the chromatic number of the random graph G(n, p) with p = n 1/2
More informationIntegral closure of powers of the graded maximal ideal in a monomial ring
ISSN: 1401-5617 Integral closure of powers of the graded maximal ideal in a monomial ring Vincenzo Micale Research Reports in Mathematics Number 1, 003 Department of Mathematics Stockholm University Electronic
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationTetrads of lines spanning PG(7, 2)
Tetrads of lines spanning PG(7, 2) Ron Shaw, Neil Gordon, Hans Havlicek Abstract Our starting point is a very simple one, namely that of a set L 4 of four mutually skew lines in PG(7, 2). Under the natural
More informationAffine combinations in affine schemes
Affine combinations in affine schemes Anders Kock Introduction The notion of neighbour points in algebraic geometry is a geometric rendering of the notion of nilpotent elements in commutative rings, and
More informationMonomial Hyperovals in Desarguesian Planes
Timothy Vis Timothy.Vis@ucdenver.edu University of Colorado Denver March 29, 2009 Hyperovals Monomial Hyperovals Introduction Classification Definition In a projective plane of even order q, a hyperoval
More informationFibers, Surjective Functions, and Quotient Groups
Fibers, Surjective Functions, and Quotient Groups 11/01/06 Radford Let f : X Y be a function. For a subset Z of X the subset f(z) = {f(z) z Z} of Y is the image of Z under f. For a subset W of Y the subset
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Multiple extensions of generalized hexagons related to the simple groups McL and Co3. Author(s) Cuypers,
More information2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.
Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms
More informationMath 203, Solution Set 4.
Math 203, Solution Set 4. Problem 1. Let V be a finite dimensional vector space and let ω Λ 2 V be such that ω ω = 0. Show that ω = v w for some vectors v, w V. Answer: It is clear that if ω = v w then
More informationAn axiomatic approach in minimum cost spanning tree problems with groups
An axiomatic approach in minimum cost spanning tree problems with groups Gustavo Bergantiños, Research Group in Economic Analysis Universidade de Vigo (Spain). María Gómez-Rúa, Research Group in Economic
More information1 Introduction We adopt the terminology of [1]. Let D be a digraph, consisting of a set V (D) of vertices and a set E(D) V (D) V (D) of edges. For a n
HIGHLY ARC-TRANSITIVE DIGRAPHS WITH NO HOMOMORPHISM ONTO Z Aleksander Malnic 1 Dragan Marusic 1 IMFM, Oddelek za matematiko IMFM, Oddelek za matematiko Univerza v Ljubljani Univerza v Ljubljani Jadranska
More informationNetwork Augmentation and the Multigraph Conjecture
Network Augmentation and the Multigraph Conjecture Nathan Kahl Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 e-mail: nkahl@stevens-tech.edu Abstract Let Γ(n, m)
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationTHE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION March, 2005
THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION March, 5 Time: 3 1 hours No aids or calculators permitted. It is not necessary to do all the problems. Complete solutions to fewer problems
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationTHE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.
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
More informationClaw-free Graphs. III. Sparse decomposition
Claw-free Graphs. III. Sparse decomposition Maria Chudnovsky 1 and Paul Seymour Princeton University, Princeton NJ 08544 October 14, 003; revised May 8, 004 1 This research was conducted while the author
More informationSelf-complementary circulant graphs
Self-complementary circulant graphs Brian Alspach Joy Morris Department of Mathematics and Statistics Burnaby, British Columbia Canada V5A 1S6 V. Vilfred Department of Mathematics St. Jude s College Thoothoor
More informationPerfect matchings in highly cyclically connected regular graphs
Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová University
More informationk-degenerate Graphs Allan Bickle Date Western Michigan University
k-degenerate Graphs Western Michigan University Date Basics Denition The k-core of a graph G is the maximal induced subgraph H G such that δ (H) k. The core number of a vertex, C (v), is the largest value
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 informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationSUPPLEMENTARY NOTES: CHAPTER 1
SUPPLEMENTARY NOTES: CHAPTER 1 1. Groups A group G is a set with single binary operation which takes two elements a, b G and produces a third, denoted ab and generally called their product. (Mathspeak:
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationOn Ferri s characterization of the finite quadric Veronesean V 4 2
On Ferri s characterization of the finite quadric Veronesean V 4 2 J. A. Thas H. Van Maldeghem Abstract We generalize and complete Ferri s characterization of the finite quadric Veronesean V2 4 by showing
More informationSergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and
NON-PLANAR EXTENSIONS OF SUBDIVISIONS OF PLANAR GRAPHS Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada and Robin Thomas 1 School of Mathematics
More informationarxiv: v2 [cs.dm] 29 Mar 2013
arxiv:1302.6346v2 [cs.dm] 29 Mar 2013 Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks Adrien Richard Laboratoire I3S, CNRS & Université de Nice-Sophia Antipolis, France.
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationOn sets without tangents and exterior sets of a conic
On sets without tangents and exterior sets of a conic Geertrui Van de Voorde Abstract A set without tangents in PG(2, q) is a set of points S such that no line meets S in exactly one point. An exterior
More informationDESCRIPTION OF SIMPLE MODULES FOR SCHUR SUPERALGEBRA S(2j2)
DESCRIPTION OF SIMPLE MODULES FOR SCHUR SUPERALGEBRA S(22) A.N. GRISHKOV AND F. MARKO Abstract. The goal of this paper is to describe explicitly simple modules for Schur superalgebra S(22) over an algebraically
More informationDistinguishing Cartesian powers of graphs
Distinguishing Cartesian powers of graphs Wilfried Imrich Sandi Klavžar Abstract The distinguishing number D(G) of a graph is the least integer d such that there is a d-labeling of the vertices of G that
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationINDECOMPOSABILITY IN INVERSE LIMITS WITH SET-VALUED FUNCTIONS
INDECOMPOSABILITY IN INVERSE LIMITS WITH SET-VALUED FUNCTIONS JAMES P. KELLY AND JONATHAN MEDDAUGH Abstract. In this paper, we develop a sufficient condition for the inverse limit of upper semi-continuous
More informationPermutations and Polynomials Sarah Kitchen February 7, 2006
Permutations and Polynomials Sarah Kitchen February 7, 2006 Suppose you are given the equations x + y + z = a and 1 x + 1 y + 1 z = 1 a, and are asked to prove that one of x,y, and z is equal to a. We
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationComputing a Lower Bound for the Canonical Height on Elliptic Curves over Q
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q John Cremona 1 and Samir Siksek 2 1 School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. In our quest to find a splitter theorem for internally 4-connected binary
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationDefinability in the Enumeration Degrees
Definability in the Enumeration Degrees Theodore A. Slaman W. Hugh Woodin Abstract We prove that every countable relation on the enumeration degrees, E, is uniformly definable from parameters in E. Consequently,
More informationMATROIDS DENSER THAN A PROJECTIVE GEOMETRY
MATROIDS DENSER THAN A PROJECTIVE GEOMETRY PETER NELSON Abstract. The growth-rate function for a minor-closed class M of matroids is the function h where, for each non-negative integer r, h(r) is the maximum
More informationCONSTRAINED PERCOLATION ON Z 2
CONSTRAINED PERCOLATION ON Z 2 ZHONGYANG LI Abstract. We study a constrained percolation process on Z 2, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability
More informationCHOMP ON NUMERICAL SEMIGROUPS
CHOMP ON NUMERICAL SEMIGROUPS IGNACIO GARCÍA-MARCO AND KOLJA KNAUER ABSTRACT. We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies
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 informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
More informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
More informationThree-Bit Monomial Hyperovals
Timothy Vis Timothy.Vis@ucdenver.edu University of Colorado Denver Rocky Mountain Discrete Math Days 2008 Definition of a Hyperoval Definition In a projective plane of order n, a set of n + 1-points, no
More informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More informationRepresentations of Sp(6,R) and SU(3) carried by homogeneous polynomials
Representations of Sp(6,R) and SU(3) carried by homogeneous polynomials Govindan Rangarajan a) Department of Mathematics and Centre for Theoretical Studies, Indian Institute of Science, Bangalore 560 012,
More informationTOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology
TOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology DONALD M. DAVIS Abstract. We use ku-cohomology to determine lower bounds for the topological complexity of mod-2 e lens spaces. In the
More informationIsometry Dimension of Finite Groups
Journal of Algebra 246, 641 646 (2001) doi:10.1006/jabr.2001.8973, available online at http://www.idealibrary.com on Isometry Dimension of Finite Groups Manish M. Patnaik 1 Massachusetts Institute of Technology
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More information(1)(a) V = 2n-dimensional vector space over a field F, (1)(b) B = non-degenerate symplectic form on V.
18.704 Supplementary Notes March 21, 2005 Maximal parabolic subgroups of symplectic groups These notes are intended as an outline for a long presentation to be made early in April. They describe certain
More informationM INIM UM DEGREE AND F-FACTORS IN GRAPHS
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 29 (2000), 33-40 M INIM UM DEGREE AND F-FACTORS IN GRAPHS P. K a t e r in is a n d N. T s ik o p o u l o s (Received June 1998) Abstract. Let G be a graph, a,
More informationarxiv: v2 [math.co] 7 Jan 2016
Global Cycle Properties in Locally Isometric Graphs arxiv:1506.03310v2 [math.co] 7 Jan 2016 Adam Borchert, Skylar Nicol, Ortrud R. Oellermann Department of Mathematics and Statistics University of Winnipeg,
More informationTHE GRIGORCHUK GROUP
THE GRIGORCHUK GROUP KATIE WADDLE Abstract. In this survey we will define the Grigorchuk group and prove some of its properties. We will show that the Grigorchuk group is finitely generated but infinite.
More informationAntipodal Labelings for Cycles
Antipodal Labelings for Cycles Justie Su-Tzu Juan and Daphne Der-Fen Liu Submitted: December 2006; revised: August 2007 Abstract Let G be a graph with diameter d. An antipodal labeling of G is a function
More informationColoring square-free Berge graphs
Coloring square-free Berge graphs Maria Chudnovsky Irene Lo Frédéric Maffray Nicolas Trotignon Kristina Vušković September 30, 2015 Abstract We consider the class of Berge graphs that do not contain a
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
Coloring Vertices and Edges of a Path by Nonempty Subsets of a Set P.N. Balister E. Győri R.H. Schelp November 8, 28 Abstract A graph G is strongly set colorable if V (G) E(G) can be assigned distinct
More informationSTRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS
Discussiones Mathematicae Graph Theory 30 (2010 ) 407 423 STRUCTURE OF THE SET OF ALL MINIMAL TOTAL DOMINATING FUNCTIONS OF SOME CLASSES OF GRAPHS K. Reji Kumar Department of Mathematics N.S.S College,
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
More information