ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS

Size: px
Start display at page:

Download "ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS"

Transcription

1 ON EISENSTEIN-DUMAS AND GENERALIZED SCHÖNEMANN POLYNOMIALS Anuj Bshno and Sudsh K. Khanduja Dpartmnt of Mathmatcs, Panjab Unvrsty, Chandgarh , Inda. E-mal: ABSTRACT. Lt v b a valuaton of a fld K havng valu group Z. It s known that a polynomal x n + a n 1 x n a 0 satsfyng v(a ) v(a 0) > 0 n n wth v(a 0 ) coprm to n, s rrducbl ovr K. Such a polynomal s rfrrd to as an Esnstn-Dumas polynomal wth rspct to v. In ths papr, w gv ncssary and suffcnt condtons so that som translat g(x+a) of a gvn polynomal g(x) blongng to K[x] s an Esnstn-Dumas polynomal wth rspct to v. In fact an analogous problm s dalt wth for a wdr class of polynomals, vz. Gnralzd Schönmann polynomals wth coffcnts ovr valud flds of arbtrary rank. Kywords : Fld Thory and polynomals; Valud flds; Non-Archmdan valud flds Mathmatcs Subjct Classfcaton : 12E05; 12J10; 12J25. All corrspondnc may b addrssd to ths author. 1

2 1. INTRODUCTION Th classcal Schönmann Irrducblty Crtron stats that f f(x) s a monc polynomal wth coffcnts from th rng Z of ntgrs whch s rrducbl modulo a prm numbr p and f g(x) blongng to Z[x] s a polynomal of th form g(x) = f(x) + pm(x) whr M(x) blongng to Z[x] s rlatvly prm to f(x) modulo p and th dgr of M(x) s lss than th dgr of g(x), thn g(x) s rrducbl ovr th fld Q of ratonal numbrs. Such a polynomal s rfrrd to as a Schönmann polynomal wth rspct to p and f(x). It can b asly sn that f g(x) s as abov, thn th f(x)-xpanson of g(x) obtand on dvdng t by succssv powrs of f(x) gvn by g(x) = g (x)f(x), dg g (x) < dgf(x), satsfs () g (x) = 1, () p dvds th contnt of ach polynomal g (x) for 0 1 and () p 2 dos not dvd th contnt of g 0 (x). Clarly any polynomal g(x) blongng to Z[x] whos f(x)-xpanson satsfs th abov thr proprts s a Schönmann polynomal wth rspct to p and f(x). Not that a monc polynomal s an Esnstn polynomal wth rspct to a prm p f and only f t s a Schönmann polynomal wth rspct to p and f(x) = x. Th Schönmann Irrducblty Crtron has bn xtndd to polynomals wth coffcnts ovr valud flds n svral ways (cf. Khanduja and Saha, 1997; Rbnbom, 1999, Chaptr 4, D; Brown, 2008). In 2008, Ron Brown gav a gnralzaton of th Schönmann Irrducblty Crtron for polynomals wth coffcnts n a valud fld (K, v) of arbtrary rank, whch wll b statd aftr ntroducng som notatons. W shall dnot by v x th Gaussan valuaton of th fld K(x) of ratonal functons n an ndtrmnat x whch xtnds th valuaton v of K and s dfnd on K[x] by v x ( a x ) = mn{v(a ) a K}. For an lmnt ξ n th valuaton rng R v of v wth maxmal dal M v, ξ wll dnot ts v-rsdu,.., th mag of ξ undr th canoncal homomorphsm from R v onto R v /M v. For f(x) blongng to R v [x], f(x) wll stand for th polynomal ovr R v /M v obtand by rplacng ach coffcnt of f(x) by ts v-rsdu. Th followng rsult of Ron Brown whch gnralzs th Schönmann Irrducblty Crtron s provd n scton 3 (s Lmma 3.1). 2

3 Thorm A. Lt v b a valuaton of arbtrary rank of a fld K wth valu group G and valuaton rng R v havng maxmal dal M v. Lt f(x) blongng to R v [x] b a monc polynomal of dgr m such that f(x) s rrducbl ovr R v /M v. Assum that g(x) R v [x] s a monc polynomal whos f(x)-xpanson 1 f(x) + g (x)f(x) satsfs vx (g (x)) vx (g 0 (x)) > 0 for 0 1 and v x (g 0 (x)) / dg for any numbr d > 1 dvdng. Thn g(x) s rrducbl ovr K. A polynomal satsfyng th hypothss of Thorm A wll b rfrrd to as a Gnralzd Schönmann polynomal wth rspct to v and f(x). In th partcular cas whn f(x) = x, t wll b calld an Esnstn-Dumas polynomal wth rspct to v. Whn v s a dscrt valuaton wth valu group Z, thn a monc polynomal a x s an Esnstn-Dumas polynomal wth rspct to v f v(a ) v(a 0) and v(a 0 ) s coprm to. Thus Thorm A xtnds th usual Esnstn-Dumas Irrducblty Crtron 1. In ths papr, w frst nvstgat whn a translat g(x+a) of a gvn polynomal g(x) blongng to K[x] havng a root θ s an Esnstn-Dumas polynomal wth rspct to an arbtrary hnslan valuaton v of a fld K. It s shown that g(x + a) s such a polynomal f and only f K(θ)/K s a totally ramfd xtnson and (θ, a) s a (K, v)-dstngushd par as dfnd blow. In partcular, t s dducd that f som translat of a polynomal g(x) = x + a 1 x a 0 s an Esnstn-Dumas polynomal wth rspct to v wth not dvsbl by th charactrstc of th rsdu fld of v, thn th polynomal g(x a 1 ) s an Esnstn-Dumas polynomal wth rspct to v. Ths gnralzs a rsult of M. Juras provd n 2006 (cf. Juras, 2006). W also dal wth th followng mor gnral problm rlatd to Thorm A. Lt g(x) blongng to R v [x] b a monc polynomal ovr a hnslan valud fld (K, v) of arbtrary rank wth ḡ(x) = φ(x) whr φ(x) s an rrducbl polynomal ovr R v /M v and θ s a root of g(x). What ar ncssary and suffcnt condtons so that g(x) s a Gnralzd Schönmann polynomal wth rspct to v and som polynomal f(x) R v [x] wth f(x) = φ(x)? 1 Esnstn-Dumas Irrducblty Crtron. Lt g(x) = a n x n + a n 1 x n a o b a polynomal wth coffcnts n Z. Suppos thr xsts a prm p whos xact powr p r dvdng a (whr r = f a = 0), satsfy r n = 0, (r /n ) (r 0 /n) for 0 n 1 and r 0, n ar coprm. Thn g(x) s rrducbl ovr Q. 3

