ON A GENERALIZED EULERIAN DISTRIBUTION

Size: px
Start display at page:

Download "ON A GENERALIZED EULERIAN DISTRIBUTION"

Transcription

1 A. Ist. Statist. Math. Vol. 43, No. 1, (1991) ON A GENERALIZED EULERIAN DISTRIBUTION CH. A. CHARALAMBIDES Statistical Uit, Uiversity of Athes, Paepisteraiopolis, Athes , Greece (Received April 24, 1989; revised February 13, 1990) Abstract. The distributio with probability fuctio pk(, ~, t3) = A,~,k(a, fl)/(a + fl)[] k = 0, 1, 2,...,, where the parameters a ad /3 are positive real umbers, A,k (~, fl) is the geeralized Euleria umber ad (a + fl)[] = (a + fl)(a +/3 + 1)--. (c~ + fl + - 1), itroduced ad discussed by Jaarda (1988, A. Ist. Statist. Math., 40, ), is further studied. The probability geeratig fuctio of the geeralized Euleria distributio is expressed by a geeralized Euleria polyomial which, whe expaded suitably, provides the factorial momets i closed form i terms of o-cetral Stirlig umbers. Further, it is show that the geeralized Euleria distributio is uimodal ad asymptotically ormal. Key words ad phrases: Euleria umbers, Euleria polyomials, Stirlig umbers, radom permutatios, uimodality, asymptotic ormality. 1. Itroductio Carlitz ad Scoville (1974) itroduced a geeralized (symmetric) Euleria umber A(r, s [ a,/3) i coectio with the problem of eumeratig (a,/3)- sequeces (geeralized permutatios). Recurrece relatios ad other algebraic properties of these umbers were developed. It ca be show that (1.1) pk(, a,/3) = A,k(a, /3)/(a +/3)[~], k = 0, 1, 2,...,, where the parameters a ad /3 are positive real umbers ad A,k(a, /3) = A(k, - k I a,/3) is a legitimate probability fuctio. The distributio with probability fuctio (1.1) may be called a geeralized Euleria distributio. Morisita (1971), after a series of experimetal studies with at lios, suggested a model i which each at lio was allowed to settle i fie sad (or i coarse sad) with a probability proportioal to the evirometal desity. He the provided a recurrece relatio for the probability that k out of at lios settled i fie sad. Jaarda (1988), i a iterestig mathematical ad statistical treatmet of Morisita's model, proved that a explicit solutio of this recurrece ca be give i terms of the geeralized Euleria umber E~,k(a, b). This umber is related to the geeralized (symmetric) Euleria umber A(r, s I a,/3) of Carlitz ad Scoville (1974) by E,k(a, b) = A(- k, k I a, b) = A(k, - k I b, a). 197

2 198 CH. A. CHARALAMBIDES I the preset paper, which is motivated by Jaarda's work, it is show that the problem of derivig the probability fuctio of the umber L of at lios choosig fie sad to settle (i Morisita's model) whe the evirometal desities are positive itegers is equivalet to the problem of derivig the probability fuctio of the umber X~+I of rises i a radom (c~,/3)-sequece of Z+l = {1, 2,..., + 1}. The otio of a (a, ~)-sequece, itroduced by Carlitz ad Scoville (1974), costitutes a geeralizatio of the otio of a permutatio. From the above equivalece the probability fuctio of L~ is deduced (Sectio 2). The probability geeratig fuctio of this distributio, whe the evirometal desities are positive real umbers, is expressed i terms of a geeralized Euleria polyomial. Further, this polyomial, if suitably expaded, provides a explicit expressio of the factorial momets i terms of o-cetral Stirlig umbets (Sectio 3). It is also show that the -th geeralized Euleria polyomial has distict o-positive real roots. Usig this result, oe ca prove that the geeralized Euleria distributio is uimodal ad asymptotically ormal (Sectio 4). 2. Morisita's model, radom permutatios ad (c~,/~)-sequeces Morisita (1971) cosidered at lios, each of which was allowed to choose to settle either i fie or coarse sad, ad postulated that (2.1) (2.2) (2.3) Pr(the first at lio to choose coarse sad) = 1 - Pr(the first at lio to choose fie sad) = a/(a + b), Pr(the -th at lio to choose coarse sad give that k at lios are i fid sad) = ( a + k )/ ( a + b + - 1), Pr(the -th at lio to choose fie sad give that - k - 1 at lios are i coarse sad) = (b + - k - 1)/(a + b + - 1) where the parameters a ad b are positive real umbers. Cosider a arbitrary permutatio cr = (al, a2,..., a+l) of the set Z+l = {1, 2,..., + 1}. A pair of cosecutive elemets (a~, a~+l) i cr is called a rise if a~ < ai+l ad a fall if al > ai+l. If k(a) is the umber of rises of the permutatio (r, the clearly 0 < k(a) < ad the umber of falls of the same permutatio is - k(a). The umber of permutatios of Z+l with k rises (ad - k falls) is equal to the Euleria umber A+l,k+l. Suppose that a permutatio is radomly chose from the set of the ( + 1)! permutatios of Z+l ad let X+l be the umber of its rises. The the probability fuctio of the radom variable X,~+I is give by (2.4) pk() -- Pr(X+l --/ ) -- A+l,k+l/( + 1)!, k ---- O, 1, 2,...,. I order to relate Morisita's model with a radom permutatio model, cosider the followig costructio of a radom permutatio of Z+l. Startig with the umber 1, the remaiig umbers, 2, 3,..., + 1, are placed oe after the other

