CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS. Nicholas Wage Appleton East High School, Appleton, WI 54915, USA.
|
|
- Peter Snow
- 5 years ago
- Views:
Transcription
1 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 CHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS Nicholas Wage Appleton East High School, Appleton, WI 54915, USA wageee@gail.co Received: 8/3/05, Revised: 5/16/06, Accepted: 5/6/06, Published: 6/1/06 Abstract In a classic paper, Evans, Pulha, and Sheehan coputed the nuber of coplete graphs of size 4 for a special class of graphs called Paley Graphs. Here we consider analogous questions for generalized Paley-type graphs. 1. Introduction The Rasey nuber R is the sallest positive integer such that any graph G with R or ore vertices contains a coplete subgraph of size or its copleent G c contains a coplete subgraph of size. The only values of for which R is known are 4. We consider a natural etension of coputing and estiating R. For a graph G, let k G denote the nuber of coplete graphs of size contained in G. Let T n := ink G + k G c 1 as G ranges over all graphs with n vertices. Note that R is the sallest n for which T n > 0. In [Erd6], Erdős conjectured that T n n n = 1 1!. However, this is not quite correct. In [Tho97], Thoason showed that for = 4, this it is no ore than 1/33 4!, rather than 1/3 4! as the conjecture predicts. For a prie p 1 od 4, let Gp denote the Paley graph with p vertices, indeed 0 through p 1. A Paley graph contains an edge y if and only if φ y = 1, where φ denotes the Legendre sybol. This notation assues that the prie p will be clear p
2 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 fro contet. For eaple, the Paley graph G5 is a pentagon. The Legendre sybol is ultiplicative and φ 1 = 1 if p 1 od 4. Therefore, φy = φ y. This equation iplies that our definition is syetric in and y, so the edges are well defined. For pries p 3 od 4, φ 1 = 1, so φ y = φy. In this case we define a generalized directed Paley graph. Note that since φ 1 = 1 for every and y, there is eactly one directed edge, creating a type of graph called a tournaent. Paley graphs have any interesting properties. They are both self-copleentary and self-siilar. Also, for the function k G + k G c on graphs with p vertices, Paley graphs are inial in certain ways. For eaple, the Rasey nuber R4 = 18; the Paley graph G17 is the only graph up to isoorphis with 17 vertices such that k 4 G + k 4 G c = 0. This inspired Evans, Pulha, and Sheehan [EPS81] to copute the eact value of k 4 Gp + k 4 Gp c using character sus. For > 4, the character sus are difficult to deterine eplicitly. We prove an asyptotic result for all. Theore 1. For pries p 1 od 4 and positive integers k Gp 1 =. p p! Doubling this value to account for the coplete graphs in its isoorphic copleent, we see that the conjecture of Erdős, while false for general graphs, is true for the Paley graphs. Moreover, the conjectured bound is eactly achieved by these graphs. For all pries p and integers t > 1 we define two other types of generalized Paley graphs, G t p and G tp. The graph G t p has an edge y if and only if both φ ty = 1 and φy t = 1. The graph G tp has an edge y if and only if at least one of these stateents is true, that is φ ty = 1 or φy t = 1. Note that G t p is a subgraph of G tp. We now define two related generalized Paley graphs. Definition 1. For a prie p and integer t, let G t p denote the graph with p vertices, indeed 0 through p 1, which contains an edge y if and only if φ ty = 1 and φy t = 1. Siilarly, let G tp denote the graph with p vertices, indeed 0 through p 1, which contains an edge y if either φ ty = 1 or φy t = 1, and contains no edge y if neither of these stateents hold true. We prove a siilar result for these generalized graphs. Theore. Let be a positive integer and t be an integer such that t 1, 0, 1 od p. Then, for pries p, and we have k G t p + k G t p c 1 = p p! 4 4
3 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 3 Siilarly, k G tp + k G tp c = 1 p p! Reark. After this work was copleted, it was brought to the author s attention that a paper of Graha, Chung, and Wilson, [CGW88], iplies these its because Paley graphs are eaples of quasi-rando graphs. However, we stress that the proofs in this paper are direct, and lead to stronger error ters in estiates. In other words, a careful analysis of these proofs leads to strong bounds for the errors between the iting values and the actual values. A key result in the work of Evans, Pulha and Sheehan is a forula that eactly coputes the nuber of coplete graphs of size 4 in a Paley graph, naely, they obtain k 4 Gp = p 1 p p where is an even integer such that p = + y. It is known that for p 1 od 4, that not only eists, but is unique up to sign. Their proof essentially follows fro an evaluation of the hypergeoetric su 3F t = φ 1 p Z/pZ y Z/pZ φφyφ1 φ1 yφ ty 4 when t = 1. One should note that while it can be shown that this is equivalent to the definition of 3 F t, it is not a priori the definition. Siilarly, we will require the su F 1 t = φ 1 p Z/pZ φφ1 φ1 t. 5 In this paper we copute a graph theoretic result siilar to that of Evans, Pulha, and Sheehan which would norally be intractable without the help of the special t evaluations of these character sus. Theore 3. Let p be a prie, and let t be a non-zero eleent of Z/pZ whose ultiplicative order is greater than 3. Let H t p represent the directed graph where y is an edge if and only if φ = φ ty = 1, and let C t p denote the nuber of 3-cycles in H t p y z. Then C t p = p 1 [ 90 3pφt + 1φt + t + p 14p + 48φ t + 7φt + 6φ1 t φ1 t 3 + 1φt t 3 + 1φ1 t + 1φ 1 + 1φ1 + t + 4φt t + 6φt t 4 + 1φt t + 3φt 4 tp 6pφ1 t 3φ tp + p 3F t 3 ] 6p1 + φ1 t F 1 t 3p1 + φt F 1 t 3.
4 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 4 Although this forula is difficult to grasp at first glance, we note that it siplifies draatically for several special t. For eaple, we obtain forulas uch like 3 in the following cases: Corollary 1. If t =, and p is a prie congruent to 5 or 7 od 4, then { p 1 19 C t p = p 6p if p 5 od 4, + y = p, and odd, p 1 19 p 6p + 5 if p 7 od 4. Corollary. If t = 1, and p is a prie congruent to 7 or 13 od 4, then { p 1 19 C t p = p 6p + 5 if p 7 od 4, p 1 19 p + p if p 13 od 4, + y = p, and odd. In Section we state the tools that will be necessary in Section 3, where we will prove the ain theores.. Preinaries We will need the following facts for our proofs. The deepest result we require is due to Weil. Weil s Theore. [BEW98], pg. 183 If p is a prie, and f Z[] is a polynoial with degree n which is not congruent odulo p to cg for any integer c and polynoial g with integer coefficients, then f φ < n 1 p. Z/pZ Reark. Fro this point onward, we oit the suation indices with the understanding that all sus are over Z/pZ unless indicated otherwise. For sall n, eplicit evaluations of these sus are siple. Clearly, if n = 0, φc = φcp. 6 Note that as runs over all the eleents of Z/pZ, so does a + b if a 0 od p. Using this fact, we can also copute the value for n = 1. Let q denote a non-zero, non-residue of
5 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 5 Z/pZ. Then φa + b = φy y=a+b = z=q 1 y φqz = φq φz z = y = φy φa + b, so φa + b = 0. 7 Finally, we prove a forula for the case n =. Proposition 1. For any prie p and polynoial f = a + b + c with roots r and s is Z/pZ, { φa p 1φa if r s od p + b + c = φa if r s od p. Proof. φa + b + c = = φa φ a r s φφ s r. Let t = s r. Note that when t 0 od p, it is clear that φ = p 1. When, t 0 od p, φφ t = φtφt 1 = φφ 1, t so the suation is equivalent to the suation when t 1 od p. Thus, this is equivalent for all p 1 non-zero values of t. Note that φ t = φ φ t t t = φ φu u= t = φ 0 = 0.
6 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 6 However, we can also show that φ t t = φ + p 1 φφ t = p φφ t. Equating these two epressions, we obtain φa φφ t = φa. For n 3 there does not appear to be a general evaluation. However, with additional achinery, certain evaluations are possible. A character χ is a ultiplicative function that aps the eleents of Z/pZ to the cople roots of unity. Let χ denote the conjugate character of χ, that is, χ = 1/χ. By convention, we say that χ0 = 0. The Legendre sybol is a siple eaple of a character. Another siple character is ɛ, the trivial character, for which ɛ = 1 unless 0 od p. A Jacobi su, for characters χ and ψ is Jχ, ψ := χψ1. 8 Additionally, we define the noralized Jacobi su for characters A and B A := B 1 JA, B p B. 9 Then, we define n+1f n A0, A 1,...A n t := p B 1,...B n p 1 A0 χ χ χ A1 χ B 1 χ An χ χt, 10 B n χ where the su is over all χ with odulus p. Additionally, we define φ, φ,...φ n+1f n t := n+1 F n ɛ,...ɛ t. 11 Although these functions are epressed in ters of Jacobi sus, it is known that the definitions in the introduction, 5 and 4, are equivalent see [Ono04]. These objects allow us to find a general forula in ters of F 1 when n = 3. Proposition. For any prie p and third-degree polynoial with leading coefficient a and distinct roots q, r, s Z/pZ, we have r s φ a q r s = φ aφq s F 1 p. q s
7 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 7 Proof. The proof of this is straightforward: φ a q r s = φa = φaφq s φ q s r s q s = φ aφq s F 1 r s q s φφ1 φ 1 r s q s p. 3. Proof of the Theores Using Weil s Theore fro the previous section, we will prove Theore 1. Proof of Theore 1. The following is a proof by induction. For = 1, k 1 Gp = p, so the theore holds. Assue the theore holds for 1. For each prie p 1 od 4 we want to write k Gp as a character su. To count the nuber of coplete -subgraphs, we look at each possible set of distinct points, and check to see if it is a coplete subgraph. Since y is an edge if and only if φ y = 1, then assuing y the equation 1+φ y conveniently returns 1 if y is an edge, and 0 otherwise. Thus, if we take the product of this equation over all pairs selected fro our points, it will return 1 if we have a coplete subgraph, and 0 otherwise. We need only su this product over all possible sets of distinct points to get k Gp. Therefore k Gp = a 1 < <a 0<i<j 1 + φa i a j. We will now anipulate this equation to ake it easier to evaluate. First we can isolate the a ters into their own suation. Second, we can replace the condition that a is greater than a 1 and siply require it to be distinct fro each of the other a i. Note that this will count each set of vertices ties, once for each possible final ter, so we ust divide by. Then, we can separate out the ters of the product not involving a, and pull out a 1 ter. The result of all these anipulations is k Gp = a 1 <...<a 1 [ 0<i<j< 1 + φa i a j a a i k=1 1 + φa a k ].
8 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 8 Note that the beginning of this equation resebles k 1 Gp. If we bound 1 a a i k=1 1 + φa a k in ters of p and, then we can pull it outside of the suation. Specifically, if we show that then p p + 1 a a i k=1 p p + k 1 1 Gp k Gp and by the inductive hypothesis we know that p p + k 1 Gp p p φa a k p + p + 1, 1 p + p p p + = p 1 p = 1!. The right hand bound evaluates to the sae it, and so k Gp 1 =, p p! which proves our result. k 1 Gp, k 1 Gp p 1 All that reains is to prove the bound for 1. We start by ultiplying out each product, getting 1 ters. The first ter is 1, which we su over the p 1 possible values of a. Now, consider an arbitrary ter fro the reaining 1 ters. It is a product of Legendre sybols of the for φa a i. Since the Legendre sybol is ultiplicative, we can for a single Legendre sybol, that is, write the ter as φfa where f is a polynoial with coefficients in Z/pZ. We know the roots of f are aong the different a i values, that f contains at least one such root, and, since all the a i are distinct, f has no repeated roots. This eans that it is not congruent od p to cg for any integer c and polynoial g with integer coefficients. Moreover, f has degree at ost 1 so by Weil s theore, we have p φ fa p. a Z/pZ
9 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 9 Note that this su, however, includes 1 ters which are not in the su we wish to evaluate, naely a 1,..., a 1. Each of these ters is between 1 and 1, so reoving the changes the su by at ost 1. Therefore, p p + 1 fa 1 p + 1 p + 1. a a i φ This bound holds for each of the 1 1 ters involving Legendre sybols, so p p + 1 which iplies 1. 1 a a i k=1 1 + φa a k p p + 1, The proof of Theore is siilar to the proof of Theore 1. This tie we eaine k G t p as a character su and use Weil s Theore to estiate it. Proof of Theore. We first prove that k G t p = 1 p p! First consider and y such that y, ty, t 1 y, t y, t y od p. There is an edge between and y in G t p if and only if φ ty = φy t = 1. Thus, { 1 + φ ty 1 + φy t 1 if y is an edge, = 14 0 otherwise. As such, we define h p := a 1 <...<a a i ta j,t a j 0<i,j i j 1 + φa i ta j. 15 This counts the nuber of coplete subgraphs in G t p that do not contain any edges where t y, t 1 y, t 1 y, t y od p. However, each Z/pZ has at ost 4 such edges, so there are at ost p of these edges total since each edge is counted twice. Each such edge is a eber of p subgraphs of size, and so we are issing at ost p p coplete subgraphs of size. Thus h p k G t p h p + p p.
10 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 10 We divide this equation by p and take the it as p tends to infinity. The p p ter has degree p 1, so it vanishes, aking the left hand side and right hand side its equal. Therefore k G t p p p = p h p p, and all that reains is to evaluate 15. In particular, we will show that h p p p = 1. 4! This will be proved by induction. If = 1, it is clearly true. Otherwise, assue the clai is true for 1. Perforing the sae anipulations as in the proof of Theore 1, we get h p = a 1<...<a a i ta j,t a j 0<i,j< i j φa i ta j a t e a i e 1 k=1 1 + φa ta k 1 + φa k ta. So, if we show that φa ta k 1 + φa k ta p 4 1 p + 5, 16 a t e a i k=1 then e p p 4 1 p Applying the inductive hypothesis, we obtain p 4 1 p + 5 h 1 p h p p p + 5 h p. h 1 p p 4 1 p + 5 = 4 1 p p 4 1 p = 1 4!. The right hand side it evaluates to the sae value and thus h 1p p 1 p h p p = 1 4!. 17
11 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 11 All that reains is to prove the bounds for 16. We ultiply out the product, getting 4 1 ters. The first ter is siply 1. There are at ost p choices for a, and at least p 5, so suing it over all of the returns a value between p 5 and p. Now, consider an arbitrary ter out of the reaining ters. It is a product of Legendre sybols of the for φa ta i and φa i ta. Since the Legendre sybol is ultiplicative, we can for a single Legendre sybol, that is, write the ter as φfa where f is a polynoial with coefficients in Z/pZ. We know f has at least one root, and we know that each of the roots of f is either of the for ta i or t 1 a i for soe i. Also, since t ±1, ta i t 1 a i, so if f had a repeated root r, we could write r = ta i = t 1 a j. However, this iplies that a j = t a i and our suation requires that we choose a i and a j such that this is false. Thus, f has no repeated roots, and this eans that it is not congruent odulo p to cg for any integer c and polynoial g with integer coefficients. Moreover, f has degree at ost, so by Weil s theore we have φ fa 3 p. a Note that the above su includes at ost 5 ters that the suations in 16 ecludes. Each of these ters is between 1 and 1, so reoving the changes the su by at ost 5. Therefore, a t e a i e φ fa p + 5. This bound holds for each of the ters involving Legendre sybols, so 16 holds. The other three calculations of p k /p are analogous. For and y where t y, t 1 y, y, ty, t y, we replace 14 with 3 φ ty φy t φ tyφy t φ ty + φy t φ tyφy t 4 1 φ ty 1 φy t The calculations follow as above. for G t p c ; for G tp; for G tp c. We now prove Theore 3, the result epressing C t p in ters of hypergeoetric functions. Proof of Theore 3. The first step is to once again write our epression for C t p as a character su. No cycle can contain 0 because φ0 = 0, and so 0 has no outgoing edges. So we
12 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 1 look at each set of three distinct, non-zero points, y, and z, and check for a cycle. Also, we ay assue that ty, y tz, and z t, because if one of these is true, there is no cycle. Note that any such group of, y, z the epression 1 + φ 1 + φ y 1 + φ z 1 + φ ty 1 + φ y tz 1 + φ z t returns 6 if, y, and z for a cycle, and 0 otherwise. If we su this over each possible set, we count each cycle three ties. Thus 3 6 C t p = 1 + φ 1 + φ y 1 + φ z z 0 0,y, y 0,z, tz z,ty,t 1 z 1 + φ ty 1 + φ y zt 1 + φ z t. Since z 0, z runs over Z/pZ as does, and yz runs over Z/pZ as y does, so we can replace by z and y by yz. We can pull the 1 + φz ter to the very front of the suation. Note that φz 0, and when φz = 1 and 1 + φz = 0, the whole inner ter is ultiplied by 0, so its accuracy is irrelevant. Thus, assuing that φz = 1 is always true within the inner suations does not change the value of the epression as a whole. Using this fact, we can entirely rid the inner suation of z and write 3 6 C t p = c 1 + φ z = p 1c. z 0 where c = y 0,1, t 0,1, t 1,y,ty 1 + φ 1 + φ y 1 + φ y t 1 + φ 1 t 1 + φ ty.
13 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 13 The 5 values does not take on are all distinct unless y = t 1 or y = t. Thus c = 1 + φ 1 + φ y 1 + φ y t 1 + φ 1 t 1 + φ ty y 0,1, t,t 1,t + 0,1 t 1 + 0,1 t 1,t y 0,t y 0,t y 0,t y 0,t y 0,t 1 + φ 1 + φ t 1 + φ 1 t 1 + φ t t φ φ 1 + φ 1 t 1 + φ 1 t φ t φ y 1 + φ y t 1 + φ ty 1 + φ y 1 + φ y t 1 + φ 1 t 1 + φ 1 ty 1 + φ y 1 + φ y t 1 + φ t 1 + φ t 1 ty 1 + φ y 1 + φ y t 1 + φ 1 ty 1 + φ y ty 1 + φ y 1 + φ y t 1 + φ ty 1 + φ 1 t y = S 0 + S 1 + S S 3 S 4 S 5 S 6 S 7, where S i corresponds to the ter in the ith row. Note that since the order of t is greater than three, t 1, t 1, t so there is no double counting. Now we wish to evaluate these 8 ters. Key to the siplification will be the following trick: if we have an epression of the for 1 + φα..., where we know α 0, then we ay assue throughout the... that φα = 1, because either this will be true, or the entire epression will be ultiplied by 0 so it is irrelevant. We will also ake use of equations 6 and 7, as well as propositions and outlined in the preinaries. With these tools it is not difficult to reduce the epressions to closed fors in ters of F 1 and 3F values. Fro this point on, all equations have been verified as accurate for sall pries less than 00 by direct coputer calculations in order to prevent arithetic errors during the anipulations. For S 0, we pull the two ters involving just y out of the inner suation, and evaluate it. Then we switch the order of suation and solve the inner one. Thus
14 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 14 S 0 = = = y 0,1, t,t 1,t y 0,t 1 + φ 1 + φ y 1 + φ y t 1 + φ 1 t 1 + φ ty 1 + φ y p 1 φ t 1 + φ y t p 1 φ t + φφ1 tφ ty p 8 φt φ1 t φ1 t 3 φ t φt t 3 φ1 t + p 3F t φt 4 tp + φ t + φ 1 + φt 3 1 p 1 + φ t 1 + φ 1 t F 1 t p 1 + φ 1 t F 1 t p 1 + φ t F 1 t 3. To evaluate S 1, we pull the ters independent of to the front of the suation. Then since the epression is ultiplied by 1 + φt, we ay use the trick entioned above to assue that φt = 1 throughout the rest of the epression. Net, we take the suation over all and subtract out the specific cases 0, 1, and t 1. Then we ultiply out the inside of the suation and evaluate it ter by ter. This shows that S 1 = = 1 + φ t 1 + φ t t 3 0 t 1,1 1 + φ 1 + φ 1 t 1 + φ φ t 1 + φ 1 t p + p F 1 t φ 1 4φ1 t φ t 7. The value of S is coputed by noting that after pulling out a φ t fro the third ter of the suand, it is siilar to the second ter and so we can pull a 1+φ t to the front using the trick above, and evaluate it in a fashion siilar to S 1. The resulting epression can be siplified further using the trick entioned above. Hence S = 1 + φ 1 t 3 0,t t 1,1 = 1 + φ 1 t φ t = 1 + φ 1 t φ t 1 + φ 1 + φ 1 t 1 + φ tφ1 t 0,t t 1,1 1 + φ 1 + φ 1 t p 8 4φ1 t φ 1. We can use a siilar trick in the evaluation of S 3. This shows that S 3 = y 0,t = 1 + φ t 1 + φ y 1 + φ y t 1 + φ ty p 9 φ 1 φ1 t 3 φ1 t φt 1 φ1 t.
15 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 15 The evaluation of S 4 involves the sae anipulations as in S 1. These result in S 4 = 1 + φ 1 t 1 + φ y 1 + φ y t 1 + φ 1 ty Likewise, we obtain = 1 + φ 1 t S 5 = = 1 + φ t 1 + φ t y 0,t p + p F 1 t 15 6φ t φt φ1 + t + t φ t t t 3 φ1 + t φt + t. y 0,t 1 + φ y 1 + φ y t 1 + φ 1 t y p + p F 1 t φ 1 4φ1 t 3 4φ1 t 4φ1 + t 4φ1 t. To evaluate S 6, we siply pull ters to the front and notice a siilarity to a previous ter. We have S 6 = y 0,t 1 + φ y 1 + φ y t 1 + φ y 1 + φ 1 ty 1 + φyφ1 t = 1 + φ 1 t = S 4. Siilarly, we have S 7 = = S 5. Adding this all up, we get C t p = y 0,t 1 + φ t and this is the desired forula. y 0,t 1 + φ y 1 + φ y t 1 + φ 1 ty 1 + φ y 1 + φ y t 1 + φ 1 t y p 1 [ 90 3pφt + 1φt + t + p 14p + 48φ t + 7φt + 6φ1 t φ1 t 3 + 1φt t 3 + 1φ1 t + 1φ 1 + 1φ1 + t + 4φt t + 6φt t 4 + 1φt t + 3φt 4 tp 6pφ1 t 3φ tp + p 3F t 3 ] 6p1 + φ1 t F 1 t 3p1 + φt F 1 t 3, Proof of Corollaries 1 and. We begin by stating two well known facts about quadratic residues. First, φ is 1 when p 1 or 7 od 8 and 1 when p 3 or 5 od 8. Second, φ3 is 1 when p = 1 or 11 od 1 and is 1 when p 5 or 7 od 1. With these it is siple to show that if p 5 or 7 od 4 and t = or p 7 or 13 od 4
16 INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A18 16 and t = 1/, then φt = φ1 t = 1. When these two facts hold, Theore 3 siplifies to C t p = p 1 [ p + p 3F t 3 5p + 3pφ φ 1 + t + t ] φ The clais follow fro the fact that see [Ono04], pg. 19 for p, 7 we have { 1 if p 3 od 4, p 3F 8 = 4 p if p 1 od 4, + y = p, and odd, p and that for p, 3 we have { 1 φ if p 3 od 4, p 3F = φ4 8 p if p 1 od 4, + y = p, and odd. p Note that we cannot apply these facts in the single case p = 7 in Corollary 1. However, it is siple to check by hand that the forula still holds in this case. Acknowledgents. This research was supported by the University of Wisconsin-Madison NSF Vigre REU progra. The author would like to thank Ken Ono and Jerey Rouse for their invaluable guidance. The author would also like to thank Karl Mahlburg for his help in proofreading, Sharon Garthwaite for her patience in helping e to use L A TEX, and the referee for nuerous helpful suggestions. References [BEW98] [CGW88] [EPS81] [Erd6] [Ono04] Bruce C. Berndt, Ronald J. Evans, and Kenneth S. Willias, Gauss and Jacobi sus, Canadian Matheatical Society Series of Monographs and Advanced Tets, John Wiley & Sons Inc., New York, 1998, A Wiley-Interscience Publication. MR MR d:1109 F. R. K. Chung, R. L. Graha, and R. M. Wilson, Quasirando graphs, Proc. Nat. Acad. Sci. U.S.A , no. 4, MR MR a:05116 R. J. Evans, J. R. Pulha, and J. Sheehan, On the nuber of coplete subgraphs contained in certain graphs, J. Cobin. Theory Ser. B , no. 3, MR MR c:05075 P. Erdős, On the nuber of coplete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl , MR MR #1937 Ken Ono, The web of odularity: arithetic of the coefficients of odular fors and q-series, CBMS Regional Conference Series in Matheatics, vol. 10, Published for the Conference Board of the Matheatical Sciences, Washington, DC, 004. MR MR c:11053 [Tho97] Andrew Thoason, Graph products and onochroatic ultiplicities, Cobinatorica , no. 1, MR MR i:05087
Polygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationM ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.
M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x
More informationAn EGZ generalization for 5 colors
An EGZ generalization for 5 colors David Grynkiewicz and Andrew Schultz July 6, 00 Abstract Let g zs(, k) (g zs(, k + 1)) be the inial integer such that any coloring of the integers fro U U k 1,..., g
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationClosed-form evaluations of Fibonacci Lucas reciprocal sums with three factors
Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationON SOME PROBLEMS OF GYARMATI AND SÁRKÖZY. Le Anh Vinh Mathematics Department, Harvard University, Cambridge, Massachusetts
#A42 INTEGERS 12 (2012) ON SOME PROLEMS OF GYARMATI AND SÁRKÖZY Le Anh Vinh Matheatics Departent, Harvard University, Cabridge, Massachusetts vinh@ath.harvard.edu Received: 12/3/08, Revised: 5/22/11, Accepted:
More informationCharacterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone
Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationON REGULARITY, TRANSITIVITY, AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV
ON REGULARITY TRANSITIVITY AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV Departent of Coputational & Theoretical Sciences Faculty of Science International Islaic University
More informationExponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus
ACTA ARITHMETICA XCII1 (2000) Exponential sus and the distribution of inversive congruential pseudorando nubers with prie-power odulus by Harald Niederreiter (Vienna) and Igor E Shparlinski (Sydney) 1
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationON THE 2-PART OF THE BIRCH AND SWINNERTON-DYER CONJECTURE FOR QUADRATIC TWISTS OF ELLIPTIC CURVES
ON THE 2-PART OF THE BIRCH AND SWINNERTON-DYER CONJECTURE FOR QUADRATIC TWISTS OF ELLIPTIC CURVES LI CAI, CHAO LI, SHUAI ZHAI Abstract. In the present paper, we prove, for a large class of elliptic curves
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationMODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m)
#A37 INTEGERS 8 (208) MODULAR HYPERBOLAS AND THE CONGRUENCE ax x 2 x k + bx k+ x k+2 x 2k c (od ) Anwar Ayyad Departent of Matheatics, Al Azhar University, Gaza Strip, Palestine anwarayyad@yahoo.co Todd
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS
#A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa jkritsch@iastateedu Adriana Salerno
More informationA REMARK ON PRIME DIVISORS OF PARTITION FUNCTIONS
International Journal of Nuber Theory c World Scientific Publishing Copany REMRK ON PRIME DIVISORS OF PRTITION FUNCTIONS PUL POLLCK Matheatics Departent, University of Georgia, Boyd Graduate Studies Research
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationINDEPENDENT SETS IN HYPERGRAPHS
INDEPENDENT SETS IN HYPERGRAPHS Abstract. Many iportant theores and conjectures in cobinatorics, such as the theore of Szeerédi on arithetic progressions and the Erdős-Stone Theore in extreal graph theory,
More informationJacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a
Jacobi sybols efiitio Let be a odd positive iteger If 1, the Jacobi sybol : Z C is the costat fuctio 1 1 If > 1, it has a decopositio ( as ) a product of (ot ecessarily distict) pries p 1 p r The Jacobi
More informationROTH S THEOREM ON ARITHMETIC PROGRESSIONS
ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ADAM LOTT ABSTRACT. The goal of this paper is to present a self-contained eposition of Roth s celebrated theore on arithetic progressions. We also present two
More informationPage 1 Lab 1 Elementary Matrix and Linear Algebra Spring 2011
Page Lab Eleentary Matri and Linear Algebra Spring 0 Nae Due /03/0 Score /5 Probles through 4 are each worth 4 points.. Go to the Linear Algebra oolkit site ransforing a atri to reduced row echelon for
More informationMULTIPLAYER ROCK-PAPER-SCISSORS
MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction
More information#A62 INTEGERS 16 (2016) REPRESENTATION OF INTEGERS BY TERNARY QUADRATIC FORMS: A GEOMETRIC APPROACH
#A6 INTEGERS 16 (016) REPRESENTATION OF INTEGERS BY TERNARY QUADRATIC FORMS: A GEOMETRIC APPROACH Gabriel Durha Deartent of Matheatics, University of Georgia, Athens, Georgia gjdurha@ugaedu Received: 9/11/15,
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationVINOGRADOV S THREE PRIME THEOREM
VINOGRADOV S THREE PRIME THEOREM NICHOLAS ROUSE Abstract I sketch Vinogradov s 937 proof that every sufficiently large odd integer is the su of three prie nubers The result is dependent on nuerous interediate
More informationTHE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n
THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra
More informationBernoulli numbers and generalized factorial sums
Bernoulli nubers and generalized factorial sus Paul Thoas Young Departent of Matheatics, College of Charleston Charleston, SC 29424 paul@ath.cofc.edu June 25, 2010 Abstract We prove a pair of identities
More informationNote on generating all subsets of a finite set with disjoint unions
Note on generating all subsets of a finite set with disjoint unions David Ellis e-ail: dce27@ca.ac.uk Subitted: Dec 2, 2008; Accepted: May 12, 2009; Published: May 20, 2009 Matheatics Subject Classification:
More informationAcyclic Colorings of Directed Graphs
Acyclic Colorings of Directed Graphs Noah Golowich Septeber 9, 014 arxiv:1409.7535v1 [ath.co] 6 Sep 014 Abstract The acyclic chroatic nuber of a directed graph D, denoted χ A (D), is the iniu positive
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationOn Certain C-Test Words for Free Groups
Journal of Algebra 247, 509 540 2002 doi:10.1006 jabr.2001.9001, available online at http: www.idealibrary.co on On Certain C-Test Words for Free Groups Donghi Lee Departent of Matheatics, Uni ersity of
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationarxiv: v2 [math.nt] 5 Sep 2012
ON STRONGER CONJECTURES THAT IMPLY THE ERDŐS-MOSER CONJECTURE BERND C. KELLNER arxiv:1003.1646v2 [ath.nt] 5 Sep 2012 Abstract. The Erdős-Moser conjecture states that the Diophantine equation S k () = k,
More informationSERIES, AND ATKIN S ORTHOGONAL POLYNOMIALS. M. Kaneko and D. Zagier
SUPERSINGULAR j-invariants, HYPERGEOMETRIC SERIES, AND ATKIN S ORTHOGONAL POLYNOMIALS M. Kaneko and D. Zagier 1. Introduction. An elliptic curve E over a field K of characteristic p > 0 is called supersingular
More informationarxiv: v1 [math.gr] 18 Dec 2017
Probabilistic aspects of ZM-groups arxiv:7206692v [athgr] 8 Dec 207 Mihai-Silviu Lazorec Deceber 7, 207 Abstract In this paper we study probabilistic aspects such as (cyclic) subgroup coutativity degree
More informationALGEBRA REVIEW. MULTINOMIAL An algebraic expression consisting of more than one term.
Page 1 of 6 ALGEBRAIC EXPRESSION A cobination of ordinary nubers, letter sybols, variables, grouping sybols and operation sybols. Nubers reain fixed in value and are referred to as constants. Letter sybols
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationOrder Ideals in Weak Subposets of Young s Lattice and Associated Unimodality Conjectures
Annals of Cobinatorics 8 (2004) 1-0218-0006/04/020001-10 DOI ********************** c Birkhäuser Verlag, Basel, 2004 Annals of Cobinatorics Order Ideals in Weak Subposets of Young s Lattice and Associated
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationA Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science
A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationQuadratic Reciprocity. As in the previous notes, we consider the Legendre Symbol, defined by
Math 0 Sring 01 Quadratic Recirocity As in the revious notes we consider the Legendre Sybol defined by $ ˆa & 0 if a 1 if a is a quadratic residue odulo. % 1 if a is a quadratic non residue We also had
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationCHAPTER 8 CONSTRAINED OPTIMIZATION 2: SEQUENTIAL QUADRATIC PROGRAMMING, INTERIOR POINT AND GENERALIZED REDUCED GRADIENT METHODS
CHAPER 8 CONSRAINED OPIMIZAION : SEQUENIAL QUADRAIC PROGRAMMING, INERIOR POIN AND GENERALIZED REDUCED GRADIEN MEHODS 8. Introduction In the previous chapter we eained the necessary and sufficient conditions
More informationOn the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs
On the Inapproxiability of Vertex Cover on k-partite k-unifor Hypergraphs Venkatesan Guruswai and Rishi Saket Coputer Science Departent Carnegie Mellon University Pittsburgh, PA 1513. Abstract. Coputing
More informationStandard & Canonical Forms
Standard & Canonical Fors CHAPTER OBJECTIVES Learn Binary Logic and BOOLEAN AlgebraLearn How to ap a Boolean Expression into Logic Circuit Ipleentation Learn How To anipulate Boolean Expressions and Siplify
More informationMoment of Inertia. Terminology. Definitions Moment of inertia of a body with mass, m, about the x axis: Transfer Theorem - 1. ( )dm. = y 2 + z 2.
Terinology Moent of Inertia ME 202 Moent of inertia (MOI) = second ass oent Instead of ultiplying ass by distance to the first power (which gives the first ass oent), we ultiply it by distance to the second
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationEgyptian Mathematics Problem Set
(Send corrections to cbruni@uwaterloo.ca) Egyptian Matheatics Proble Set (i) Use the Egyptian area of a circle A = (8d/9) 2 to copute the areas of the following circles with given diaeter. d = 2. d = 3
More informationMA304 Differential Geometry
MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question
More informationBeyond Mere Convergence
Beyond Mere Convergence Jaes A. Sellers Departent of Matheatics The Pennsylvania State University 07 Whitore Laboratory University Park, PA 680 sellers@ath.psu.edu February 5, 00 REVISED Abstract In this
More informationEstimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples
Open Journal of Statistics, 4, 4, 64-649 Published Online Septeber 4 in SciRes http//wwwscirporg/ournal/os http//ddoiorg/436/os4486 Estiation of the Mean of the Eponential Distribution Using Maiu Ranked
More informationG G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k
12 VICTORIA HOSKINS 3. Algebraic group actions and quotients In this section we consider group actions on algebraic varieties and also describe what type of quotients we would like to have for such group
More informationTHE ROTATION NUMBER OF PRIMITIVE VE SEQUENCES. Citation Osaka Journal of Mathematics. 52(3)
Title THE ROTATION NUMBER OF PRIMITIVE VE SEQUENCES Author(s) Suyaa, Yusuke Citation Osaka Journal of Matheatics 52(3) Issue 205-07 Date Tet Version publisher URL http://hdlhandlenet/094/57655 DOI Rights
More informationDescent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,
Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu
More informationADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE
ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationBernoulli Numbers. Junior Number Theory Seminar University of Texas at Austin September 6th, 2005 Matilde N. Lalín. m 1 ( ) m + 1 k. B m.
Bernoulli Nubers Junior Nuber Theory Seinar University of Texas at Austin Septeber 6th, 5 Matilde N. Lalín I will ostly follow []. Definition and soe identities Definition 1 Bernoulli nubers are defined
More informationVARIABLES. Contents 1. Preliminaries 1 2. One variable Special cases 8 3. Two variables Special cases 14 References 16
q-generating FUNCTIONS FOR ONE AND TWO VARIABLES. THOMAS ERNST Contents 1. Preliinaries 1. One variable 6.1. Special cases 8 3. Two variables 10 3.1. Special cases 14 References 16 Abstract. We use a ultidiensional
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More information(a) As a reminder, the classical definition of angular momentum is: l = r p
PHYSICS T8: Standard Model Midter Exa Solution Key (216) 1. [2 points] Short Answer ( points each) (a) As a reinder, the classical definition of angular oentu is: l r p Based on this, what are the units
More informationCongruences and Modular Arithmetic
Congruenes and Modular Aritheti 6-17-2016 a is ongruent to b od n eans that n a b. Notation: a = b (od n). Congruene od n is an equivalene relation. Hene, ongruenes have any of the sae properties as ordinary
More informationAlgebraic Montgomery-Yang problem: the log del Pezzo surface case
c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang
More informationA Note on Online Scheduling for Jobs with Arbitrary Release Times
A Note on Online Scheduling for Jobs with Arbitrary Release Ties Jihuan Ding, and Guochuan Zhang College of Operations Research and Manageent Science, Qufu Noral University, Rizhao 7686, China dingjihuan@hotail.co
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationTHE CONSTRUCTION OF GOOD EXTENSIBLE RANK-1 LATTICES. 1. Introduction We are interested in approximating a high dimensional integral [0,1]
MATHEMATICS OF COMPUTATION Volue 00, Nuber 0, Pages 000 000 S 0025-578(XX)0000-0 THE CONSTRUCTION OF GOOD EXTENSIBLE RANK- LATTICES JOSEF DICK, FRIEDRICH PILLICHSHAMMER, AND BENJAMIN J. WATERHOUSE Abstract.
More informationAyşe Alaca, Şaban Alaca and Kenneth S. Williams School of Mathematics and Statistics, Carleton University, Ottawa, Ontario, Canada. Abstract.
Journal of Cobinatorics and Nuber Theory Volue 6, Nuber,. 17 15 ISSN: 194-5600 c Nova Science Publishers, Inc. DOUBLE GAUSS SUMS Ayşe Alaca, Şaban Alaca and Kenneth S. Willias School of Matheatics and
More informationTABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS. By William W. Chen
TABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS By Willia W. Chen The distribution of the non-null characteristic roots of a atri derived fro saple observations
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More informationA := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.
59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationConstruction of the Electronic Angular Wave Functions and Probability Distributions of the Hydrogen Atom
Construction of the Electronic Angular Wave Functions and Probability Distributions of the Hydrogen Ato Thoas S. Kuntzlean Mark Ellison John Tippin Departent of Cheistry Departent of Cheistry Departent
More informationFunctions: Review of Algebra and Trigonometry
Sec. and. Functions: Review o Algebra and Trigonoetry A. Functions and Relations DEFN Relation: A set o ordered pairs. (,y) (doain, range) DEFN Function: A correspondence ro one set (the doain) to anther
More informationBiased statistics for traces of cyclic p-fold covers over finite fields
Biased statistics for traces of cyclic p-fold covers over finite fields Alina Bucur, Chantal David, Brooke Feigon and Matilde Lalín February 25, 2010 Abstract In this paper, we discuss in ore detail soe
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationLeft-to-right maxima in words and multiset permutations
Left-to-right axia in words and ultiset perutations Ay N. Myers Saint Joseph s University Philadelphia, PA 19131 Herbert S. Wilf University of Pennsylvania Philadelphia, PA 19104
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationHermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s
International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More information