4 Our rsults ar provd usng saturatd dstngushd chans whch wll b dfnd aftr ntroducng som notatons. In what follows, v s a hnslan valuaton of arbtrary rank of a fld K and ṽ s th unqu prolongaton of v to th algbrac closur K of K wth valu group G. By th dgr of an lmnt α n K, w shall man th dgr of th xtnson K(α)/K and shall dnot t by dg α. For an lmnt ξ n th valuaton rng of ṽ, ξ wll stand for ts ṽ-rsdu and for a subfld L of K, L and G(L) wll dnot rspctvly th rsdu fld and th valu group of th valuaton of L obtand by rstrctng ṽ. Whn thr s no chanc of confuson, w shall wrt ṽ(α) as v(α) for α blongng to K. A fnt xtnson (K, v )/(K, v) s calld dfctlss f [K : K] = f, whr and f ar th ndx of ramfcaton and th rsdual dgr of v /v. Rcall that a par (θ, α) of lmnts of K s calld a dstngushd par (mor prcsly (K, v)-dstngushd par) f th followng thr condtons ar satsfd: () dg θ > dg α, () ṽ(θ β) ṽ(θ α) for vry β n K wth dg β < dg θ, () f γ K and dg γ < dg α, thn ṽ(θ γ) < ṽ(θ α). Dstngushd pars gv rs to dstngushd chans n a natural mannr. A chan θ = θ 0, θ 1,..., θ r of lmnts of K wll b calld a saturatd dstngushd chan for θ f (θ, θ +1 ) s a dstngushd par for 0 r 1 and θ r K. Popscu and Zaharscu (cf. Popscu and Zaharscu, 1995) wr th frst to ntroduc th noton of dstngushd chans. In 1995, thy provd th xstnc of a saturatd dstngushd chan for ach θ blongng to K \ K n cas (K, v) s a complt dscrt rank on valud fld. (cf. In 2005, Aghgh and Khanduja Aghgh and Khanduja, 2005) provd that f (K, v) s a hnslan valud fld of arbtrary rank, thn an lmnt θ blongng to K \ K has a saturatd dstngushd chan wth rspct to v f and only f K(θ) s a dfctlss xtnson of (K, v). A saturatd dstngushd chan for θ gvs rs to svral nvarants assocatd wth θ, som of whch ar gvn by Thorm B statd blow whch s provd n (cf. Aghgh and Khanduja, 2005). Thorm B. Lt (K, v) and ( K, ṽ) b as abov. Lt θ = θ 0, θ 1,..., θ r and θ = η 0, η 1,..., η s b two saturatd dstngushd chans for an lmnt θ blongng to K \ K, thn r = s and [K(θ ) : K] = [K(η ) : K], G(K(θ )) = G(K(η )), K(θ ) = K(η ) for 1 r. Furthr G(K(θ +1 )) G(K(θ )), K(θ +1 ) K(θ ) for 0 r 1. 4

5 In ths papr, w prov Thorm 1.1. Lt v b a hnslan valuaton of arbtrary rank of a fld K wth valu group G. Lt g(x) blongng to R v [x] b a monc polynomal of dgr havng a root θ. Thn for an lmnt a of K, g(x + a) s an Esnstn- Dumas polynomal wth rspct to v f and only f (θ, a) s a dstngushd par and K(θ)/K s a totally ramfd xtnson of dgr. Th followng rsult whch gnralzs a rsult of M. Juras wll b quckly dducd from th abov thorm. Thorm 1.2. Lt g(x) = a x b a monc polynomal wth coffcnts n a hnslan valud fld (K, v). Suppos that th charactrstc of th rsdu fld of v dos not dvd. If thr xsts an lmnt b blongng to K such that g(x + b) s an Esnstn-Dumas polynomal wth rspct to v, thn so s g(x a 1 ). Not that f g(x) blongng to R v [x] s a monc polynomal such that ḡ(x) s rrducbl ovr R v /M v, thn for any non-zro α n M v, g(x) s a Gnralzd Schönmann polynomal wth rspct to f(x) = g(x) α and v. Thrfor to dal wth th scond problm mntond aftr Thorm A, w may assum that ḡ(x) = φ(x) wth φ(x) rrducbl ovr R v /M v and > 1. Whn dg φ(x) = 1 thn th problm rfrrd to abov s alrady solvd n Thorm 1.1 bcaus g(x + a) s an Esnstn-Dumas polynomal wth rspct to v f and only f g(x) s a Gnralzd Schönmann polynomal wth rspct to v and x a. Sttng asd ths two cass, w shall prov Thorm 1.3. Lt v b a hnslan valuaton of arbtrary rank of a fld K wth valu group G and f(x) blongng to R v [x] b a monc polynomal of dgr m > 1 wth f(x) rrducbl ovr th rsdu fld of v. Lt g(x) K[x] b a Gnralzd Schönmann polynomal wth rspct to v and f(x) havng f(x)- 1 xpanson f(x) + g (x)f(x) wth > 1. Lt θ b a root of g(x). Thn for som sutabl root θ 1 of f(x), θ has a saturatd dstngushd chan θ = θ 0, θ 1, θ 2 of lngth 2 wth G(K(θ 1 )) = G, K(θ) = K( θ) and [G(K(θ)) : G] =. Th convrs of th abov rsult s also tru as assrtd by th followng thorm. 5

6 Thorm 1.4. Lt (K, v) b as n th abov thorm. Lt g(x) blongng to R v [x] b a monc polynomal such that ḡ(x) = φ(x), > 1 whr φ(x) s an rrducbl polynomal ovr R v /M v of dgr m > 1. Suppos that a root θ of g(x) has a saturatd dstngushd chan θ = θ 0, θ 1, θ 2 of lngth 2 wth G(K(θ 1 )) = G, K(θ) = K( θ) and [G(K(θ)) : G] =. Thn g(x) s a Gnralzd Schönmann polynomal wth rspct to v and f(x), whr f(x) s th mnmal polynomal of θ 1 ovr K. 2. PROOF OF THEOREMS 1.1, 1.2 Proof of Thorm 1.1. Wrt g(x + a) = x + a 1 x a 0, a, a K. Suppos frst that g(x + a) s an Esnstn-Dumas polynomal wth rspct to v. Thn t s rrducbl ovr K n vw of Thorm A. Snc (K, v) s hnslan, all roots of g(x + a) hav th sam v-valuaton and hnc v(θ a) = v(a 0). In vw of th hypothss that g(x + a) s an Esnstn-Dumas polynomal, w hav = [G + Z v(a 0) : G] = [G + Zv(θ a) : G]. (1) To prov that (θ, a) s a dstngushd par, t s to b shown that max{v(θ β) β K, dg β < dg θ} = v(θ a) = v(a 0). (2) If β s as n (2) and f v(θ β) > v(θ a), thn by th strong trangl law, v(β a) = mn{v(β θ), v(θ a)} = v(θ a) whch n vw of th fundamntal nqualty (cf. Englr and Prstl, 2005, Thorm 3.3.4) and (1) mpls that dg (β a), a contradcton. Thrfor (2) holds and (θ, a) s a dstngushd par wth K(θ)/K totally ramfd n vw of (1). Convrsly suppos that (θ, a) s a dstngushd par and K(θ)/K s a totally ramfd xtnson of dgr. Not that v(θ a) v(θ) 0. Kpng n mnd that (K, v) s hnslan and th rlaton btwn th roots and coffcnts of th th K-rrducbl polynomal g(x + a) = x + a 1 x a 0, w s that v(a ) ( )v(θ a) = ( )v(a 0) 0. So g(x + a) s an Esnstn-Dumas polynomal wth rspct to v onc w show that s v(a 0) / G for any postv numbr s <. Suppos to th contrary thr xsts a postv numbr s < such that 6