3 ON A GENERALIZED EULERIAN DISTRIBUTION 199 i all possible ways. There are two possible ways of placig 2: either to the left or to the right of 1, iducig a fall: (2,1) or a rise: (1,2). Thus, (2.5) Pr(placemet of 2 iduces a fall) = Pr(placemet of 2 iduces a rise) = 1/2. Further, there are + 1 possible ways of placig + 1. If it is placed betwee the two elemets of a rise or to the left of the elemets already placed, the umber of rises remais uchaged while the umber of falls is icreased by oe. If it is placed betwee the two elemets of a fall or to the right of the elemets already placed, the umber of rises is icreased by oe while the umber of falls remais uchaged. Thus, (2.6) (2.7) Pr(placemet of + 1 iduces a fall give that k rises are already iduced) = (k + 1)/( + 1), Pr(placemet of + 1 iduces a rise give that k falls are already iduced) = ( - k + 1)/( + 1). It is apparet from the precedig aalysis that there is a oe-to-oe correspodece betwee the set of differet choices of the at lios to settle, whe a = b -- 1, ad the set of the differet choices of the umbers 2, 3,..., + 1 to be placed. More specifically, if the j-th at lio chooses fie (or coarse) sad to settle, the the umber j + 1 is iserted i a place iducig a rise (or a fall) ad vice versa. This correspodece implies that i the particular case of Morisita's model with a = b = 1, the probability fuctio Pr(L -- k), k = 0, 1, 2,..., of the umber L of at lios choosig fie sad to settle is give by (2.4). The otio of a (a,/3)-sequece, itroduced by Carlitz ad Scoville (1974) ad costitutig a geeralizatio of the otio of a permutatio, ca be related to Morisita's model whe the parameters a ad b are positive itegers. A (a,/3)- sequece, of Z+I, i additio to the + 1 elemets of Z+I, icludes a symbols 0 ad/3 symbols 01 subject to the coditios that there is at least oe symbol 0 o the extreme left ad at least oe symbol 01 o the extreme right ad that the umber 1 has all a symbols 0 to its left ad all/3 symbols 01 to its right. There is oe (a,/3)- sequece of ZI: (0,..., 0, 1, 0',..., 0') ad ths (a,/3)-sequeces of Z+I ca be obtaied by isertig the umbers 2, 3,..., + 1 oe after the other i all differet ways. Sice there are a +/3 j - 2 differet ways of isertig the umber j for j -- 2, 3,..., + 1, it follows that the umber of (a,/3)-sequeces of Z~+I is equal to (a+/3) I]. Cosider a arbitrary (a, /3)-sequece s = (Sl, 82,..., 8Wa-}-13-l-1) of Z~+I. A rise is defied as a pair of cosecutive elemets (si, si+l) with si < Si+l where si may be 0. Similarly a fall is defied as a pair of cosecutive elemets (si, si+l) with si > si+l where si+l may be 0'. If k(s) 1 is the umber of rises of a (a,/3)-sequece s of Z+l, the 0 _< k(s) <_ ad the umber of falls of the same (a,/3)-sequece is - k(s) + 1. The umber of (a, fl)-sequeces of Z+l with k + 1 rises (ad - k + 1 falls) is equal to A(k, - k I a,/3) = A( - k, k I/3, a), the geeralized symmetric Euleria umber studied by Carlitz ad Scoville (1974).

