A Witt type formula. G.A.T.F.da Costa 1 Departamento de Matemática Universidade Federal de Santa Catarina Florianópolis-SC-Brasil.
|
|
- Martin Webb
- 5 years ago
- Views:
Transcription
1 A Wtt type formula G.A.T.F.da Costa 1 Departamento de Matemátca Unversdade Federal de Santa Catarna Floranópols-SC-Brasl arxv: v2 [math.co] 4 Mar 2013 Abstract Gven a fnte, connected graph G, T ts edge adjacency matrx, and, a postve nteger, ths paper nvestgates some combnatoral and algebrac propertes of the Wtt type formula Ω(, T ) = 1 µ(g) T rt g. The sum ranges over the postve dvsors of and µ s the Möbus functon. 1 Introducton The objectve of the present paper s to nvestgate algebrac and combnatoral aspects of the formula gven n the abstract whch gves the number of equvalence classes of arbtrarly orented but non-bactracng non-perodc closed paths of length n a orented graph. The formula s well nown n assocaton wth the zeta functon of a graph nvestgated by several authors. See [8, 9, 10] and references theren. As shown n ths paper the formula has several propertes of the Wtt formula type not nvestgated prevously, as far as I now. Let s recall Wtt formula and some of ts propertes. Let be a postve nteger, R a real number, µ the classcal Möbus functon defned by the rules: a) µ(+1) = +1, b) µ(g) = 0, f g = p e p eq q, p 1,..., p q prmes, and any e > 1, c) µ(p 1...p q ) = ( 1) q. The polynomal of degree n R wth ratonal coeffcents gven n terms of Möbus functon, M(; R) = 1 µ(g)r g, (1.1) has many applcatons n algebra and combnatorcs [5]. It s called the Wtt formula when t s assocated wth the followng result [6]: If V s an R-dmensonal vector space and L s the free Le algebra generated by V then L has a Z >0 gradaton 1 g.costa@ufsc.br 1
2 L = L, L has dmenson gven by M(; R) whch satsfes the formal relaton (1 z ) M(;R) = 1 Rz (1.2) called the Wtt dentty. otce that the coeffcent of the lnear term n the rght hand sde s mnus the dmenson of the vector space that generates the Le algebra. Wtt dentty follows from the Poncaré-Broff-Wtt theorem whch says that (1 z ) M(;R) = 1 + R z (1.3) s the generatng functon for the dmensons of the homogeneous subspaces of the envelopng algebra of L. Wtt formula s also called the neclace polynomal because M(; R) gves the number of nequvalent non-perodc colorngs of a crcular strng of beads - a neclace - wth at most R colors [12]. In [7] S. Sherman assocated t to the number of equvalence classes of closed non-perodc paths of length whch traverse counterclocwsely wthout bactracng the edges of a graph wth R loops counterclocwsely orented and hooed to a sngle vertex so that Ω generalzes M. otce that the coeffcent of the lnear term n the rght hand sde of Wtt dentty s mnus the number of loops n the graph. It s proved that the formula for Ω(, T ) satsfes some denttes analogous to those satsfed by M(, R) whch Carltz proved n [11] and Metropols and Rota n [12]. In [5], Moree proved smlar denttes for hs Wtt transform. Also, the formula can be nterpreted as a dmenson formula and t can be assocated to a colorng problem. The paper s organzed as follows. In secton 2, some prelmnary defntons and results are gven. In secton 3, several denttes satsfed by the formula s proved. In secton 4, the formula s nterpreted as a dmenson formula assocated to free Le super algebras and, n secton 5, to neclace colorngs. The formula s appled to some examples. 2 Prelmnares Let G = (V, E) be a fnte connected and orented graph where V s the set of vertces wth V elements and E s the set of orented edges wth E elements labeled e 1,...,e E. An edge has an orgn and an end as gven by ts orentaton. The graph may have multple edges and loops. ow, consder the graph G bult from G by addng n the opposng orented edges e E +1 = (e 1 ) 1,...,e 2 E = (e E ) 1, (e ) 1 beng the orented edge opposte to 2
3 e and wth orgn (end) the end (orgn) of e. In the case that e s an orented loop, e + E = (e ) 1 s just an addtonal orented loop hooed to the same vertex. Thus, G has 2 E orented edges. A path n G s gven by an ordered sequence (e 1,..., e ), {1,..., 2 E }, of orented edges n G such that the end of e s the orgn of e +1. Also, a path can be represented by a word n the alphabet of the symbols n the set {e 1,..., e 2E }, a word beng a concatenated product of symbols whch respect the order of the symbols n the sequence. In ths paper, all paths are cycles. These are non-bactracng tal-less closed paths, that s, the end of e concdes wth the orgn of e 1, subjected to the nonbactracng condton that e +1 e + E. In another words, a cycle never goes mmedately bacwards over a prevous edge. Tal-less means that e 1 e 1. The length of a cycle s the number of edges n ts sequence. A cycle p s called perodc f p = q r for some r > 1 and q s a non perodc cycle. umber r s called the perod of p. The cycle (e, e 1,..., e 1 ) s called a crcular permutaton of (e 1,..., e ) and (e 1,..., e 1 1 ) s an nverson of the latter. A cycle and ts nverse are taen as dstnct. The classcal Möbus nverson formula s used several tmes n ths paper. Gven arthmetc functons f and g t states that g(n) = d n f(d) f and only f f(n) = d n µ(d)g(n/d). In order to count cycles of a gven length n a graph G a crucal tool s the edge adjacency matrx of G [8]. Ths s the 2 E 2 E matrx T defned as follows: T j = 1, f end vertex of edge s the start vertex of edge j and edge j s not the nverse edge of ; T j = 0, otherwse. Theorem 2.1. ([8]) The number T rt (over)counts cycles of length n a graph G. Proof. Let a and b be two edges of G. The (a, b) th entry of matrx T s (T ) (a,b) = e 1,...,e 1 T (a,e1 )T (e1,e 2 )...T (e 1,b) From the defnton of the entres of T t follows that (T ) (a,b) counts the number of paths of length wth no bactracs from edge a to edge b. For b = a, only closed paths are counted. Tang the trace gves the number of non-bactracng closed paths wth every edge taen nto account as startng edge, hence, the trace overcounts closed paths because every edge n the path s taen nto account as startng edge. The paths counted by the trace are tal-less, that s, e 1 e 1 ; otherwse, T rt = a (T ) (a,a) would have a term wth entry (a, a 1 ) whch s not possble. 3
4 Theorem 2.2. [9] Denote by Ω(, T ) the number of equvalence classes of non perodc cycles of length n G. Ths number s gven by the followng formula: Ω(, T ) = 1 µ(g) T rt g (2.1) Proof. In the set of T rt cycles there s the subset wth Ω(, T ) elements formed by the non perodc cycles of length plus ther crcular permutatons and the subset wth g 1 Ω(, T ) elements formed by the perodc cycles of length (whose g g perods are the common dvsors of ) plus ther crcular permutatons. (A cycle of perod g and length s of the form (e 1 e 2...e α ) g where α = /g, and (e 1 e 2...e α ) s a non perodc cycle so that the number of perodc cycles wth perod g plus ther crcular permutatons s gven by (/g)ω(/g, T )). Hence, T rt = ( ) g Ω g, T Möbus nverson formula gves the result. Remar 1. Some terms n the rght hand sde of (2.1) are negatve. In spte of that the rght hand sde s always postve. Multply both sdes by. The fst term equals T rt whle the other terms gve (n absolute value) the number accordng to perod of the varous subsets of perodc cycles whch are proper subsets of the larger set wth T rt elements. Remar 2. Wtt formula can be expressed n a form analogous to (2.1). Defne Q as the R R matrx wth all entres equal to one. The trace T rq = R counts counterclocwsely orented cycles n the graph wth R loops counterclocwsely orented and hooed to a sngle vertex so that M(; R) = 1 µ(g)t rq g (2.2) A recurrence relaton whch may be useful n practcal calculatons of Ω(, T ) s gven next. Theorem 2.3. Ω(, T ) = T rt,g g Ω (g, T ) (2.3) Proof. Ths follows from T rt = g Ω (g, T ) = Ω(, T ) + g Ω (g, T ).,g 4
5 3 Some denttes satsfed by Ω It turns out that Ω(, T ) satsfes some denttes analogous to those satsfed by Wtt formula proved n [11, 12]. These denttes are establshed n ths secton. In [5], Moree proved smlar denttes for hs Wtt transform. Theorem 3.1. Gven the matrces T 1 and T 2 defne S(s, T ) = g s µ(g) T rt g, = 1, 2, and denote by T 1 T 2 the Kronecer product of T 1 and T 2. Then, S(s, T 1 )S(t, T 2 ) = S(, T 1 T 2 ) (3.1) [s,t]= The summaton s over the set of postve ntegers {s, t [s, t] = }, [s, t] beng the least common multple of s, t. It also holds that S(, T l ) = S(t, T ) (3.2) [l,t]=l Proof. In order to prove (3.1) t suffces to consder the equvalent formula (see [11]) S(, T 1 T 2 ) [s,t]= S(s, T 1 )S(t, T 2 ) = Usng Möbus nverson formula, the left hand sde s equal to S(s, T 1 ) S(t, T 2 ) = (T rt1 )(T rt2 ) s t But (T rt1 )(T rt2 ) = T r(t 1 T 2 ). By Möbus nverson formula ths gves the rght hand sde of the equvalent formula. Usng deas from [5], the next dentty can be proved usng the followng equvalent formula: S(t, T ) = S(, T l ) [l,t]= l g The left hand sde s equal to l t l S(t, T ) = T rt = T r(t l ). Apply Möbus nverson formula to get the result. Remar 3. Formula (3.1) may be generalzed to the case T = T 1 T 2... T l to gve S(s 1, T 1 )... S(s l, T l ) = S(, T ) (3.3) [s 1,...,s l ]= Also, t can be proved that S(, T s 1 T r 2 ) = [rp,sq]=nrs 5 S(p, T 1 )S(q, T 2 ) (3.4)
6 where r and s are relatvely prme and the summaton s over all postve ntegers p, q such that [rp, sq] = nrs. The proof s an applcaton of prevous denttes as n [12], Theorem 5. Remar 4. In terms of Ω, usng that [s, t](s, t) = st, (7) becomes (s, t)ω(s, T 1 )Ω(t, T 2 ) = Ω(, T 1 T 2 ) (3.5) [s,t]= where (s, t) s the maxmum common dvsor of s and t. Ths can be extended to the general case (3.3) to gve (s 1,, s l )Ω(s 1, T 1 )... Ω(s l, T l ) = Ω(, T ) (3.6) [s 1,...,s l ]= where (s 1,, s l ) s the greatest common dvsor of (s 1,, s l ) and the sum runs over all postve ntegers (s 1,, s l ) wth least common multple equal to and T = T 1 T l. Also, from (8), In terms of Ω (10) reads Ω(, T l ) = Ω(, T s 1 T r 2 ) = [l,t]=l [rp,sq]=rs t Ω(t, T ). (3.7) pqω(p, T 1 )Ω(q, T 2 ) Usng (rp, sq)[rp, sq] = rpsq wth [rp, sq] = rs mples (rp, sq) = pq and Ω(, T1 s T2 r ) = (rp, sq)ω(p, T 1 )Ω(q, T 2 ) [rp,sq]=rs Replace s and r by s/(r, s) and r/(r, s) to get (r, s)ω(, T s/(r,s) 1 T r/(r,s) 2 ) = (rp, sq)ω(p, T 1 )Ω(q, T 2 ) (3.8) The sum s over p, q such that pq/(pr, qs) = /(r, s). Another dentty satsfed by Ω s of the Wtt type (1.2). It s a well nown result about the ζ functon of a graph G whch s defned as follows: ζ(z) := [p] (1 z l(p) ) 1 = (1 z ) Ω(,T ) (3.9) 6
7 See [8] and [9]. The frst product s over the equvalence classes [p] of bactracless and tal-less closed paths of length l(p) n G. It s a famous result that ζ = [det(1 zt )] 1, hence, Ω(, T ) satsfes the Wtt type dentty (1 z ) Ω(,T ) = det(1 zt ) (3.10) As mentoned n the ntroducton, the coeffcent of the lnear term n Wtt s dentty s the negatve of the number of loops n a graph wth R loops hooed to a sngle vertex. The coeffcents n the expanson of the determnant det(1 zt ) as a polynomal n z also have nce combnatoral meanngs related to the structure of the graph G as proved by several authors. See [10] and references theren. ext theorem gves formulas for these coeffcents and for those of the nverse of the determnant whch are relevant for the next secton. Theorem 3.2. Defne Then, T rt g(z) := z. (3.11) where + (1 z ) ±Ω(,T ) = e g(z) = [det(1 zt )] ± = 1 c ± () = λ ± (m) m=1 a 1 + 2a a = a a = m =1 + =1 c ± ()z, (3.12) (T rt ) a a! a (3.13) wth λ + (m) = ( 1) m+1, λ (m) = +1, c + () = 0 for > 2 E, and c () 0. Furthemore, T rt = s = (s ) 1, s Z 0 s = s +1 ( s 1)! (±1) c± () s (3.14) s! where s = s, s! = s!. Proof. Defne P ± by P ± (z) = + =1 (1 z ) ±Ω(,T ) 7
8 Tae the logarthm of both sdes and use (2.1) to get lnp ± = = + T rt 1 + Ω(, T )z = z = g(z) ( ) 1 Ω, T z from whch the frst equalty n (3.12) follows. From the defnton of g(z), t follows that T rt + 1 g(z) := z = T r T z = ±T r ln(1 zt ) = ±ln det(1 zt ) provng the second equalty n (3.12). The thrd equalty s obtaned formally expandng the exponental. formal Taylor expanson of 1 e g, the coeffcents c ± are gven by d As the c ± () = 1 [ ±(1 e g ) ]! dz z=0 Usng Faa d Bruno s formula as n [1], the dervatves can be computed explctly and (3.13) follows. The determnant s a polynomal of maxmum degree 2 E, hence, c + () = 0 for > 2 E. Clearly, c () 0. To prove (3.14) wrte [2] ( ln 1 ) c ± ()z = = ± + l=1 + l=1 ( 1) l (±1) l ( ± ) l c ± ()z ( s )! (s!) s = (s ) 1 s Z 0 s = l ( c± () s ) z s l = + z =1 s = (s ) 1, s Z 0 s = s +1 ( s 1)! (±1) c± () s s! The second equalty n (3.12) appled to the left hand sde yelds ( ln 1 ) + c ± ()z T rt = z 8 =1
9 Compare coeffcents to get the result. Remar 5. Wtt dentty can be expressed n terms of a determnant: (1 z ) M(;R) = 1 Rz = det(1 zq) The proof s analogous to the proof of prevous theorem usng (2.2). 4 Ω and free Le super algebras As mentoned n the ntroducton the coeffcent n the Wtt formula (1.1) has an algebrac nterpretaton as the negatve of the dmenson of a vector space that generates a free Le algebra and the nverse of ths formula s the generatng functon of dmensons of the subspaces of the envelopng algebra of the Le algebra. Is t possble that the coeffcents n the determnant det(1 zt G ) above have smlar nterpretaton? The answer s postve. Formula (2.1) and the coeffcents of the determnant and ts nverse can be nterpreted algebracally n terms of data related to Le super algebras. In seres of papers S. -J. Kang and M. -H Km [2, 4] generalzed Wtt formula (1.1) to the case the free Le algebra L s generated by an nfnte graded vector space. They obtaned a generalzed Wtt formula for the dmensons of the homogeneous subspaces of L whch satsfes a generalzed Wtt dentty. In [4] S. -J. Kang extended these results to super spaces and Le super algebras. Some of the results are summarzed n the followng proposton. Proposton 4.1. Let V = =1 V be a Z >0 -graded super space wth fnte dmensons dmv = t() and super dmensons DmV = t() Z, 1. Let L = L be the free Le super algebra generated by V wth a Z >0 -gradaton nduced by that of V. Then, the super dmensons of the subspaces L are gven by formula DmL = µ(g) g W ( ) g The summaton ranges over all common dvsors g of and W s gven by W () = s T () ( s 1)! s! (4.1) t() s (4.2) where T () = {s = (s ) 1 s Z 0, s = } and s = s, s! = s!. The numbers DmL satsfy the dentty (1 z ) DmL = 1 t()z. (4.3) 9 =1
10 The rght hand sde of (4.3) s related to the generatng functon for the W s, by the relaton Furthermore, g(z) := W (n)z n (4.4) n=1 e g(z) = 1 t()z (4.5) =1 ( ) DmL 1 = z DmU(L) z (4.6) where DmU(L) s the dmenson of the -th homogeneous subspace of U(L), the unversal envelopng algebra of L. In [4], (4.1) s called the generalzed Wtt formula; W s called Wtt partton functon; and (4.3) s called generalzed Wtt dentty. See secton 2.3 of [4]. Gven a formal power seres + =1 t z wth t Z, for all 1, the coeffcents n the seres can be nterpreted as the super dmensons of a Z >0 -graded super space V = =1 V wth dmensons dmv = t and super dmensons DmV = t Z. Let L be the free Le super algebra generated by V. Then, t has a gradaton nduced by V and the homogeneous subspaces have dmenson gven by (4.1). Apply ths nterpretaton to the determnant det(1 zt ) whch s a polynomal of degree 2 E n the formal varable z. It can be taen as a power seres wth coeffcents t = 0, for > 2 E. Comparson of the formulas n Theorem 3.2 wth formulas n the above Proposton mples the next result: Proposton 4.2. Gven a graph G, T ts edge matrx, let V = 2 E =1 V be a Z >0 - graded super space wth fnte dmensons dmv = c + () and the super dmensons DmV = c + () gven by (3.13), the coeffcents of det(1 zt ). Let L = L be the free Le super algebra generated by V. Then, the super dmensons of the subspaces L are gven by DmL = Ω(, T ). The algebra has generalzed Wtt dentty gven by (3.10). The zeta functon of G (3.9) s the generatng functon for the dmensons of the subspaces of the envelopng algebra U(L) of L whch are gven by DmU(L) n = c (n), c (n) gven by (3.13). Example 1. G 1, the graph wth R 2 edges counterclocwsely orented and hooed to a sngle vertex shown n Fgure 1. The edge matrx for G 1 s the 2R 2R symmetrc matrx ( ) A B T G1 = B A =1 10
11 Fgure 1: Graph G 1 where A s the R R matrx wth all entres equal to 1 and B s the R R matrx wth the man dagonal entres equal to 0 and all the other entres equal to 1. Ths matrx has the trace gven by and the determnant T rt G 1 = 1 + (R 1)(1 + ( 1) ) + (2R 1), = 1, 2,... det(1 zt G1 ) = (1 z) [1 (2R 1)z] (1 z 2 ) R 1 = 1 2R =1 c()z where c(2r) = ( 1) R (2R 1), c(2) = ( 1) (2 1) ( R ), = 1,, R 1 and Futhermore, c(2 + 1) = 2R( 1) ( R 1 ), = 0, 1, R 1 [det(1 zt G1 )] 1 = + z q q=0 q a (2R 1) q =0 where a = =0 ( 1) ( + R 1 R 1 ) ( + R 2 R 2 ) Let s consder the case R = 2. In ths case, T rt G 1 = 2 + ( 1) + 3, det(1 zt G1 ) = 1 4z + 2z 2 + 4z 3 3z 4 11
12 so that the number of classes of reduced nonperodc cycles of length s gven by the formula Ω(, T G1 ) = 1 ) µ(g) (2 + ( 1) g + 3 g The graph generates the followng algebra. Let V = 4 =1 V be a Z >0 -graded super space wth dmensons dmv 1 = 4, dmv 2 = 2, dmv 3 = 4, dmv 4 = 3 and super dmensons DmV 1 = 4, DmV 2 = 2, DmV 3 = 4, DmV 4 = 3. Let L = L be the free graded Le super algebra generated by V. The dmensons of the subspaces L are gven by the generalzed Wtt formula DmL = 1 ) µ(g) (2 + ( 1) g + 3 g whch satsfes the generalzed Wtt dentty + (1 z ) Ω(,T G 1 ) = 1 [4z 2z 2 4z 3 + 3z 4 ] The subspace U n (L) of the envelopng algebra U(L) have dmensons gven by the zeta functon of the graph, + (1 z ) Ω(,T G 1 ) = (( 1) n n 24 12n)z n 16 n=1 so that DmU n (L) = 1 16 (( 1)n n 24 12n) Example 2. G 2, the bpartte graph shown n Fgure 2. Fgure 2: Graph G 2 12
13 The edge matrx of G 2 s T G2 = The matrx has the trace T rtg 2 = 0 f s odd and T rtg 2 = f s even, and the determnant det(1 zt G2 ) = 1 6z 2 + 9z 4 4z 6 If s odd, the number of classes of nonperodc cycles of length s Ω(, T G2 ) = 0, f s odd, and Ω(, T G2 ) = 1 µ(g)t rt g G 2 f s even. The graph generates the followng algebra. Let V = 3 =1 V 2 be a Z >0 -graded superspace wth dmensons dmv 2 = 6, dmv 4 = 9, dmv 6 = 4 and superdmensons DmV 2 = 6, DmV 4 = 9, DmV 6 = 4. Let L = L be the free graded Le superalgebra generated by V. The dmensons of the subspaces L are DmL = 0, for odd and DmL = 1 µ(g)t rt g G 2 for even. The dmensons satsfy the generalzed Wtt dentty + (1 z ) Ω(,T G 2 ) = 1 [6z 2 9z 4 + 4z 6 ] The generatng functon for the dmensons of the subspaces U n (L) of the envelopng algebra U(L) s gven by + (1 z ) Ω(,T G 2 ) = (2 2n+5 6n 14)z 2n n=1 so that DmU n (L) = 2 2n+5 6n 14 13
14 5 eclace colorngs nduced by paths Gven the set of 2 E colors {c 1,..., c 2 E }, assgn the colors c, c E + to edges e, e E + = e 1 G, respectvely, so that to a cycle of length n G corresponds an ordered sequence of colors. ow, assgn each color n ths sequence to a bead n a crcular strng wth beads - a neclace - n such a manner that two adjacent colors n the sequence are assgned to adjacent beads. The non bactracng condton for cycles mples that no two adjacent beads are panted wth colors, say, c and c E +. It s clear that there s a correspondence between the classes of nonperodc cycles of length n G and classes of nonperodc colorngs of a neclace wth beads wth at most 2 E dstnct colors nduced by the cycles so that the number of nequvalent colorngs s Ω G (, T ). Of course the structure of the graph reflects tself on the colorng. For nstance, the presence of loops n the graph means that ther assgned colors may appear repeated n a strng of adjacent beads. Ths can not happen to a color assgned to an edge whch s not a loop. The edge matrx T may be called the color matrx. It bascally tells what colors are allowed to follow a gven color n the neclace. Element T j = 1, f a color c j can follow color c and c j c E + ; T j = 0, otherwse. Example 3. The number of nonperodc colorngs of a neclace wth beads wth at most 6 colors and color matrx gven by graph G 1 wth R = 3: T G1 = s Ω(, T G1 ) = 1 ) µ(g) (3 + 2( 1) g + 5 g For = 3, Ω(3, T G1 ) = 40. The classes of nonperodc colorngs are [c c 2 j], [c 3+ c 2 j], [c c 2 3+j], [c 3+ c 2 3+j ], [c 2 c j ], [c 2 3+ c j ], [c 2 c 3+j ], [c 2 3+ c 3+j ], for (, j) = (1, 2), (1, 3), (2, 3) and [c c j c ], [c 3+ c j c ], [c c 3+j c ],[c c j c 3+ ], [c 3+ c 3+j c ], [c 3+ c j c 3+ ], [c c 3+j c 3+ ], [c 3+ c 3+j c 3+ ], for (, j, ) = (1, 2, 3), (1, 3, 2). These corresponds to the classes of cycles [e +1 e +2 j ], [e 1 e 2 j], [e +1 e 2 j ], [e 1 for (, j) = (1, 2), (1, 3), (2, 3) and [e +1 e +1 [e 1 e 1 j e +1 ], [e 1 e +1 j e 1 ],[e+1 e 1 j e 2 j ], [e +2 e +1 j ], [e 2 e +1 j ], [e +2 j e +1 ], [e 1 e +1 j e +1 ], [e+1 e 1 j e +1 e 1 ], [e 1 e 1 j e 1 e 1 j ], [e 2 e 1 j ], ],[e+1 e +1 j e 1 ], ], for (, j, ) = (1, 2, 3), (1, 3, 2). Example 4. For the graph G 2 assgn to the three orented edges e 1, e 2, e 3 the colors c 1, c 2, c 3, respectvely. The graph s bpartte so only paths of even length are possble. The number of nequvalent nonperodc colorngs nduced by the nonperodc 14
15 cycles of length s gven by Ω(, T G2 ) = 1 µ(g)t rt g G 2 (5.1) For = 2, Ω(2, T G2 ) = 6. The classes are [e 1 e 1 2 ], [e 1 1 e 2 ], [e 1 e 1 3 ], [e 1 1 e 3 ], [e 2 e 1 3 ], [e 1 2 e 3 ]. The nduced colorngs are [c 1 c 5 ], [c 4, c 2 ], [c 1 c 6 ], [c 4 c 3 ], [c 2 c 6 ], [c 5 c 3 ]. For The paths are [e 1 e 1 2 e 3 e 1 2 ], [e 1 e 1 2 e 1 e 1 3 ], [e 1 e 1 3 e 2 e 1 3 ], 2 e 3 ]. To these classes correspond the colorngs [c 1 c 5 c 3 c 5 ], [c 1 c 5 c 1 c 6 ], [c 1 c 6 c 2 c 6 ], [c 4 c 2 c 4 c 3 ], [c 4 c 2 c 6 c 2 ], [c 4 c 3 c 5 c 3 ]. The graph has no loops so strngs of two or more beads wth a same color s not possble. = 4, Ω(4, T G2 ) = 6. [e 1 1 e 2 e 1 1 e 3 ], [e 1 1 e 2 e 1 3 e 2 ], [e 1 1 e 3 e 1 Acnowledgements. I would le to than Prof. C. Storm (Adelph Unversty, USA) for sendng me hs jont paper wth G. Scott on the coeffcents of Ihara zeta functon. Also, many thans to Prof. Asterode Santana for hs help wth the fgures, latex commands and determnants. References [1] G. A. T. F. da Costa, J. Varane, Feynman dentty: a specal case revsted, Letters n Math. Phys. 73 (2005), [2] S.-J. Kang, M.-H. Km, Free Le algebras, generalzed Wtt formula, and the denomnator dentty, J. Algebra, 183 (1996) [3] S.-J. Kang, M.-H. Km, Dmenson Formula for Graded Le Algebras and ts Applcatons, Trans. Amer. Math. Soc. 351 (1999), [4] S.-J. Kang, Graded Le Superalgebras and the Superdmenson Formula, J. Algebra, 204 (1998) [5] P. Moree, The formal seres Wtt transform, Dscrete Math. 295 (2005), [6] J. P. Serre, Le Algebras and Le Groups, Benjamn, ew Yor, [7] S. Sherman, Combnatoral aspects of the Isng model for ferromagnetsm.ii. An analogue to the Wtt dentty, Bull. Am. Math. Soc. 68 (1962), [8] H. M. Star, A. A. Terras, Zeta Functons of Fnte Graphs and Coverngs, Adv. Math. 121, (1996). [9] A. A. Terras, What are prmes n graphs and how many of them have a gven length?, U.C.S.D. Math. Club, Oct. 30, Avalable at aterras/what are prmes n graphs and how many.pdf 15
16 [10] G. Scott, C. Storm, The coeffcents of Ihara zeta functon, Involve (2008), [11] L. Carltz, An arthmetc functon, Bull. Amer. Math. Soc. 43(1937) [12]. Metropols, Gan-Carlo Rota, Wtt vectors and the algebra of neclaces, Adv. Math. 50 (1983)
Zeta function of a graph revisited
Trabalho apresentado no CMAC-Sul, Curitiba-PR, 2014. Zeta function of a graph revisited G.A.T. F. da Costa Departamentode Matemática Universidade Federal de Santa Catarina 88040-900-Florianópolis-SC-Brasil
More informationCounting Cycles in Strongly Connected Graphs
Proceeding Series of the Brazilian Society of Applied and Computational Mathematics, Vol. 3,., 205. Trabalho apresentado no XXXV CMAC, atal-r, 204. Counting Cycles in Strongly Connected Graphs G. A. T.
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationStatistical Mechanics and Combinatorics : Lecture III
Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex
More informationA summation on Bernoulli numbers
Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationAPPENDIX 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 informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More information1 Generating functions, continued
Generatng functons, contnued. Exponental generatng functons and set-parttons At ths pont, we ve come up wth good generatng-functon dscussons based on 3 of the 4 rows of our twelvefold way. Wll our nteger-partton
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationGELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n
GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationShort running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI
Short runnng ttle: A generatng functon approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI JASON FULMAN Abstract. A recent paper of Church, Ellenberg,
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationh-analogue of Fibonacci Numbers
h-analogue of Fbonacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Benaoum Prnce Mohammad Unversty, Al-Khobar 395, Saud Araba Abstract In ths paper, we ntroduce the h-analogue of Fbonacc numbers for
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationChowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions
Proc. Int. Conf. Number Theory and Dscrete Geometry No. 4, 2007, pp. 7 79. Chowla s Problem on the Non-Vanshng of Certan Infnte Seres and Related Questons N. Saradha School of Mathematcs, Tata Insttute
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationThis model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:
1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationZhi-Wei Sun (Nanjing)
Acta Arth. 1262007, no. 4, 387 398. COMBINATORIAL CONGRUENCES AND STIRLING NUMBERS Zh-We Sun Nanng Abstract. In ths paper we obtan some sophstcated combnatoral congruences nvolvng bnomal coeffcents and
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More information7. Products and matrix elements
7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationPRIMES 2015 reading project: Problem set #3
PRIMES 2015 readng project: Problem set #3 page 1 PRIMES 2015 readng project: Problem set #3 posted 31 May 2015, to be submtted around 15 June 2015 Darj Grnberg The purpose of ths problem set s to replace
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationOn the partial orthogonality of faithful characters. Gregory M. Constantine 1,2
On the partal orthogonalty of fathful characters by Gregory M. Constantne 1,2 ABSTRACT For conjugacy classes C and D we obtan an expresson for χ(c) χ(d), where the sum extends only over the fathful rreducble
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationCOMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX
COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A MATRIX J Mc Laughln 1 Mathematcs Department Trnty College 300 Summt Street, Hartford, CT 06106-3100 amesmclaughln@trncolledu Receved:, Accepted:,
More informationMixed-integer vertex covers on bipartite graphs
Mxed-nteger vertex covers on bpartte graphs Mchele Confort, Bert Gerards, Gacomo Zambell November, 2006 Abstract Let A be the edge-node ncdence matrx of a bpartte graph G = (U, V ; E), I be a subset the
More informationSpectral graph theory: Applications of Courant-Fischer
Spectral graph theory: Applcatons of Courant-Fscher Steve Butler September 2006 Abstract In ths second talk we wll ntroduce the Raylegh quotent and the Courant- Fscher Theorem and gve some applcatons for
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationMULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6
MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6 In these notes we offer a rewrte of Andrews Chapter 6. Our am s to replace some of the messer arguments n Andrews. To acheve ths, we need to change
More informationGeorgia Tech PHYS 6124 Mathematical Methods of Physics I
Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationProf. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model
EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several
More informationHyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix
6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More information1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:
68A Solutons to Exercses March 05 (a) Usng a Taylor expanson, and notng that n 0 for all n >, ( + ) ( + ( ) + ) We can t nvert / because there s no Taylor expanson around 0 Lets try to calculate the nverse
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationThe Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices
Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More information