7 s v(a 0) = sv(θ a) G, say sv(θ a) = v(b), b K. Snc K(θ)/K s totally ramfd, thr xsts c n K wth v(c) = 0 such that ((θ a) s /b) = c, whch mpls that v((θ a) s bc) > v(b). (3) St v(θ a) = δ and h(x) = (x a) s bc. Lt w dnot th valuaton of K(x) dfnd on K[x] by w( c (x a) ) = mn {ṽ(c ) + δ}, c K. Not that w(h(x)) = mn{sδ, v(bc)} = v(b). Ths qualty wll contradct (3) thrby compltng th proof of th thorm onc w show that To vrfy (4), wrt h(x) = v(h(θ)) = w(h(x)). (4) s (x β () ). Kpng n mnd that h(x) blongng to =1 K[x] s a polynomal of dgr s < and th fact that (θ, a) s a dstngushd par, w hav v(θ β () ) v(θ a) for 1 s and hnc t can b asly sn that v(θ β () ) = mn{v(θ a), v(a β () )} = w(x β () ). On summng ovr, th abov quaton gvs (4). Proof of Thorm 1.2. In vw of Thorm 1.1, t s nough to prov that f (θ, b) s a dstngushd par, thn so s (θ, a 1 ). In fact t suffcs to show that v(θ + a 1 ) v(θ b). (5) Lt θ = θ (1), θ (2),..., θ () dnot th K-conjugats of θ. Usng th hypothss v() = 0, w hav consquntly v(θ + a 1 ) = v(θ + a 1) = v(θ v(θ + a 1 θ () ) = v( =1 (θ θ () )); ) mn {v(θ 2 θ() )} = v(θ θ (2) ) (say). (6) Snc b K, v(θ b) = v(θ (2) b) and hnc v(θ θ (2) ) v(θ b) whch togthr wth (6) provs (5) and hnc th thorm. 7 =2

8 W us Thorm 1.1 to construct xampls of totally ramfd xtnsons K(θ)/K such that no translat of th mnmal polynomal of θ ovr K s an Esnstn-Dumas polynomal wth rspct to v. Notaton. For α sparabl ovr K of dgr > 1, ω K (α) wll stand for th Krasnr s constant dfnd by ω K (α) = max{ṽ(α α ) α α runs ovr K-conjugats of α}. Exampl 2.1. Lt K b th fld of 2-adc numbrs wth th usual valuaton v 2 gvn by v 2 (2) = 1. Th prolongaton of v 2 to th algbrac closur of K wll b dnotd by v 2 agan. Consdr θ = 2+2(2 1/2 )+2 2 (2 1/22 ) and θ 1 = 2+2(2 1/2 ). It wll b shown that K(θ) = K(2 1/4 ) and (θ, θ 1 ) s a dstngushd par. Not that th Krasnr s constant ω K (θ 1 ) = 3/2 and v 2 (θ θ 1 ) = 7/4 > ω K (θ 1 ). Thrfor by Krasnr s Lmma (cf. Englr and Prstl, 2005, Thorm 4.1.7), K(θ 1 ) K(θ) and hnc 2 2 (2 1/4 ) = θ θ 1 blongs to K(θ) as assrtd. To show that (θ, θ 1 ) s a dstngushd par, w frst vrfy that whnvr γ blongng to K satsfs v 2 (θ γ) > v 2 (θ θ 1 ) = 7/4, thn dg γ 4. If γ s as abov, w hav by th strong trangl law v 2 (θ 1 γ) = mn{v 2 (θ 1 θ), v 2 (θ γ)} = 7/4 > ω K (θ 1 ) = 3/2. So by Krasnr s Lmma, K(θ 1 ) K(γ) and hnc G(K(γ)) contans v 2 (θ 1 γ) = 7/4 whch mpls that dg γ 4. Thrfor 7/4 = v 2 (θ θ 1 ) = max{v 2 (θ β) β K, dg β < 4}. Also for any b K wth dg b < dg θ 1, w hav b K and clarly v 2 (θ 1 b) 1/2 < v 2 (θ θ 1 ). So (θ, θ 1 ) s a dstngushd par. As can b asly chckd, θ s a root of g(x) = x 4 8x x 2 80x + 4 whch must b rrducbl ovr K. By Thorm 1.1 no translat of g(x) can b an Esnstn-Dumas polynomal wth rspct to v 2 bcaus (θ, θ 1 ) s a dstngushd par wth θ 1 / K and consquntly (θ, a) cannot b a dstngushd par for any a n K n vw of Thorm B. Morovr, f p b a prm numbr dffrnt from 2, thn no translat of g(x) can b an Esnstn-Dumas polynomal wth rspct to th p-adc valuaton v p, for othrws n vw of Thorm 1.2, g(x + 2) = x 4 4x 2 64x 124 would b an Esnstn-Dumas polynomal wth rspct to v p, whch s clarly mpossbl. 3. PROOF OF THEOREM 1.3. W nd th followng lmma whch s provd n (cf. Brown, 2008, Lmma 4). Its proof s omttd. 8

9 Lmma 3.1. Lt v, G, f(x) and g(x) b as n Thorm A. Lt θ b a root of g(x) and v b a prolongaton of v to K(θ) wth valu group G. Thn v (f(θ)) = v x (g 0 (x)), G = G + Z vx (g 0 (x)), th rsdu fld of v s a smpl xtnson of th rsdu fld of v gnratd by th v -rsdu θ of θ and g(x) s rrducbl ovr K. In partcular th ndx of ramfcaton and th rsdual dgr of v /v ar and dg f(x) rspctvly. Proof of Thorm 1.3. Snc θ s a root of ḡ(x) = f(x) and f(x) s an rrducbl polynomal of dgr m > 1, t follows that v(θ) = 0 and thr xsts a root α () of f(x) such that v(θ α () ) > 0. Lt α b a root of f(x) satsfyng 0 < v(θ α) = max{v(θ α () ) α () runs ovr roots of f(x)} = δ (say). (7) W clam that (θ, α) s a dstngushd par. Obsrv that f γ blongng to K s such that dg γ < dg α, thn v(θ γ) < δ, for othrws by th trangl law w would hav v(α γ) > 0 and hnc ᾱ = γ whch s mpossbl bcaus m = [K(ᾱ) : K] = [K( γ) : K] [K(γ) : K] < m. So to prov th clam, t suffcs to show that whnvr β blongs to K wth v(θ β) > δ, thn dg β dg θ. For provng ths nqualty, n vw of th fundamntal nqualty and th fact dg θ = [G(K(θ)) : G][K(θ) : K] drvd from Lmma 3.1, t s nough to show that G(K(θ)) G(K(β)), K(θ) K(β). (8) Lt β b an lmnt of K wth v(β θ) > δ and α (1), α (2),..., α (m) b th roots of f(x), countd wth multplcts, f any. Wrt m f(β) f(θ) = ( ) β α () = θ α () =1 m =1 ( 1 + β θ ). θ α () Snc v(θ β) > δ and by (7) v(θ α () ) δ for vry, t follows from th abov xprsson for f(β)/f(θ) that ts ṽ-rsdu quals 1 and hnc v(f(β)) = v(f(θ)). Thrfor n vw of Lmma 3.1, G(K(θ)) = G + Zv(f(θ)) G(K(β)). Also kpng n mnd that v(θ β) > δ > 0, w hav by Lmma 3.1, K(θ) = K( θ) = K( β) whch provs (8) and hnc th clam. Rcall that ᾱ s a root of th rrducbl polynomal f(x) of dgr m > 1. So v(α 1) = 0. Also for any β n K wth dg β < dg α, w hav v(α β) 0, 9

