The Degree of the Splitting Field of a Random Polynomial over a Finite Field
|
|
- Lawrence Patrick
- 5 years ago
- Views:
Transcription
1 The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada fjdixon,danielg@math.carleton.ca Mathematics Subject Classi cations: T06, 20B99 Abstract The asymptotics of the order of a random permutation have been widely studied. P. ErdÄos and P. Tur an proved that asymptotically the distribution of the logarithm of the order of an element in the symmetric group S n is normal with mean 2 (log n)2 and variance 3 (log n)3. More recently R. Stong has shown that the mean of the order is asymptotically exp(c p n= log n + O( p n log log n= log n)) where C = 2:99047 : : :. We prove similar results for the asymptotics of the degree of the splitting eld of a random polynomial of degree n over a nite eld. Introduction We consider the following problem. Let F q denote a nite eld of size q and consider the set P n (q) of monic polynomials of degree n over F q. What can we say about the degree over F q of the splitting eld of a random polynomial from P n (q)? Because we are dealing with nite elds and there is only one eld of each size, it is well known that the degree of the splitting eld of f() 2 P n (q) is the least common multiple of the degrees of the irreducible factors of f() over F q. Thus the problem can be rephrased as follows. Let be a partition of n (denoted ` n) and write in the form k 2 k 2 :::n kn where has k s parts of size s. We shall say that a polynomial is of shape if it has k s irreducible factors of degree s for each s. Let w( ; q) be the proportion of polynomials in P n (q) which have shape. If we de ne m( ) to be the least common multiple of the sizes of the parts of, then the degree of the splitting eld over F q of a polynomial of shape is m( ). The average degree of a splitting eld is given by E n (q) := `n w( ; q)m( ): An analogous problem arises in the symmetric group S n. A permutation in S n is of type = k 2 k 2 :::n kn if it has exactly ks cycles of length s for each s, and its order is then the electronic journal of combinatorics (2004), #R00
2 equal to m( ). If w( ) denotes the proportion of permutations in S n which are of type, then the average order of a permutation in S n is equal to E n := `n w( )m( ): We can think of m( ) as a random variable where ranges over the partitions of n and the probability of is w( ; q) and w( ) in the respective cases. Properties of the random variable m( ) (and related random variables) under the distribution w( ) have been studied by a number of authors, notably by ErdÄos and Tur an in a series of papers [, 2, 3] and [4]. In particular, the main theorem of [3] shows that in this case the distribution of log m( ) is approximated by a normal distribution with mean (log 2 n)2 and variance (log 3 n)3 in a precise sense. In our notation the theorem reads as follows. For each real x de ne ½ ª n (x) := ` n j log m( ) 2 (log n)2 + p x ¾ (log n) 3=2 : 3 Then for each x 0 > 0: w( )! p Z x e t2 =2 dt as n! uniformly for x 2 [ x 0 ; x 0 ] : 2¼ 2ª n (x) In particular, the mean of the random variable log m( ) is asymptotic to 2 (log n)2, but this does not imply that log E n (the log of the mean of m( )) is asymptotic to (log n)2 2 and indeed it is much larger. The problem of estimating E n was raised in [4], and the rst asymptotic expression for log E n was obtained by Goh and Schmutz [6]. The result of Goh and Schmutz was re ned by Stong [9] who showed that r µp n n log log n log E n = C log n + O ; log n where C = 2:99047::: is an explicitly de ned constant. The object of the present paper is to prove analogous theorems for the random variable m( ) under the distribution w( ; q). Actually, it turns out that these theorems hold for several important classes of polynomials which we shall now describe. Consider the classes: ² M (q): the class of all monic polynomials over F q. In this class the number of polynomials of degree n is q n for each n. ² M 2 (q): the class of all monic square-free polynomials over F q. In this class the number of polynomials of degree n is ( q )q n for each n: ² M 3 (q): the class of all monic square-free polynomials over F q whose irreducible factors have distinct degrees. In this class the number of polynomials of degree n is a(n; q)q n where, for each q, a(n; q)! a(q) := Q k ( + i k(q)q k ) exp( =k) as n! where i k (q) is the number of monic irreducible polynomials of degree k over F q (see [7] Equation () with j = 0). the electronic journal of combinatorics (2004), #R00 2
3 For x > 0 de ne n (x) := ½ ` n j log m( ) 2 (log n)2 > x p 3 (log n) 3=2 ¾ : Then for each of the classes of polynomials described above we have a weak analogue of the theorem of ErdÄos and Tur an quoted above, and an exact analogue of Stong's theorem. Theorem Fix one of the classes M i (q) described above. For each ` n, let w( ; q) denote the proportion of polynomials in this class whose factorizations have shape. Then there exists a constant c 0 > 0 (independent of the class) such that for each x there exists n 0 (x) such that w i ( ; q) c 0 e x=4 for all q and all n n 0 (x): () 2 n(x) In particular, almost all f() of degree n in M i (q) have splitting elds of degree exp(( 2 + o())(log n) 2 ) over F q as n!. Theorem 2 Let C be the same constant as in the Goh-Schmutz-Stong theorem. Then in each of the classes described above the average degree E n (q) of a splitting eld of a polynomial of degree n in that class satis es r log E n (q) = C n log n + O 2 Properties of w( ; q) µp n log log n uniformly in q. log n First consider the value of w( ; q) for each of the three classes. Let i s = i s (q) denote the number of monic irreducible polynomials of degree s over F q. Then (see, for example, [8]) we have q s = P djs di d so a simple argument shows that q s s i s qs s ( + 2q s=2 ) : Let ` n have the form k :::n kn. Since Pn (q) contains q n polynomials, and there are ways to select k irreducible factors of degree s, we have is +k k w( ; q) = q n µ is + k s = k s q sk s µ is + k s in M (q): Similarly, since there are ( q )q n polynomials of degree n in M 2 (q), and there are i s k ways to select k distinct irreducible factors of degree s, in this case we have µ is µ is w( ; q) = = q sks in M ( q )q n k s ( q 2 (q): ) k s the electronic journal of combinatorics (2004), #R00 3 k s
4 Finally, since there are a(n; q)q n polynomials of degree n in M 3 (q) and each of these polynomials has at most one irreducible factor of each degree, we get w( ; q) = a(n; q)q n µ i ks s = µ q i sks ks s a(n; q) k s when each part in has multiplicty, and w( ; q) = 0 otherwise. we also have k s w( ) = k 2 k 2:::n k nk!k 2!:::k n! : in M 3 (q) As is well known We shall use the notation n to denote the set of all partitions of n, n;k to denote the set of partitions k 2 k 2 :::n n k in which each ki < k and 0 n;k to denote the complementary set of partitions. It is useful to note that in M (q) and M 2 (q) we have w( ; q)! w( ) as q!. However, this behaviour is not uniform in. Indeed for each of these two classes the ratio w( ; q)=w( ) is unbounded above and below for xed q if we let range over all partitions of n and n!. This means we have to be careful in deducing our theorems from the corresponding results for w( ). In M 3 (q), we have w( ; q) = 0 whenever 2 0 n;2, and a simple computation shows that a(n; q)w( ; q)! w( ) as q! whenever 2 n;2 : Lemma 3 There exists a constant a 0 > 0 such that for all n and all prime powers q >. q a 0 and a(n; q) a 0 Proof. The rst inequality is satis ed whenever a 0 2, so it is enough to prove that the set of all a(n; q) has a strictly positive lower bound. We shall use results from [7, Theorems and 2]. In our notation [7] shows that a(q) increases monotonically with q starting with a(2) = 0:3967 : : :, and that for some absolute constant c we have ja(n; q) a(q)j c=n for all n. In particular, a(n; q) a(q) c=n a(2) c=n. Thus a(n; q) a(2) > 0 for all q whenever n > n 2 0 := b2c=a(2)c. On the other hand, as we noted above, in M 3 (q), a(n; q)w( ; q)! w( ) as q! whenever 2 n;2 and is 0 otherwise. Thus a(n; q) = 2 a(n; q)w( ; q)! w( ) = b(n), say, as q! : n 2 k;2 Evidently, b(n) > 0 (it is the probability that a permutation in S n has all of its cycles of di erent lengths). De ne b 0 := min fb(n) j n = ; 2; :::; n 0 g. Then the limit above shows that there exists q 0 such that a(n; q) b 2 0 whenever n = ; 2; :::; n 0 and q > q 0. Finally, choose a 0 2 such that =a 0 is bounded above by 2 a(2), 2 b 0 and all a(n; q) with n = ; 2; :::; n 0 and q q 0. This value of a 0 satis es the stated inequalities. the electronic journal of combinatorics (2004), #R00 4
5 We next examine some properties of the w( ; q) which we shall need later. In what follows, if := k :::n kn 2 n and ¹ := l :::m lm 2 m, then the join _ ¹ denotes the partition of m + n with k s + l s parts of size s. We shall say that and ¹ are disjoint if k s l s = 0 for each s: Lemma 4 Let a 0 be a constant satisfying the conditions in Lemma 3. Then for each class M i (q) we have w( _ ¹; q) a 0 w( ; q)w(¹; q) for all and ¹. On the other hand, if and ¹ are disjoint, then w( _ ¹; q) a 2 0 w( ; q)w(¹; q). We also have w( _ ¹) w( )w(¹), with equality holding when and ¹ are disjoint. Proof. First note that in each of the classes, w( _¹; q) is 0 if either w( ; q) or w(¹; q) is 0: Suppose neither of the latter is 0 and put r := w( _ ¹; q)=w( ; q)w(¹; q). First consider the class M (q). Then r can be written as a product of terms of the form µ is + k s + l s k s + l s = µ µ is + k s is + l s The numerator of this ratio counts the number of ways of placing k s + l s indistinguishable items in i s distinguishable boxes. The denominator counts the number of ways of doing this when k s of the items are of one type and l s are another, and so is at least as great as the numerator. Hence we conclude that r < a 0 in this case. Moreover, when and ¹ are disjoint then each term is equal to and so r = a 2 0. This proves the claim for the class M (q). Taking limits as q! also gives a proof of the nal statement. Now consider the class M 2 (q). In this case r=( q ) can be written as a product of terms of the form µ is = k s + l s k s µ µ is is The numerator counts the number of ways to choose k s + l s out of i s items, whilst the denominator is at least as large as i s is k s k s l s which counts the number of ways to choose k s +l s items when k s are of one type and l s are another type. This shows that each term is at most and so r ( q ) a 0 as required. Again, in this case, when the partitions are disjoint, each term is equal to and so r = q a 2 0. This proves the claim for the class M 2 (q), and the proof for the class M 3 (q) is similar (in this case w( _ ¹; q) is 0 unless and ¹ are disjoint). Lemma 5 For all partitions of the form [s k ] and all q we have in each of the classes M i (q). k s l s : w( s k ; q) a 0 k + (2s) k l s : the electronic journal of combinatorics (2004), #R00 5
6 Proof. Fix q and k and de ne v s := q sk k! ky µ q s s + j : j=0 Since i s q s =s we have w( s k ; q) a 0 v s for each of the three classes. We also note that Finally since v = k Y ( + j=q) k Y ( + j=2) = k + : k! k! 2 k k Y v s+ =v s = q k j=0 j=0 q s+ =(s + ) + j q s =s + j we obtain w( s k ; q) a 0 v s a 0 s k v so the result follows. j=0 k Y µ k q k qs s s + = ; s + Lemma 6 Let = k :::n kn be a partition of n. The following are true for each of the classes M i (q). (a) If each k s k for some xed integer k > 0, then w( ; q) a 0 e 2k(k ) w( ): (b) There exists a constant c such that, if each k s, then w( ; q) c w( ). Proof. (a) For each of the classes we have w( ; q) a 0 n Y j=0 q sks k s! (i s + k s ) ks : Using the bound i s q s =s we obtain Y n µ w( ; q) a 0 + s(k ks s ) s ks k s! q s à n! a 0 w( ) exp sk s (k s )q s : Since P sq s P s2 s = 2, this proves (a): (b) Similarly, for partitions with no two parts of the same size we have (for any of the classes) w( ; q) q sk s iks s à w( ) exp 2 µ s k s ks!! n k s q s=2 + 2q s=2 so the lower bound follows with c := exp 2 P 2 s=2 = 0: Recall that the set n;k consists of all partitions of n in which each part has multiplicity < k, and 0 n;k consists of the remaining partitions. ks the electronic journal of combinatorics (2004), #R00 6
7 Lemma 7 For all classes M i (q), and all n and q 2 0 n;k w( ; q) a 2 0 k + whenever k 2: 2k Similarly 2 0 n;k w( ) k + whenever k 2: 2k Proof. Each 2 0 n;k can be written in the form [sk ] _ ¹ for some ¹ ` n ks in at least one way. Hence using Lemmas 4 and 5 we obtain 2 0 n;k w( ; q) ¹`n ks = a 0 w([s k ]; q) a 2 0 w([s k ] _ ¹; q) a 0 w([s k ]; q) k + (2s) k + k a2 0 2 : k ¹`n ks w(¹; q) This proves the stated inequality. The corresponding inequality for w( ) is similar. 3 Proof of Theorem Since n (x) and ª n (x)nª n ( x) are complementary sets for x > 0, and the error function is even, the theorem of ErdÄos and Tur an quoted in the Introduction shows that for xed x > 0: W n (x) := w( )! (x) as n! ; where (x) := p 2¼ ½Z x 2 n(x) e t2 =2 dt + Z x ¾ e t2 =2 dt = p 2 Z e t2 =2 dt: 2¼ x A simple integration by parts shows (see, for example, [5, Chap. 7]) that (x) < 2e x2 =2 p 2¼x for x > 0: Thus, for x, there exists n 0 (x) > 0 such that W n (x) < e x2 =2 whenever n > n 0 (x). De ne n;k (x) := n (x) \ n;k and 0 n;k (x) := n(x) \ 0 n;k. Now using Lemma 6 we have, for each of the classes M i (q), that W n;k (x; q) := w( ; q) a 0 e 2k(k ) w( ) a 0 e 2k(k ) W n (x): 2 n;k (x) 2 n;k (x) the electronic journal of combinatorics (2004), #R00 7
8 On the other hand Lemma 7 shows that for k : W 0 n;k(x; q) := 2 0 n;k (x) w( ; q) 2 0 n;k (x) w( ; q) a 2 0 k + 2 k < 8a2 0e (k+)=2 : Thus for x, k and n n 0 (x) we have w( ; q) = W n;k (x; q) + Wn;k 0 (x; q) < a 0e 2k(k ) e x2 =2 + 8a 2 0 e (k+)=2 : 2 n (x) If x 2, then we can choose k := bx=2c and obtain e 2k(k ) e x2 =2 + 8a 0 e (k+)=2 < e x + 8a 0 e x=4 < ( + 8a 0 )e x=4 ; uniformly in x. Thus taking c 0 := a 0 ( + 8a 0 ) we obtain () for x 2. However, by adjusting the value of c 0 if necessary we can ensure that the inequality () is also valid for x with x < 2. Then the inequality is valid for all x. Finally, we prove the last assertion of the theorem. Given any " > 0 and ± > 0, choose x so that c 0 e x=4 < ±, and then choose n n 0 (x) so that x < " p 3 log n. Now () shows that for all n n the proportion of f() of degree n in M i (q) which have splitting elds whose degree lies outside of the interval exp(( 2 ")(log n)2 ); exp(( 2 + ")(log n)2 ) is bounded by c 0 e x=4 < ±. This is equivalent to what is stated. 4 Proof of Theorem 2 We start by proving an upper bound for E n (q). De ne ~E n := max fe m j m = ; 2; :::; ng : (It seems likely that ~ E n = E n but we have not been able to prove this.) Lemma 8 There exists a constant c 2 > 0 such that, in each of the classes M i (q), E n (q) c 2 ~ En for all q and all n. Proof. Let k 2 be the least integer such that We shall de ne c 2 := 2a 0 e 2k(k ). a 2 0 (k + )s =2: (2s) k the electronic journal of combinatorics (2004), #R00 8
9 We shall prove the lemma by induction on n. Note that E (q) = c 2 = c 2 ~ E. Assume n 2 and that E m (q) c 2 ~ Em for all m < n. Now Lemma 4 shows that En;k 0 (q) := 2 0 n;k w( ; q)m( ) a 0 sw( s k ; q) ¹`n ks ¹`n ks = a 0 sw( s k ; q)e n ks (q): w(¹; q)m(¹) w( s k _ ¹; q)m( s k _ ¹) Thus using Lemma 5, the choice of k and the induction hypothesis, we obtain E 0 n;k (q) a2 0 (k + )s (2s) k c 2 ~ E n ks 2 c 2 ~ E n n o because the sequence ~En is monotonic. On the other hand, Lemma 6 shows by the choice of c 2. E n;k (q) := 2 n;k w( ; q)m( ) a 0 e 2k(k ) w( )m( ) a 0 e 2k(k ) E n 2 c 2 E ~ n 2 n;k Hence and the induction step is proved. E n (q) = E n;k (q) + E 0 n;k (q) c 2 ~ E n To complete the proof of the theorem we must prove a lower bound for E n (q). Let n denote the set of partitions ¼ of the form: (i) ¼ is a partition of some integer m with n r < m n where r is the smallest prime > p n; (ii) the parts of ¼ are distinct and each is a multiple of a di erent prime > p n. Note that if the parts of ¼ are k r ; :::; k t r t where r ; :::; r t are distinct primes > p n then w(¼)m(¼) Qi r i= (k i r i )! = Q i =k i. Consider the partitions of n which can be written in the form ¼ _! where ¼ 2 n and! 2 n j¼j. In Sect. 3 of [9] (see especially the bottom of page 3) Stong notes (in our notation) that since ¼ and! are disjoint: E n w(¼ _!)m(¼ _!) ¼2 n!`n j¼j ¼2 n w(¼)m(¼)!`n j¼j w(!) = ¼2 n w(¼)m(¼): the electronic journal of combinatorics (2004), #R00 9
10 ³ He then proves that the last sum is greater than E n exp O Similarly, using Lemma 4 we obtain E n (q) w(¼ _!; q)m(¼ _!) ¼2 n!`n j¼j a 2 0 ¼2 n w(¼; q)m(¼)!`n j¼j w(!; q) = a 2 0 ³ pn log log n. log n ¼2 n w(¼; q)m(¼): Since each ¼ 2 n has all its parts of di erent sizes, Lemma 6 shows that w(¼; q) c w(¼), and so from the result due to Stong quoted above µ µp n log log n E n (q) a 2 0 c w(¼)m(¼) E n exp O : log n ¼2 n The lower bound in our theorem now follows from Stong's theorem. References [] P. ErdÄos and P. Tur an, On some problems of a statistical group theory I, Z. Wahrschein. Verw. Gebeite 4 (965) 75{86. [2] P. ErdÄos and P. Tur an, On some problems of a statistical group theory II, Acta Math. Acad. Sci. Hungar. 8 (967) 5{63. [3] P. ErdÄos and P. Tur an, On some problems of a statistical group theory III, Acta Math. Acad. Sci. Hungar. 8 (967) 309{320. [4] P. ErdÄos and P. Tur an, On some problems of a statistical group theory IV, Acta Math. Acad. Sci. Hungar. 9 (968) 43{435. [5] W. Feller, \An Introduction to Probability Theory and its Applications", Vol. (3rd. ed.), Wiley, New York, 968. [6] W. Goh and E. Schmutz, The expected order of a random permutation, Bull. London Math. Soc. 23 (99) 34{42. [7] A. Knopfmacher and R. Warlimont, Distinct degree factorizations for polynomials over a nite eld, Trans. Amer. Math. Soc. 347 (995) 2235{2243. [8] R. Lidl and H. Niederreiter, \Finite Fields", Cambridge Univ. Press, 997. [9] R. Stong, The average order of a permutation, Electronic J. Combinatorics 5 (998) #R4. the electronic journal of combinatorics (2004), #R00 0
The Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada {jdixon,daniel}@math.carleton.ca
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 informationSplitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field.
Splitting Fields for Characteristic Polynomials of Matrices with Entries in a Finite Field. Eric Schmutz Mathematics Department, Drexel University,Philadelphia, Pennsylvania, 19104. Abstract Let M n be
More informationON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE
ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This
More informationCOMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS
COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS A. KNOPFMACHER, M. E. MAYS, AND S. WAGNER Abstract. A composition of the positive integer n is a representation of n as an ordered sum of positive integers
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationarxiv: v1 [math.co] 22 May 2014
Using recurrence relations to count certain elements in symmetric groups arxiv:1405.5620v1 [math.co] 22 May 2014 S.P. GLASBY Abstract. We use the fact that certain cosets of the stabilizer of points are
More informationEconomics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries
1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social
More informationJoshua N. Cooper Department of Mathematics, Courant Institute of Mathematics, New York University, New York, NY 10012, USA.
CONTINUED FRACTIONS WITH PARTIAL QUOTIENTS BOUNDED IN AVERAGE Joshua N. Cooper Department of Mathematics, Courant Institute of Mathematics, New York University, New York, NY 10012, USA cooper@cims.nyu.edu
More informationTHE ORDER OF ELEMENTS IN SYLOW p-subgroups OF THE SYMMETRIC GROUP
THE ORDER OF ELEMENTS IN SYLOW p-subgroups OF THE SYMMETRIC GROUP JAN-CHRISTOPH SCHLAGE-PUCHTA Abstract. Define a random variable ξ n by choosing a conjugacy class C of the Sylow p-subgroup of S p n by
More informationPolynomials over finite fields. Algorithms and Randomness
Polynomials over Finite Fields: Algorithms and Randomness School of Mathematics and Statistics Carleton University daniel@math.carleton.ca AofA 10, July 2010 Introduction Let q be a prime power. In this
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
More informationMathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
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 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 informationYunhi Cho and Young-One Kim
Bull. Korean Math. Soc. 41 (2004), No. 1, pp. 27 43 ANALYTIC PROPERTIES OF THE LIMITS OF THE EVEN AND ODD HYPERPOWER SEQUENCES Yunhi Cho Young-One Kim Dedicated to the memory of the late professor Eulyong
More informationConstrained Leja points and the numerical solution of the constrained energy problem
Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter
More informationSolutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa
1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such
More information8 Periodic Linear Di erential Equations - Floquet Theory
8 Periodic Linear Di erential Equations - Floquet Theory The general theory of time varying linear di erential equations _x(t) = A(t)x(t) is still amazingly incomplete. Only for certain classes of functions
More informationR. Popovych (Nat. Univ. Lviv Polytechnic )
UDC 512.624 R. Popovych (Nat. Univ. Lviv Polytechnic ) SHARPENING OF THE EXPLICIT LOWER BOUNDS ON THE ORDER OF ELEMENTS IN FINITE FIELD EXTENSIONS BASED ON CYCLOTOMIC POLYNOMIALS ПІДСИЛЕННЯ ЯВНИХ НИЖНІХ
More informationDICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1
DICKSON POLYNOMIALS OVER FINITE FIELDS QIANG WANG AND JOSEPH L. YUCAS Abstract. In this paper we introduce the notion of Dickson polynomials of the k + 1)-th kind over finite fields F p m and study basic
More informationarxiv: v2 [math.nt] 4 Nov 2012
INVERSE ERDŐS-FUCHS THEOREM FOR k-fold SUMSETS arxiv:12093233v2 [mathnt] 4 Nov 2012 LI-XIA DAI AND HAO PAN Abstract We generalize a result of Ruzsa on the inverse Erdős-Fuchs theorem for k-fold sumsets
More informationMATH 131A: REAL ANALYSIS (BIG IDEAS)
MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.
More informationON THE ERDOS-STONE THEOREM
ON THE ERDOS-STONE THEOREM V. CHVATAL AND E. SZEMEREDI In 1946, Erdos and Stone [3] proved that every graph with n vertices and at least edges contains a large K d+l (t), a complete (d + l)-partite graph
More informationEigenvalues of Random Matrices over Finite Fields
Eigenvalues of Random Matrices over Finite Fields Kent Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpoly.edu September 5, 999 Abstract
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationMEASURE AND CATEGORY { Department of Mathematics, University of Tennessee, Chattanooga,
Mathematica Pannonica 7/1 (1996), 69 { 78 MEASURE AND CATEGORY { SOME NON-ANALOGUES Harry I. Miller Department of Mathematics, University of Tennessee, Chattanooga, TN, 371403, USA Franz J. Schnitzer Institut
More informationA PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO Introduction
A PURELY COMBINATORIAL APPROACH TO SIMULTANEOUS POLYNOMIAL RECURRENCE MODULO 1 ERNIE CROOT NEIL LYALL ALEX RICE Abstract. Using purely combinatorial means we obtain results on simultaneous Diophantine
More informationMultiplicative Order of Gauss Periods
Multiplicative Order of Gauss Periods Omran Ahmadi Department of Electrical and Computer Engineering University of Toronto Toronto, Ontario, M5S 3G4, Canada oahmadid@comm.utoronto.ca Igor E. Shparlinski
More informationGALOIS THEORY I (Supplement to Chapter 4)
GALOIS THEORY I (Supplement to Chapter 4) 1 Automorphisms of Fields Lemma 1 Let F be a eld. The set of automorphisms of F; Aut (F ) ; forms a group (under composition of functions). De nition 2 Let F be
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More informationON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS
Fizikos ir matematikos fakulteto Seminaro darbai, Šiaulių universitetas, 8, 2005, 5 13 ON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS Boris ADAMCZEWSKI 1, Yann BUGEAUD 2 1 CNRS, Institut Camille Jordan,
More informationOn the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers
On the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers Qun-iong Zheng, Wen-Feng Qi and Tian Tian y August 2, 20 Abstract Let M be a square-free odd integer
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationThe Truncated Pentagonal Number Theorem
The Truncated Pentagonal Number Theorem George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 16802 USA Mircea Merca Doctoral School in Applied Mathematics University
More informationA prospect proof of the Goldbach s conjecture
A prospect proof of the Goldbach s conjecture Douadi MIHOUBI LMPA, the University of M sila, 28000 M sila, Algeria mihoubi_douadi@yahoofr March 21, 2015 Abstract Based on, the well-ordering (N;
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationOn a correlation inequality of Farr
On a correlation inequality of Farr Colin McDiarmid, Department of Statistics Oxford University Abstract Suppose that each vertex of a graph independently chooses a colour uniformly from the set {1,...,
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 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 informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
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 informationPaul Glendinning and Nikita Sidorov
Mathematical Research Letters 8, 535 543 (2001) UNIQUE REPRESENTATIONS OF REAL NUMBERS IN NON-INTEGER BASES Paul Glendinning and Nikita Sidorov 1. Introduction Problems related to the expansions of real
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More information220 B. BOLLOBÁS, P. ERDŐS AND M. SIMONOVITS then every G(n, m) contains a K,,, 1 (t), where a log n t - d log 2 (1 Jc) (2) (b) Given an integer d > 1
ON THE STRUCTURE OF EDGE GRAPHS II B. BOLLOBAS, P. ERDŐS AND M. SIMONOVITS This note is a sequel to [1]. First let us recall some of the notations. Denote by G(n, in) a graph with n vertices and m edges.
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationPROBABILITY VITTORIA SILVESTRI
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8 4. Properties of Probability measures Preface These lecture notes are for the course
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationAN INEQUALITY FOR THE NORM OF A POLYNOMIAL FACTOR IGOR E. PRITSKER. (Communicated by Albert Baernstein II)
PROCDINGS OF TH AMRICAN MATHMATICAL SOCITY Volume 9, Number 8, Pages 83{9 S -9939()588-4 Article electronically published on November 3, AN INQUALITY FOR TH NORM OF A POLYNOMIAL FACTOR IGOR. PRITSKR (Communicated
More informationOn generalized Lucas sequences
Contemporary Mathematics On generalized Lucas sequences Qiang Wang This paper is dedicated to Professor G. B. Khosrovshahi on the occasion of his 70th birthday and to IPM on its 0th birthday. Abstract.
More information2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene
Introduction 1 A dierential intermediate value theorem by Joris van der Hoeven D pt. de Math matiques (B t. 425) Universit Paris-Sud 91405 Orsay Cedex France June 2000 Abstract Let T be the eld of grid-based
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 informationLifting to non-integral idempotents
Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,
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 informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationThe average dimension of the hull of cyclic codes
Discrete Applied Mathematics 128 (2003) 275 292 www.elsevier.com/locate/dam The average dimension of the hull of cyclic codes Gintaras Skersys Matematikos ir Informatikos Fakultetas, Vilniaus Universitetas,
More informationHeights of characters and defect groups
[Page 1] Heights of characters and defect groups Alexander Moretó 1. Introduction An important result in ordinary character theory is the Ito-Michler theorem, which asserts that a prime p does not divide
More informationCzechoslovak Mathematical Journal
Czechoslovak Mathematical Journal Oktay Duman; Cihan Orhan µ-statistically convergent function sequences Czechoslovak Mathematical Journal, Vol. 54 (2004), No. 2, 413 422 Persistent URL: http://dml.cz/dmlcz/127899
More informationSubset sums modulo a prime
ACTA ARITHMETICA 131.4 (2008) Subset sums modulo a prime by Hoi H. Nguyen, Endre Szemerédi and Van H. Vu (Piscataway, NJ) 1. Introduction. Let G be an additive group and A be a subset of G. We denote by
More informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More informationDisjoint Subgraphs in Sparse Graphs 1
Disjoint Subgraphs in Sparse Graphs 1 Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 OWB, UK jbav2@dpmms.cam.ac.uk
More informationLONG CYCLES IN ABC PERMUTATIONS
LONG CYCLES IN ABC PERMUTATIONS IGOR PAK AND AMANDA REDLICH Abstract. An abc-permutation is a permutation σ abc S n obtained by exchanging an initial block of length a a final block of length c of {1,...,
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 informationThe Number of Irreducible Polynomials of Even Degree over F 2 with the First Four Coefficients Given
The Number of Irreducible Polynomials of Even Degree over F 2 with the First Four Coefficients Given B. Omidi Koma School of Mathematics and Statistics Carleton University bomidi@math.carleton.ca July
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationApplications of Chromatic Polynomials Involving Stirling Numbers
Applications of Chromatic Polynomials Involving Stirling Numbers A. Mohr and T.D. Porter Department of Mathematics Southern Illinois University Carbondale, IL 6290 tporter@math.siu.edu June 23, 2008 The
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationProducts of ratios of consecutive integers
Products of ratios of consecutive integers Régis de la Bretèche, Carl Pomerance & Gérald Tenenbaum 27/1/23, 9h26 For Jean-Louis Nicolas, on his sixtieth birthday 1. Introduction Let {ε n } 1 n
More informationSign changes of Fourier coefficients of cusp forms supported on prime power indices
Sign changes of Fourier coefficients of cusp forms supported on prime power indices Winfried Kohnen Mathematisches Institut Universität Heidelberg D-69120 Heidelberg, Germany E-mail: winfried@mathi.uni-heidelberg.de
More informationReal Analysis: Homework # 12 Fall Professor: Sinan Gunturk Fall Term 2008
Eduardo Corona eal Analysis: Homework # 2 Fall 2008 Professor: Sinan Gunturk Fall Term 2008 #3 (p.298) Let X be the set of rational numbers and A the algebra of nite unions of intervals of the form (a;
More informationOff-diagonal hypergraph Ramsey numbers
Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationTHE SUM OF DIGITS OF n AND n 2
THE SUM OF DIGITS OF n AND n 2 KEVIN G. HARE, SHANTA LAISHRAM, AND THOMAS STOLL Abstract. Let s q (n) denote the sum of the digits in the q-ary expansion of an integer n. In 2005, Melfi examined the structure
More informationGENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
GENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS ARNAUD BODIN Abstract. We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results
More informationProof by Induction. Andreas Klappenecker
Proof by Induction Andreas Klappenecker 1 Motivation Induction is an axiom which allows us to prove that certain properties are true for all positive integers (or for all nonnegative integers, or all integers
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationA NEW PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS
A NEW PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ERNIE CROOT AND OLOF SISASK Abstract. We present a proof of Roth s theorem that follows a slightly different structure to the usual proofs, in that
More informationThe Distribution of Generalized Sum-of-Digits Functions in Residue Classes
Journal of umber Theory 79, 9426 (999) Article ID jnth.999.2424, available online at httpwww.idealibrary.com on The Distribution of Generalized Sum-of-Digits Functions in Residue Classes Abigail Hoit Department
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More information4 Sums of Independent Random Variables
4 Sums of Independent Random Variables Standing Assumptions: Assume throughout this section that (,F,P) is a fixed probability space and that X 1, X 2, X 3,... are independent real-valued random variables
More informationA product of γ-sets which is not Menger.
A product of γ-sets which is not Menger. A. Miller Dec 2009 Theorem. Assume CH. Then there exists γ-sets A 0, A 1 2 ω such that A 0 A 1 is not Menger. We use perfect sets determined by Silver forcing (see
More informationarxiv: v2 [math.nt] 9 Oct 2013
UNIFORM LOWER BOUND FOR THE LEAST COMMON MULTIPLE OF A POLYNOMIAL SEQUENCE arxiv:1308.6458v2 [math.nt] 9 Oct 2013 SHAOFANG HONG, YUANYUAN LUO, GUOYOU QIAN, AND CHUNLIN WANG Abstract. Let n be a positive
More informationOn Gauss sums and the evaluation of Stechkin s constant
On Gauss sums and the evaluation of Stechkin s constant William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Igor E. Shparlinski Department of Pure
More informationA regeneration proof of the central limit theorem for uniformly ergodic Markov chains
A regeneration proof of the central limit theorem for uniformly ergodic Markov chains By AJAY JASRA Department of Mathematics, Imperial College London, SW7 2AZ, London, UK and CHAO YANG Department of Mathematics,
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationA New Algorithm to Compute Terms in Special Types of Characteristic Sequences
A New Algorithm to Compute Terms in Special Types of Characteristic Sequences Kenneth J. Giuliani 1 and Guang Gong 2 1 Dept. of Mathematical and Computational Sciences University of Toronto at Mississauga
More informationContinued Fraction Digit Averages and Maclaurin s Inequalities
Continued Fraction Digit Averages and Maclaurin s Inequalities Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu Joint with Francesco Cellarosi, Doug Hensley and Jake
More informationAnalysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort
Analysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort Xi Chen Columbia University We continue with two more asymptotic notation: o( ) and ω( ). Let f (n) and g(n) are functions that map
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 informationLecture 7: February 6
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 7: February 6 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationCLIQUES IN THE UNION OF GRAPHS
CLIQUES IN THE UNION OF GRAPHS RON AHARONI, ELI BERGER, MARIA CHUDNOVSKY, AND JUBA ZIANI Abstract. Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set
More information