On Deterministic Finite Automata and Syntactic Monoid Size, Continued
|
|
- Agnes O’Connor’
- 5 years ago
- Views:
Transcription
1 O Dtrmiistic Fiit Automata ad Sytactic Mooid Siz, Cotiud Markus Holzr ad Barbara Köig Istitut für Iformatik, Tchisch Uivrsität Müch, Boltzmastraß 3, D Garchig bi Müch, Grmay mail: Abstract. W cotiu our ivstigatio o th rlatioship btw rgular laguags ad sytactic mooid siz. I this papr w cofirm th cojctur o two grator trasformatio smigroups. W show that for vry prim 7 thr xist atural umbrs k ad l with = k + l such that th smigroup U k,l is maximal w.r.t. its siz amog all (trasformatio) smigroups which ca b gratd with two grators. This sigificatly tights th boud o th sytactic mooid siz of laguags accptd by -stat dtrmiistic fiit automata with biary iput alphabt. As a by-product of our ivstigatios w ar abl to dtrmi th maximal siz amog all smigroups gratd by two trasformatios, whr o is a prmutatio with a sigl cycl ad th othr is a o-bijctiv mappig. 1 Itroductio Fiit automata ar usd i svral applicatios ad implmtatios i softwar girig, programmig laguags ad othr practical aras i computr scic. Thy ar o of th first ad most itsly ivstigatd computatioal modls. Sic rgular laguags hav may rprstatios i th world of fiit automata it is atural to ivstigat th succictss of thir diffrt rprstatios. Rctly, th siz of th sytactic mooid as a atural masur of dscriptiv complxity for rgular laguags was proposd i [3] ad studid i dtail. Rcall, that th sytactic mooid of a laguag L is th smallst mooid rcogizig th laguag udr cosidratio. It is uiquly dfid up to isomorphism ad is iducd by th sytactic cogruc L dfid ovr Σ by v 1 L v 2 if ad oly if for vry u, w Σ w hav uv 1 w L uv 2 w L. Th sytactic mooid of L is th quotit mooid M(L) = Σ / L. I particular, th siz of trasformatio mooids of -stat (miimal) dtrmiistic fiit automata was ivstigatd i [3]. I most cass tight uppr bouds o th sytactic mooid siz wr obtaid. It was prov that a - stat dtrmiistic fiit automato with siglto iput alphabt (iput alphabt with at last thr lttrs, rspctivly) iducs a liar (, rspctivly) siz sytactic mooid. I th cas of two lttr iput alphabt, a lowr boud of ( ) l l! k ( l) k k l l, for som atural umbrs k ad l clos to 2, ad a trivial
2 o-matchig uppr boud of!+g(), whr g() dots Ladau s fuctio [5 7], which givs th maximal ordr of all prmutatios i S, for th siz of th sytactic mooid of a laguag accptd by a -stat dtrmiistic fiit automato was giv. This iducs a family of dtrmiistic fiit automata such that th fractio of th siz of th iducd sytactic mooid ad tds to 1 as gos to ifiity, ad is th startig poit of our ivstigatios. I this papr w tight th boud o th sytactic mooid siz o two grators, cofirmig th cojctur, that for vry prim 7 thr xist atural umbrs k ad l with = k + l such that th smigroup U k,l as itroducd i [3] is maximal w.r.t. its siz amog all (trasformatio) smigroups which ca b gratd with two grators. Sic U k,l, for suitabl k ad l is a sytactic mooid, this sharps th abov giv boud for sytactic mooids iducd by -stat dtrmiistic fiit automata with biary iput alphabt. I ordr to show that thr is o largr subsmigroup of T with two grators, w ivstigat all possibl combiatios of grators. I pricipl th followig situatios for grators appar: 1. Two prmutatios, 2. a prmutatio with o cycl ad a o-bijctiv trasformatio, 3. a prmutatio with two or mor cycls ad a o-bijctiv trasformatio th smigroup U k,l is of this typ, ad 4. two o-bijctiv trasformatios. I th forthcomig w will show that for a larg ough th maximal subsmigroup is of typ (3) ad that whvr is prim th smigroup is isomorphic to som U k,l. Th tir argumt rlis o a sris of lmmata covrig th abov mtiod cass, whr th scod cas plays a major rol. I fact, as a by-product w ar abl to dtrmi th maximal siz amog all smigroups gratd by two trasformatios, whr o trasformatio is a prmutatio with a sigl cycl ad th othr is a o-bijctiv mappig. I ordr to achiv our goal w us divrs tchiqus from algbra, aalysis, ad v computr vrifid rsults for a fiit umbr of cass. Th papr is orgaizd as follows. I th xt sctio w itroduc th cssary otatios. Th i Sctio 3 w start our ivstigatios with th cas whr o is a prmutatio with a sigl cycl ad th othr is a o-bijctiv mappig. Nxt, two prmutatios ad two o-bijctiv mappigs ar cosidrd. Sctio 5 dals with th most complicatd cas, whr th prmutatio cotais two or mor cycls, ad Sctio 6 is dvotd to th mai rsult of this papr, o th siz maximality of th smigroup udr cosidratio. Fially, w summariz our rsults ad stat som op problms. 2 Dfiitios W assum th radr to b familiar with th basic otios of formal laguag thory ad smigroup thory, as cotaid i [4] ad [9]. I this papr w ar dalig with rgular laguags ad thir sytactic mooids. A smigroup is a
3 o-mpty st S quippd with a associativ biary opratio, i.., (αβ)γ = α(βγ) for all α, β, γ S. Th smigroup S is calld a mooid if it cotais a idtity lmt id. If E is a st, th w dot by T (E) th mooid of fuctios from E ito E togthr with th compositio of fuctios. W rad compositio from lft to right, i.., first α, th β. Bcaus of this covtio, it is atural to writ th argumt i of a fuctio to th lft: (i)αβ = ((i)α)β. Th imag of a fuctio α i T (E) is dfid as img(α) = { (i)α i E } ad th krl of α is th quivalc rlatio, which is iducd by i j if ad oly if (i)α = (j)α. I particular, if E = {1,..., }, w simply writ T for th mooid T (E). Th mooid of all prmutatios ovr lmts is dotd by S ad trivially is a sub-mooid of T. Th smigroup w ar itrstd i is dfid blow ad was itroducd i [3] i ordr to study th rlatio btw -stat dtrmiistic fiit automata with biary iput alphabt ad th siz of sytactic mooids. Dfiitio 1. Lt 2 such that = k + l for som atural umbrs k ad l. Furthrmor, lt α = ( k)(k + 1 k ) b a prmutatio of S cosistig of two cycls. W dfi th smigroup U k,l as a subst of T as follows: A trasformatio γ is a lmt of U k,l if ad oly if 1. thr xists a atural umbr m N such that γ = α m or 2. th trasformatio γ satisfis that (a) thr xist i {1,..., k} ad j {k + 1,..., } such that (i)γ = (j)γ ad (b) thr xists h {k + 1,..., } such that h img(γ). Obsrv, that it is always bttr to choos th lmt h which is missig i th imag of γ from th largr cycl of α sic this yilds a largr smigroup U k,l. Thrfor w ca safly assum that k l. I [3] it was show that if gcd{k, l} = 1, th th smigroup U k,l ca b gratd by two grators oly. Morovr, i this cas, U k,l is th sytactic mooid of a laguag accptd by a -stat dtrmiistic fiit automato, whr = k + l. Fially, w d som additioal otatio. If A is a arbitrary o-mpty subst of a smigroup S, th th family of subsmigroups of S cotaiig A is o-mpty, sic S itslf is o such smigroup; hc th itrsctio of th family is a subsmigroup of S cotaiig A. W dot it by A. It is charactrizd withi th st of subsmigroups of S by th proprtis: (1) A A ad (2) if U is a subsmigroup of S cotaiig A, th A U. Th smigroup A cosists of all lmts of S that ca b xprssd as fiit products of lmts i A. If A = S, th w say that A is a st of grators for S. If A = {α, β} w simply writ A as α, β. 3 Smigroup Siz Th Sigl Cycl Cas I this sctio w cosidr th cas whr o grator is a prmutatio cotaiig a sigl cycl ad th othr is a o-bijctiv trasformatio. This situatio
4 is of particular itrst, sic it allows us to compltly charactriz this cas ad morovr it is vry hlpful i th squl wh dalig with two prmutatios or two o-bijctiv trasformatios. Th outli of this sctio is as follows: First w dfi a subst of T by som asy proprtis as i th cas of th U k,l smigroup, vrify that it is a smigroup ad that it is gratd by two grators. Th subst of T w ar itrstd i, is dfid as follows: Dfiitio 2. Lt 2 ad 1 d <. Furthrmor, lt α = ( ) b a prmutatio of S cosistig of o cycl. W dfi V d as a subst of T as follows: A trasformatio γ is a lmt of V d if ad oly if 1. thr xists a atural umbr m N such that γ = α m or 2. thr xists a i {1,..., } such that (i)γ = (i + d)γ, whr + dots th additio modulo. Th ituitio bhid choosig this spcific smigroup V d is th followig: Without loss of grality w ca assum that α = ( ). By choosig a o-bijctiv trasformatio β which maps two lmts 1 i < j oto th sam imag o ca ifr that vry trasformatio γ gratd by α ad β is ithr a multipl of α or maps two lmts of distac d := j i to th sam valu. Nxt w show that V d is idd a smigroup ad that V d is isomorphic to V d if gcd{, d} = gcd{, d }. Thrfor, it will b sufficit to cosidr oly divisors of i th followig. W omit th proof of th followig lmma. Lmma 1. Th st V d is closd udr compositio ad is thrfor a (trasformatio) smigroup. Morovr, V d is isomorphic to V d whvr d = gcd{, d }. Bfor w ca prov that V d ca b gratd by two lmts of T w d a rsult, which costituts how to fid a complt basis for th symmtric group S. Th rsult giv blow was show i [8]. Thorm 1. Giv a o-idtical lmt α i S, th thr xists β such both grat th symmtric group S, providd that it is ot th cas that = 4 ad α is o of th thr prmutatios (1 2)(3 4), (1 3)(2 4), ad (1 4)(2 3). Now w ar rady for th proof that two lmts ar ough to grat all of th smigroup V d. Du to th lack of spac w omit th proof of th followig thorm, which is havily basd o Thorm 1. Thorm 2. Lt 2 ad 1 d <. Th smigroup V d ca b gratd by two lmts of T, whr o lmt is th prmutatio α = ( ) ad th othr is a lmt β of krl siz 1. 1 I ordr to dtrmi th siz of V d, th followig thorm, rlatig siz ad umbr of colourigs of a particular graph, is vry usful i th squl. 1 Obsrv, that thr is a -stat miimal dtrmiistic fiit automato A with biary iput alphabt th trasitio mooid of which quals V d. Hc, V d is th sytactic mooid of L(A). Sic this statmt ca b asily s, w omit its proof.
5 Thorm 3. Lt 2 ad 1 d < with d. Dot th udirctd graph cosistig of d circls, ach of lgth d, by G. Th V d = + N, whr N = ( ( 1) d + ( 1) d ( 1) ) d is th umbr of ivalid colourigs of G with colours. Proof. Th subsmigroup V d ca b obtaid from T by rmovig all trasformatios ot satisfyig th scod part of Dfiitio 2 ad by addig th multipls of α aftrwards. Th umbr of th formr trasformatios ca b dtrmid as follows: Assum that a graph G has ods V = {1,..., } whr a circl C k cosists of ods {k, k + d,..., k + id,..., k + d}, for 1 k d. Th o ca asily vrify that th colourigs of G ar xactly th trasformatios which do ot satisfy th scod part of Dfiitio 2. Th umbr of colourigs of a graph G with k colours is dscribd by its chromatic polyomial, s,.g. [10]. Sic th chromatic polyomial of a circl C with ods is (k 1) + ( 1) (k 1) ad th chromatic polyomial of a graph cosistig of discoctd compots is th product of th chromatic polyomials of its compots, th dsird rsult follows. Now w ar rady to prov som asymptotics o th siz of V d for som particular valus of d, which ar dtrmid first. Thorm 4. Th siz of V d is maximal whvr d = max({1} { d d divids ad d is odd }). Lt V dot th smigroup V d of maximal siz. Th V lim = 1 1, whr is th bas of th atural logarithm. Proof. Th maximality of V d w.r.t. its siz is s as follows. W first dfi two ral-valud fuctios ( ) x ( ) x u v,k (x) = ( 1) k x + ( 1) ad u odd,k (x) = ( 1) k x ( 1). Th additioal idx k is prst for latr us s Lmma 5. For ow w assum that k =. W hav V d = + u v, (d) whvr d is v ad V d = + u odd,(d) whvr d is odd. Obviously uodd,k < uv,k. First w show that uv,k is strictly mooto by takig th first drivatio of l u v,k (x). W obtai d ) l uv,k (x) = l (( 1) k x + ( 1) + x ( 1) k x l( 1) ( ) k x 2 dx ( 1) k x + ( 1) ( ) > l ( 1) k x k ( 1) k x l( 1) x ( 1) k x = k x l( 1) k l( 1) = 0 x
6 Aalogously o ca show that u odd,k is strictly atito. So if thr xist divisors d such that d is odd, th smigroup V d is maximal w.r.t. its siz whvr w choos th largst such d. Othrwis thr ar oly divisors d such that d is v ad w choos th smallst of ths divisors which is 1. Nxt cosidr th smigroup V = V d, for som 1 d <. From our prvious ivstigatios o ca ifr that th followig iqualitis hold: + ( 1) ( 1) + ( ( 1) d + ( 1) d ( 1) ) d + ( ( 1) 3 ( 1) ) 3. Th scod half of th iquality follows sic th siz of V d is maximal whvr d is odd ad 1 d < is maximal. This is achivd idally whvr d = 3. Th rst follows with th mootoicity ad atitoicity of th fuctios u v, ad u odd,, rspctivly. W ow dtrmi th limits of th lowr ad uppr bouds. Thr w fid that + ( 1) ( ( 1) lim = lim = 1 lim = 1 1, ( ) ) 1 ( 1 ) 1 1 lim sic lim (1 + 1 ) =, ad th limit of th uppr boud tds also to 1 1 by similar rasos as abov. Hc lim V = 1 1. From th asymptotic bhaviour of th smigroups V ad U k,l w immdiatly ifr th followig thorm. Thorm 5. Thr xists a atural umbr N such that for vry N, thr xist k ad l with = k + l such that V < U k,l. Proof. Th xistc of a atural umbr N satisfyig th rquirmts giv abov follows from Thorm 4 ad a rsult from [3], which stat that V lim = 1 1 for suitabl k() ad l(). ad U k(),l() lim = 1, Th followig lmma shows that whvr w hav a prmutatio cosistig of a sigl cycl ad a o-bijctiv trasformatio, w obtai at most as may lmts as cotaid i V. Lmma 2 (A cycl ad a o-bijctiv trasformatio). If α S such that α cosists of a sigl cycl ad β T \S, th α, β V.
7 Proof. Sic th prmutatio α cosists of a sigl cycl, thr is a prmutatio π such that παπ 1 = ( ). W st α = παπ 1 ad β = πβπ 1. Bcaus π is a bijctio, w ca ifr that α, β = α, β. Thr ar two lmts i < j such that (i)β = (j)β. W dfi d = j i. It ca b asily s that α ad β grat at most th trasformatios spcifid i Dfiitio 2. Thrfor w coclud that α, β V. Obsrv, that bcaus of Thorm 5, Lmma 2 implis that thr xists a atural umbr N such that for vry N thr xist k ad l with = k + l such that α, β < U k,l, for vry α S such that α cosists of a sigl cycl ad β T \S. 4 Smigroup Siz Two Prmutatios or No-Bijctiv Mappigs I this sctio w show that two prmutatios or two o-bijctiv trasformatio ar ifrior i siz to a U k,l smigroup, for larg ough = k + l. Hr it turs out, that th smigroup V is vry hlpful i both cass. If w tak two prmutatios as grators, th w ca at most obtai th symmtric group S. Lmma 3 (Two prmutatios). Lt 2. If α, β S, th α, β < V. Sktch of Proof. Obviously, for prmutatios α ad β w hav α, β!. I ordr to prov th statd iquality it suffics to show that! < V 1. Th dtails ar lft to th radr. Nxt w cosidr th cas of two o-bijctiv trasformatios. Lmma 4 (Two o-bijctiv trasformatios). Lt 2. If both α ad β i T \ S, th α, β < V. Proof. Sic α ad β ar both o-bijctiv, thr ar idics j 1 < k 1 ad j 2 < k 2 such that (j 1 )α = (k 1 )α ad (j 2 )β = (k 2 )β. I this cas w ca costruct a prmutatio π such that (i 1 )π = j 1, (i 1 + 1)π = k 1 for som idx i 1 ad (i 2 )π = j 2, (i 2 + 1)π = k 2 for som idx i 2. If j 1 = j 2, th it is th cas that i 1 = i 2, similarly if j 1 = k 2, th i 1 = i 2 + 1, tc. This mas that all trasformatios gratd by παπ 1 ad πβπ 1 satisfy th scod part of Dfiitio 2 for d = 1. Accordig to Dfiitio 2 th st παπ 1, πβπ 1, ad thrfor also α, β which is isomorphic, hav lss lmts tha V 1, sic at last th prmutatios ar missig. Thus, th statd claim follows. 5 Smigroup Siz Two ad Mor Cycls Fially w cosidr th cas whr o of th grators is a prmutatio α cosistig of two or mor cycls ad th othr is a o-bijctiv trasformatio. I this cas w distiguish two sub-cass, accordig to whthr th o-bijctiv trasformatio β mrgs lmts from th sam or diffrt cycls of α. W start our ivstigatio with th cas whr thr ar i ad j such that (i)β = (j)β ad both ar locatd withi th sam cycl of α.
8 Lmma 5 (A arbitrary prmutatio ad a o-bijctiv mappig mrgig lmts from th sam cycl). Thr xists a atural umbr N such that for vry N th followig holds: Lt α, β T b trasformatios whr α is a prmutatio. Furthrmor lt β b a o-bijctiv trasformatio such that (i)β = (j)β ad both i ad j ar locatd i th sam cycl of α. Th thr xist k ad l with = k + l such that α, β < U k,l. Proof. W assum that i ad j ar locatd i th sam cycl of lgth m with distac d w.r.t. thir locatio withi th cycl. W ca assum that d divids m, othrwis w ca fid a isomorphic smigroup whr this is th cas, followig th idas of th proof of Lmma 1. With a similar argumt as i th proof of Thorm 3 w ca dduc that th smigroup gratd by α ad β cotais at most som prmutatios ad th ivalid colourigs of a graph G, whr G cosists of d circls of lgth m d ad m isolatd ods. Th umbr of valid colourigs of such a graph quals (( 1) m d + ( 1) m d ( 1)) d m. Thrfor w coclud α, β +! ( ( 1) m d + ( 1) m d ( 1) ) d m. Similar rasoig as i th proof of Thorm 4 shows that +! ( ( 1) m d + ( 1) m d ( 1) ) d m +! ( ( 1)( 2) 2 ) 3 ad lim ( ) +! ( 1)( 2) 3 2 = 1 1. Hc, a similar asymptotic argumt as i th proof of Thorm 5 shows that thr is a atural umbr N such for vry N th siz of th smigroups o lmts udr cosidratio is strictly lss tha th siz of U k,l, for suitabl k ad l with = k + l. Fially, w cosidr th cas whr th o-bijctiv trasformatio β mrgs lmts from diffrt cycls of th prmutatio α. I th rmaidr of this sctio w assum = k +l to b a prim umbr. Th rasos for this assumptio is that k ad l ar always coprim, which guarats that U k,l ca b gratd by two grators oly. Lmma 6 (A prmutatio with two or mor cycls ad a o-bijctiv mappig mrgig lmts from diffrt cycls). Lt b a prim umbr ad lt α, β T b trasformatios whr α is a prmutatio cosistig of m 2 cycls. Furthrmor lt β b a o-bijctiv trasformatio such that (i)β = (j)β ad i ad j ar locatd i diffrt cycls of α. Th thr xist k ad l with = k + l such that α, β U k,l.
9 Proof. W dfi U := α, β ad show that U U, whr U is gratd by a two-cycl prmutatio α ad a o-bijctiv mappig β that mrgs lmts of diffrt cycls, as dscribd blow i dtail. Now assum that th m cycls i α hav lgths k 1,..., k m, i.., = m i=1 k i. Furthrmor th sts of lmts of th m cycls ar dots by C 1,..., C m ad C i = k i. Without loss of grality w may assum that β mrgs lmts of th first two cycls C 1 ad C 2. W ow cosidr th followig two cass accordig to which lmt is missig i th imag of β: 1. Thr is a lmt h which is ot cotaid i th imag of β ad morovr, h is ot locatd i th first two cycls of α. So lt us assum that it is locatd i th third cycl C 3. Lt α b a prmutatio with two cycls, whr th lmts of th first cycl ar C 1 = C 2 m i=4 C i ad th lmts of th scod cycl ar C 2 = C 1 C 3. I th cycls ths lmts ca b arragd i a arbitrary way. W ow st k = k 2 + m i=4 k i ad l = k 1 + k 3. Sic = k + l ad is prim, it follows that gcd{k, l} = 1. Similar to th costructio for th U k,l o ca ow fid a trasformatio β such that α ad β grat a smigroup U isomorphic to U k,l. That mas, th lmts of U ar xactly th multipls of α ad all trasformatios γ which satisfy (i)γ = (j)γ, for i C 1 ad j C 2, ad whr at last o lmt of C 2 is missig i th imag of γ. Now lt us compar th sizs of U ad U. First cosidr oly th obijctiv trasformatios of U. This icluds at last all o-bijctiv trasformatios gratd by α ad β, sic th first cycl of α icluds C 2 ad th scod cycl of α icluds C 1 ad C 3. So for ay o-bijctiv γ gratd by α ad β thr ar idics i C 1, j C 2, h C 3 such that (i)γ = (j)γ ad h img(γ). This implis that γ ca b gratd by α ad β as wll. Howvr, U may cotai mor prmutatios tha U. I th worst cas, if gcd{k i, k j } = 1 for all pairs of cycl lgths with i j, th U cotais m i=1 k i prmutatios, whras U cotais oly kl prmutatios, which might b lss. W show that this shortcomig is alrady compsatd by th umbr of trasformatios with imag siz 1. Th smigroup U cotais k 1 k 2 k 3 ( 1)! mappigs with imag siz 1. W first choos th two lmts which ar i th sam krl quivalc class, for which thr ar k 1 k 2 possibilitis, th w choos th lmt of th imag that is missig, for which thr ar k 3 possibilitis, ad fially w distribut th 1 lmts of th imag oto th krl quivalc classs. I th sam way w ca show that thr ar kl 2 ( 1)! trasformatios with imag siz 1 i U. Now dfi k = m i=4 k i ad obsrv, that k might b qual to 0. Th w coclud that kl 2 k 1 k 2 k 3 = (k 2 + k )(k 1 + k 3 ) 2 k 1 k 2 k 3 = (k 2 + k )(k k 1 k 3 + k 2 3) k 1 k 2 k 3 = k 2 1k 2 + k 1 k 2 k 3 + k 2 k k k k k 1 k 3 + k k 2 3 k 1 + k 2 + k 3 + k =.
10 Thrfor U cotais at last! mor trasformatios of imag siz 1 tha U. This maks up for th missig prmutatios, sic thr ar at most! of thm. 2. Th missig lmt h of th imag of β is locatd i o of th first two cycls. Th a aalogous costructio as i (1) shows how to costruct suitabl α ad β such that U α, β. Du to th lack of spac th dtails ar lft to th radr. This complts our proof ad shows that α, β U k,l, bcaus i both cass smigroup U is isomorphic to som U k,l, for appropriat k ad l. 6 O th Maximality of U k,l Smigroups Now w ar rady to prov th mai thorm of this papr, amly that th siz maximal smigroup has U k,l lmts, for som k ad l, whvr = k + l is a prim gratr or qual tha 7. Obsrv, that th followig thorm strgths Lmma 5. Thorm 6. Lt 7 b a prim umbr. Th th smigroup U k,l, for som k ad l with = k + l, is maximal w.r.t. its siz amog all smigroups which ca b gratd with two grators. Proof. Sic all othr cass hav alrady b tratd i th Lmmata 3, 4, ad 6, it is lft to show that U k,l has mor lmts tha th smigroup V, whr V is gratd by α ad β ad lattr mappig mrgs lmts locatd i th sam cycl of α. Not that k ad l ar trivially coprim whvr = k + l is a prim. W hav show i Lmma 5 that V +! ( ( 1)( 2) 3 Furthrmor from [3] it follows that U k,l ) 3 = +! (( 1)( 2)) 3. ( ) l! k l ( ) k k l l. l W us Stirlig s approximatio i th vrsio ( ) ( ) 1 2π <! < 2π 12 giv i [1, 11]. I this way w obtai a uppr boud for V ad a lowr boud for U k,l, s th proof i [3], as follows: ad V + ( ) 1 2π 12 (( 1)( 2)) 3
11 U k,l ( ( ) ) Th uppr boud for V is smallr tha th lowr boud for U k,l whvr 2 ( 2 ) < ( ( 1)( 2) 2 ) 3 } {{ } A() ( ) 1 2π 1 12 }{{} B() Th fuctio A() is mooto ad covrgs to whil th fuctio B() is atito ad covrgs to 0. For 20 w hav A() > ad B() < 10 7, ad thrfor A() B() > 0.35 =: c. W st c 1 = 0.01 ad c 2 = 0.34 ad solv th quatios 2 ( 2 ) < c1 ad < c2. Ths quatios ar satisfid if ( ) log c > 2 log ad > ( 8 c ) , i.., whvr 82. Th rmaiig cass for 7 81 hav b chckd with th hlp of th Groups, Algorithms ad Programmig (GAP) systm for computatioal discrt algbra. To this d w hav vrifid that V U k,l, for som k ad l, whr th uppr boud for V from Lmma 5 ad th xact valu of U k,l was usd. 2 It turd out that V is maximal w.r.t. siz for all V smigroups.. 7 Coclusios W hav cofirmd th cojctur i [3] o th siz of two grator smigroups. I th d, w hav show that for prim, such that 7, th smigroup gratd by two grators with maximal siz ca b charactrizd i a vry ic ad accurat way. Th cass 2 6 ar ot tratd i this papr, but w 2 Th formula giv blow did ot appar i [3] ad givs th xact siz of th U k,l smigroup: Lt k, l N such that gcd{k, l} = 1. Th smigroup U k,l cotais xactly U k,l = kl + X i=1! i!! ( ) l i l i ( )( )! ix k l i! r i r lmts, whr = k + l. Hr i stads for th Stirlig umbrs of th scod kid ad dots th umbr of possibilitis to partitio a -lmt st ito i o-mpty substs. r=1
12 wr abl to show that i all ths cass th smigroup V cotais a maximal umbr of lmts. Hr 2 5 wr do by brut forc sarch usig th GAP systm ad = 6 by additioal quit ivolvd cosidratios, which w hav to omit to du th lack of spac. Morovr, w hav compltly classifid th cas wh o grator is a prmutatio cosistig of a sigl cycl. Nvrthlss, som qustios rmai uaswrd. First of all, what about th cas wh 7 is ot a prim umbr. W cojctur, that Thorm 6 also holds i this cas, but w hav o proof yt. Also, th qustio how to choos k ad l proprly rmais uaswrd. I ordr to maximiz th siz of U k,l o has to miimiz th umbr of valid colourigs s [3] which is miimal if k ad l ar clos to 2. This clashs with th obsrvatio that th cycl α from which a lmt i th imag of β is missig should b as larg as possibl. Nvrthlss, to maximiz th siz of U k,l w cojctur that for larg ough both k ad l ar as clos to 2 as th coditio that k ad l should b coprim allows. Agai a proof of this statmt is still missig. I ordr to udrstad th vry atur of th qustio much bttr, a stp towards its solutio would b to show that th squc U k,l for fixd = k+l ad varyig k is uimodal. 8 Ackowldgmts Thaks to Rob Johso, ad Paul Pollack, ad Joh Robrtso for thir hlp i maagig th sstial stp i th proof of Lmma 1. Rfrcs 1. W. Fllr. Stirlig s formula. I A Itroductio to Probability Thory ad Its Applicatios, volum 1, chaptr 2.9, pags Wily, 3rd ditio, G. H. Hardy ad E. M. Wright. A Itroductio to th Thory of Numbrs. Clardo, 5th ditio, M. Holzr ad B. Köig. O dtrmiistic fiit automata ad sytactic mooid siz. I M. Ito ad M. Toyama, ditors, Prprocdigs of th 6th Itratioal Cofrc o Dvlopmts i Laguag Thory, pags , Kyoto, Japa, Sptmbr Kyoto Sagyo Uivrsity. To appar i LNCS. 4. J. M. Howi. A Itroductio to Smigroup Thory, volum 7 of L. M. S. Moographs. Acadmic Prss, E. Ladau. Übr di Maximalordug dr Prmutatio ggb Grads. Archiv dr Mathmatik ud Physik, 3:92 103, J.-L. Nicolas. Sur l ordr maximum d u élémt das l group s ds prmutatios. Acta Arithmtica, 14: , J.-L. Nicolas. Ordr maximum d u élémt du group d prmutatios t highly composit umbrs. Bullti of th Mathmatical Socity Frac, 97: , S. Piccard. Sur ls bass du group symétriqu t ls coupls d substitutios qui gdrt u group régulir. Librairi Vuibrt, Paris, J.-E. Pi. Varitis of formal laguags. North Oxford, R. C. Rad. A itroductio to chromatic polyomials. Joural of Combiatorial Thory, 4:52 71, H. Robbis. A rmark of Stirlig s formula. Amrica Mathmatical Mothly, 62:26 29, 1955.
PURE MATHEMATICS A-LEVEL PAPER 1
-AL P MATH PAPER HONG KONG EXAMINATIONS AUTHORITY HONG KONG ADVANCED LEVEL EXAMINATION PURE MATHEMATICS A-LEVEL PAPER 8 am am ( hours) This papr must b aswrd i Eglish This papr cosists of Sctio A ad Sctio
More informationNEW VERSION OF SZEGED INDEX AND ITS COMPUTATION FOR SOME NANOTUBES
Digst Joural of Naomatrials ad Biostructurs Vol 4, No, March 009, p 67-76 NEW VERSION OF SZEGED INDEX AND ITS COMPUTATION FOR SOME NANOTUBES A IRANMANESH a*, O KHORMALI b, I NAJAFI KHALILSARAEE c, B SOLEIMANI
More informationz 1+ 3 z = Π n =1 z f() z = n e - z = ( 1-z) e z e n z z 1- n = ( 1-z/2) 1+ 2n z e 2n e n -1 ( 1-z )/2 e 2n-1 1-2n -1 1 () z
Sris Expasio of Rciprocal of Gamma Fuctio. Fuctios with Itgrs as Roots Fuctio f with gativ itgrs as roots ca b dscribd as follows. f() Howvr, this ifiit product divrgs. That is, such a fuctio caot xist
More informationChapter 2 Infinite Series Page 1 of 11. Chapter 2 : Infinite Series
Chatr Ifiit Sris Pag of Sctio F Itgral Tst Chatr : Ifiit Sris By th d of this sctio you will b abl to valuat imror itgrals tst a sris for covrgc by alyig th itgral tst aly th itgral tst to rov th -sris
More informationRestricted Factorial And A Remark On The Reduced Residue Classes
Applid Mathmatics E-Nots, 162016, 244-250 c ISSN 1607-2510 Availabl fr at mirror sits of http://www.math.thu.du.tw/ am/ Rstrictd Factorial Ad A Rmark O Th Rducd Rsidu Classs Mhdi Hassai Rcivd 26 March
More informationOn the approximation of the constant of Napier
Stud. Uiv. Babş-Bolyai Math. 560, No., 609 64 O th approximatio of th costat of Napir Adri Vrscu Abstract. Startig from som oldr idas of [] ad [6], w show w facts cocrig th approximatio of th costat of
More informationDTFT Properties. Example - Determine the DTFT Y ( e ) of n. Let. We can therefore write. From Table 3.1, the DTFT of x[n] is given by 1
DTFT Proprtis Exampl - Dtrmi th DTFT Y of y α µ, α < Lt x α µ, α < W ca thrfor writ y x x From Tabl 3., th DTFT of x is giv by ω X ω α ω Copyright, S. K. Mitra Copyright, S. K. Mitra DTFT Proprtis DTFT
More informationTriple Play: From De Morgan to Stirling To Euler to Maclaurin to Stirling
Tripl Play: From D Morga to Stirlig To Eulr to Maclauri to Stirlig Augustus D Morga (186-1871) was a sigificat Victoria Mathmaticia who mad cotributios to Mathmatics History, Mathmatical Rcratios, Mathmatical
More informationWorksheet: Taylor Series, Lagrange Error Bound ilearnmath.net
Taylor s Thorm & Lagrag Error Bouds Actual Error This is th ral amout o rror, ot th rror boud (worst cas scario). It is th dirc btw th actual () ad th polyomial. Stps:. Plug -valu ito () to gt a valu.
More informationA Simple Proof that e is Irrational
Two of th most bautiful ad sigificat umbrs i mathmatics ar π ad. π (approximatly qual to 3.459) rprsts th ratio of th circumfrc of a circl to its diamtr. (approximatly qual to.788) is th bas of th atural
More informationSTIRLING'S 1 FORMULA AND ITS APPLICATION
MAT-KOL (Baja Luka) XXIV ()(08) 57-64 http://wwwimviblorg/dmbl/dmblhtm DOI: 075/МК80057A ISSN 0354-6969 (o) ISSN 986-588 (o) STIRLING'S FORMULA AND ITS APPLICATION Šfkt Arslaagić Sarajvo B&H Abstract:
More informationDiscrete Fourier Transform. Nuno Vasconcelos UCSD
Discrt Fourir Trasform uo Vascoclos UCSD Liar Shift Ivariat (LSI) systms o of th most importat cocpts i liar systms thory is that of a LSI systm Dfiitio: a systm T that maps [ ito y[ is LSI if ad oly if
More information1985 AP Calculus BC: Section I
985 AP Calculus BC: Sctio I 9 Miuts No Calculator Nots: () I this amiatio, l dots th atural logarithm of (that is, logarithm to th bas ). () Ulss othrwis spcifid, th domai of a fuctio f is assumd to b
More informationFORBIDDING RAINBOW-COLORED STARS
FORBIDDING RAINBOW-COLORED STARS CARLOS HOPPEN, HANNO LEFMANN, KNUT ODERMANN, AND JULIANA SANCHES Abstract. W cosidr a xtrmal problm motivatd by a papr of Balogh [J. Balogh, A rmark o th umbr of dg colorigs
More informationLaw of large numbers
Law of larg umbrs Saya Mukhrj W rvisit th law of larg umbrs ad study i som dtail two typs of law of larg umbrs ( 0 = lim S ) p ε ε > 0, Wak law of larrg umbrs [ ] S = ω : lim = p, Strog law of larg umbrs
More informationH2 Mathematics Arithmetic & Geometric Series ( )
H Mathmatics Arithmtic & Gomtric Sris (08 09) Basic Mastry Qustios Arithmtic Progrssio ad Sris. Th rth trm of a squc is 4r 7. (i) Stat th first four trms ad th 0th trm. (ii) Show that th squc is a arithmtic
More informationSolution to 1223 The Evil Warden.
Solutio to 1 Th Evil Ward. This is o of thos vry rar PoWs (I caot thik of aothr cas) that o o solvd. About 10 of you submittd th basic approach, which givs a probability of 47%. I was shockd wh I foud
More informationA GENERALIZED RAMANUJAN-NAGELL EQUATION RELATED TO CERTAIN STRONGLY REGULAR GRAPHS
#A35 INTEGERS 4 (204) A GENERALIZED RAMANUJAN-NAGELL EQUATION RELATED TO CERTAIN STRONGLY REGULAR GRAPHS B d Wgr Faculty of Mathmatics ad Computr Scic, Eidhov Uivrsity of Tchology, Eidhov, Th Nthrlads
More informationDigital Signal Processing, Fall 2006
Digital Sigal Procssig, Fall 6 Lctur 9: Th Discrt Fourir Trasfor Zhg-Hua Ta Dpartt of Elctroic Systs Aalborg Uivrsity, Dar zt@o.aau.d Digital Sigal Procssig, I, Zhg-Hua Ta, 6 Cours at a glac MM Discrt-ti
More informationThomas J. Osler. 1. INTRODUCTION. This paper gives another proof for the remarkable simple
5/24/5 A PROOF OF THE CONTINUED FRACTION EXPANSION OF / Thomas J Oslr INTRODUCTION This ar givs aothr roof for th rmarkabl siml cotiud fractio = 3 5 / Hr is ay ositiv umbr W us th otatio x= [ a; a, a2,
More informationStatistics 3858 : Likelihood Ratio for Exponential Distribution
Statistics 3858 : Liklihood Ratio for Expotial Distributio I ths two xampl th rjctio rjctio rgio is of th form {x : 2 log (Λ(x)) > c} for a appropriat costat c. For a siz α tst, usig Thorm 9.5A w obtai
More informationInternational Journal of Advanced and Applied Sciences
Itratioal Joural of Advacd ad Applid Scics x(x) xxxx Pags: xx xx Cotts lists availabl at Scic Gat Itratioal Joural of Advacd ad Applid Scics Joural hompag: http://wwwscic gatcom/ijaashtml Symmtric Fuctios
More informationHadamard Exponential Hankel Matrix, Its Eigenvalues and Some Norms
Math Sci Ltt Vol No 8-87 (0) adamard Exotial al Matrix, Its Eigvalus ad Som Norms İ ad M bula Mathmatical Scics Lttrs Itratioal Joural @ 0 NSP Natural Scics Publishig Cor Dartmt of Mathmatics, aculty of
More informationFolding of Hyperbolic Manifolds
It. J. Cotmp. Math. Scics, Vol. 7, 0, o. 6, 79-799 Foldig of Hyprbolic Maifolds H. I. Attiya Basic Scic Dpartmt, Collg of Idustrial Educatio BANE - SUEF Uivrsity, Egypt hala_attiya005@yahoo.com Abstract
More informationMONTGOMERY COLLEGE Department of Mathematics Rockville Campus. 6x dx a. b. cos 2x dx ( ) 7. arctan x dx e. cos 2x dx. 2 cos3x dx
MONTGOMERY COLLEGE Dpartmt of Mathmatics Rockvill Campus MATH 8 - REVIEW PROBLEMS. Stat whthr ach of th followig ca b itgratd by partial fractios (PF), itgratio by parts (PI), u-substitutio (U), or o of
More informationAPPENDIX: STATISTICAL TOOLS
I. Nots o radom samplig Why do you d to sampl radomly? APPENDI: STATISTICAL TOOLS I ordr to masur som valu o a populatio of orgaisms, you usually caot masur all orgaisms, so you sampl a subst of th populatio.
More informationBOUNDS FOR THE COMPONENTWISE DISTANCE TO THE NEAREST SINGULAR MATRIX
SIAM J. Matrix Aal. Appl. (SIMAX), 8():83 03, 997 BOUNDS FOR THE COMPONENTWISE DISTANCE TO THE NEAREST SINGULAR MATRIX S. M. RUMP Abstract. Th ormwis distac of a matrix A to th arst sigular matrix is wll
More informationSection 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.
MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H
More informationChapter Five. More Dimensions. is simply the set of all ordered n-tuples of real numbers x = ( x 1
Chatr Fiv Mor Dimsios 51 Th Sac R W ar ow rard to mov o to sacs of dimsio gratr tha thr Ths sacs ar a straightforward gralizatio of our Euclida sac of thr dimsios Lt b a ositiv itgr Th -dimsioal Euclida
More informationSOME IDENTITIES FOR THE GENERALIZED POLY-GENOCCHI POLYNOMIALS WITH THE PARAMETERS A, B AND C
Joural of Mathatical Aalysis ISSN: 2217-3412, URL: www.ilirias.co/ja Volu 8 Issu 1 2017, Pags 156-163 SOME IDENTITIES FOR THE GENERALIZED POLY-GENOCCHI POLYNOMIALS WITH THE PARAMETERS A, B AND C BURAK
More informationSession : Plasmas in Equilibrium
Sssio : Plasmas i Equilibrium Ioizatio ad Coductio i a High-prssur Plasma A ormal gas at T < 3000 K is a good lctrical isulator, bcaus thr ar almost o fr lctros i it. For prssurs > 0.1 atm, collisio amog
More informationChapter Taylor Theorem Revisited
Captr 0.07 Taylor Torm Rvisitd Atr radig tis captr, you sould b abl to. udrstad t basics o Taylor s torm,. writ trascdtal ad trigoomtric uctios as Taylor s polyomial,. us Taylor s torm to id t valus o
More informationDiscrete Fourier Transform (DFT)
Discrt Fourir Trasorm DFT Major: All Egirig Majors Authors: Duc guy http://umricalmthods.g.us.du umrical Mthods or STEM udrgraduats 8/3/29 http://umricalmthods.g.us.du Discrt Fourir Trasorm Rcalld th xpotial
More informationJournal of Modern Applied Statistical Methods
Joural of Modr Applid Statistical Mthods Volum Issu Articl 6 --03 O Som Proprtis of a Htrogous Trasfr Fuctio Ivolvig Symmtric Saturatd Liar (SATLINS) with Hyprbolic Tagt (TANH) Trasfr Fuctios Christophr
More informationDiscrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform. Discrete Fourier Transform
Discrt Fourir Trasform Dfiitio - T simplst rlatio btw a lt- squc x dfid for ω ad its DTFT X ( ) is ω obtaid by uiformly sampli X ( ) o t ω-axis btw ω < at ω From t dfiitio of t DTFT w tus av X X( ω ) ω
More informationCDS 101: Lecture 5.1 Reachability and State Space Feedback
CDS, Lctur 5. CDS : Lctur 5. Rachability ad Stat Spac Fdback Richard M. Murray 7 Octobr 3 Goals: Di rachability o a cotrol systm Giv tsts or rachability o liar systms ad apply to ampls Dscrib th dsig o
More informationPart B: Transform Methods. Professor E. Ambikairajah UNSW, Australia
Part B: Trasform Mthods Chaptr 3: Discrt-Tim Fourir Trasform (DTFT) 3. Discrt Tim Fourir Trasform (DTFT) 3. Proprtis of DTFT 3.3 Discrt Fourir Trasform (DFT) 3.4 Paddig with Zros ad frqucy Rsolutio 3.5
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationarxiv: v1 [math.fa] 18 Feb 2016
SPECTRAL PROPERTIES OF WEIGHTE COMPOSITION OPERATORS ON THE BLOCH AN IRICHLET SPACES arxiv:60.05805v [math.fa] 8 Fb 06 TE EKLUN, MIKAEL LINSTRÖM, AN PAWE L MLECZKO Abstract. Th spctra of ivrtibl wightd
More informationUNIT 2: MATHEMATICAL ENVIRONMENT
UNIT : MATHEMATICAL ENVIRONMENT. Itroductio This uit itroducs som basic mathmatical cocpts ad rlats thm to th otatio usd i th cours. Wh ou hav workd through this uit ou should: apprciat that a mathmatical
More informationProblem Value Score Earned No/Wrong Rec -3 Total
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING ECE6 Fall Quiz # Writt Eam Novmr, NAME: Solutio Kys GT Usram: LAST FIRST.g., gtiit Rcitatio Sctio: Circl t dat & tim w your Rcitatio
More informationFurther Results on Pair Sum Graphs
Applid Mathmatis, 0,, 67-75 http://dx.doi.org/0.46/am.0.04 Publishd Oli Marh 0 (http://www.sirp.org/joural/am) Furthr Rsults o Pair Sum Graphs Raja Poraj, Jyaraj Vijaya Xavir Parthipa, Rukhmoi Kala Dpartmt
More informationThe Interplay between l-max, l-min, p-max and p-min Stable Distributions
DOI: 0.545/mjis.05.4006 Th Itrplay btw lma lmi pma ad pmi Stabl Distributios S Ravi ad TS Mavitha Dpartmt of Studis i Statistics Uivrsity of Mysor Maasagagotri Mysuru 570006 Idia. Email:ravi@statistics.uimysor.ac.i
More informationOn a problem of J. de Graaf connected with algebras of unbounded operators de Bruijn, N.G.
O a problm of J. d Graaf coctd with algbras of uboudd oprators d Bruij, N.G. Publishd: 01/01/1984 Documt Vrsio Publishr s PDF, also kow as Vrsio of Rcord (icluds fial pag, issu ad volum umbrs) Plas chck
More informationCDS 101: Lecture 5.1 Reachability and State Space Feedback
CDS, Lctur 5. CDS : Lctur 5. Rachability ad Stat Spac Fdback Richard M. Murray ad Hido Mabuchi 5 Octobr 4 Goals: Di rachability o a cotrol systm Giv tsts or rachability o liar systms ad apply to ampls
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More information07 - SEQUENCES AND SERIES Page 1 ( Answers at he end of all questions ) b, z = n
07 - SEQUENCES AND SERIES Pag ( Aswrs at h d of all qustios ) ( ) If = a, y = b, z = c, whr a, b, c ar i A.P. ad = 0 = 0 = 0 l a l
More informationOption 3. b) xe dx = and therefore the series is convergent. 12 a) Divergent b) Convergent Proof 15 For. p = 1 1so the series diverges.
Optio Chaptr Ercis. Covrgs to Covrgs to Covrgs to Divrgs Covrgs to Covrgs to Divrgs 8 Divrgs Covrgs to Covrgs to Divrgs Covrgs to Covrgs to Covrgs to Covrgs to 8 Proof Covrgs to π l 8 l a b Divrgt π Divrgt
More informationChapter (8) Estimation and Confedence Intervals Examples
Chaptr (8) Estimatio ad Cofdc Itrvals Exampls Typs of stimatio: i. Poit stimatio: Exampl (1): Cosidr th sampl obsrvatios, 17,3,5,1,18,6,16,10 8 X i i1 17 3 5 118 6 16 10 116 X 14.5 8 8 8 14.5 is a poit
More information(Reference: sections in Silberberg 5 th ed.)
ALE. Atomic Structur Nam HEM K. Marr Tam No. Sctio What is a atom? What is th structur of a atom? Th Modl th structur of a atom (Rfrc: sctios.4 -. i Silbrbrg 5 th d.) Th subatomic articls that chmists
More informationLectures 9 IIR Systems: First Order System
EE3054 Sigals ad Systms Lcturs 9 IIR Systms: First Ordr Systm Yao Wag Polytchic Uivrsity Som slids icludd ar xtractd from lctur prstatios prpard by McCllla ad Schafr Lics Ifo for SPFirst Slids This work
More informationMATH 681 Notes Combinatorics and Graph Theory I. ( 4) n. This will actually turn out to be marvelously simplifiable: C n = 2 ( 4) n n + 1. ) (n + 1)!
MATH 681 Nots Combiatorics ad Graph Thory I 1 Catala umbrs Prviously, w usd gratig fuctios to discovr th closd form C = ( 1/ +1) ( 4). This will actually tur out to b marvlously simplifiabl: ( ) 1/ C =
More informationDFT: Discrete Fourier Transform
: Discrt Fourir Trasform Cogruc (Itgr modulo m) I this sctio, all lttrs stad for itgrs. gcd m, = th gratst commo divisor of ad m Lt d = gcd(,m) All th liar combiatios r s m of ad m ar multils of d. a b
More informationProbability & Statistics,
Probability & Statistics, BITS Pilai K K Birla Goa Campus Dr. Jajati Kshari Sahoo Dpartmt of Mathmatics BITS Pilai, K K Birla Goa Campus Poisso Distributio Poisso Distributio: A radom variabl X is said
More informationLECTURE 13 Filling the bands. Occupancy of Available Energy Levels
LUR 3 illig th bads Occupacy o Availabl rgy Lvls W hav dtrmid ad a dsity o stats. W also d a way o dtrmiig i a stat is illd or ot at a giv tmpratur. h distributio o th rgis o a larg umbr o particls ad
More informationln x = n e = 20 (nearest integer)
H JC Prlim Solutios 6 a + b y a + b / / dy a b 3/ d dy a b at, d Giv quatio of ormal at is y dy ad y wh. d a b () (,) is o th curv a+ b () y.9958 Qustio Solvig () ad (), w hav a, b. Qustio d.77 d d d.77
More informationNET/JRF, GATE, IIT JAM, JEST, TIFR
Istitut for NET/JRF, GATE, IIT JAM, JEST, TIFR ad GRE i PHYSICAL SCIENCES Mathmatical Physics JEST-6 Q. Giv th coditio φ, th solutio of th quatio ψ φ φ is giv by k. kφ kφ lφ kφ lφ (a) ψ (b) ψ kφ (c) ψ
More information10. Joint Moments and Joint Characteristic Functions
0 Joit Momts ad Joit Charactristic Fctios Followig sctio 6 i this sctio w shall itrodc varios paramtrs to compactly rprst th iformatio cotaid i th joit pdf of two rvs Giv two rvs ad ad a fctio g x y dfi
More informationChapter 4 - The Fourier Series
M. J. Robrts - 8/8/4 Chaptr 4 - Th Fourir Sris Slctd Solutios (I this solutio maual, th symbol,, is usd for priodic covolutio bcaus th prfrrd symbol which appars i th txt is ot i th fot slctio of th word
More informationTime : 1 hr. Test Paper 08 Date 04/01/15 Batch - R Marks : 120
Tim : hr. Tst Papr 8 D 4//5 Bch - R Marks : SINGLE CORRECT CHOICE TYPE [4, ]. If th compl umbr z sisfis th coditio z 3, th th last valu of z is qual to : z (A) 5/3 (B) 8/3 (C) /3 (D) o of ths 5 4. Th itgral,
More informationFigure 2-18 Thevenin Equivalent Circuit of a Noisy Resistor
.8 NOISE.8. Th Nyquist Nois Thorm W ow wat to tur our atttio to ois. W will start with th basic dfiitio of ois as usd i radar thory ad th discuss ois figur. Th typ of ois of itrst i radar thory is trmd
More informationThey must have different numbers of electrons orbiting their nuclei. They must have the same number of neutrons in their nuclei.
37 1 How may utros ar i a uclus of th uclid l? 20 37 54 2 crtai lmt has svral isotops. Which statmt about ths isotops is corrct? Thy must hav diffrt umbrs of lctros orbitig thir ucli. Thy must hav th sam
More informationThe Equitable Dominating Graph
Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay
More informationKISS: A Bit Too Simple. Greg Rose
KI: A Bit Too impl Grg Ros ggr@qualcomm.com Outli KI radom umbr grator ubgrators Efficit attack N KI ad attack oclusio PAGE 2 O approach to PRNG scurity "A radom umbr grator is lik sx: Wh it's good, its
More informationCharacter sums over generalized Lehmer numbers
Ma t al. Joural of Iualitis ad Applicatios 206 206:270 DOI 0.86/s3660-06-23-y R E S E A R C H Op Accss Charactr sums ovr gralizd Lhmr umbrs Yuakui Ma, Hui Ch 2, Zhzh Qi 2 ad Tiapig Zhag 2* * Corrspodc:
More informationOn spanning trees and cycles of multicolored point sets with few intersections
On spanning trs and cycls of multicolord point sts with fw intrsctions M. Kano, C. Mrino, and J. Urrutia April, 00 Abstract Lt P 1,..., P k b a collction of disjoint point sts in R in gnral position. W
More informationAn Introduction to Asymptotic Expansions
A Itroductio to Asmptotic Expasios R. Shaar Subramaia Asmptotic xpasios ar usd i aalsis to dscrib th bhavior of a fuctio i a limitig situatio. Wh a fuctio ( x, dpds o a small paramtr, ad th solutio of
More informationINTRODUCTION TO SAMPLING DISTRIBUTIONS
http://wiki.stat.ucla.du/socr/id.php/socr_courss_2008_thomso_econ261 INTRODUCTION TO SAMPLING DISTRIBUTIONS By Grac Thomso INTRODUCTION TO SAMPLING DISTRIBUTIONS Itro to Samplig 2 I this chaptr w will
More informationHardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.
Hardy-Littlwood Conjctur and Excptional ral Zro JinHua Fi ChangLing Company of Elctronic Tchnology Baoji Shannxi P.R.China E-mail: fijinhuayoujian@msn.com Abstract. In this papr, w assum that Hardy-Littlwood
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationCalculus & analytic geometry
Calculus & aalytic gomtry B Sc MATHEMATICS Admissio owards IV SEMESTER CORE COURSE UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CALICUT UNIVERSITYPO, MALAPPURAM, KERALA, INDIA 67 65 5 School of Distac
More informationCOUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM
COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM Jim Brown Dpartmnt of Mathmatical Scincs, Clmson Univrsity, Clmson, SC 9634, USA jimlb@g.clmson.du Robrt Cass Dpartmnt of Mathmatics,
More informationCS 361 Meeting 12 10/3/18
CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm
More informationPier Franz Roggero, Michele Nardelli, Francesco Di Noto
Vrsio.0 9/06/04 Pagia di 7 O SOME EQUATIOS COCEIG THE IEMA S PIME UMBE FOMULA AD O A SECUE AD EFFICIET PIMALITY TEST. MATHEMATICAL COECTIOS WITH SOME SECTOS OF STIG THEOY Pir Fra oggro, Michl ardlli, Fracsco
More information2.29 Numerical Fluid Mechanics Spring 2015 Lecture 12
REVIEW Lctur 11: Numrical Fluid Mchaics Sprig 2015 Lctur 12 Fiit Diffrcs basd Polyomial approximatios Obtai polyomial (i gral u-qually spacd), th diffrtiat as dd Nwto s itrpolatig polyomial formulas Triagular
More informationTraveling Salesperson Problem and Neural Networks. A Complete Algorithm in Matrix Form
Procdigs of th th WSEAS Itratioal Cofrc o COMPUTERS, Agios Nikolaos, Crt Islad, Grc, July 6-8, 7 47 Travlig Salsprso Problm ad Nural Ntworks A Complt Algorithm i Matrix Form NICOLAE POPOVICIU Faculty of
More informationChapter 11.00C Physical Problem for Fast Fourier Transform Civil Engineering
haptr. Physical Problm for Fast Fourir Trasform ivil Egirig Itroductio I this chaptr, applicatios of FFT algorithms [-5] for solvig ral-lif problms such as computig th dyamical (displacmt rspos [6-7] of
More informationON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park
Kangwon-Kyungki Math. Jour. 11 (2003), No. 2, pp. 147 153 ON RIGHT(LEFT) DUO PO-SEMIGROUPS S. K. L and K. Y. Park Abstract. W invstigat som proprtis on right(rsp. lft) duo po-smigroups. 1. Introduction
More informationA Review of Complex Arithmetic
/0/005 Rviw of omplx Arithmti.do /9 A Rviw of omplx Arithmti A omplx valu has both a ral ad imagiary ompot: { } ad Im{ } a R b so that w a xprss this omplx valu as: whr. a + b Just as a ral valu a b xprssd
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationThus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.
Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn
More informationCramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter
WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)
More informationECE602 Exam 1 April 5, You must show ALL of your work for full credit.
ECE62 Exam April 5, 27 Nam: Solution Scor: / This xam is closd-book. You must show ALL of your work for full crdit. Plas rad th qustions carfully. Plas chck your answrs carfully. Calculators may NOT b
More informationNarayana IIT Academy
INDIA Sc: LT-IIT-SPARK Dat: 9--8 6_P Max.Mars: 86 KEY SHEET PHYSIS A 5 D 6 7 A,B 8 B,D 9 A,B A,,D A,B, A,B B, A,B 5 A 6 D 7 8 A HEMISTRY 9 A B D B B 5 A,B,,D 6 A,,D 7 B,,D 8 A,B,,D 9 A,B, A,B, A,B,,D A,B,
More information5.1 The Nuclear Atom
Sav My Exams! Th Hom of Rvisio For mor awsom GSE ad lvl rsourcs, visit us at www.savmyxams.co.uk/ 5.1 Th Nuclar tom Qustio Papr Lvl IGSE Subjct Physics (0625) Exam oard Topic Sub Topic ooklt ambridg Itratioal
More informationENGG 1203 Tutorial. Difference Equations. Find the Pole(s) Finding Equations and Poles
ENGG 03 Tutoial Systms ad Cotol 9 Apil Laig Obctivs Z tasfom Complx pols Fdbac cotol systms Ac: MIT OCW 60, 6003 Diffc Equatios Cosid th systm pstd by th followig diffc quatio y[ ] x[ ] (5y[ ] 3y[ ]) wh
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationSums, Approximations, and Asymptotics II
6.04/8.06J Mathmatics for Computr Scic March 5, 005 Srii Dvadas ad Eric Lhma Lctur Nots Sums, Approximatios, ad Asymptotics II Block Stackig How far ca a stack of idtical blocks ovrhag th d of a tabl without
More informationLinear Algebra Existence of the determinant. Expansion according to a row.
Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit
More informationONLINE SUPPLEMENT Optimal Markdown Pricing and Inventory Allocation for Retail Chains with Inventory Dependent Demand
Submittd to Maufacturig & Srvic Opratios Maagmt mauscript MSOM 5-4R2 ONLINE SUPPLEMENT Optimal Markdow Pricig ad Ivtory Allocatio for Rtail Chais with Ivtory Dpdt Dmad Stph A Smith Dpartmt of Opratios
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More informationNew Sixteenth-Order Derivative-Free Methods for Solving Nonlinear Equations
Amrica Joural o Computatioal ad Applid Mathmatics 0 (: -8 DOI: 0.59/j.ajcam.000.08 Nw Sixtth-Ordr Drivativ-Fr Mthods or Solvig Noliar Equatios R. Thukral Padé Rsarch Ctr 9 Daswood Hill Lds Wst Yorkshir
More informationTotal Prime Graph. Abstract: We introduce a new type of labeling known as Total Prime Labeling. Graphs which admit a Total Prime labeling are
Itratoal Joural Of Computatoal Egrg Rsarch (crol.com) Vol. Issu. 5 Total Prm Graph M.Rav (a) Ramasubramaa 1, R.Kala 1 Dpt.of Mathmatcs, Sr Shakth Isttut of Egrg & Tchology, Combator 641 06. Dpt. of Mathmatcs,
More information2617 Mark Scheme June 2005 Mark Scheme 2617 June 2005
Mark Schm 67 Ju 5 GENERAL INSTRUCTIONS Marks i th mark schm ar plicitly dsigatd as M, A, B, E or G. M marks ("mthod" ar for a attmpt to us a corrct mthod (ot mrly for statig th mthod. A marks ("accuracy"
More informationCPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More information