10 for othrws ᾱ = β and ths n vw of th fundamntal nqualty would mply [K(β) : K] [K( β) : K] = m. So (α, 1) s a dstngushd par. Thus w hav provd that θ has a saturatd dstngushd chan θ, α, 1 of lngth 2. Snc [K(α) : K] = [K(ᾱ) : K] = m, t follows from th fundamntal nqualty that G(K(α)) = G. Th othr two qualts hold by vrtu of Lmma PROOF OF THEOREM 1.4. W rtan th notatons of th prvous sctons as wll as th assumpton that v s a hnslan valuaton of arbtrary rank of a fld K wth unqu prolongaton ṽ to th algbrac closur K havng valu group G. Rcall that a par (α, δ) blongng to K G s sad to b a mnmal par (mor prcsly (K, v)-mnmal par) f whnvr β blongng to K satsfs ṽ(α β) δ, thn dg β dg α. It can b asly sn that f (θ, α) s a dstngushd par and δ = ṽ(θ α), thn (α, δ) s a mnmal par. Lt (α, δ) b a (K, v)-mnmal par. Th valuaton w α,δ of K(x) dfnd on K[x] by w α,δ ( c (x α) ) = mn{ṽ(c ) + δ}, c K wll b rfrrd to as th valuaton dfnd by th par (α, δ). Th dscrpton of w α,δ on K[x] s gvn by th alrady known thorm statd blow (cf. Alxandru, Popscu and Zaharscu, 1988; Khanduja, 1992). Thorm C. Lt w α,δ b th valuaton of K(x) dfnd by a mnmal par (α, δ) and w α,δ b th valuaton of K(x) obtand by rstrctng w α,δ. Lt f(x) b th mnmal polynomal of α ovr K. Thn for any polynomal g(x) n K[x] wth f(x)-xpanson g (x)f(x), on has w α,δ (g(x)) = mn{ṽ(g (α))+w α,δ (f(x))}. 0 Th followng rsult provd n (cf. Aghgh and Khanduja, 2005, Thorm 1.1()) wll b usd n th squl. Lmma D. Lt (θ, α) b a (K, v)-dstngushd par and f(x) b th mnmal polynomal of α ovr K. Thn G(K(θ)) = G(K(α)) + Zv(f(θ)). Proof of Thorm 1.4. W dvd th proof nto thr stps. Stp I. Lt f(x) b th mnmal polynomal of θ 1 ovr K. In ths stp, w prov that f(x) s rrducbl ovr K and f(x) = φ(x). In vw of th hypothss [K(θ) : K] = m, [G(K(θ)) : G] = and th fundamntal nqualty, t follows that [K(θ) : K] m. Snc θ s a root of th polynomal g(x) havng dgr m, 10

11 w hav [K(θ) : K] = m. Not that v(θ θ 1 ) > 0, bcaus f F (x) R v [x] s a monc polynomal wth F (x) = φ(x), thn thr xsts a root β of F (x) such that β = θ whch n vw of th hypothss > 1 mpls that v(θ θ 1 ) v(θ β) > 0. So th assrton of Stp I s provd onc w show that [K(θ 1 ) : K] = [K( θ 1 ) : K] = m. (9) Rcall that K(θ 1 ) K(θ) by Thorm B. Thrfor usng th hypothss K(θ) = K( θ) and th fact θ 1 = θ, t follows that K(θ 1 ) = K( θ); n partcular [K(θ 1 ) : K] = [K( θ 1 ) : K] = m. (10) Snc K(θ 1 )/K s a dfctlss xtnson n vw of (Aghgh and Khanduja, 2005, Thorm 1.2) and t s gvn that G(K(θ 1 )) = G, w now obtan (9) usng (10). Stp II. For smplcty of notaton, w shall hncforth dnot θ 1 by α. St 1 v(θ α) = δ and v(f(θ)) = λ. Lt g(x) = f(x) + g (x)f(x) b th f(x)- xpanson of g(x). Lt w α,δ b th valuaton of K(x) dfnd by th mnmal par (α, δ). In ths stp, w prov that and Wrt f(x) = m (x α () ), g(x) = =1 w α,δ (f(x)) = λ (11) w α,δ (g(x)) = v x (g 0 (x)) = λ. (12) m j=1 and hnc v(θ α () ) = mn{δ, v(α α () )}, w hav (x θ (j) ). Usng th fact that v(θ α () ) δ m w α,δ (f(x)) = w α,δ ( (x α () )) = =1 m mn{δ, v(α α () )} = =1 m v(θ α () ) = λ =1 whch provs (11). Snc (K, v) s hnslan, for any K-conjugat θ (j) of θ, thr xsts a K-conjugat α () of α such that v(θ (j) α) = v(θ α () ) δ; consquntly w α,δ (x θ (j) ) = mn{δ, v(α θ (j) )} = v(α θ (j) ), whch on summng ovr j gvs w α,δ (g(x)) = v(g(α)). (13) 11

12 Rcall that n vw of Stp I, f(x) s rrducbl ovr K of dgr m havng θ as a root. So for any polynomal A(x)= a x blongng to K[x] of dgr lss than m, w hav v(a(θ)) = v x (A(x)) = mn {v(a )}, (14) for f th abov qualty dos not hold, thn m > 1, v(θ) = 0 and hnc th trangl law would mply v(a(θ)) > mn{v(a θ )} = v(a j ) (say) and thus m 1 (a /a j ) θ = 0, whch s mpossbl. Kpng n mnd th f(x)-xpanson of g(x) and that f(α) = 0, w s that g(α) = g 0 (α) and consquntly t follows from (14) that v(g(α)) = v(g 0 (α)) = v x (g 0 (x)) whch togthr wth (13) provs th frst qualty of (12). As f(x), g(x) ar rrducbl ovr th hnslan valud fld (K, v), w hav v(f(θ (j) )) = v(f(θ)), 1 j m, v(g(α () )) = v(g(α)), 1 m. (15) Kpng n mnd that m g(α () ) = ± =1 m j=1 f(θ (j) ), t s clar from (15) that v(g(α)) = v(f(θ)) = λ, whch provs th scond qualty of (12) n vw of (13). Stp III. In ths stp, w prov that g(x) s a Gnralzd Schönmann polynomal wth rspct to v and f(x). By Thorm C, (11) and (12), w hav w α,δ (g(x)) = mn 0 {v(g (α)) + λ} = v x (g 0 (x)) = λ. (16) As v(g (α)) = v x (g (x)), (16) shows that v x (g (x)) + λ λ for 0 1,.., v x (g (x)) λ = vx (g 0 (x)) > 0. Rcall that λ = v(f(θ)). Snc (θ, α) s a dstngushd par, n vw of Lmma D and th hypothss G(K(α)) = G, w hav G(K(θ)) = G + Zλ. (17) By hypothss [G(K(θ)) : G] =, so t follows from (17) that s th smallst postv ntgr for whch λ G. Ths complts th proof of th thorm. Exampl 4.1. Lt K b th fld of 3-adc numbrs wth th usual valuaton v 3 whos xtnson to th algbrac closur K of K wll b dnotd by ṽ 3. 12

