Notes on Freiman s Theorem
|
|
- Maud Cox
- 5 years ago
- Views:
Transcription
1 Notes on Freiman s Theorem Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, jacques@ucsd.edu. 1 Introduction Freiman s Theorem describes the structure of a set A under the condition that A + A has size close to that of A. If P is a generalized arithmetic progression, then P + P is close to P. Freiman s Theorem states the partial converse: if P + P is close to P then P must be contained in a small generalized arithmetic progression. The theorem may be stated as follows, and we will give the remarkable proof of this theorem due to Ruzsa. Theorem 1 Let A Z N be a set such that A + A C A. Then A is contained in a d-dimensional arithmetic progression P of cardinality at most k A where d and k depend on C only. The constants from this theorem can be chosen to be d = C 40C and k = C C40C. 2 Plünnecke s Theorem A layered graph is a directed graph G with vertex set comprising a union of directed paths (v 1, v 2,..., v n ) where v i V i for i [n] and the sets V i, called layers, are pairwise disjoint. A layered graph G is a Plünnecke Graph if for each arc u v and Γ + (v) = {w 1, w 2,..., w k } and Γ (u) = {t 1, t 2,..., t l } there exist vertices u 1, u 2,..., u l and v 1, v 2,..., v k and arcs v i w i for i [k] and arcs t j u j for i [l]. Given two layered graphs G, H with layers V i, W i for i [n], the product graph G H has layers V i W i for i [n] and the arc (v, w) (v, w ) is present if and only if v v E(G) or w w E(G). The reader is invited to check that G H is a Plünnecke Graph if G and H are. For i [n] and Z V 0 let Γ i (Z) be the ith neighborhood of Z, namely the set of vertices in V i joined 1
2 from Z by a directed path. The ith magnification ratio D i (G) of a layered graph G with layers V i : i [n] is The first lemma is { Γi (Z) min Z } : Z V 1, Z Lemma 1 Let G, H be layered graphs. Then D i (G H) = D i (G)D i (H). Proof. It is straightforward to check D i (G H) D i (G)D i (H). For the reverse inequality, let P = V 1 W 1, Q = V 1 W i and R = V i W i. Join (v, w) P to (v, w ) Q in F if v = v and w Γ i (w) and (v, w ) Q to (v, w ) R if w = w and v Γ i (v ). Then there exists a path from (v, w) P to (v, w ) Q if and only if there exists a path from (v, w) to (v, w ) in G H. Hence in the layered graph F with layers P, Q and R we have that the magnification D P R from P to R is exactly D i (G H). We next show that the magnification D P Q is D i (H) and D QR is D i (G). If C W 1 with Γ i (C) / C = D i (H), let v V 1 and C = {v} C. This shows D P Q D i (H). Conversely, let C P = V 1 W 1. For each x V 1, let C x = {y : (x, y) C}. Then Γ(C x ) Q / C x D i (H) hence D P Q D i (H). Therefore D P Q = D i (H) and similarly D QR = D i (G) from Q to R. Since D P Q D QR D P R, we have D i (G)D i (H) D i (G H). Lemma 2 Let G be a Plünnecke Graph with layers V i : i [n] such that D n (G) 1. Then there are V 1 disjoint paths from V 1 to V n and D i (G) 1 for all i [n]. Proof. Add a vertex a joined to all of V 1 and a vertex b joined to all of V n. Let m be the maximum number of disjoint a-b paths. There exists a set S = {s 1, s 2,..., s m } of size m separating a from b, by Menger s Theorem. Set S i = S V i. Choose S such that M = s i S i is a minimum. We claim that S V 1 V n. Suppose this is false; there exists i : 1 i < n such that S V i = {s 1, s 2,..., s q } =. Let P 1, P 2,..., P m be disjoint paths from V 1 to V n. Each P i contains exactly one s i, by the minimality of m. Let s i and s + i denote the predecessor and successor of s i on the path containing s i, oriented from V 1 to V n, 1 i q. By the minimality of M, we cannot replace any elements of S with predecessors on the paths. So we find a path P from V 1 to V n that misses {s 1, s 2,..., s q, s q+1,..., s m }. 2
3 This path must intersect S, as S is a separating set. Let {r} = P V i 1. Then the next vertex of P must be s i for some i : 1 i q. We claim that every path from {s 1, s 2,..., s q, r} to s + 1, s + 2,..., s + q passes through the vertices s 1, s 2,..., s q. Suppose that this claim is false. If there exists a path Q from s i to s + j missing s 1, s 2,..., s q, then the path comprises the segment of P i to s i, the segment of Q to s + j and the segment of P j onwards, misses S. This contradicts the fact that S is a separating set. Therefore the graph induced by {s 1,..., s q, r}, {s 1,..., s q } and {s + 1,..., s + q } is a Plünnecke Graph. In this subgraph, let d + (x) and d (X) be the in- and out-degrees of x. Since s i is joined to s i, d + (s i ) d+ (s i ). Similarly, d (s i ) d (s + i ). Also q i=1 d+ (s i ) = q i=1 d (s + i ) by counting edges, and d+ (r) + d + (s i ) = d (s i ). Since d + (r) > 0, we have a contradiction. Therefore S V 1 V n and, by minimality, S = (V 1 S) (Γ n (V 1 \S) and S = V 1 S + Γ n (V 1 \S) V 1 S + V 1 \S = V 1. Theorem 2 (Plünnecke s Theorem). Let G be a Plünnecke Graph with layers V 0, V i : i [n]. Then D 1 (G) D 2 (G) 1/2 D n (G) 1/n. Proof. The theorem follows from the last lemma when D n := D n (G) = 1. Consider first the case D n < 1. It is enough to show D 1/i i Dn 1/n for all i [n]. Let m, r N be chosen with m i and ( ) m + n 1 Dn r 1. n We suppose m is a minimum subject to this constraint. Let A = {a 1, a 2,..., a m } Z all of whose increasing sums a j1 + a j2 + + a jm j 1 j 2 j m are distinct. Let H be the layered graph whose layers are V 0 = {0}, V k = ka for k [n] and such that x V k is joined to y V k+1 if x + a = y for some a A. Then by the choice of m and a preceding lemma, ( ) m + n 1 D n (G r H) = DnD r n (H) = Dn r 1. n By the last lemma, it follows that D i (G r H) 1. Using the bound ( ) m n m + n 1 m n n! n we have the inequality D i ( m+i 1 i 1 ) 1/r 1 ( n! m i/r 3 D r n ) i/rn.
4 Letting r, this converges to D i Dn i/n, as required. If D n > 1, then we reverse H to obtain a layered graph F whose layers in order are V 0 = na, V 1 = (n 1)A,..., V n = {0}. Applying similar arguments to those above on the layered graph G r F gives the bound for D n > 1. 3 Ruzsa s covering lemma In this section we see that if A + A is small, then so is ka la, where ka := {a 1 + a a k : a 1, a 2,..., a k A}. Note that repetitions are allowed in this definition. Lemma 3 Let k N and let A and B be non-empty subsets of Z such that A+kB C A. For h k, there is a non-empty set X A such that X + hb C h/k X. Proof. Let G be the natural Plünnecke Graph. If the result were false, then D h (G) > C h/k so D k (G) > C which implies that A + kb > C A, a contradiction. Lemma 4 If A is a non-empty subset of Z and A + A C A, then ka C k A for each k 3. Proof. Take k = 1 and B = A in the preceding lemma. This implies that there exists a non-empty X A such that X + ka C k A C k A, but X + ka ka, so the result is proved. Lemma 5 Let U, V, W Z. Then U V W U + V U + W. Proof. Define, for x V W, ϕ(u, x) = (u + v(x), u + w(x)) where v(x) V, w(x) W satisfy v(x) w(x) = x. Then ϕ is an injection U (V W ) (U + V ) (U + W ). Theorem 3 (Covering lemma) Let A, B Z such that A + B C A and let k and l be natural numbers with l k. Then kb lb C k+l A. Proof. Suppose l k 1. By the first lemma, there exists A A with A + kb C k A. Again there exists A A with A + lb C l A. Using the last lemma, A kb lb A + kb A + lb C k+l A A and the result follows on dividing by A. 4
5 4 Freiman homomorphisms Let A Z s or A Z and B Z t. Then ϕ : A B is called a (Freiman) k-homomorphism if whenever x 1 + x x k = y 1 + y y k, with x i, y i A, ϕ(x i ) = ϕ(y i ). In addition, ϕ is called a k-isomorphism if ϕ is invertible and ϕ and ϕ 1 are k-homomorphisms. Note that ϕ is a k-homomorphism if the map ψ : (x 1,..., x k ) ϕ(x i ) induced by ϕ is a well defined map ka kb, and a k-isomorphism if ψ is a bijection. Our interest will be in 2-isomorphisms, as these preserve arithmetic progressions a set 2-isomorphic to an arithmetic progression is clearly an arithmetic progression. We use the following notation: if ϕ : A B and X A, then ϕ X denotes the restriction of ϕ to X. Lemma 6 Let A Z and suppose ka ka < N where N is prime. Then there exists A A with X A /k that is k-isomorphic to a subset of Z N. Proof. We may suppose A N and select a prime p > k max A. Then the quotient map ϕ 1 : Z Z p is a homomorphism of all orders, and ϕ 1 A is a k-isomorphism. Now let q be a random element of [p 1] and define ϕ 2 : Z p Z p by ϕ 2 (x) = qx. Then ϕ 2 is an isomorphism of all orders, and hence a k-isomorphism. Let ϕ 3 (x) = x where ϕ 3 : Z p Z. Then for any j, ϕ 3 Ij is a k-isomorphism where I j = {x Z p : j 1 k p x < j k p 1}. For, if k i=1 x i = k i=1 y i (mod p) with x i, y i I j, then k i=1 x i = k i=1 y i in Z. By the pigeonhole principle, there exist A A with A A /k (depending on q) and ϕ 2 ϕ 1 [A ] I j for some j. Restricted to A, ϕ 3 ϕ 2 ϕ 1 is a k-homomorphism. Finally, let ϕ 4 be the quotient map (a k-homomorphism) Z Z N. Then with ϕ = ϕ 4 ϕ 3 ϕ 2 ϕ 1, ϕ(x) = qx (mod p) (mod N) and ϕ A is a k-homomorphism, as it is the composition of k-homomorphisms. We prove that for some q, ϕ A is a a k-isomorphism. Now i a i i a i with a i, a i A implies i a i i a i (mod p) so we have q( i a i i a i) (mod p) is a multiple of N for some a i, a i A if ϕ A fails to be a k-isomorphism. The probability of this event is at most ka ka /N < 1. So for some q, ϕ A is a k-isomorphism. 5 Proof of Freiman s Theorem We now present Ruzsa s proof of Freiman s Theorem. We start with a set A Z such that A + A C A. The first step is to show 2A 2A contains an arithmetic progression of 5
6 small dimension and size relative to A. By the covering lemma, 8A 8A C 16 A. By the last lemma, A contains a subset A of cardinality at least A /8 which is 8-isomorphic to a a set B Z N with C 16 A < N 2C 16 A, where N is prime and C A < N 2C A, using Bertrand s Postulate. So B = αn with α (16C 16 ) 1. By Bogolyubov s Theorem, 2B 2B contains an arithmetic progression of dimension at most α 2 at least (α 2 /4) α 2 N = β A where β is a constant depending only on C. 8-isomorphic to A, 2B 2B is 2-isomorphic to 2A 2A. and cardinality Since B is Any set 2-isomorphic to a d-dimensional arithmetic progression is a d-dimensional arithmetic progression. Therefore 2A 2A, and hence 2A 2A, contains an arithmetic progression Q of dimension at most α 2 and cardinality β A. Now let X = {x 1, x 2,..., x k } A be maximal such that x, y X, x y imply x y Q Q. Equivalently, all the sets x + Q are disjoint, so X + Q = X Q. Since X is maximal, A X +(Q Q) and X is contained in the k-dimensional arithmetic progression { k } R = a i x i : 0 a i 1. i=1 Therefore A is contained in the arithmetic progression R + (Q Q), of dimension at most α 2 + X. We know that X + Q A + 2A 2A C 5 A, by the covering lemma and R + (Q Q) kx + Q Q ka + 2A 2A C k+4 A. Since X + Q = X Q, this shows X C 5 A / Q. Since Q β A, we have k = X C 5 /β and therefore R + (Q Q) has dimension at most α 2 + β 1 C 5 and cardinality at most C C5 /β+4 A. This completes the proof of Freiman s Theorem. 6
A proof of Freiman s Theorem, continued. An analogue of Freiman s Theorem in a bounded torsion group
A proof of Freiman s Theorem, continued Brad Hannigan-Daley University of Waterloo Freiman s Theorem Recall that a d-dimensional generalized arithmetic progression (GAP) in an abelian group G is a subset
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationWalk through Combinatorics: Sumset inequalities.
Walk through Combinatorics: Sumset inequalities (Version 2b: revised 29 May 2018) The aim of additive combinatorics If A and B are two non-empty sets of numbers, their sumset is the set A+B def = {a+b
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
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 informationA talk given at the Institute of Math., Chinese Academy of Sciences ( ).
A talk given at the Institute of Math., Chinese Academy of Sciences (2007-01-30). COMBINATORIAL ASPECTS OF SZEMERÉDI S THEOREM Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093, P.
More informationApplication 3.2 (Ruzsa). Let α R and A be a finite non-empty set in a commutative group. Suppose that A + A α A. Then for all positive integers h 2
Application 3.2 (Ruzsa). Let α R and A be a finite non-empty set in a commutative group. Suppose that A + A α A. Then for all positive integers h 2 Proof. ( ) α 4 + h 2 ha A α 2 A. h 1 Later on in the
More informationAdditive Combinatorics Lecture 12
Additive Combinatorics Lecture 12 Leo Goldmakher Scribe: Gal Gross April 4th, 2014 Last lecture we proved the Bohr-to-gAP proposition, but the final step was a bit mysterious we invoked Minkowski s second
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationProjective Varieties. Chapter Projective Space and Algebraic Sets
Chapter 1 Projective Varieties 1.1 Projective Space and Algebraic Sets 1.1.1 Definition. Consider A n+1 = A n+1 (k). The set of all lines in A n+1 passing through the origin 0 = (0,..., 0) is called the
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 informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
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 information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationA GENERAL THEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUTATIVE RING. David F. Anderson and Elizabeth F. Lewis
International Electronic Journal of Algebra Volume 20 (2016) 111-135 A GENERAL HEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUAIVE RING David F. Anderson and Elizabeth F. Lewis Received: 28 April 2016 Communicated
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 informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
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 informationFinite and infinite arithmetic progressions in sumsets
Annals of Mathematics, 163 (2006), 1 35 Finite and infinite arithmetic progressions in sumsets By E. Szemerédi and V. H. Vu* Abstract We prove that if A is a subset of at least cn 1/2 elements of {1,...,n},
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationSETS WITH MORE SUMS THAN DIFFERENCES. Melvyn B. Nathanson 1 Lehman College (CUNY), Bronx, New York
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A05 SETS WITH MORE SUMS THAN DIFFERENCES Melvyn B. Nathanson 1 Lehman College (CUNY), Bronx, New York 10468 melvyn.nathanson@lehman.cuny.edu
More informationGraph Transformations T1 and T2
Graph Transformations T1 and T2 We now introduce two graph transformations T1 and T2. Reducibility by successive application of these two transformations is equivalent to reducibility by intervals. The
More informationINVERSE LIMITS AND PROFINITE GROUPS
INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological
More informationApplications of Homotopy
Chapter 9 Applications of Homotopy In Section 8.2 we showed that the fundamental group can be used to show that two spaces are not homeomorphic. In this chapter we exhibit other uses of the fundamental
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationAngle contraction between geodesics
Angle contraction between geodesics arxiv:0902.0315v1 [math.ds] 2 Feb 2009 Nikolai A. Krylov and Edwin L. Rogers Abstract We consider here a generalization of a well known discrete dynamical system produced
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationMATH32062 Notes. 1 Affine algebraic varieties. 1.1 Definition of affine algebraic varieties
MATH32062 Notes 1 Affine algebraic varieties 1.1 Definition of affine algebraic varieties We want to define an algebraic variety as the solution set of a collection of polynomial equations, or equivalently,
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 informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationA GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY
A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame congruence theory is not an easy subject and it takes a considerable amount of effort to understand it. When I started this project, I believed that this
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 informationLecture 6. s S} is a ring.
Lecture 6 1 Localization Definition 1.1. Let A be a ring. A set S A is called multiplicative if x, y S implies xy S. We will assume that 1 S and 0 / S. (If 1 / S, then one can use Ŝ = {1} S instead of
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationSequences of height 1 primes in Z[X]
Sequences of height 1 primes in Z[X] Stephen McAdam Department of Mathematics University of Texas Austin TX 78712 mcadam@math.utexas.edu Abstract: For each partition J K of {1, 2,, n} (n 2) with J 2, let
More information1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings
More informationDimension Theory. Mathematics 683, Fall 2013
Dimension Theory Mathematics 683, Fall 2013 In this note we prove some of the standard results of commutative ring theory that lead up to proofs of the main theorem of dimension theory and of the Nullstellensatz.
More informationNote on Vertex-Disjoint Cycles
Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.
More informationarxiv: v1 [math.co] 5 May 2016
Uniform hypergraphs and dominating sets of graphs arxiv:60.078v [math.co] May 06 Jaume Martí-Farré Mercè Mora José Luis Ruiz Departament de Matemàtiques Universitat Politècnica de Catalunya Spain {jaume.marti,merce.mora,jose.luis.ruiz}@upc.edu
More informationLOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi
LOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi Department of Mathematics, East China Normal University, Shanghai, 200062, China and Center for Combinatorics,
More informationGRAPHS WITHOUT THETA SUBGRAPHS. 1. Introduction
GRAPHS WITHOUT THETA SUBGRAPHS J. VERSTRAETE AND J. WILLIFORD Abstract. In this paper we give a lower bound on the greatest number of edges of any n vertex graph that contains no three distinct paths of
More informationFunctions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014
Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6 th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. I have omitted some
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More information1.1 Szemerédi s Regularity Lemma
8 - Szemerédi s Regularity Lemma Jacques Verstraëte jacques@ucsd.edu 1 Introduction Szemerédi s Regularity Lemma [18] tells us that every graph can be partitioned into a constant number of sets of vertices
More informationTHE LENGTH OF NOETHERIAN MODULES
THE LENGTH OF NOETHERIAN MODULES GARY BROOKFIELD Abstract. We define an ordinal valued length for Noetherian modules which extends the usual definition of composition series length for finite length modules.
More informationGENERALIZED PIGEONHOLE PROPERTIES OF GRAPHS AND ORIENTED GRAPHS
GENERALIZED PIGEONHOLE PROPERTIES OF GRAPHS AND ORIENTED GRAPHS ANTHONY BONATO, PETER CAMERON, DEJAN DELIĆ, AND STÉPHAN THOMASSÉ ABSTRACT. A relational structure A satisfies the n k property if whenever
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 informationCombinatorial Number Theory
Combinatorial Number Theory Combinatorial Number Theory Travis Dirle December 4, 016 Contents 1 Basics and Cardinality Inequalities 1 Structure of Sets with Few Sums 9 3 Location and Sumsets 15 4 Density
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationA proof of a partition conjecture of Bateman and Erdős
proof of a partition conjecture of Bateman and Erdős Jason P. Bell Department of Mathematics University of California, San Diego La Jolla C, 92093-0112. US jbell@math.ucsd.edu 1 Proposed Running Head:
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationEXISTENCE AND UNIQUENESS OF INFINITE COMPONENTS IN GENERIC RIGIDITY PERCOLATION 1. By Alexander E. Holroyd University of Cambridge
The Annals of Applied Probability 1998, Vol. 8, No. 3, 944 973 EXISTENCE AND UNIQUENESS OF INFINITE COMPONENTS IN GENERIC RIGIDITY PERCOLATION 1 By Alexander E. Holroyd University of Cambridge We consider
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationON THE NUMBER OF COMPONENTS OF A GRAPH
Volume 5, Number 1, Pages 34 58 ISSN 1715-0868 ON THE NUMBER OF COMPONENTS OF A GRAPH HAMZA SI KADDOUR AND ELIAS TAHHAN BITTAR Abstract. Let G := (V, E be a simple graph; for I V we denote by l(i the number
More informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationDisjoint paths in unions of tournaments
Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton
More informationMaximal Independent Sets In Graphs With At Most r Cycles
Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics
More information3. The Sheaf of Regular Functions
24 Andreas Gathmann 3. The Sheaf of Regular Functions After having defined affine varieties, our next goal must be to say what kind of maps between them we want to consider as morphisms, i. e. as nice
More informationInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Pinar Heggernes Pim van t Hof Daniel Meister Yngve Villanger Abstract Given two graphs G and H as input, the Induced Subgraph
More informationShort Introduction to Admissible Recursion Theory
Short Introduction to Admissible Recursion Theory Rachael Alvir November 2016 1 Axioms of KP and Admissible Sets An admissible set is a transitive set A satisfying the axioms of Kripke-Platek Set Theory
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
More informationMath 418 Algebraic Geometry Notes
Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R
More informationThe number of trees in a graph
The number of trees in a graph Dhruv Mubayi Jacques Verstraëte November 23, 205 Abstract Let T be a tree with t edges We show that the number of isomorphic (labeled) copies of T in a graph G = (V, E) of
More information8 Complete fields and valuation rings
18.785 Number theory I Fall 2017 Lecture #8 10/02/2017 8 Complete fields and valuation rings In order to make further progress in our investigation of finite extensions L/K of the fraction field K of a
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationLecture Notes on Discrete Mathematics. October 15, 2018 DRAFT
Lecture Notes on Discrete Mathematics October 15, 2018 2 Contents 1 Basic Set Theory 5 1.1 Basic Set Theory....................................... 5 1.1.1 Union and Intersection of Sets...........................
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationACTING FREELY GABRIEL GASTER
ACTING FREELY GABRIEL GASTER 1. Preface This article is intended to present a combinatorial proof of Schreier s Theorem, that subgroups of free groups are free. While a one line proof exists using the
More informationPartial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs
Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs Flavia Bonomo a,1, Maria Chudnovsky b,2 and Guillermo Durán c,3 a Departamento de Matemática, Facultad
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationNotes on Graph Theory
Notes on Graph Theory Maris Ozols June 8, 2010 Contents 0.1 Berge s Lemma............................................ 2 0.2 König s Theorem........................................... 3 0.3 Hall s Theorem............................................
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationThis is a closed subset of X Y, by Proposition 6.5(b), since it is equal to the inverse image of the diagonal under the regular map:
Math 6130 Notes. Fall 2002. 7. Basic Maps. Recall from 3 that a regular map of affine varieties is the same as a homomorphism of coordinate rings (going the other way). Here, we look at how algebraic properties
More informationNotes on the Bourgain-Katz-Tao theorem
Notes on the Bourgain-Katz-Tao theorem February 28, 2011 1 Introduction NOTE: these notes are taken (and expanded) from two different notes of Ben Green on sum-product inequalities. The basic Bourgain-Katz-Tao
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
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 COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS. 1. Introduction
THE COMPLEXITY OF DISSOCIATION SET PROBLEMS IN GRAPHS YURY ORLOVICH, ALEXANDRE DOLGUI, GERD FINKE, VALERY GORDON, FRANK WERNER Abstract. A subset of vertices in a graph is called a dissociation set if
More informationHIGHER EUCLIDEAN DOMAINS
HIGHER EUCLIDEAN DOMAINS CHRIS J. CONIDIS Abstract. Samuel and others asked for a Euclidean domain with Euclidean rank strictly greater than ω, the smallest infinite ordinal. Via a limited technique Hiblot
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationA note on the Isomorphism Problem for Monomial Digraphs
A note on the Isomorphism Problem for Monomial Digraphs Aleksandr Kodess Department of Mathematics University of Rhode Island kodess@uri.edu Felix Lazebnik Department of Mathematical Sciences University
More informationThe geometry of secants in embedded polar spaces
The geometry of secants in embedded polar spaces Hans Cuypers Department of Mathematics Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands June 1, 2006 Abstract Consider
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1+o(1))2 ( 1)/2.
More informationMath 203A - Solution Set 3
Math 03A - Solution Set 3 Problem 1 Which of the following algebraic sets are isomorphic: (i) A 1 (ii) Z(xy) A (iii) Z(x + y ) A (iv) Z(x y 5 ) A (v) Z(y x, z x 3 ) A Answer: We claim that (i) and (v)
More informationShort notes on Axioms of set theory, Well orderings and Ordinal Numbers
Short notes on Axioms of set theory, Well orderings and Ordinal Numbers August 29, 2013 1 Logic and Notation Any formula in Mathematics can be stated using the symbols and the variables,,,, =, (, ) v j
More informationPERVERSE SHEAVES ON A TRIANGULATED SPACE
PERVERSE SHEAVES ON A TRIANGULATED SPACE A. POLISHCHUK The goal of this note is to prove that the category of perverse sheaves constructible with respect to a triangulation is Koszul (i.e. equivalent to
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 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 informationCIRCLE IMMERSIONS THAT CAN BE DIVIDED INTO TWO ARC EMBEDDINGS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 138, Number 2, February 2010, Pages 743 751 S 0002-9939(09)10140-5 Article electronically published on October 1, 2009 CIRCLE IMMERSIONS THAT CAN
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationarxiv: v1 [math.co] 24 Apr 2014
On sets of integers with restrictions on their products Michael Tait, Jacques Verstraëte Department of Mathematics University of California at San Diego 9500 Gilman Drive, La Jolla, California 9093-011,
More informationLecture 8: Equivalence Relations
Lecture 8: Equivalence Relations 1 Equivalence Relations Next interesting relation we will study is equivalence relation. Definition 1.1 (Equivalence Relation). Let A be a set and let be a relation on
More informationNOTES ON WELL ORDERING AND ORDINAL NUMBERS. 1. Logic and Notation Any formula in Mathematics can be stated using the symbols
NOTES ON WELL ORDERING AND ORDINAL NUMBERS TH. SCHLUMPRECHT 1. Logic and Notation Any formula in Mathematics can be stated using the symbols,,,, =, (, ) and the variables v j : where j is a natural number.
More information