Curious Bounds for Floor Function Sums
|
|
- Avis Glenn
- 5 years ago
- Views:
Transcription
1 Journal of Integer Sequences, Vol. 1 (018), Article Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International College Nakhon Patho, 7170 Thailand thotsaporn@gail.co wongey@gail.co Abstract Jacobsthal was the first to study a certain kind of su of floor functions. His work was followed by that of Carlitz, Grison, and Tverberg. More recently, Onphaeng and Pongsriia proved soe sharp upper and lower bounds for the sus of Jacobsthal and Tverberg. In this paper, we devise concise forulas for these sus, which we then use to prove the upper and lower bounds claied by Tverberg. Furtherore, we present conjectural lower and upper bounds for these sus. 1 Introduction In 1957, Jacobsthal [] defined and studied a function of the for a1 +a +k a1 +k a +k f ({a 1,a },k) = + for fixed Z + with a 1,a,k Z. He also defined the functions k S ({a 1,a },K) = f ({a 1,a },k), k=0 0 a 1,a,K 1. 1 Correspondence should be addressed to Elaine Wong: wongey@gail.co. 1
2 It is iportant to note that we can take advantage of the -periodicity of f, and so we restrict our a 1,a, and K values accordingly for the su. Jacobsthal, and then later Carlitz [1], Grison [], and Tverberg [5], proved S ({a 1,a },K) 0. In 01, Tverberg [5] proposed a generalized notation for these su functions for any set A = {a 1,...,a n } with 0 a 1,...,a n,k 1 and n = A, that is, S ({a 1,...,a n },K) = k=0 T [1,n] ( 1) n T k + i T a i He also claied without proof the other upper and lower bounds of S for sets {a 1,a } and {a 1,a,a } (i.e., n =,). In 017, Onphaeng and Pongsriia [4] furnished a proof for the upper bounds when n is even and 4 and the lower bounds when n is odd and. In this paper, we investigate the bounds for S for all n Z + and supply the issing proofs of Tverberg s upper bounds. Furtherore, we conjecture all the bounds for S not previously entioned and suarize the findings in Table 1. Authors who claied their bounds without proof are denoted with an asterisk (*). Otherwise, a proof is given in their corresponding paper.. n Lower Bound Lower Bound Credit Upper Bound Upper Bound Credit 1 0 Trivial 1 Trivial Jacobsthal; 0 Carlitz; Tverberg*; Grison; Corollary 8 Tverberg; Theore 9 Tverberg*; Tverberg*; Onphaeng, Corollary 14 Pongsriia 4 4 Onphaeng, Conjecture 17* (Conjecture) Pongsriia odd n Onphaeng, ( 5) Pongsriia (Conjectures) Conjecture 17* even (Conjectures) Conjecture 17* n Onphaeng, ( 5) Pongsriia Table 1: Bounds for S ({a 1,...,a n },K)
3 We discuss the case of n = 1 in this section as it sets the foundation for the ain strategy that we use to prove higher cases. We begin with an explicit definition of Jacobsthal s su. Definition 1. For any Z and a 1,K Z + {0}, S ({a 1 },K) = ( a1 +k k=0 ) k. The su can be written concisely without using the suation sybol, which we show below. Note that the periodicity that existed in the n case does not exist here. However, we only prove the following proposition for 0 K 1 because that is all that is needed for higher values of n. We let a od denote the inial non-negative representative in the Z/-equivalence class. Proposition. For 0 K 1 and a 1 Z + {0}, a1 S ({a 1 },K) = (K +1)+ax(0,(a 1 od )+K +1). Proof. We observe a1 +k = a1 k + + {a1 } + { } k, where {x} = x x, the fractional part of x. This notation is distinguished fro the usual set notation according to context. Furtherore, since 0 k 1, {a1 } { } k a1 od + = + k. The result is derived as follows: ( ) a1 +k k ( a1 = + k=0 = k=0 a1 (K +1)+ k + {a1 } + a1 od + k k=0 { } k k )
4 = + = = a1 (K +1)+ k= (a 1 od ) a1 a1 (a 1 od ) 1 k=0 (a1 od )+k (a 1 od ) 1 (K +1)+ 0+ k=0 (a1 od )+k k= (a 1 od ) (K +1)+ax(0,(a 1 od )+K +1). 1 The bounds for S ({a 1 },K) are then easily attained fro Proposition. Corollary. For 0 a 1,K 1, 0 S ({a 1 },K) 1. In particular, the axiu occurs precisely when a 1 = K = 1. Proof. The result follows fro the fact that S ({a 1 },K) = ax(0,a 1 +K +1). In the following sections, we use siilar ethods to provide bounds when n > 1 for the sus S ({a 1,...,a n },K). Lower and upper bounds for n = Carlitz [1], Grison [], Jacobsthal [], and Tverberg [5] all proved the lower bound for n =, while Tverberg was first to ention the upper bound for this case. In this section, we prove the upper bound by introducing a new for for the su just as before. We also use this for to give a new proof for its lower bound. We do this by first writing out Jacobsthal s su explicitly, and then aking a generalization of Proposition. Definition 4. For any Z + and any a 1,a,K Z + {0}, S ({a 1,a },K) = ( a1 +a +k a1 +k a +k + k=0 ) k. 4
5 We show that the su can be written concisely without using the suation sybol, siilar to Proposition. Proposition 5. For 0 K 1, and any a 1,a Z + {0}, ( a1 +a a1 a ) S ({a 1,a },K) = (K +1) +ax(0,((a 1 +a ) od )+K +1) ax(0,(a 1 od )+K +1) ax(0,(a od )+K +1). Proof. Rewriting the two-variable su in Definition 4 as a series of one-variable sus, S ({a 1,a },K) = S ({a 1 +a },K) S ({a 1 },K) S ({a },K), allows us to apply Proposition to each su to get our result. A syetry exists in Proposition 5. We outline the pattern in the lea below. This, along with a partial result in Theore 7, gives us the desired upper and lower bounds in Corollary 8 and Theore 9, respectively. Lea 6. (Mirrored Sus) For 0 a 1,a 1 and 0 K, S ({a 1,a },K) = S ({ a 1, a }, K). Proof. It is enough to show the clai for 0 a 1 + a. Otherwise, we have that ( a 1 )+( a ) <, in which case we can use a siilar arguent by substituting a 1 with a 1 and a with a. For the case a 1 = a = 0, the result trivially holds by Definition 4. For the case 0 < a 1 +a <, Proposition 5 siplifies to S ({a 1,a },K) = ax(0,a 1 +a +K +1) ax(0,a 1 +K +1) ax(0,a +K +1). (1) Furtherore, we note that < (a 1 +a ) <, which gives S ({ a 1, a }, K) = 1 K +ax(0, (a 1 +a ) K 1) Now consider the following equations that use the fact that ax(0, a 1 K 1) ax(0, a K 1). () ax(0,x) ax(0, x) = x, for all x R. 5
6 ax(0,a 1 +a +K +1) ax(0, a 1 a K + 1) = a 1 +a +K +1, ax(0, a 1 K 1) ax(0,a 1 +K +1) = a 1 K 1, ax(0, a 1 K 1) ax(0,a +K +1) = a K 1. () (4) (5) Then, ()+(4)+(5) confirs (1) = (). Finally, we consider a 1 +a =. Here, Proposition 5 gives S ({a 1,a },K) = K +1 ax(0,a 1 +K +1) ax(0,a +K +1), S ({ a 1, a }, K) = (K +1) ax(0, a 1 K 1) ax(0, a K 1). (6) (7) In this case, (4)+(5) confirs (6) = (7). This concludes the proof. We show the upper bound for half the range of K using differences. Theore 7. For 0 a 1,a 1 and 0 K 1, S ({a 1,a },K). Proof. We show the stronger result, that for 0 K 1, S ({a 1,a },K) K +1. For the case K = 0, a1 +a S ({a 1,a },0) = +ax(0,((a 1 +a ) od ) +1) ax(0,a 1 +1) ax(0,a +1) a1 +a = For the case 1 K 1, it is enough to show that := S ({a 1,a },K) S ({a 1 +1,a },K 1) 1. 6
7 By using Proposition 5 we explicitly write out the two sus a1 +a S ({a 1,a },K) = (K +1) +ax(0,((a 1 +a ) od )+K +1) ax(0,a 1 +K +1) ax(0,a +K +1), a1 +a +1 S ({a 1 +1,a },K 1) = K +ax(0,((a 1 +a +1) od )+K ) ax(0,a 1 +K +1) ax(0,a +K ). We deterine according to the possible values of a 1 +a and a +K +1. Case 1: (a 1 +a < and a +K +1 0) If a 1 +a < 1, then both sus are the sae. S ({a 1,a },K) = 0+ax(0,a 1 +a +K +1) ax(0,a 1 +K +1) 0, S ({a 1 +1,a },K 1) = 0+ax(0,(a 1 +1)+a +K ) ax(0,(a 1 +1)+K ) 0. If a 1 +a = 1, then both sus evaluate to K. Therefore, we get = 0. Case : (a 1 +a < and a +K +1 > 0) Again, we assue a 1 +a < 1. S ({a 1,a },K) = 0+ax(0,a 1 +a +K +1) ax(0,a 1 +K +1) (a +K +1), S ({a 1 +1,a },K 1) = 0+ax(0,(a 1 +1)+a +K +1) ax(0,(a 1 +1)+K ) (a +K ). Therefore, = S ({a 1,a },K) S ({a 1 +1,a },K 1) = 1. A siilar arguent holds for a 1 +a = 1. Case : (a 1 +a and a +K +1 0) S ({a 1,a },K) = (K +1)+ax(0,(a 1 +a )+K +1) ax(0,a 1 +K +1) 0, S ({a 1 +1,a },K 1) = K +ax(0,(a 1 +1+a )+K ) ax(0,(a 1 +1)+K ) 0. 7
8 Therefore, = S ({a 1,a },K) S ({a 1 +1,a },K 1) = +1. Case 4: (a 1 +a and a +K +1 > 0) = 0 using siilar reasoning to Case and Case. We suarize the four cases for 0 < K 1 in the table below. Case a 1 +a a +K +1 1 < 0 0 < > > 0 0 Table : Suary of values. This shows that 1 1. Thus, we have shown that S ({a 1,a },K) S ({a 1,a },K 1)+1 K +1 for all 0 K 1. We apply Lea 6 and Theore 7 to show the upper bound for S. Corollary 8. For 0 a 1,a,K 1, S ({a 1,a },K). Proof. For 0 K 1, Theore 7 gives the result. For K, S ({a 1,a },K) = S ({ a 1, a }, K) by Lea 6. Fro there, we apply Theore 7 to the right hand side and get the result. Finally, for K = 1, it is easily seen that S ({a 1,a },K) = 0. This copletes the proof. The lower bound is now easy to show using. Theore 9. For 0 a 1,a,K 1, 0 S ({a 1,a },K). Proof. Without loss of generality, we assue that 0 a a 1 1. Consider 0 K 1. Thus, the conditions of Case (i.e., a1 +a < and a +K +1 > 0) cannot be et because if a 1 + a <, then a. So, a + K This shows that 1, which eans = 0 or 1. This, along with S ({a 1,a },0) 0, gives us the lower bound as desired. Next, we consider K, and apply Lea 6 to coplete the arguent. Lastly, S ({a 1,a }, 1) = 0. We now have the coplete result. 8,
9 Upper bound for n = Onphaeng and Pongsriia [4] already proved the lower bound for this case. In this section, we follow the style of the previous sections by rewriting the su, observing its syetry, and using a difference to prove the upper bound. This tie, we use Tverberg s forulation to write out the su explicitly. Definition 10. For any Z + and a 1,a,a,K Z + {0}, ( a1 +a +a +k S ({a 1,a,a },K) = k=0 a1 +a +k a +a +k a1 +a +k ) a1 +k a +k a +k k Like before, we show that the su can be written concisely without using the suation sybol. Proposition 11. For 0 K 1 and a 1,a,a Z + {0}, ( a1 +a +a a1 +a a +a S ({a 1,a,a },K) = a1 +a a1 a a ) (K +1) +ax(0,((a 1 +a +a ) od )+K +1) ax(0,((a 1 +a ) od )+K +1) ax(0,((a +a ) od )+K +1) ax(0,((a 1 +a ) od )+K +1) +ax(0,(a 1 od )+K +1) +ax(0,(a od )+K +1) +ax(0,(a od )+K +1). Proof. We can rewrite our three-variable su in Definition 10 in ters of two-variable sus, that is, S ({a 1,a,a },K) = S ({a 1,a +a },K) S ({a 1,a },K) S ({a 1,a },K). (8) We then apply Proposition 5 to each su to get our result. A syetry exists for S ({a 1,a,a },K), siilar to Lea 6. 9
10 Lea 1. (Mirrored Sus) For 0 a 1,a,a 1 and 0 K, S ({a 1,a,a },K) = S ({ a 1, a, a }, K). Proof. As above, we rewrite the three-variable su as a series of two-variable sus and then reason as follows: S ({a 1,a,a },K) = S ({a 1,a +a },K) S ({a 1,a },K) S ({a 1,a },K) = S ({a 1,(a +a ) od },K) S ({a 1,a },K) S ({a 1,a },K) = S ({ a 1, (a +a ) od }, K) S ({ a 1, a }, K) S ({ a 1, a }, K) = S ({ a 1,( a )+( a )}, K) S ({ a 1, a }, K) S ({ a 1, a }, K) = S ({ a 1, a, a }, K). The first and fifth equalities coe fro (8). We take advantage of the a i -periodicity of the susinthesecondandfourthequalities. Lastly, weapplylea6inthethirdequality. Next, we show the upper bound for half the range of K using. Theore 1. For 0 a 1,a,a 1 and 0 K 1, S ({a 1,a,a },K). Proof. Without loss of generality, we assue that 0 a a a 1 1. We break down the proof into two cases of K, that is, we would like to show { K +1, if 0 K 1 (Case A); S ({a 1,a,a },K), if K 1 (Case B). As above, we define a difference of sus, := S ({a 1,a,a },K) S ({a 1 +1,a,a },K 1), and note that can be converted to via (8) as follows: = S ({a 1,a,a },K) S ({a 1 +1,a,a },K 1) = (S ({a 1,a +a },K) S ({a 1 +1,a +a },K 1)) (S ({a 1,a },K) S ({a 1 +1,a },K 1)) (S ({a 1,a },K) S ({a 1 +1,a },K 1)) = ({a 1,a +a },K) ({a 1,a },K) ({a 1,a },K). 10
11 Case A: Fro the proof of Theore 9, we know that ({a 1,a },K) 0 and ({a 1,a },K) 0. This, coupled with the fact that ({a 1,a + a },K) 1 (by Table ), gives 1. Furtherore, with S ({a 1,a,a },0) 1, we get S K +1 as in the proof of Theore 7. Case B: If 0, then we can use Case A (i.e., S K +1 ) to show S ({a 1,a,a },K) S ({a 1 +1,a,a },K 1). If = 1, we show S directly. Observe that the only way to obtain = 1 is when ({a 1,a +a },K) = +1, ({a 1,a },K) = 0, ({a 1,a },K) = 0. This arrangeent is achieved when our assued a 1,a,a,K also satisfies all conditions fro Table. So, in Table, we organize each row according to the restrictions that ust be applied. The type refers to the logical operator on the conditions in the sae row in order to achieve that particular value. Keeping these conditions in ind, we bound S ({a 1,a,a },K) according to whether a +a < or not. Condition a Type Condition b +1 (1a) a 1 +(a +a ) od AND (1b) ((a +a ) od )+K (a) a 1 +a XOR (b) a +K (a) a 1 +a XOR (b) a +K +1 0 Table : Conditions on values for Case B Case B1: a +a <. Conditions (1a) and (1b) siplify to a 1 +a +a < AND a +a +K +1 0, which therefore satisfies (b) and (b), iplying that it also satisfies (a) and (a) by the XOR condition. Thus, we get a 1 +a < AND a +K +1 0, a 1 +a < AND a +K
12 Applying these conditions to Proposition 11 results in the following forula: S ({a 1,a,a },K) = K +1 ax(0,a 1 +a +K +1) ax(0,a 1 +a +K +1)+ax(0,a 1 +K +1), which can be broken down into the following four subcases. Case B1.1: (a 1 +K +1 > 0) S ({a 1,a,a },K) = a 1 a a + + = 0. Case B1.: (a 1 +K +1 0 and a 1 +a +K +1 > 0) S ({a 1,a,a },K) = K +1 (a 1 +a +K +1) (a 1 +a +K +1) = ( a 1 a a ) (a 1 +K)+( 1) 0 +( 1), because a 1 +a +a (1a) and a 1 a a gives a 1. This, along with K, gives us the second to last line. Case B1.: (a 1 +a +K +1 0 and a 1 +a +K +1 > 0) S ({a 1,a,a },K) = a 1 a, because a 1 +a. Case B1.4: (a 1 +a +K +1 0) This case cannot happen because a 1 +a +a gives that a 1 +a which eans a1 +a +K +1, contradicting the condition. We suarize these four subcases in Table 4. Subcase a 1 +a +K +1 a 1 +a +K +1 a 1 +K +1 S 1 > 0 > 0 > 0 0 > 0 > 0 0 > N/A Case B: a +a <. Table 4: Subcases for B1 1
13 Conditions (1a) and (1b) siplify to a 1 +a +a AND a +a +K +1 0, which therefore satisfies (a) and (a), iplying that it also satisfies (b) and (b) by the XOR condition. Thus, we get a 1 +a AND a +K +1 > 0, a 1 +a AND a +K +1 > 0. Applying these conditions to Proposition 11 results in the following forula: S ({a 1,a,a },K) = (K +1) ax(0,a 1 +a +K +1) ax(0,a 1 +a +K +1)+(a 1 +K +1) +(a +K +1)+(a +K +1), which can be broken down into the following three subcases. B.1: (a 1 +a +K +1 > 0 and a 1 +a +K +1 > 0) S ({a 1,a,a },K) = (a 1 +a +K +1) (a 1 +a +K +1) +(a 1 +a +K +1)+(a +K +1) = a 1, because a 1 +a +a and a 1 a a gives a 1. B.: (a 1 +a +K +1 > 0 and a 1 +a +K +1 0) S ({a 1,a,a },K) = ( a 1 )+(a 1 +a +K +1) B.: (a 1 +a +K +1 0) a 1. S ({a 1,a,a },K) = ( a 1 )+(a 1 +a +K +1) We suarize the three cases in Table 5. +(a 1 +a +K +1) ( a 1 ). 1
14 Subcase a 1 +a +K +1 a 1 +a +K +1 S 1 > 0 > 0 > Table 5: Subcases for B The results fro Tables 4 and 5 coplete the proof of Case B. Hence, we have proven the theore. Lea 1 and Theore 1 give the ain result, which we state as a corollary. Corollary 14. For 0 a 1,a,a,K 1, S ({a 1,a,a },K). Proof. For 0 K 1, Theore 1 gives us our result. For K, S ({a 1,a,a },K) = S ({ a 1, a, a }, K) by Lea 1. Fro there, we apply Theore 1 to the right hand side and get the result. Finally, S ({a 1,a,a }, 1) = 0. This copletes the proof. 4 (Not so sharp) lower bound for n = 4 Given that 0 a 1,a,a,a 4,K 1, the pattern of the axiu and iniu values of S ({a 1,a,a,a 4 },K) is less clear, as evidenced by soe results of the coputer progra: Maxiu Values of Sus Miniu Values of Sus (S 1,S,...) = (0,4,,8,7,1,11,16,15,0,19,4,8,7,,1,6,5,40,9,44,...). (S 1,S,...) = (0,0,,,, 6, 5, 6, 9, 8, 9, 1, 11, 1, 15, 14, 15, 18, 17, 18, 1, 0,...). Onphaeng and Pongsriia [4] showed the upper bound S ({a 1,a,a,a 4 },K) 4 14.
15 We conjecture the lower bound S ({a 1,a,a,a 4 },K). In an attept to prove this lower bound, we found that writing a difference of sus (like or ) is not an efficient way to approach the proble. Accordingly, we use another ethod to obtain the following partial result. Theore 15. For 0 a 1,a,a,a 4,K 1, S ({a 1,a,a,a 4 },K). Proof. We can cobine the following bounds fro n =,, naely, along with the identity 0 S ({a 1 +a +a,a 4 },K), S ({a 1 +a,a 4 },K), S ({a 1 +a,a 4 },K), S ({a,a,a 4 },K), 0 S ({a 1,a 4 },K), S ({a 1,a,a,a 4 },K) = S ({a 1 +a +a,a 4 },K) S ({a 1 +a,a 4 },K) to obtain the claied result. S ({a 1 +a,a 4 },K) S ({a,a,a 4 },K)+S ({a 1,a 4 },K), 5 Conjectures In order to coplete the analysis on this type of floor function proble, we want to show all the upper bounds and lower bounds for any nuber of variables, n. Onphaeng and Pongsriia [4] were able to show the upper bound when n is even and the lower bound when n is odd. Theore 16 (Onphaeng, Pongsriia). When n is even and is even, S n. When n is odd and is even, n S. The bounds on both cases are obtained exactly at A = {/,/,...,/}, K = / 1. 15
16 We conjecture the issing bounds, naely, the lower bounds when n is even and the upper bounds when n is odd. To ake these conjectures, we wrote a Maple progra to calculate the values of S (A,K) for specific,a, and K. For each n, the sets A and K that give extree values of S for interesting patterns, which depend on. Once we deterine such values in A and K, we can quickly copute the extree values of S (A,K) for each n and then use the resulting data to for a holonoic ansatz. The resulting recurrence becoes a ninth order recurrence with polynoial coefficients of degree at ost. We suarize our findings in the following conjecture. For interested readers, this Maple code can be found on Thanatipanonda s website ( Conjecture 17. Let A := {a 1,a,...,a n } and define ax/in S (A,K) to be the axiu/iniu over all choices of a i and K with 0 a 1,a,...,a n,k 1 and fixed. Furtherore, we let the function S be as defined in the first section. Suppose now { ax S (A,K), n odd; M(n) := in S (A,K), n even. Then for n 4, we conjecture the following result in two parts. 1. n = 4k 1,4k or 4k +1, where k Z + : Under the condition that is a ultiple of k +1, the values of M(n) occur exactly at { } k A = k +1, k k +1,..., k,k = k k +1 k +1 1, { } (k +1) (k +1) (k +1) (k +1) or A =,,...,,K = k +1 k +1 k +1 k n = 4k +, where k Z + : Under the condition that is a ultiple of k + 1 and k +, the values of M(n) occur at (aong other places) { } k A = k +1, k k +1,..., k,k = k k +1 k +1 1, { } (k +1) (k +1) (k +1) (k +1) or A =,,...,,K = k +1 k +1 k +1 k +1 1, { } (k +1) (k +1) (k +1) (k +1) or A =,,...,,K = k + k + k + k + 1, { } (k +) (k +) (k +) (k +) or A =,,...,,K = k + k + k + k + 1. Moreover, M(n) can be calculated directly fro a forula siilar to the equations fro Propositions 5 and 11, or by M(n) = f(n), 16
17 where f(n) satisfies the recurrence relation 5(n+)(n )f(n) = 10(n +n 8)f(n 1) 4(n 10n+)f(n ) 4(n 11)f(n ) (n 10n 1)f(n 4) 19(n 1)(n 5)f(n 5)+64(n n+51)f(n 6) +84(n 1)f(n 7) 56(n )(n 8)f(n 8) +51(n 9)(n 8)f(n 9) for n 11, with the initial conditions f() = 0,f() = 1/,f(4) = 1,f(5) =,f(6) =,f(7) = 8,f(8) = 18, f(9) = 6, and f(10) = 65. For convenience, we give exaples of soe of the bounds (and the set A for which the values of those bounds occur) produced fro the conjectures above. Suppose n = 4,5 and is a ultiple of. Case n = 4: Case n = 5: S. S 6. For these cases, M(n) occurs at A = {/,/,...,/},K = / 1 or A = {/,/,...,/},K = / 1. Suppose n = 6. If is a ultiple of, then 9 S, with the iniu at (aong other places) A = {/,/,...,/},K = / 1 or A = {/,/,...,/},K = / 1. 17
18 If is a ultiple of 5, then 15 S, 5 with the iniu at (aong other places) Suppose n = 7,8,9 and is a ultiple of 5. A = {/5,/5,...,/5},K = /5 1 or A = {/5,/5,...,/5},K = /5 1. Case n = 7: Case n = 8: Case n = 9: S S. 5 S For these cases, M(n) occurs at A = {/5,/5,...,/5},K = /5 1 or A = {/5,/5,...,/5},K = / Acknowledgeents The authors would like to thank Harry Richan and an anonyous referee, for their helpful coents and suggestions to iprove this anuscript. References [1] L. Carlitz, Soe arithetic sus connected with the greatest integer function, Math Scand. 8 (1960), [] R. C. Grison, The evaluation of a su of Jacobsthal, Norske Vid. Selsk. Skr. Trondhei (1974), No. 4. [] E. Jacobsthal, Über eine zahlentheoretische Sue, Norske Vid. Selsk. Forh. Trondhei 0 (1957),
19 [4] K. Onphaeng and P. Pongsriia, Jacobsthal and Jacobsthal-Lucas nubers and sus introduced by Jacobsthal and Tverberg, J. Integer Sequences 0 (017), Article [5] H. Tverberg, On soe nuber-theoretic sus introduced by Jacobsthal, Acta Arith., 155 (01), Matheatics Subject Classification: Priary 11A5; Secondary 05D99. Keywords: floor function, optiization, su. Received Septeber ; revised versions received February ; February ; February Published in Journal of Integer Sequences, February 018. Return to Journal of Integer Sequences hoe page. 19
Closed-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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationAlgorithms for Bernoulli and Related Polynomials
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007, Article 07.5.4 Algoriths for Bernoulli Related Polynoials Ayhan Dil, Veli Kurt Mehet Cenci Departent of Matheatics Adeniz University Antalya,
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 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 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 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 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 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 informationDivisibility of Polynomials over Finite Fields and Combinatorial Applications
Designs, Codes and Cryptography anuscript No. (will be inserted by the editor) Divisibility of Polynoials over Finite Fields and Cobinatorial Applications Daniel Panario Olga Sosnovski Brett Stevens Qiang
More informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
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 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 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 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 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 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 informationPRELIMINARIES This section lists for later sections the necessary preliminaries, which include definitions, notations and lemmas.
MORE O SQUARE AD SQUARE ROOT OF A ODE O T TREE Xingbo Wang Departent of Mechatronic Engineering, Foshan University, PRC Guangdong Engineering Center of Inforation Security for Intelligent Manufacturing
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 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 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 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 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 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 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 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 informationModified Systematic Sampling in the Presence of Linear Trend
Modified Systeatic Sapling in the Presence of Linear Trend Zaheen Khan, and Javid Shabbir Keywords: Abstract A new systeatic sapling design called Modified Systeatic Sapling (MSS, proposed by ] is ore
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 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 informationSupport Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
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 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 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 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 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 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 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 informationCompleteness of Bethe s states for generalized XXZ model, II.
Copleteness of Bethe s states for generalized XXZ odel, II Anatol N Kirillov and Nadejda A Liskova Steklov Matheatical Institute, Fontanka 27, StPetersburg, 90, Russia Abstract For any rational nuber 2
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 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 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 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 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 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 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 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 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 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 informationElastic Force: A Force Balance: Elastic & Gravitational Force: Force Example: Determining Spring Constant. Some Other Forces
Energy Balance, Units & Proble Solving: Mechanical Energy Balance ABET Course Outcoes: 1. solve and docuent the solution of probles involving eleents or configurations not previously encountered (e) (e.g.
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 informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
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 informationThe Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex and Policy-Iteration Methods are Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010; revised Noveber 30, 2010 Abstract We prove that the classic
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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution
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 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 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 informationarxiv:math/ v1 [math.nt] 6 Apr 2005
SOME PROPERTIES OF THE PSEUDO-SMARANDACHE FUNCTION arxiv:ath/05048v [ath.nt] 6 Apr 005 RICHARD PINCH Abstract. Charles Ashbacher [] has posed a nuber of questions relating to the pseudo-sarandache function
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More informationA PROOF OF A CONJECTURE OF MELHAM
A PROOF OF A CONJECTRE OF MELHAM EMRAH KILIC, ILKER AKKS, AND HELMT PRODINGER Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
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 informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationStability Ordinates of Adams Predictor-Corrector Methods
BIT anuscript No. will be inserted by the editor Stability Ordinates of Adas Predictor-Corrector Methods Michelle L. Ghrist Jonah A. Reeger Bengt Fornberg Received: date / Accepted: date Abstract How far
More informationOn the Existence of Pure Nash Equilibria in Weighted Congestion Games
MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 3, August 2012, pp. 419 436 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/oor.1120.0543 2012 INFORMS On the Existence of Pure
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 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 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 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 informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationNew Classes of Positive Semi-Definite Hankel Tensors
Miniax Theory and its Applications Volue 017, No., 1 xxx New Classes of Positive Sei-Definite Hankel Tensors Qun Wang Dept. of Applied Matheatics, The Hong Kong Polytechnic University, Hung Ho, Kowloon,
More informationThe Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex and Policy-Iteration Methods are Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye Departent of Manageent Science and Engineering, Stanford University, Stanford,
More informationOn the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation
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 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 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 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 informationPrinciples of Optimal Control Spring 2008
MIT OpenCourseWare http://ocw.it.edu 16.323 Principles of Optial Control Spring 2008 For inforation about citing these aterials or our Ters of Use, visit: http://ocw.it.edu/ters. 16.323 Lecture 10 Singular
More informationLost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies
OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with
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 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 information1 Identical Parallel Machines
FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j
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 new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
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 information