13 Consdr th polynomal g(x) = x x wth ḡ(x) = (x 2 + 1) 2. It can b asly sn that θ = (2 + 3) s a root of g(x) whr = 1. Snc θ = 2 / K and ṽ 3 (θ 2 2) = 1/2, t follows n vw of th fundamntal nqualty that [K(θ) : K] = 4. A smpl calculaton shows that th Krasnr s constant ω K (θ) = ṽ 3 (θ 2) = 1/2. So by Krasnr s Lmma, ṽ 3 (θ β) 1 2 for vry β K wth dg β < 4. Furthr f for som γ n K, ṽ 3 (θ γ) = 1 2, thn θ = γ = 2. Snc 2 / K, w s that [K(γ) : K] 2. Thrfor (θ, 2) s a dstngushd par. It can b asly sn that (2, 0) s a dstngushd par and hnc θ, 2, 0 s a saturatd dstngushd chan for θ satsfyng th hypothss of Thorm 1.4. So g(x) s a Gnralzd Schönmann polynomal wth rspct to v 3 and f(x) = x ACKNOWLEDGEMENTS Th fnancal support by CSIR (grant no. 09/135(0539)/2008-EMR-I) and Natonal Board for Hghr Mathmatcs, Mumba s gratfully acknowldgd. REFERENCES Aghgh, K., Khanduja, S. K. (2005). On chans assocatd wth lmnts algbrac ovr a hnslan valud fld. Algbra Colloq. 12(4): Alxandru, V., Popscu, N., Zaharscu, A. (1988). A thorm of charactrzaton of rsdual transcndntal xtnsons of a valuaton. J. Math. Kyoto Unv 28(4): Brown, R. (2008). Roots of gnralzd Schönmann polynomals n hnslan xtnson flds. Indan J. Pur Appl. Math. 39(5): Englr, A. J., Prstl, A. (2005). Valud Flds. Brln: Sprngr-Vrlag. Juráš, M. (2006). Esnstn-Dumas crtron for rrducblty of polynomals and projctv transformatons of th ndpndnt varabl. JP J. Algbra, Numbr Thory and Applcatons 6(2): Khanduja, S. K. (1992). On valuatons of K(x). Proc. Ednb. Math. Soc. 35: Khanduja, S. K., Saha, J. (1997). On a gnralzaton of Esnstn s rrducblty crtron. Mathmatka 44: Popscu, N., Zaharscu, A. (1995). On th structur of th rrducbl polynomals ovr local flds. J. Numbr Thory 52: Rbnbom, P. (1999). Th Thory of Classcal Valuatons. Nw York: Sprngr- Vrlag. 13

Lucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn.

Lucas Test is based on Euler s theorem which states that if n is any integer and a is coprime to n, then a φ(n) 1modn. Modul 10 Addtonal Topcs 10.1 Lctur 1 Prambl: Dtrmnng whthr a gvn ntgr s prm or compost s known as prmalty tstng. Thr ar prmalty tsts whch mrly tll us whthr a gvn ntgr s prm or not, wthout gvng us th factors

More information

Group Codes Define Over Dihedral Groups of Small Order

Group Codes Define Over Dihedral Groups of Small Order Malaysan Journal of Mathmatcal Scncs 7(S): 0- (0) Spcal Issu: Th rd Intrnatonal Confrnc on Cryptology & Computr Scurty 0 (CRYPTOLOGY0) MALAYSIA JOURAL OF MATHEMATICAL SCIECES Journal hompag: http://nspm.upm.du.my/ournal

More information

The Hyperelastic material is examined in this section.

The Hyperelastic material is examined in this section. 4. Hyprlastcty h Hyprlastc matral s xad n ths scton. 4..1 Consttutv Equatons h rat of chang of ntrnal nrgy W pr unt rfrnc volum s gvn by th strss powr, whch can b xprssd n a numbr of dffrnt ways (s 3.7.6):

More information

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS

ON THE COMPLEXITY OF K-STEP AND K-HOP DOMINATING SETS IN GRAPHS MATEMATICA MONTISNIRI Vol XL (2017) MATEMATICS ON TE COMPLEXITY OF K-STEP AN K-OP OMINATIN SETS IN RAPS M FARAI JALALVAN AN N JAFARI RA partmnt of Mathmatcs Shahrood Unrsty of Tchnology Shahrood Iran Emals:

More information

ON RAMIFICATION POLYGONS AND GALOIS GROUPS OF EISENSTEIN POLYNOMIALS

ON RAMIFICATION POLYGONS AND GALOIS GROUPS OF EISENSTEIN POLYNOMIALS ON RAMIFICATION POLYGONS AND GALOIS GROUPS OF EISENSTEIN POLYNOMIALS CHRISTIAN GREVE AND SEBASTIAN PAULI Abstract Lt ϕx b an Esnstn polynomal of dgr n ovr a local fld and α b a root of ϕx Our man tool

More information

A study of irreducible polynomials over henselian valued fields via distinguished pairs

A study of irreducible polynomials over henselian valued fields via distinguished pairs A study of irreducible polynomials over henselian valued fields via distinguished pairs Kamal Aghigh, Department of Mathematics, K. N. Toosi University of Technology, Tehran, Iran aghigh@kntu.ac.ir, Anuj

More information

Folding of Regular CW-Complexes

Folding of Regular CW-Complexes Ald Mathmatcal Scncs, Vol. 6,, no. 83, 437-446 Foldng of Rgular CW-Comlxs E. M. El-Kholy and S N. Daoud,3. Dartmnt of Mathmatcs, Faculty of Scnc Tanta Unvrsty,Tanta,Egyt. Dartmnt of Mathmatcs, Faculty

More information

Grand Canonical Ensemble

Grand Canonical Ensemble Th nsmbl of systms mmrsd n a partcl-hat rsrvor at constant tmpratur T, prssur P, and chmcal potntal. Consdr an nsmbl of M dntcal systms (M =,, 3,...M).. Thy ar mutually sharng th total numbr of partcls

More information

Section 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.

Section 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 information

A Note on Estimability in Linear Models

A Note on Estimability in Linear Models Intrnatonal Journal of Statstcs and Applcatons 2014, 4(4): 212-216 DOI: 10.5923/j.statstcs.20140404.06 A Not on Estmablty n Lnar Modls S. O. Adymo 1,*, F. N. Nwob 2 1 Dpartmnt of Mathmatcs and Statstcs,

More information

VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 514.7(045) : : Eberhard Malkowsky 1, Vesna Veličković 2

VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 514.7(045) : : Eberhard Malkowsky 1, Vesna Veličković 2 FACTA UNIVERSITATIS Srs: Mchancs, Automatc Control Robotcs Vol.3, N o, 00, pp. 7-33 VISUALIZATION OF DIFFERENTIAL GEOMETRY UDC 54.7(045)54.75.6:59.688:59.673 Ebrhard Malkowsky, Vsna Vlčkovć Dpartmnt of

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013

Introduction 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 information

On the irreducibility of some polynomials in two variables

On the irreducibility of some polynomials in two variables ACTA ARITHMETICA LXXXII.3 (1997) On th irrducibility of som polynomials in two variabls by B. Brindza and Á. Pintér (Dbrcn) To th mmory of Paul Erdős Lt f(x) and g(y ) b polynomials with intgral cofficints

More information

Analyzing Frequencies

