Left-to-right maxima in words and multiset permutations
|
|
- Sheila Byrd
- 5 years ago
- Views:
Transcription
1 Left-to-right axia in words and ultiset perutations Ay N. Myers Saint Joseph s University Philadelphia, PA <ayers@sju.edu> Herbert S. Wilf University of Pennsylvania Philadelphia, PA <wilf@ath.upenn.edu> March 23, 2007 Abstract We extend classical theores of Rényi by finding the distributions of the nubers of both weak and strong left-to-right axia a.k.a. outstanding eleents in words over a given alphabet and in perutations of a given ultiset. 1 Introduction Given a sequence w = w 1 w 2... w n of ebers of a totally ordered set, we say j is a strongly outstanding eleent of w if whenever i < j we have w i < w j. In this case we call w j a strongly outstanding value. We say j is a weakly outstanding eleent if w i w j whenever i < j, and call w j a weakly outstanding value. In this paper we will explore the contexts in which w is a perutation, a ultiset perutation, or a word over soe finite alphabet. A faous theore of Rényi [12] see also [1] states that the nuber of perutations of [k] with r strongly outstanding eleents [ ] is equal to the nuber of such perutations with r k cycles, the latter being given by, the unsigned Stirling nuber of the first kind. r In this paper we investigate additional properties of the outstanding eleents and values of perutations, and extend the to ultiset perutations and words on [k] = {1, 2,..., k}. An interesting sidelight to our results is that we obtain a proof of Gauss s celebrated 2 F 1 evaluation by coparing two fors of one of our generating functions, in section 6 below. 1
2 2 Suary of results 2.1 Multiset perutations For perutations 1 we have the following results. Theore 1 Let M = {1 a 1, 2 a 2,..., k a k } be a ultiset with N = a1 + a a k, and let fm, r denote the nuber of perutations of M that contain exactly r strongly outstanding eleents. Then F M x = def This result is also found in [4]. r fm, rx r = N 1!a kx a 1!a 2!... a k! P M x = a kx N k a i x. 1 N a 1 + a a i Corollary 1 The generating function for the probability that a randoly selected perutation of M has exactly r strongly outstanding eleents is k 1 1 +, 2 a i x N a 1 + a a i and the average nuber of strongly outstanding eleents aong perutations of M is k P M1 a i =. 3 a i + a i a k Theore 2 The generating function for the nuber of perutations of M that contain exactly t weakly outstanding eleents is given by where G M x = φ N,a1 xφ N a1,a 2 x... φ N a1 a k 2,a k 1 xx a k 4 φ N,a x = a N 1 x. a =0 Corollary 2 The average nuber of weakly outstanding eleents aong perutations of M is k a i a i+1 + a i a k Corollary 3 Let A = ax i {a i }. The aount by which the average nuber of weakly outstanding eleents exceeds the average nuber of strongly outstanding eleents is AA 1. π Note that for perutations, all outstanding eleents and values are strongly outstanding. 2
3 2.2 Words The next theore involves Stirling nubers of the second kind, denoted by { n }. This is defined as the nuber of ways to partition a set of n eleents into nonepty subsets. Theore 3 The nuber of n-letter words over an alphabet of k letters which have exactly r strongly outstanding eleents is given by fn, k, r = [ ]{ } k n, 6 r and the average nuber of strongly outstanding eleents aong such words is H k = k + o1 n. Theore 4 The generating function for the nuber gn, k, t of n-letter words over an alphabet of k letters which have exactly t weakly outstanding eleents is given by G k n, x = def k 1 k 1 gn, k, tx t = 1 k 1 t x + t n t t t=0 x + t 1 k 1 and the average nuber of weakly outstanding eleents aong these words is n n k 1 k + H k 1 + O. k, 7 Next we introduce the notion of a teplate for words on [k]. A perutation of 5 or ore letters atches the teplate Y N Y Y, for exaple, if 1, 4, and 5 are outstanding eleents, 2 is not an outstanding eleent, and 3 is unconstrained. For exaple the perutation atches this teplate. In this case we think of the letters of the teplate Y, N, * as representing yes, no, and unconstrained, respectively. We generalize the Y and N constraints to S, W, S, and O; where S indicates a strongly outstanding eleent, W a weakly outstanding eleent, S indicates the absence of a strongly outstanding, and O the absence of an outstanding eleent. We provide an algorith for producing the generating function for the nuber of words that atch a given teplate. When the word is a perutation, we have: Theore 5 Let τ be a given teplate of length at ost n, and let τ j denote the letter that appears in position j, counting fro the left, of the teplate τ. Since every eleent of a perutation is either strongly outstanding or not outstanding, the letters of τ are chosen 3
4 fro {Y, N, }. The probability that a perutation of at least n letters atches the teplate τ is j j. 8 j:τ j = N The corresponding result for words is: j:τ j = Y Theore 6 Let τ be a word on {S, W,, S, O}. Suppose F k, τ, x = k 1 fk, τxk is the ordinary generating function for fk, τ, the nuber of words over the alphabet [k] that atch the teplate τ. Consider the adjunction of one new sybol, A {S, W,, S, O}, at the right end of τ. The generating function, F k, τa, x can be obtained fro F k, τ, x by applying an operator Ω A, i.e., where 3 Notation F k, τa, x = Ω A F k, τ, x, Ω S F k, τ, x = xf k, τ, x/1 x, 9 Ω W F k, τ, x = F k, τ, x/1 x, 10 Ω F k, τ, x = x d F k, τ, x, 11 dx Ω S F k, τ, x = x d dx x F k, τ, x, and 12 1 x Ω O F k, τ, x = x d dx 1 F k, τ, x x In the following sections we will count perutations, ultiset perutations, and words that contain a given nuber of strongly or weakly outstanding eleents. Let fk, r denote the nuber of perutations of [k] = {1, 2,..., k} that contain exactly r strongly outstanding eleents. For a ultiset M = {1 a 1, 2 a 2,..., k a k }, let fm, r denote the nuber of perutations of M that contain exactly r strongly outstanding eleents. Finally let fn, k, r denote the nuber of n letter words on the alphabet [k] that contain exactly r strongly outstanding eleents. When counting weakly outstanding eleents, we use g in place of f and t in place of r. Using the above notation, we define the following generating functions for strongly outstanding eleents: F k x = r fk, rxr, F M x = r fm, rxr, and F k n, x = 4
5 r fn, k, rxr. We define analogous generating functions for weakly outstanding eleents and use G in place of F. 4 Strongly outstanding eleents of ultiset perutations In this section we establish Theore 1 and its corollaries. Given a ultiset M = {1 a 1, 2 a 2,..., k a k }, let N = j a j. We construct the perutations of M that have exactly r strongly outstanding eleents as follows. We have N slots into which we will put the N eleents of M to ake these perutations. Take the a 1 1 s that are available and place the in soe a 1 -subset of the N slots that are available. There are two cases now. If the set of slots that we chose for the 1 s did not include the first leftost slot, then we can fill in the reaining slots with any perutation of the ultiset M/1 a 1 that has exactly r strongly outstanding eleents. On the other hand, if we did place a 1 into the first slot, then after placing all of the 1 s, the reaining slots can be filled in with any perutation of the ultiset M/1 a 1 that has exactly r 1 strongly outstanding eleents. Recall that fm, r denotes the nuber of perutations of the ultiset M that have exactly r strongly outstanding eleents. The arguent in the preceding paragraph shows that When we define N fm, r = a 1 N 1 a 1 1 fm/1 a 1, r + F M x = r fm, rx r, N 1 a 1 1 fm/1 a 1, r 1. we have the recurrence F M x = = N N 1 N 1 + x F M/1 a 1 x a 1 a 1 1 a 1 1 N 1 N 1 + x F M/1 a 1 x a 1 1 a 1 This shows that the generating polynoial resolves into linear factors over the integers. 5
6 Indeed we get the explicit for N 1 N 1 N a1 1 N a1 1 F M x = + x + x... a 1 a 1 1 a 2 a 2 1 k N a1 a 2 a i 1 1 N a1 a 2 a i 1 1 = + x a i a i 1 = N 1!a k 1 kx a i x 1 + a 1!a 2!... a k! N a 1 + a a i This gives us Theore 1. Its corollaries follow by obvious calculations. We note that this result was previously obtained by Cléent, Flajolet, and Vallée [4] in the context of binary search trees. Since the generating polynoial has real zeros only, the probabilities {p r M} are uniodal and log concave. By Darroch s Theore [5], the value of r for which p r M is axiu differs fro P M 1 of 3 above by at ost 1. 5 Weakly outstanding eleents of ultiset perutations Next we prove Theore 2. Consider gm, t, the nuber of perutations of M = {1 a 1, 2 a 2,..., k a k } that have exactly t weakly outstanding eleents, and G M x = t gm, txt. To find gm, t, suppose the perutation begins with a block of exactly 0 1 s. Since the value that follows the last 1 in the block is not available for a 1, there reain N 1 slots into which the reaining 1 s can be put, in N 1 a 1 ways. Once all of the 1 s have been placed, if the reaining perutation of the ultiset M/1 a 1 has exactly t weakly outstanding eleents then the whole thing will have t weakly outstanding eleents. Hence we have gm, t = N 1 gm/1 a 1, t, a 0 1 if M/1 a 1 is nonepty, whereas if M = 1 a 1 only, then gm, t = δ t,a1. If we ultiply by x t and su on t we find that { } N 1 G M x = x G M/1 a 1 x, a 1 0 6
7 except that if M = 1 a 1 only, then G M x = x a 1. So if we write then we have φ N,a x = a N 1 x, a =0 G M x = φ N,a1 xφ N a1,a 2 x... φ N a1 a k 2,a k 1 xx a k. 14 This gives 4. The two sus φ N,a 1 = n a and φ N,a 1 = n a /n a+1 are eleentary, and they iply that φ N,a 1/φ N,a1 = 1/n a+1. Then logarithic differentiation of 14 and evaluation at x = 1 shows that the average nuber of weakly outstanding eleents in perutations of M is k a i a i+1 + a i a k Let A = ax i {a i }. If we copare 15 and 3 we find that the aount by which the average nuber of weakly outstanding eleents exceeds the average nuber of strongly outstanding eleents is k a i a i+1 + a i a k + 1 a i a i + a i a k = k AA 1 a i a i 1 a i+1 + a i a k + 1a i + a i a k k 1 k i + 1 π2 AA This estiate is best possible when A = 1, i.e., when every eleent occurs just once. 6 Strongly outstanding eleents of words Next we investigate fn, k, r, the nuber of n-letter words over an alphabet of k letters that have exactly r strongly outstanding eleents. In so doing we will prove Theore 3. Note first that the nuber of strongly outstanding eleents of such a word depends only on the perutation of the distinct letters appearing in the word that is achieved by the first 7
8 appearances of each of those letters, because a value j can be strongly outstanding in a word w only if it is the first i.e., leftost occurrence of j in w. Hence associated with each n-letter word w over an alphabet of k letters which has exactly r strongly outstanding eleents there is a triple S, P, σ consisting of 1. a subset S [k], which is the set of all of the distinct letters that actually appear in w, and 2. a partition P of the set [n] into = S classes, naely the ith class of P consists of the set of positions in the word w that contain the ith letter of S, and 3. a perutation σ S, = S, which is the sequence of first appearances in w of each of the k letters that occur in w. σ will have r strongly outstanding eleents. Conversely, if we are given such a triple S, P, σ, we uniquely construct an n-letter word w over [k] with exactly r strongly outstanding eleents as follows. First arrange the classes of the partition P in ascending order of their sallest eleents. Then perute the set S according to the perutation σ, yielding a list S. In all of the positions of w that are described by the first class of the partition P i.e., the class in which the letter 1 lives we put the first letter of S, etc., to obtain the required word w. Thus the nuber of words that we are counting is equal to the nuber of these triples, viz. k [ r ]{ n }. 16 fn, k, r = It is noteworthy that three flavors of Pascal-triangle-like nubers occur in this forula. Let ρn, k denote the average nuber of strongly outstanding eleents aong the n- letter words that can be fored fro an alphabet of k letters. To find ρn, k for large n, we have first that fn, k, r = { } k n [ ] = { } k n! r r r { } k n! k n n k, for large n, where we have used the facts that { n } n /! and [ ] r r =!. Siilarly, rfn, k, r = { } k n [ ] r = { } k n!h r r r { } k n!h k n H n k H k, 8
9 where we have used the additional fact that r r[ r ] =!H. If we divide these last two equations we find that li ρn, k = H k = n k. The proof of Theore 3 is coplete. Fro eq. 16 we can use the standard generating functions for the two kinds of Stirling nubers to show that k fn, k, ry r t n r = 1 + y. 1 jt r,n But fro 16 we also have fn, k, ry r t n r = [ ] k l y r { } n t n l r t l r,n l,r n = [ ] k l y r t l l r t 1 t1 2t... 1 lt l,r k l 1 y l t + j t l 1 t1 2t... 1 lt = l = l j=0 l k l j=1 j=1 y + j 1t. 1 jt Coparison of these two evaluations shows that we have found and proved the following identity: l k y + j 1t k = 1 + y. 17 l 1 jt 1 jt l j=1 j=1 But Gauss had done it earlier, since it is the evaluation of his well known [ ] k y/t 2F 1 1 1/t 1. 7 A calculus of teplates 7.1 Teplates and perutations In this section we prove Theores 5 and 6. We begin by establishing equation 8, which appeared first in [13]. 9
10 This result is a generalization of a theore of R. V. Kadison [9], who discovered the case where the teplate is NN NY, and proved it by the sieve ethod. To ake this paper self-contained, we include a proof of 8. Our proof is by induction on n. Suppose it has been proved that, for all teplates τ of at ost n 1 letters, the nuber of perutations of n 1 letters that atch τ is correctly given by 8, and let τ be soe teplate of n letters. If in fact the length of τ is < n then the forula 8 gives the sae result as it did when applied to n 1-perutations, which is the correct probability. In the case where the length of τ is n and the rightost letter of τ is Y, every atching perutation σ ust have σn = n. Hence the nuber of atching perutations is n 1!p n 1 τ, where τ consists of the first n 1 letters of τ, which is equal to n!p n τ, proving the result in this case. In the last case, where the length of τ is n and the rightost letter of τ is N, the probability of a perutation atch ust be p n 1 τ 1 1/n, since this case and the preceding one are exhaustive of the possibilities and the preceding one had a probability of p n 1 τ /n. But this agrees with the forula 8 for this case, copleting the proof of the theore. 7.2 Teplates on words Next we include results for words that are analogous to those we found for perutations. A preview of the kind of results that we will get is the following. Suppose F k, τ, x = k 1 fk, τxk, where fk, τ denotes the nuber of words over the alphabet [k] that atch the teplate τ. Then consider the adjunction of one new sybol, let s call it A, at the right end of τ. Then we will show that the new generating function, F k, τa, x can be obtained fro F k, τ, x by applying a certain operator Ω A. That is, F k, τa, x = Ω A F k, τ, x. The operator Ω A will depend only on the letter A that is being adjoined to the teplate τ. Hence, to find the generating function for a coplete teplate τ, we begin with F k,, x = 1/1 x, and we read the teplate τ fro left to right. Corresponding to each letter in τ we apply the appropriate operator Ω. When we have finished scanning the entire teplate the result will be the desired generating function for τ. The letters that we will allow in a teplate τ = τ 1 τ 2... τ l are {S, W, O,, S, O}. Their eanings are that if w = w 1... w l is a word of length l over the alphabet [k] then for w to atch the teplate it ust be that w i is 1. a strongly outstanding value whenever τ i = S, or 10
11 2. a weakly outstanding value whenever τ i = W, or 3. unrestricted whenever τ i =, or 4. not a strongly outstanding value whenever τ i = S, or 5. neither a weakly nor a strongly outstanding value whenever τ i = O. Let s consider what happens to the count of atching words when we adjoin one of these letters to a teplate whose counting function is known. Let fk, τ denote the nuber of words of length l = lengthτ, on the alphabet [k] that atch the teplate τ. 1. If w is one of the words counted by fk, τs, and if we delete its last letter, we obtain one of the words that is counted by fi, τ for soe 1 i < k, and consequently k 1 fk, τs = fi, τ. If F k, τ, x = k 1 fk, τxk, then we have F k, τs, x = x F k, τ, x. 1 x Thus we have found the operator Ω S, and it is defined by Ω S F x = xf x/1 x. This is equation Siilarly, if w is one of the words counted by fk, τw, and if we delete its last letter, we obtain one of the words that is counted by fi, τ for soe 1 i k, and consequently k fk, τw = fi, τ. If F k, τ, x = k 1 fk, τxk, then we have F k, τw, x = F k, τ, x 1 x. Thus we have found the operator Ω W, and it is defined by Ω W F x = F x/1 x. This is
12 Since the arguent in each case is easy and siilar to the above we will siply list the reaining three operators, equations 11, 12, and 13, as follows: Ω F x = x d dx F x Ω S F x = x d dx x F x 1 x Ω O F x = x d dx 1 F x 1 x The successive applications of these operators can be started with the generating function for the epty teplate, F, x = 1 1 x. Thus to find the generating function for soe given teplate τ, we begin with the function 1/1 x, and then we read one letter at a tie fro τ, fro left to right, and apply the appropriate one of the five operators that are defined above. As an exaple, how any words of length 3 over the alphabet [k] atch the teplate τ = S S? This is the coefficient of x k in 1 F S S, x = Ω S Ω Ω S 1 x = x d dx = x + 3x2 1 x 4 x 1 x x d x 1 dx 1 x 1 x The required nuber of words over a k letter alphabet that atch the teplate τ is the coefficient of x k in the above. Since these generating functions will always be of the for P t/1 x r, with P a polynoial, we note for ready reference that [x k ] { j a } jx j 1 x r = j r + k j 1 a j. r 1 In the exaple above we have r = 4, a 1 = 1, a 2 = 3, so k + 2 k + 1 fk, S S =
13 8 Weakly outstanding eleents of words Finally we prove Theore 4. Recall that gn, k, t is the nuber of n-letter words over the alphabet [k] which have exactly t weakly outstanding eleents. Consider just those words w that contain exactly 1 s, < n. If w begins with a block of exactly l 1 s, 0 l then by deleting all of the 1 s in w we find that the reaining word is one with n letters over an alphabet of k 1 letters and it has exactly t l weakly outstanding eleents. Thus we have the recurrence gn, k, t = n 1 =0 n l 1 l When we set G k n, x = t gn, k, txt, we find that G k n, x = n 1 =0 l=0 k n l 1 l gn, k 1, t l + δ t,n. x l G k 1 n, x + x n. n, k 1; G 0 n, x = 0 18 To discuss this recurrence, let = x be the usual forward difference operator on x, i.e., x fx = fx + 1 fx. Then fro the recurrence above we discover that x 1 G 1 n, x = x n ; G 2 n, x = x x n x 1; G 3 n, x = 2 xx n. 2 This leads to the conjecture that G k n, x = k 1 x = t=0 { } x 1 x n k 1 k 1 k 1 1 k 1 t x + t n t x + t 1 k 1 To prove this it would suffice to show that the function G k n, x above satisfies the recurrence 18. If we substitute the conjectured for of G k into the right side of 18 we find that the sus over l and can easily be done, and the identity to be proved now reads as k 2 k 2 1 k t t t=0 x + t 1 k 2 k 1 k 1 = 1 k 1 t x + t n t t=0 13. x + t t + 1 x + t + 1n x n + x n x + t 1 k 1.
14 If we replace the duy index of suation t by t 1 on the left side, the identity to be proved becoes k 1 k 2 x + t 2 x + t 1 1 k t 1 x + t n x n + x n t 1 k 2 t t=1 k 1 k 1 = 1 k 1 t x + t n t t=0 x + t 1 k 1 It is now trivial to check that for 1 t k 1, the coefficient of x + t n on the left side is equal to that coefficient on the right. If we cancel those ters and divide out a factor x n fro what reains, the identity to be proved becoes k 1 k 2 x + t 2 x + t 1 1 k t 1 t 1 k 2 t t=1. x = 1 k 1. k 1 The su that appears above is a special case of Gauss s original 2 F 1 [a, b; c 1] evaluation, and the proof of 7 is coplete. A straightforward calculation now shows that the average nuber of weakly outstanding eleents aong n-letter words over the alphabet [k] is = n n k 1 k + H k 1 + O. k 9 Related results In the literature, the outstanding eleents and values of sequences go by various naes: éléents salients Rényi, left-to-right axia, records, and others; and appear in several different contexts and results, for exaple: It is well known that the probability of obtaining at least r strongly outstanding eleents in a sequence X 1, X 2,..., X n of n independent, identically distributed, continuous rando variables approaches 1 as n. Glick s survey [7], for exaple, contains this result and those that follow in this paragraph and the next. Let Y i = 1 if i is a strongly outstanding eleent of such a sequence, and 0 otherwise. The expected value is E[Y i ] = 1/i and the variance is V [Y i ] = 1/i 1/i 2. The nuber of strongly outstanding eleents in a sequence of continuous iid rando variables is therefore R i = i Y i with expectation E[R i ] = n 1/i and variance V [R i ] = n 1/i n 1/i2. Note n 1/i lnn Euler s constant = , and n 1/i2 π 2 /6 = for n. Let N r denote the r th outstanding eleent in a sequence of n iid continuous rando variables. Then N 1 = 1, E[N r ] = for r 2, and E[N r+1 N r ] = as well. The 14
15 probability P [N 2 = i 2, N 3 = i 3,..., N r = i r ] = 1/i 2 1i i r 1i r for 1 < i 2 < i 3 < < i r. The probability that an iid[ sequence ] of n continuous rando variables has k exactly r strongly outstanding eleents is /r 1! for large n. r Chern and Hwang [3] consider the nuber f n,k of k consecutive records strongly outstanding eleents in a sequence of n iid continuous rando variables. They iprove upon known results for the liiting distribution of f n,2. In particular they show f n,k is asyptotically Poisson for k = 1, 2, and this is not the case for k 3. They give the probability generating function for f n,2, and observe that the distribution of f n,2 is identical to that for the nuber of fixed points j in a rando perutation of [n] for 1 j < n. They give a recurrence for the probability generating function for f n,k, and copute the ean and variance for this nuber. Are there siilar results for discrete distributions? Prodinger [11] considers left-to-right axia in both the strict strongly outstanding and loose weakly outstanding senses for geoetric rando variables. He finds the generating function for the probability that a sequence of n independent geoetric rando variables each with probability pq v 1 of taking the positive integer value v, where q = p 1 has k strict left-to-right axia. This probability is the coefficient of z n y k in F z, y = 1 + yzpqk 1. 1 z1 q k k 1 For loose left-to-right axia the analogous generating function is k 0 1 z1 q k 1 z + zq k 1 py. In this paper, Prodinger also finds the asyptotic expansions for both the expected nubers of strict and loose left-to-right axia, and the variances for these nubers. He does all of the above for unifor rando variables as well. Knopfacher and Prodinger [10] consider the value and position of the r th left-to-right axiu for n geoetric rando variables. The position is the r th strongly outstanding eleent, and the value is that taken by the rando variable in that position again the value v is taken with probability pq v 1, where q = 1 p. For the r th strong left-to-right axiu, p r 1, n log q 1 respectively. q and the asyptotic forulas for value and position are r and 1 p r 1! For the rth weak left-to-right axiu, the value and position are asyptotically rq p 1 r 1! functions. r 1. p log 1 n These results are obtained by first coputing the relevant generating q 15
16 A nuber of additional properties of outstanding eleents of perutations are in Wilf [13]. Key [8] describes the asyptotic behavior of the nuber of records strongly outstanding eleents and weak records weakly outstanding eleents that occur in an iid sequence of integer valued rando variables. When the sequence w 1, w 2,..., w n under consideration is a rando perutation on n letters, then the expected nuber of strongly outstanding elents is the nth haronic nuber H n = The variance is H 2 2 n n = H n 2, where H n 2 = n 2 denotes the nth haronic nuber of the second order. Banderier, Mehlhorn, and Brier [2] show that the average nuber of left-to-right axia strongly outstanding eleents in a partial perutation is logpn+γ+2 1 p p p 2 p 2 O 1 n where γ = is Euler s constant. To obtain a partial perutation, we begin 2 with the sequence 1, 2,..., k and select each eleent with probability p; then take one of the pn! perutations of [pn] uniforily at rando and let it act on the selected eleents, while the nonselected eleents stay in place. Foata and Han [6] investigate the right-to-left lower records of signed perutations. A signed perutation is a word w = w 1 w 2... w n for which the letters w i are positive or negative integers, and w 1 w 2... w n is a perutation of {1, 2,..., n}. A lower record of such a word is a letter w i such that w i < w j for all j with i + 1 j n. The authors consider the signed subword obtained by reading the lower records of w fro left to right; and derive generating functions for signed perutations in ters of signed subwords, nubers of positive and negative letters in signed subwords, and other statistics. 1 + n 16
17 References [1] Louis Cotet, Advanced Cobinatorics, Reidel, [2] Cyril Banderier, Kurt Mehlhorn, and Rene Beier, Soothed analysis of three cobinatorial algoriths, Matheatical Foundations of Coputer Science 2003: 28th International Syposiu, Proceedings, Lecture Notes in Coputer Science 2747, Springer, 2003, [3] Hua-Huai Chern and Hsien-Kuei Hwang, Liit distribution of the nuber of consecutive records, Rando Structures Algoriths 26 no , [4] Julien Cléent, Philippe Flajolet, and Brigitte Vallée, The analysis of hybrid trie structures, Proceedings of the Ninth Annual ACM-SIAM Syposiu on Discrete Algoriths San Francisco, CA, 1998, , ACM, New York, [5] J. N. Darroch, On the distribution of the nuber of successes in independent trials, Ann. Math. Stat., , [6] Doinique Foata and Guo-Niu Han, Signed words and perutations II: The Euler- Mahonian polynoials, Electron. J. Cobin. 11 no /06, Research Paper 22, 18 pp. electronic. [7] Ned Glick, Breaking records and breaking boards, Aerican Matheatical Monthly, , [8] Eric S. Key, On the nuber of recordes in an iid discrete sequence, Journal of Theoretical Probability, 18 no , [9] Richard V. Kadison, Strategies in the secretary proble, Expositiones Matheaticae , [10] Arnold Knopfacher and Helut Prodinger, Cobinatorics of geoetrically distributed rando variables: Value and position of the r th left-to-right axiu. Discrete Math. 226 no , [11] Helut Prodinger, Cobinatorics of geoetrically distributed rando variables: Leftto-right axia. Discrete Matheatics, , [12] A. Rényi, Théorie des éléents saillants d une suite d observations, in Colloquiu Aarhus, 1962,
18 [13] Herbert S. Wilf, On the outstanding eleents of perutations, < wilf>,
Curious 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 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 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 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 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 informationA symbolic operator approach to several summation formulas for power series II
A sybolic operator approach to several suation forulas for power series II T. X. He, L. C. Hsu 2, and P. J.-S. Shiue 3 Departent of Matheatics and Coputer Science Illinois Wesleyan University Blooington,
More informationPolygonal 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 information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
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 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 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 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 informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationThe concavity and convexity of the Boros Moll sequences
The concavity and convexity of the Boros Moll sequences Ernest X.W. Xia Departent of Matheatics Jiangsu University Zhenjiang, Jiangsu 1013, P.R. China ernestxwxia@163.co Subitted: Oct 1, 013; Accepted:
More informationResearch Article On the Isolated Vertices and Connectivity in Random Intersection Graphs
International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for
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 information1. INTRODUCTION AND RESULTS
SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00
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 informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationConstant-Space String-Matching. in Sublinear Average Time. (Extended Abstract) Wojciech Rytter z. Warsaw University. and. University of Liverpool
Constant-Space String-Matching in Sublinear Average Tie (Extended Abstract) Maxie Crocheore Universite de Marne-la-Vallee Leszek Gasieniec y Max-Planck Institut fur Inforatik Wojciech Rytter z Warsaw University
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 informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
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 informationarxiv: v2 [math.co] 8 Mar 2018
Restricted lonesu atrices arxiv:1711.10178v2 [ath.co] 8 Mar 2018 Beáta Bényi Faculty of Water Sciences, National University of Public Service, Budapest beata.benyi@gail.co March 9, 2018 Keywords: enueration,
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 informationLATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.
i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give
More informationPOWER SUM IDENTITIES WITH GENERALIZED STIRLING NUMBERS
POWER SUM IDENTITIES WITH GENERALIZED STIRLING NUMBERS KHRISTO N. BOYADZHIEV Abstract. We prove several cobinatorial identities involving Stirling functions of the second ind with a coplex variable. The
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 informationarxiv: v1 [math.co] 19 Apr 2017
PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,
More informationEvaluation of various partial sums of Gaussian q-binomial sums
Arab J Math (018) 7:101 11 https://doiorg/101007/s40065-017-0191-3 Arabian Journal of Matheatics Erah Kılıç Evaluation of various partial sus of Gaussian -binoial sus Received: 3 February 016 / Accepted:
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 informationE0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011)
E0 370 Statistical Learning Theory Lecture 5 Aug 5, 0 Covering Nubers, Pseudo-Diension, and Fat-Shattering Diension Lecturer: Shivani Agarwal Scribe: Shivani Agarwal Introduction So far we have seen how
More informationAnalysis of Polynomial & Rational Functions ( summary )
Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where
More informationR. L. Ollerton University of Western Sydney, Penrith Campus DC1797, Australia
FURTHER PROPERTIES OF GENERALIZED BINOMIAL COEFFICIENT k-extensions R. L. Ollerton University of Western Sydney, Penrith Capus DC1797, Australia A. G. Shannon KvB Institute of Technology, North Sydney
More informationBootstrapping Dependent Data
Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly
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 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 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 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 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 informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
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 informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationOn Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40
On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering
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 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 informationPREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL
PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY
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 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 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 informationSecant Tree Calculus. Dominique Foata and Guo-Niu Han
October 4, 203 Secant Tree Calculus Doinique Foata and Guo-Niu Han Abstract. A true Tree Calculus is being developed to ae a joint study of the two statistics eoc (end of inial chain) and po (parent of
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationKONINKL. NEDERL. AKADEMIE VAN WETENSCHAPPEN AMSTERDAM Reprinted from Proceedings, Series A, 61, No. 1 and Indag. Math., 20, No.
KONINKL. NEDERL. AKADEMIE VAN WETENSCHAPPEN AMSTERDAM Reprinted fro Proceedings, Series A, 6, No. and Indag. Math., 20, No., 95 8 MATHEMATIC S ON SEQUENCES OF INTEGERS GENERATED BY A SIEVIN G PROCES S
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 informationIMPLICIT FUNCTION THEOREM FOR FORMAL POWER SERIES
#A9 INTEGERS 8A (208) IMPLICIT FUNCTION THEOREM FOR FORMAL POWER SERIES ining Hu School of Matheatics and Statistics, Huazhong University of Science and Technology, Wuhan, PR China huyining@protonail.co
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 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 informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationTHE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)!
THE SUPER CATALAN NUMBERS S(, + s FOR s 3 AND SOME INTEGER FACTORIAL RATIOS XIN CHEN AND JANE WANG Abstract. We give a cobinatorial interpretation for the super Catalan nuber S(, + s for s 3 using lattice
More informationA RECURRENCE RELATION FOR BERNOULLI NUMBERS. Mümün Can, Mehmet Cenkci, and Veli Kurt
Bull Korean Math Soc 42 2005, No 3, pp 67 622 A RECURRENCE RELATION FOR BERNOULLI NUMBERS Müün Can, Mehet Cenci, and Veli Kurt Abstract In this paper, using Gauss ultiplication forula, a recurrence relation
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
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 informationInfinitely Many Trees Have Non-Sperner Subtree Poset
Order (2007 24:133 138 DOI 10.1007/s11083-007-9064-2 Infinitely Many Trees Have Non-Sperner Subtree Poset Andrew Vince Hua Wang Received: 3 April 2007 / Accepted: 25 August 2007 / Published online: 2 October
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationCHARACTER SUMS AND RAMSEY PROPERTIES OF GENERALIZED PALEY GRAPHS. Nicholas Wage Appleton East High School, Appleton, WI 54915, USA.
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
More informationCompression and Predictive Distributions for Large Alphabet i.i.d and Markov models
2014 IEEE International Syposiu on Inforation Theory Copression and Predictive Distributions for Large Alphabet i.i.d and Markov odels Xiao Yang Departent of Statistics Yale University New Haven, CT, 06511
More informationConvex Programming for Scheduling Unrelated Parallel Machines
Convex Prograing for Scheduling Unrelated Parallel Machines Yossi Azar Air Epstein Abstract We consider the classical proble of scheduling parallel unrelated achines. Each job is to be processed by exactly
More informationMath Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65
The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,
More informationarxiv:math/ v1 [math.co] 22 Jul 2005
Distances between the winning nubers in Lottery Konstantinos Drakakis arxiv:ath/0507469v1 [ath.co] 22 Jul 2005 16 March 2005 Abstract We prove an interesting fact about Lottery: the winning 6 nubers (out
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 informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationA Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)
1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
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 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 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 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 informationarxiv: v1 [math.na] 10 Oct 2016
GREEDY GAUSS-NEWTON ALGORITHM FOR FINDING SPARSE SOLUTIONS TO NONLINEAR UNDERDETERMINED SYSTEMS OF EQUATIONS MÅRTEN GULLIKSSON AND ANNA OLEYNIK arxiv:6.395v [ath.na] Oct 26 Abstract. We consider the proble
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 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 informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
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 informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
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 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 informationDistributional transformations, orthogonal polynomials, and Stein characterizations
Distributional transforations, orthogonal polynoials, and Stein characterizations LARRY GOLDSTEIN 13 and GESINE REINERT 23 Abstract A new class of distributional transforations is introduced, characterized
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 informationOn the Dirichlet Convolution of Completely Additive Functions
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 014, Article 14.8.7 On the Dirichlet Convolution of Copletely Additive Functions Isao Kiuchi and Makoto Minaide Departent of Matheatical Sciences Yaaguchi
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 informationThe Frobenius problem, sums of powers of integers, and recurrences for the Bernoulli numbers
Journal of Nuber Theory 117 (2006 376 386 www.elsevier.co/locate/jnt The Frobenius proble, sus of powers of integers, and recurrences for the Bernoulli nubers Hans J.H. Tuenter Schulich School of Business,
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More informationON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS
Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by
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 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