4 200 CH. A. CHARALAMBIDES Thus, puttig A,k(c~, /~) ---- A(k, - k Is, fl) it follows that (2.8) k Note that (2.9) A, k(1, 1) = A+l,k+l, A, k(1, O) = A=,k. Suppose that a (a, ~)-sequece is radomly chose from the set of the (c~ + ~)[] (a, ~)-sequeces of Z+l ad let X~+I be the umber of its rises. The, the probability fuctio pk(, (~,/3) = Pr(X~+I = k + 1), k = 0, 1, 2,..., is give by (1.1), where the parameters c~ ad/~ are, i this case, positive itegers. Further, the precedig aalysis of the costructio of a (a, fi~)-sequece, by virtue of Morisita's postulates (2.1), (2.2) ad (2.3), with a = b ad ~ = a positive itegers, implies Pr(L = k) = Pr(X+l = k+l) = pk(, a, ~), k = 0, 1, 2,...,. I the geeral case of Morisita's model where the parameters a ad b are positive real umbers, ot ecessarily itegers, the probability fuctio Pr(L = k), k = 0, 1, 2,...,, of the umber L~ of at lios choosig fie sad to settle ca be obtaied as (1.1) with a = b ad/3 = a, by comparig the recurrece relatio for Pr(L = k) deduced from postulates (2.1), (2.2) ad (2.3) with the recurrece relatio for the ratio A,k(a, /~)/(c~ + ~)[] deduced from the followig recurrece relatio of the geeralized Euleria umbers A,k(c~, ~) = A(k, - k I o~, t3) (Carlitz ad Scoville (1974)) (2.10) A+l,k(a,/3) = (/3+k)A,k(a, ~) + (a k)a,k-l(c~,/~) k = 0, 1, 2,..., + 1, = 0, 1, 2,... with Ao,o((~, ~) = 1, Ao,k(a, /3) = O, k # 0 (see also Jaarda (1988) where A~,k(a,/3) = E~,k(~, a)). 3. Geeratig fuctios, factorial momets ad geeralized Euleria polyomials The probability geeratig fuctio of the geeralized Euleria distributio (1.1), o usig the geeralized Euleria polyomials (3.1) A(t; ~,/~) = ~-~A,k(a, ~)t k, = 0, 1, 2,..., may be obtaied as k=0 (3.2) G(t; = k = A(t; + )El. k=o

5 ON A GENERALIZED EULERIAN DISTRIBUTION 201 The factorial momet geeratig fuctio is the give by (3.3) oo F(t; a,/3) = Ett(r)(, a, fl)t~/r! = A(t+ 1; a,/3)/(a + fl) M r~-0 where Thus, (3.4) ~(r)(~, 4,/3) = Z[L(~)], r = 1, 2,...,,(0)(~, 4,/3) = 1, with L (~) = L(L~ - 1)( - 2)... (L - r + 1). The derivatio of the factorial momets by expadig the right-had side of (3.3) is facilitated by the followig brief study of the geeralized Euleria polyomials. Itroducig i (3.1) the expressio (2.8) of the geeralized Euleria umbers A,k (~,/3) ad sice A,k (ct,/3) = 0 for k >, it follows that A(t; a, fl) = Z(_I)i a+/3+ a+z+k-j-1 k=o j=o J k - j (/3 q- k - j)tk = E(_I) j o~+/3-[- tj a+/3+k-j-1 (/3+k_j)tk_ j ~=0 J k=~ k - j = ~(-1)~ ~+/3+~. ~+/3+r- 1 (/3+~)~t ~. j=0 3 v=0 r A(t; 4,/3) = (1 - t) ~+~+ Z ~ +/3 + r - 1 ) (/3 + r)t L r=0?" The geeratig fuctio of the geeralized Euleria polyomials A(t, u; 4,/3) = E =O o usig the expressio (3.4) may be obtaied as A(t; a,/3)u/!, A(t,u; a, fl)=e(1-t) ~+#+~ a+/3+r-1 (/3+r)ffu/! ~O r~o =(l-t) a+~ a+/3+r-1 tre[(/3+r)u(l_t)]/! r~0 rt~0 = ee~(l_0( 1 _ t)~+ ~ ~ a +/3 + r - 1 [te,~(~_~)]~ r ~"~0 = e#~(l-t)(1 _ t)~+#[1 _ te~(~-t)]-~-~. T

6 202 CH. A. CHARALAMBIDES Note, i passig, that lim A(t, u; a,/3) = (1 - u) -~-z, t--~l implyig (3.5) A~,k(a, /3) = (a + ~)[~], k----o i agreemet with the result i Theorem 3.2 of Jaarda (1988). The geeratig fuctio of the geeralized Euleria polyomials may be rewritte i the form A(t, u; c~,/3) = e"~(t-1){1 -[e ~(t-1) - 1]/(t - 1)} -~-~ which, o usig the o-cetral Stirlig umbers (Koutras (1982)) (3.6) S(, r l a) = 1 E(_l)k (~)(c~ + k), k=o r = O, 1, 2,...,, = 0, 1, 2,... with the geeratig fuctio OG ~f r=o, 1,2,..., ca be expaded as 1 / - r r tlt/ i r~0 = (~+#)C~JS(,~[~)(t-1) -~ ~"I~!, =O yieldig for the geeralized Euleria polyomials the expressio (3.7) A(t; ~,/3) : E(~ H-/3)[r]S(, r I c~)(t - 1) -r. Returig to the geeralized Euleria distributio, its factorial momet geeratig fuctio (3.3), by virtue of (3.7), may be expaded i powers of t as E~(t; ~,/3) : ~{(~ +/3)E~-~1/(~ +/3)I~J}s(~, ~ - ~ I ~)t ~ r-~o =~{S(,-r,oO/(o~+#+-1)}tr/rL r~-o 7"

7 ON A GENERALIZED EULERIAN DISTRIBUTION 203 Thus, (3.8) p(r)(,t~,/3)=s(,-rl(x)/(~+fl+-i~, r=0, 1, 2,..., /\ r ] ad #(r)(, ~,/~) = 0 for r = + 1, + 2,... The computatio of the factorial momets (3.8) is facilitated by the followig expressio of the o-cetral Stirlig umbers as polyomials of the o-cetrality parameter: (3.9) S(,-rlc~)=~(k)s(-k,-r)c~ k k----0 where S(, r) = S(, r 10) is the usual Stirlig umbers. From (3.8) with r = 1 ad r = 2, o usig (3.9) ad S(- l, -1) = S(- 2, - 2) =1, S(,-2)=3(4)+(3 ) S(,-1)= () 2 ' it follows that (3.10) [() ]/ #(, ~, /3) -- #(u(, c~, /3) = 2 + us (~ + ~ + - 1), ad (3.11) 2[3(4)+(3)( 3c~+1)+(2) ~2 ] #(2)(, c~, t3) = (c~ + t )(c~ +/ ) 2 (4) + (3)(2o~ + 2~ + 1)+ (2)(a + ~)2 +a/3(c~ + ~-1) (~+/3+- 1)2(a+fl+- 2) i agreemet with the expressios obtaied by Jaarda (1988). Before cocludig this sectio it is worth otig that the expressio (3.4) has the followig direct probabilistic applicatio. The -th (power) momet about a arbitrary poit fl of a radom variable X obeyig a egative biomial, or biomial distributio, ca be expressed i terms of the geeralized Euleria polyomials. 4. The asymptotic behavior of the distributio The probability geeratig fuctios G(t; a, t3) of the geeralized Euleria distributio (1.1) which is give by (3.2) i terms of the geeralized Euleria polyomials A(t; a, ~) ca be writte as (4.1) G(t; c~, 13) = H(qj +pit), qj -- 1-pj, j = 1, 2,...,, j=l

8 204 CH. A. CHARALAMBIDES 0 < pl < p2 < "'" < p = 1. This represetatio is show by provig that the geeralized Euleria polyomial A(t; a, ~) has distict real o-positive roots for all = 1, 2,... This proof may be carried out by iductio as follows: The geeralized Euleria polyomials A(t; a,/3) satisfy the differecedifferetial equatio d (4.2) A+l(t; a,/3) = t(1 - t)~a(t; a,/3) + t(a +/3 + )A(t; a,/3), =0, 1, 2,... with A0(t; a,/3) = 1, which may be deduced from (3.1) o usig the triagular recurrece relatio (2.10) of the geeralized Euleria umbers A, k(c~,/3). From (4.2) it follows that At(t; a,/3) = (a +/3)t, A2(t; a,/3) = (a +/3)t[(a +/3)t + 1 t that is the statemet holds for = 1, 2. Now suppose that A(t; a,/3) has distict real o-positive roots ad cosider the fuctio B~(t; a,/3) = (1 - t)-(~+~+)a(t; a,/3). The B(t; a,/3) has exactly the same fiite zeroes as those of A(t; a,/3) ad the idetity (4.2) becomes d B B+l(t; a,/3) = t~ (t; a,/3), = 0, 1, 2,... B(t; a, 13) also has a zero at t = -oo, ad by Rolle's theorem, betwee ay two zeroes of B(t; a,/3), the derivative db(t; a, ~3)~dr has a zero. This implies that B+l (t; a,/3) has distict zeroes o the egative axis; obviously t = 0 is aother zero, makig + 1 altogether. Sice A+l(t; a,/3) is of degree + 1 by iductio, we have foud all roots ad the statemet is proved. As a cosequece of this property of the geeralized Euleria polyomials, the geeralized Euleria umber A,,,k (a,/3) is a strictly logarithmic cocave fuctio of k, that is (4.3) [A,k(a, /3)]2 > A,k+l(a, /3)A,k-l(C~, /3). Further, it follows that the geeralized Euleria distributio (1.1) is uimodal either with a peak or with a plateau of two poits (see, for example, Comtet (1974), p. 270). Let us, ow, cosider the sequece of idepedet zero-oe radom variables Zj, j = 1, 2,...,, with P(X,j = O) = qj, P(X,3 = 1) = pj, j = 1, 2,...,. The the probability geeratig fuctio of the sum S = ~ X,j is give by j=l (4.1) ad hece P(S = k) = A,k(a,/3)/(a +/3)["], k = 0, 1, 2,...,.

9 ON A GENERALIZED EULERIAN DISTRIBUTION 205 From (3.11) it follows that Var(S) --+ oc as -+ c~. Therefore, lettig Y,j -- [Var(S)]-l/2[Z,j - E(Z,j)], j -- 1, 2,..., ad F,j (y) = Pr(Y,j < y), it follows that for a give e > 0 there exists o such that [Y, k[ < e for all > o, implyig that the Lideberg coditio lim ~ f y2df~,j(y)=o, of the bouded variace ormal covergece criterio is fulfilled. Hece [s az(s ) ] (4.4) lim P L ~ <x =~(x) with beig the distributio fuctio of the stadard ormal distributio. Note that (4.4) still holds whe E(S~) ad Var(S) are replaced by approximate values (as --* cx)). The r-th factorial momet (3.8) may be approximated as follows: Itroducig the expressio r--k j=o r-k+j where S2(m, j) is the associated Stirlig umber of secod kid (see Comtet (1974), p. 226) ito (3.9), (3.8) may be writte as -k ak a+fl+-1,(r) (, /3) = ()( k r+j-k ) /( r ) " j=0 k=0 Sice $2(2r, r) = (2r)!/(r!2r), $2(2r - 1, r - 1) = (2r - 1)!/[3(r - 2)!2r-1], it follows that p(r)(, (~, /3) = (2~)/2r + [ra + r(r- 1)/3](2~-1)/2 ~-1 (c~ + fl + - 1)(~) A further approximatio of the factorial polyomials of leads to Therefore, + (-~+2)" p(r)(, o~,/3) ---- (/2) r + [rol + r(r - 1)/3](/2) r-1 + o(-r+2). #(, a,/3) = /2 + o(1), #(~)(, a,/3) = (/2) 2 + (a + 1/3) + o(1). Istead of usig these approximate values to fid a approximate value of the variace, it is better to derive such a value by approximatig its exact value (3.11). I this way, we fid a2(, a,/3) = il2 + o(1). Thus i (4.4) we may use (4.5) E(S) = /2, Var(S~) = il2.

10 206 CH. A. CHARALAMBIDES Ackowledgemets The author wishes to thak both referees for their valuable commets whe revisig this paper. REFERENCES Carlitz, L. ad Scoville, R. (1974). Geeralized Euleria umbers: combiatorial applicatios, J. Reie Agew. Math., 265, Comtet, L. (1974). Advaced Combiatorics, Reidel, Dordrecht, Hollad. Jaarda, K. G. (1988). Relatioship betwee Morisita's model for estimatig the evirometal desity ad the geeralized Euleria umbers, A. Ist. Statist. Math., 40, Koutras, M. (1982). No-cetral Stirlig umbers ad some applicatios, Discrete Math., 42, Morisita, M. (1971). Measurig of habitat value by evirometal desity method, Statistical Ecology (eds. G. P. Patil et al.), , The Pesylvaia State Uiversity Press.

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

1 Graph Sparsfication

1 Graph Sparsfication CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

Module 8-7: Pascal s Triangle and the Binomial Theorem

Module 8-7: Pascal s Triangle and the Binomial Theorem Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced

More information

Convergence results for conditional expectations

Convergence results for conditional expectations Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,

More information

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com) wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

Random Graphs and Complex Networks T

Random Graphs and Complex Networks T Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

A Comparative Study of Positive and Negative Factorials

A Comparative Study of Positive and Negative Factorials A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the

More information

Novel Encryption Schemes Based on Catalan Numbers

Novel Encryption Schemes Based on Catalan Numbers D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

5.3 Recursive definitions and structural induction

5.3 Recursive definitions and structural induction /8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information

The digraph drop polynomial

The digraph drop polynomial The digraph drop polyomial Fa Chug Ro Graham Abstract For a weighted directed graph (or digraph, for short), deoted by D = (V, E, w), we defie a two-variable polyomial B D (x, y), called the drop polyomial

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis

More information

SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION

SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Palestie Joural of Mathematics Vol. 607, 38 46 Palestie Polytechic Uiversity-PPU 07 SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Chirag Garg ad R. K. Sharma Commuicated by Ayma Badawi MSC

More information

3. b. Present a combinatorial argument that for all positive integers n : : 2 n

3. b. Present a combinatorial argument that for all positive integers n : : 2 n . b. Preset a combiatorial argumet that for all positive itegers : : Cosider two distict sets A ad B each of size. Sice they are distict, the cardiality of A B is. The umber of ways of choosig a pair of

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Matrix representation of a solution of a combinatorial problem of the group theory

Matrix representation of a solution of a combinatorial problem of the group theory Matrix represetatio of a solutio of a combiatorial problem of the group theory Krasimir Yordzhev, Lilyaa Totia Faculty of Mathematics ad Natural Scieces South-West Uiversity 66 Iva Mihailov Str, 2700 Blagoevgrad,

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

CSE 417: Algorithms and Computational Complexity

CSE 417: Algorithms and Computational Complexity Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

UNIT 1 RECURRENCE RELATIONS

UNIT 1 RECURRENCE RELATIONS UNIT RECURRENCE RELATIONS Structure Page No.. Itroductio 7. Objectives 7. Three Recurret Problems 8.3 More Recurreces.4 Defiitios 4.5 Divide ad Coquer 7.6 Summary 9.7 Solutios/Aswers. INTRODUCTION I the

More information

Symmetric Class 0 subgraphs of complete graphs

Symmetric Class 0 subgraphs of complete graphs DIMACS Techical Report 0-0 November 0 Symmetric Class 0 subgraphs of complete graphs Vi de Silva Departmet of Mathematics Pomoa College Claremot, CA, USA Chaig Verbec, Jr. Becer Friedma Istitute Booth

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

Mathematical Stat I: solutions of homework 1

Mathematical Stat I: solutions of homework 1 Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More information

The Adjacency Matrix and The nth Eigenvalue

The Adjacency Matrix and The nth Eigenvalue Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

Recurrent Formulas of the Generalized Fibonacci Sequences of Third & Fourth Order

Recurrent Formulas of the Generalized Fibonacci Sequences of Third & Fourth Order Natioal Coferece o 'Advaces i Computatioal Mathematics' 7-8 Sept.03 :- 49 Recurret Formulas of the Geeralized Fiboacci Sequeces of hird & Fourth Order A. D.Godase Departmet of Mathematics V.P.College Vaijapur

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

Compactness of Fuzzy Sets

Compactness of Fuzzy Sets Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

More information

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Counting Regions in the Plane and More 1

Counting Regions in the Plane and More 1 Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

A study on Interior Domination in Graphs

A study on Interior Domination in Graphs IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,

More information

Some cycle and path related strongly -graphs

Some cycle and path related strongly -graphs Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i

More information

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70 NOTE:. Attempt all seve questios. Major CSL 02 2. Write your ame ad etry o o every sheet of the aswer script. Time 2 Hrs Max Marks 70 Q No Q Q 2 Q 3 Q 4 Q 5 Q 6 Q 7 Total MM 6 2 4 0 8 4 6 70 Q. Write a

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

Examples and Applications of Binary Search

Examples and Applications of Binary Search Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We

More information

CMPT 125 Assignment 2 Solutions

CMPT 125 Assignment 2 Solutions CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address

More information

ABOUT A CONSTRUCTION PROBLEM

ABOUT A CONSTRUCTION PROBLEM INTERNATIONAL JOURNAL OF GEOMETRY Vol 3 (014), No, 14 19 ABOUT A CONSTRUCTION PROBLEM OVIDIU T POP ad SÁNDOR N KISS Abstract I this paper, we study the costructio of a polygo if we kow the midpoits of

More information

On Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets

On Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya

More information

INTERSECTION CORDIAL LABELING OF GRAPHS

INTERSECTION CORDIAL LABELING OF GRAPHS INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,

More information

THE COMPETITION NUMBERS OF JOHNSON GRAPHS

THE COMPETITION NUMBERS OF JOHNSON GRAPHS Discussioes Mathematicae Graph Theory 30 (2010 ) 449 459 THE COMPETITION NUMBERS OF JOHNSON GRAPHS Suh-Ryug Kim, Boram Park Departmet of Mathematics Educatio Seoul Natioal Uiversity, Seoul 151 742, Korea

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

Analysis of Algorithms

Analysis of Algorithms Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms

More information

Matrix Partitions of Split Graphs

Matrix Partitions of Split Graphs Matrix Partitios of Split Graphs Tomás Feder, Pavol Hell, Ore Shklarsky Abstract arxiv:1306.1967v2 [cs.dm] 20 Ju 2013 Matrix partitio problems geeralize a umber of atural graph partitio problems, ad have

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #2

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #2 Name Date Hr. ALGEBRA - SPRING FINAL MULTIPLE CHOICE REVIEW # 5. Which measure of ceter is most appropriate for the followig data set? {7, 7, 75, 77,, 9, 9, 90} Mea Media Stadard Deviatio Rage 5. The umber

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

Spanning Maximal Planar Subgraphs of Random Graphs

Spanning Maximal Planar Subgraphs of Random Graphs Spaig Maximal Plaar Subgraphs of Radom Graphs 6. Bollobiis* Departmet of Mathematics, Louisiaa State Uiversity, Bato Rouge, LA 70803 A. M. Frieze? Departmet of Mathematics, Caregie-Mello Uiversity, Pittsburgh,

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information