Analyzing Frequencies Frquncy (# ndvduals) Frquncy (# ndvduals) /3/16 H o : No dffrnc n obsrvd sz frquncs and that prdctd by growth modl How would you analyz ths data? 15 Obsrvd Numbr 15 Expctd Numbr from growth modl 1 1 5

More information

The Equitable Dominating Graph

The 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 information

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall 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 information

A NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION*

A NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION* A NEW GENERALISATION OF SAM-SOLAI S MULTIVARIATE ADDITIVE GAMMA DISTRIBUTION* Dr. G.S. Davd Sam Jayakumar, Assstant Profssor, Jamal Insttut of Managmnt, Jamal Mohamd Collg, Truchraall 620 020, South Inda,

More information

te Finance (4th Edition), July 2017.

te Finance (4th Edition), July 2017. Appndx Chaptr. Tchncal Background Gnral Mathmatcal and Statstcal Background Fndng a bas: 3 2 = 9 3 = 9 1 /2 x a = b x = b 1/a A powr of 1 / 2 s also quvalnt to th squar root opraton. Fndng an xponnt: 3

More information

Lecture 3: Phasor notation, Transfer Functions. Context

Lecture 3: Phasor notation, Transfer Functions. Context EECS 5 Fall 4, ctur 3 ctur 3: Phasor notaton, Transfr Functons EECS 5 Fall 3, ctur 3 Contxt In th last lctur, w dscussd: how to convrt a lnar crcut nto a st of dffrntal quatons, How to convrt th st of

More information

8-node quadrilateral element. Numerical integration

8-node quadrilateral element. Numerical integration Fnt Elmnt Mthod lctur nots _nod quadrlatral lmnt Pag of 0 -nod quadrlatral lmnt. Numrcal ntgraton h tchnqu usd for th formulaton of th lnar trangl can b formall tndd to construct quadrlatral lmnts as wll

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results

BINOMIAL 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 information

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D Comp 35 Introducton to Machn Larnng and Data Mnng Fall 204 rofssor: Ron Khardon Mxtur Modls Motvatd by soft k-mans w dvlopd a gnratv modl for clustrng. Assum thr ar k clustrs Clustrs ar not rqurd to hav

More information

cycle that does not cross any edges (including its own), then it has at least

cycle 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 information

The Matrix Exponential

The 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 information

Lecture 6.4: Galois groups

Lecture 6.4: Galois groups Lctur 6.4: Galois groups Matthw Macauly Dpartmnt of Mathmatical Scincs Clmson Univrsity http://www.math.clmson.du/~macaul/ Math 4120, Modrn Algbra M. Macauly (Clmson) Lctur 6.4: Galois groups Math 4120,

More information

Shortest Paths in Graphs. Paths in graphs. Shortest paths CS 445. Alon Efrat Slides courtesy of Erik Demaine and Carola Wenk

Shortest Paths in Graphs. Paths in graphs. Shortest paths CS 445. Alon Efrat Slides courtesy of Erik Demaine and Carola Wenk S 445 Shortst Paths n Graphs lon frat Sls courtsy of rk man an arola Wnk Paths n raphs onsr a raph G = (V, ) wth -wht functon w : R. Th wht of path p = v v v k s fn to xampl: k = w ( p) = w( v, v + ).

More information

SCHUR S THEOREM REU SUMMER 2005

SCHUR S THEOREM REU SUMMER 2005 SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation

More information

The Matrix Exponential

The 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 information

Heisenberg Model. Sayed Mohammad Mahdi Sadrnezhaad. Supervisor: Prof. Abdollah Langari

Heisenberg Model. Sayed Mohammad Mahdi Sadrnezhaad. Supervisor: Prof. Abdollah Langari snbrg Modl Sad Mohammad Mahd Sadrnhaad Survsor: Prof. bdollah Langar bstract: n ths rsarch w tr to calculat analtcall gnvalus and gnvctors of fnt chan wth ½-sn artcls snbrg modl. W drov gnfuctons for closd

More information

Week 3: Connected Subgraphs

Week 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 information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

BINOMIAL 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

Soft k-means Clustering. Comp 135 Machine Learning Computer Science Tufts University. Mixture Models. Mixture of Normals in 1D

Soft k-means Clustering. Comp 135 Machine Learning Computer Science Tufts University. Mixture Models. Mixture of Normals in 1D Comp 35 Machn Larnng Computr Scnc Tufts Unvrsty Fall 207 Ron Khardon Th EM Algorthm Mxtur Modls Sm-Suprvsd Larnng Soft k-mans Clustrng ck k clustr cntrs : Assocat xampls wth cntrs p,j ~~ smlarty b/w cntr

More information

Consider a system of 2 simultaneous first order linear equations

Consider a system of 2 simultaneous first order linear equations Soluon of sysms of frs ordr lnar quaons onsdr a sysm of smulanous frs ordr lnar quaons a b c d I has h alrna mar-vcor rprsnaon a b c d Or, n shorhand A, f A s alrady known from con W know ha h abov sysm

More information

arxiv: v1 [math.pr] 28 Jan 2019

arxiv: v1 [math.pr] 28 Jan 2019 CRAMÉR-TYPE MODERATE DEVIATION OF NORMAL APPROXIMATION FOR EXCHANGEABLE PAIRS arxv:190109526v1 [mathpr] 28 Jan 2019 ZHUO-SONG ZHANG Abstract In Stn s mthod, an xchangabl par approach s commonly usd to

More information

Independent Domination in Line Graphs

Independent Domination in Line Graphs Itratoal Joural of Sctfc & Egrg Rsarch Volum 3 Issu 6 Ju-1 1 ISSN 9-5518 Iddt Domato L Grahs M H Muddbhal ad D Basavarajaa Abstract - For ay grah G th l grah L G H s th trscto grah Thus th vrtcs of LG

More information

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH.

SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. SOME PARAMETERS ON EQUITABLE COLORING OF PRISM AND CIRCULANT GRAPH. K VASUDEVAN, K. SWATHY AND K. MANIKANDAN 1 Dpartmnt of Mathmatics, Prsidncy Collg, Chnnai-05, India. E-Mail:vasu k dvan@yahoo.com. 2,

More information

Construction of asymmetric orthogonal arrays of strength three via a replacement method

Construction of asymmetric orthogonal arrays of strength three via a replacement method isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy

More information

External Equivalent. EE 521 Analysis of Power Systems. Chen-Ching Liu, Boeing Distinguished Professor Washington State University

External Equivalent. EE 521 Analysis of Power Systems. Chen-Ching Liu, Boeing Distinguished Professor Washington State University xtrnal quvalnt 5 Analyss of Powr Systms Chn-Chng Lu, ong Dstngushd Profssor Washngton Stat Unvrsty XTRNAL UALNT ach powr systm (ara) s part of an ntrconnctd systm. Montorng dvcs ar nstalld and data ar

More information

COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP

COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP ISAHP 00, Bal, Indonsa, August -9, 00 COMPLEX NUMBER PAIRWISE COMPARISON AND COMPLEX NUMBER AHP Chkako MIYAKE, Kkch OHSAWA, Masahro KITO, and Masaak SHINOHARA Dpartmnt of Mathmatcal Informaton Engnrng

More information

Total Prime Graph. Abstract: We introduce a new type of labeling known as Total Prime Labeling. Graphs which admit a Total Prime labeling are

Total 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 information

September 27, Introduction to Ordinary Differential Equations. ME 501A Seminar in Engineering Analysis Page 1. Outline

September 27, Introduction to Ordinary Differential Equations. ME 501A Seminar in Engineering Analysis Page 1. Outline Introucton to Ornar Dffrntal Equatons Sptmbr 7, 7 Introucton to Ornar Dffrntal Equatons Larr artto Mchancal Engnrng AB Smnar n Engnrng Analss Sptmbr 7, 7 Outln Rvw numrcal solutons Bascs of ffrntal quatons

More information

A NON-LINEAR MODEL FOR STUDYING THE MOTION OF A HUMAN BODY. Piteşti, , Romania 2 Department of Automotive, University of Piteşti

A NON-LINEAR MODEL FOR STUDYING THE MOTION OF A HUMAN BODY. Piteşti, , Romania 2 Department of Automotive, University of Piteşti ICSV Carns ustrala 9- July 7 NON-LINER MOEL FOR STUYING THE MOTION OF HUMN OY Ncola-oru Stănscu Marna Pandra nl Popa Sorn Il Ştfan-Lucan Tabacu partnt of ppld Mchancs Unvrsty of Ptşt Ptşt 7 Roana partnt

More information

COUNTING TAMELY RAMIFIED EXTENSIONS OF LOCAL FIELDS UP TO ISOMORPHISM

COUNTING 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 information

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization THE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND Economcs 600: August, 007 Dynamc Part: Problm St 5 Problms on Dffrntal Equatons and Contnuous Tm Optmzaton Quston Solv th followng two dffrntal quatons.

More information

MP IN BLOCK QUASI-INCOHERENT DICTIONARIES

MP IN BLOCK QUASI-INCOHERENT DICTIONARIES CHOOL O ENGINEERING - TI IGNAL PROCEING INTITUTE Lornzo Potta and Prr Vandrghynst CH-1015 LAUANNE Tlphon: 4121 6932601 Tlfax: 4121 6937600 -mal: lornzo.potta@pfl.ch ÉCOLE POLYTECHNIQUE ÉDÉRALE DE LAUANNE

More information

Lifting Constructions of Strongly Regular Cayley Graphs

Lifting Constructions of Strongly Regular Cayley Graphs Lftng Constructons of Strongly Rgular Cayly Graphs Koj Momhara Qng Xang Abstract W gv two lftng constructons of strongly rgular Cayly graphs. In th frst constructon w lft a cyclotomc strongly rgular graph

More information

Supplementary Materials

Supplementary Materials 6 Supplmntary Matrials APPENDIX A PHYSICAL INTERPRETATION OF FUEL-RATE-SPEED FUNCTION A truck running on a road with grad/slop θ positiv if moving up and ngativ if moving down facs thr rsistancs: arodynamic

More information

Outlier-tolerant parameter estimation

Outlier-tolerant parameter estimation Outlr-tolrant paramtr stmaton Baysan thods n physcs statstcs machn larnng and sgnal procssng (SS 003 Frdrch Fraundorfr fraunfr@cg.tu-graz.ac.at Computr Graphcs and Vson Graz Unvrsty of Tchnology Outln

More information

Physics 256: Lecture 2. Physics

Physics 256: Lecture 2. Physics Physcs 56: Lctur Intro to Quantum Physcs Agnda for Today Complx Numbrs Intrfrnc of lght Intrfrnc Two slt ntrfrnc Dffracton Sngl slt dffracton Physcs 01: Lctur 1, Pg 1 Constructv Intrfrnc Ths wll occur

More information

Abstract Interpretation: concrete and abstract semantics

Abstract Interpretation: concrete and abstract semantics Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion

More information

CHAPTER 33: PARTICLE PHYSICS

CHAPTER 33: PARTICLE PHYSICS Collg Physcs Studnt s Manual Chaptr 33 CHAPTER 33: PARTICLE PHYSICS 33. THE FOUR BASIC FORCES 4. (a) Fnd th rato of th strngths of th wak and lctromagntc forcs undr ordnary crcumstancs. (b) What dos that

More information

ANALYTICITY THEOREM FOR FRACTIONAL LAPLACE TRANSFORM

ANALYTICITY THEOREM FOR FRACTIONAL LAPLACE TRANSFORM Sc. Rs. hm. ommn.: (3, 0, 77-8 ISSN 77-669 ANALYTIITY THEOREM FOR FRATIONAL LAPLAE TRANSFORM P. R. DESHMUH * and A. S. GUDADHE a Prof. Ram Mgh Insttt of Tchnology & Rsarch, Badnra, AMRAVATI (M.S. INDIA

More information

CS 361 Meeting 12 10/3/18

CS 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 information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

On spanning trees and cycles of multicolored point sets with few intersections

On 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 information

Approximately Maximizing Efficiency and Revenue in Polyhedral Environments

Approximately Maximizing Efficiency and Revenue in Polyhedral Environments Approxmatly Maxmzng Effcncy and Rvnu n olyhdral Envronmnts Thành Nguyn Cntr for Appld Mathmatcs Cornll Unvrsty Ithaca, NY, USA. thanh@cs.cornll.du Éva Tardos Computr Scnc Dpartmnt Cornll Unvrsty Ithaca,

More information

Jones vector & matrices

Jones vector & matrices Jons vctor & matrcs PY3 Colást na hollscol Corcagh, Ér Unvrst Collg Cork, Irland Dpartmnt of Phscs Matr tratmnt of polarzaton Consdr a lght ra wth an nstantanous -vctor as shown k, t ˆ k, t ˆ k t, o o

More information

Thus, 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.

Thus, 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 information

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0

Function Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0 unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr

More information

Chiang Mai J. Sci. 2014; 41(2) 457 ( 2) ( ) ( ) forms a simply periodic Proof. Let q be a positive integer. Since

Chiang Mai J. Sci. 2014; 41(2) 457 ( 2) ( ) ( ) forms a simply periodic Proof. Let q be a positive integer. Since 56 Chag Ma J Sc 0; () Chag Ma J Sc 0; () : 56-6 http://pgscccmuacth/joural/ Cotrbutd Papr Th Padova Sucs Ft Groups Sat Taș* ad Erdal Karaduma Dpartmt of Mathmatcs, Faculty of Scc, Atatürk Uvrsty, 50 Erzurum,

More information

Aotomorphic Functions And Fermat s Last Theorem(4)

Aotomorphic Functions And Fermat s Last Theorem(4) otomorphc Fuctos d Frmat s Last Thorm(4) Chu-Xua Jag P. O. Box 94 Bg 00854 P. R. Cha agchuxua@sohu.com bsract 67 Frmat wrot: It s mpossbl to sparat a cub to two cubs or a bquadrat to two bquadrats or gral

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

(Upside-Down o Direct Rotation) β - Numbers

(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 information

Review - Probabilistic Classification

Review - Probabilistic Classification Mmoral Unvrsty of wfoundland Pattrn Rcognton Lctur 8 May 5, 6 http://www.ngr.mun.ca/~charlsr Offc Hours: Tusdays Thursdays 8:3-9:3 PM E- (untl furthr notc) Gvn lablld sampls { ɛc,,,..., } {. Estmat Rvw

More information

ON RIGHT(LEFT) DUO PO-SEMIGROUPS. S. K. Lee and K. Y. Park

ON 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 information

ST 524 NCSU - Fall 2008 One way Analysis of variance Variances not homogeneous

ST 524 NCSU - Fall 2008 One way Analysis of variance Variances not homogeneous ST 54 NCSU - Fall 008 On way Analyss of varanc Varancs not homognous On way Analyss of varanc Exampl (Yandll, 997) A plant scntst masurd th concntraton of a partcular vrus n plant sap usng ELISA (nzym-lnkd

More information

Optimal Ordering Policy in a Two-Level Supply Chain with Budget Constraint

Optimal Ordering Policy in a Two-Level Supply Chain with Budget Constraint Optmal Ordrng Polcy n a Two-Lvl Supply Chan wth Budgt Constrant Rasoul aj Alrza aj Babak aj ABSTRACT Ths papr consdrs a two- lvl supply chan whch consst of a vndor and svral rtalrs. Unsatsfd dmands n rtalrs

More information

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P

DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P DISTRIBUTION OF DIFFERENCE BETWEEN INVERSES OF CONSECUTIVE INTEGERS MODULO P Tsz Ho Chan Dartmnt of Mathmatics, Cas Wstrn Rsrv Univrsity, Clvland, OH 4406, USA txc50@cwru.du Rcivd: /9/03, Rvisd: /9/04,

More information

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero. SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain

More information

Cramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter

Cramé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 information

Epistemic Foundations of Game Theory. Lecture 1

Epistemic Foundations of Game Theory. Lecture 1 Royal Nthrlands cadmy of rts and Scncs (KNW) Mastr Class mstrdam, Fbruary 8th, 2007 Epstmc Foundatons of Gam Thory Lctur Gacomo onanno (http://www.con.ucdavs.du/faculty/bonanno/) QUESTION: What stratgs

More information

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Propositional 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 information

Chapter 6 Student Lecture Notes 6-1

Chapter 6 Student Lecture Notes 6-1 Chaptr 6 Studnt Lctur Nots 6-1 Chaptr Goals QM353: Busnss Statstcs Chaptr 6 Goodnss-of-Ft Tsts and Contngncy Analyss Aftr compltng ths chaptr, you should b abl to: Us th ch-squar goodnss-of-ft tst to dtrmn

More information

SIMEON BALL AND AART BLOKHUIS

SIMEON BALL AND AART BLOKHUIS A BOUND FOR THE MAXIMUM WEIGHT OF A LINEAR CODE SIMEON BALL AND AART BLOKHUIS Absrac. I s shown ha h paramrs of a lnar cod ovr F q of lngh n, dmnson k, mnmum wgh d and maxmum wgh m sasfy a cran congrunc

More information

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN

International Journal of Scientific & Engineering Research, Volume 6, Issue 7, July ISSN Intrnational Journal of Scintific & Enginring Rsarch, Volum 6, Issu 7, July-25 64 ISSN 2229-558 HARATERISTIS OF EDGE UTSET MATRIX OF PETERSON GRAPH WITH ALGEBRAI GRAPH THEORY Dr. G. Nirmala M. Murugan

More information

The Fourier Transform

The Fourier Transform /9/ Th ourr Transform Jan Baptst Josph ourr 768-83 Effcnt Data Rprsntaton Data can b rprsntd n many ways. Advantag usng an approprat rprsntaton. Eampls: osy ponts along a ln Color spac rd/grn/blu v.s.

More information

ALGEBRA HW 7 CLAY SHONKWILER

ALGEBRA HW 7 CLAY SHONKWILER ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer

More information

Quasi-Classical States of the Simple Harmonic Oscillator

Quasi-Classical States of the Simple Harmonic Oscillator Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats

More information

CHAPTER 7d. DIFFERENTIATION AND INTEGRATION

CHAPTER 7d. DIFFERENTIATION AND INTEGRATION CHAPTER 7d. DIFFERENTIATION AND INTEGRATION A. J. Clark School o Engnrng Dpartmnt o Cvl and Envronmntal Engnrng by Dr. Ibrahm A. Assakka Sprng ENCE - Computaton Mthods n Cvl Engnrng II Dpartmnt o Cvl and

More information

Hardy-Littlewood Conjecture and Exceptional real Zero. JinHua Fei. ChangLing Company of Electronic Technology Baoji Shannxi P.R.

Hardy-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

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the

The graph of y = x (or y = ) consists of two branches, As x 0, y + ; as x 0, y +. x = 0 is the Copyright itutcom 005 Fr download & print from wwwitutcom Do not rproduc by othr mans Functions and graphs Powr functions Th graph of n y, for n Q (st of rational numbrs) y is a straight lin through th

More information

Square of Hamilton cycle in a random graph

Square of Hamilton cycle in a random graph Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs

More information

Decision-making with Distance-based Operators in Fuzzy Logic Control

Decision-making with Distance-based Operators in Fuzzy Logic Control Dcson-makng wth Dstanc-basd Oprators n Fuzzy Logc Control Márta Takács Polytchncal Engnrng Collg, Subotca 24000 Subotca, Marka Orškovća 16., Yugoslava marta@vts.su.ac.yu Abstract: Th norms and conorms

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

Lecture 23 APPLICATIONS OF FINITE ELEMENT METHOD TO SCALAR TRANSPORT PROBLEMS

Lecture 23 APPLICATIONS OF FINITE ELEMENT METHOD TO SCALAR TRANSPORT PROBLEMS COMPUTTION FUID DYNMICS: FVM: pplcatons to Scalar Transport Prolms ctur 3 PPICTIONS OF FINITE EEMENT METHOD TO SCR TRNSPORT PROBEMS 3. PPICTION OF FEM TO -D DIFFUSION PROBEM Consdr th stady stat dffuson

More information

SCRIBE: JAKE LEVINSON

SCRIBE: JAKE LEVINSON GL n REPRESENTATION THEORY NOTES FOR 12-03 SCRIBE: JAKE LEVINSON As th th last lctur, ths on s basd on John Stmbrdg s papr: A local charactrzaton of smpl-lacd crstals, Trans. Amr. Math. Soc. 355 (2003),

More information

Chapter 10. The singular integral Introducing S(n) and J(n)

Chapter 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 information

In 1991 Fermat s Last Theorem Has Been Proved

In 1991 Fermat s Last Theorem Has Been Proved I 99 Frmat s Last Thorm Has B Provd Chu-Xua Jag P.O.Box 94Bg 00854Cha Jcxua00@s.com;cxxxx@6.com bstract I 67 Frmat wrot: It s mpossbl to sparat a cub to two cubs or a bquadrat to two bquadrats or gral

More information

Computing and Communications -- Network Coding

Computing and Communications -- Network Coding 89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc

More information

UNTYPED LAMBDA CALCULUS (II)

UNTYPED LAMBDA CALCULUS (II) 1 UNTYPED LAMBDA CALCULUS (II) RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] 1 1 1 1 v v CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y /

More information

Hydrogen Atom and One Electron Ions

Hydrogen Atom and One Electron Ions Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial

More information

8. Linear Contracts under Risk Neutrality

8. Linear Contracts under Risk Neutrality 8. Lnr Contrcts undr Rsk Nutrlty Lnr contrcts r th smplst form of contrcts nd thy r vry populr n pplctons. Thy offr smpl ncntv mchnsm. Exmpls of lnr contrcts r mny: contrctul jont vnturs, quty jont vnturs,

More information

1 Minimum Cut Problem

1 Minimum Cut Problem CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms

More information

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals

More information

Spectral Synthesis in the Heisenberg Group

Spectral Synthesis in the Heisenberg Group Intrnational Journal of Mathmatical Analysis Vol. 13, 19, no. 1, 1-5 HIKARI Ltd, www.m-hikari.com https://doi.org/1.1988/ijma.19.81179 Spctral Synthsis in th Hisnbrg Group Yitzhak Wit Dpartmnt of Mathmatics,

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Combinatorial Networks Week 1, March 11-12

Combinatorial Networks Week 1, March 11-12 1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl

More information

3.4 Properties of the Stress Tensor

3.4 Properties of the Stress Tensor cto.4.4 Proprts of th trss sor.4. trss rasformato Lt th compots of th Cauchy strss tsor a coordat systm wth bas vctors b. h compots a scod coordat systm wth bas vctors j,, ar gv by th tsor trasformato

More information

ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS

ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS Novi Sad J. Math. Vol. 45, No. 1, 2015, 201-206 ABEL TYPE THEOREMS FOR THE WAVELET TRANSFORM THROUGH THE QUASIASYMPTOTIC BOUNDEDNESS Mirjana Vuković 1 and Ivana Zubac 2 Ddicatd to Acadmician Bogoljub Stanković

More information

Discrete Shells Simulation

Discrete Shells Simulation Dscrt Shlls Smulaton Xaofng M hs proct s an mplmntaton of Grnspun s dscrt shlls, th modl of whch s govrnd by nonlnar mmbran and flxural nrgs. hs nrgs masur dffrncs btwns th undformd confguraton and th

More information