Lecture hall partitions and the wreath products C k S n

Size: px
Start display at page:

Download "Lecture hall partitions and the wreath products C k S n"

Transcription

1 Lecture hall partitios ad the wreath products C k S Thomas W. Pesyl ad Carla D. Savage Departmet of Computer Sciece, North Carolia State Uiversity Raleigh, NC , USA twpesyl@csu.edu ad savage@csu.edu submitted: Jauary 31, 2012; revised: December 12, 2012; February 26, 2013 Abstract It is show that statistics o the wreath product groups, C k S, ca be iterpreted i terms of atural statistics o lecture hall partitios. Lecture hall theory is applied to prove distributio results for statistics o C k S. Fially, some ew statistics o C k S are itroduced, ispired by lecture hall theory, ad their distributios are derived. 1 Itroductio The purpose of this ote is to show that statistics o the wreath product C k S of a cyclic group C k, of order k, ad the symmetric group S, ca be iterpreted i terms of atural statistics o lecture hall partitios. We demostrate that lecture hall theory ca be used to prove results about the distributio of statistics o C k S. We itroduce some ew statistics o C k S, ispired by lecture hall partitios, icludig a quadratic versio of flag-major idex, ad prove distributio results for these statistics. The paper is orgaized as follows. I Sectio 2, we defie the s-lecture hall partitios ad state a few useful results. Sectio 3 is devoted to statistics of iterest o the wreath product groups ad a very brief discussio of what is kow. Sectio 4 itroduces s- iversio sequeces, which will be used to relate statistics o C k S to statistics o lecture hall partitios. Sectio 5 describes a bijectio betwee (k, 2k,..., k)-iversio sequeces ad C k S that allows statistics to be traslated from oe domai to aother. Sectio 6 reviews recet work of Savage-Schuster [13] relatig iversio sequeces to lecture hall partitios. This work was developed with the itetio of extedig work o permutatio statistics to a more geeral settig. 1

2 Sectio 7 is the heart of the paper. We prove there a theorem which allows us to apply the tools of Sectio 6 to C k S. This cotais our mai results relatig statistics such as descet, flag-major idex ad flag-iversio umber to statistics o lecture hall partitios, also provig a Euler-Mahoia distributio result. I Sectio 8 we defie a ew statistic lhall o C k S ad derive its surprisigly ice distributio. I Sectio 9, we are led to defie a distorted versio of the descet statistic o C k S, that reveals a eve closer coectio to lecture hall partitios. A few words about otatio: Z is the set of itegers, R the set of real umbers, S the set of permutatios of elemets; [ j ] {1, 2,..., j}, where [ 0 ] ; [ ] q (1 q )/(1 q); ad for x (x 1, x 2,..., x ), x x 1 + x x. 2 Lecture hall partitios For a sequece s {s i } i 1 of positive itegers, the s-lecture hall partitios are the elemets of the set { L (s) λ Z λ 1 0 λ 2 λ }. s 1 s 2 s For example, (0, 1, 3, 4) L (1,2,3,4), but (0, 1, 3, 4) L (1,3,5,7), sice 3/5 > 4/7. The origial lecture hall partitios L L (1,2,...,) ad Eriksso i [3], where they showed that λ L y λ were itroduced by Bousquet-Mélou 1. (1) 1 y2i 1 I [4] they proved the followig refiemet, which will be useful i the preset work. Theorem 1. The Refied Lecture Hall Theorem [4]: For ay oegative iteger, λ L q λ y λ where λ ( λ 1 /1, λ 2 /2,..., λ / ). 1 + qy i 1 q 2, (2) y+i If the largest part i a lecture hall partitio i L is costraied, we have the followig. Theorem 2. [8, 13] For itegers 1 ad t 0, q λ [ t + 1 ] q. (3) λ L ; λ t 2

3 For example, whe 3 ad t 1, the set {λ L 3 λ 3 3} has the eight elemets: {(0, 0, 0), (0, 0, 1), (0, 0, 2), (0, 0, 3), (0, 1, 2), (0, 1, 3), (0, 2, 3), (1, 2, 3)} ad λ L 3 ; λ 3 3 q λ 1/1 + λ 2 /2 + λ 3 / q + 3q 2 + q 3 [ 2 ] 3 q. 3 Statistics o C k S A elemet π S is a bijectio π : [ ] [ ] ad we write π (π 1,..., π ), to mea that π(i) π i. A descet i π S is a positio i [ 1 ] such that π i > π i+1. The set of all descets of π is Des π ad des π Des π. The iversio umber of π is iv π {(i, j) 1 i < j ad π i > π j }. For example, if π (5, 4, 1, 3, 2), the Des π {1, 2, 4}, des π 3 ad iv π 8. For positive itegers k ad, we view C k S combiatorially as a set of pairs (π, σ): C k S {(π, σ) π S, σ {0, 1,..., k 1} }. We use the otatio π σ to deote (π, σ) ad write π σ (π σ 1 1, πσ 2 2,..., πσ ) ((π 1,..., π ), (σ 1,..., σ )) (π, σ). Statistics o C k S (or k-colored permutatios or k-idexed permutatios) have bee studied by may, startig with Reier s work o siged permutatios [12], followed by idepedet work of Breti [5] ad Steigrímsso [14] o the more geeral wreath products. Pairs of (descet, major idex) statistics have bee foud, satisfyig relatios like Carlitz s q-euleria polyomials, startig with work of Adi, Breti, ad Roichma [1]. There have very recetly bee may ew ad excitig discoveries, icludig [7, 10, 9, 2]. It is remarkable the may variatios i the defiitios of the statistics, eve whe they give the same distributio. We start with a fairly stadard defiitio of descet. The descet set of π σ C k S is Des π σ {i {0, 1,..., 1} σ i < σ i+1, or σ i σ i+1 ad π i > π i+1 }, (4) with the covetio that π 0 σ

4 We will cosider the followig statistics defied o C k S. des π σ Des π σ comaj π σ ( i) i Des π σ fmaj π σ k comaj π σ fiv π σ iv π + iσ i. As a example, for π σ (5 1, 4 1, 1 0, 3 0, 2 2 ) C 3 S 5, we have Des π σ {0, 1, 4}; des π σ 3; comaj π σ 10; fmaj π σ 26; ad fiv π σ 21. Note that this defiitio of fmaj differs a bit from those appearig elsewhere, eve amog those who defie the descet set as i (4) ([1, 7]). Usig lecture hall theory, we will show, amog other thigs: fmaj πσ fiv πσ, (5) π σ C k S q [ kt + 1 ] q xt t 0 λ L q λ x λ/(k) π σ C k S q σ i π σ C k S q fmaj πσ xdes πσ i0 (1, (6) xqki ) π σ C k S q fmaj πσ xdes πσ (1. (7) xqki ) Relatios of the form (6), for geeral k, have bee foud oly recetly, startig with Chow ad Masour [7] ad Hyatt [10], sometimes with slightly differet defiitios of Des or fmaj. Our itetio here is to highlight our methods, which are quite ovel, ad which allow us to prove ew results like (7). 4 Statistics o s-iversio sequeces The coectio betwee statistics o C k S ad statistics o lecture hall partitios will be made via statistics o iversio sequeces. Give a sequece s {s i } i 1 of positive itegers, ad positive iteger, the set I (s) s-iversio sequeces is defied by I (s) {(e 1,..., e ) Z 0 e i < s i for 1 i }. The familiar iversio sequeces associated with permutatios are the elemets of I (s) s (1, 2,..., ). 4 of for

5 The ascet set of a iversio sequece e I (s) Asc e { i {0, 1,..., 1} is the set e i s i < e i+1 s i+1 with the covetio that e 0 0. For example, as a elemet of I (3,6,9,12,15) 5, the iversio sequece e (1, 3, 2, 2, 13) has the ascet set Asc e {0, 1, 4}. The followig statistics o I (s) were defied i [13]: asc e Asc e, amaj e ( i), e i Asc e e i, lhp e e + i Asc e (s i s ). For e (1, 3, 2, 2, 13) I (3,6,9,12,15) 5, we have asc e 3; amaj e 10; e 21; ad lhp e 81. I this paper, our focus is the sequece s (k, 2k,..., k), where k is a positive iteger. Let I,k I (k,2k,...,k). We will require two ew statistics o I,k : N(e) j1 ej ; j Ifmaj e k amaj e N(e). For e (1, 3, 2, 2, 13) I (3,6,9,12,15) 5, N(e) 4 ad Ifmaj e 26. }, 5 From statistics o C k S to statistics o I,k We will make use of the followig bijectio betwee S ad I,1 which was proved i [13] to have the required properties. Lemma 1. For positive iteger, the mappig φ : S I,1 defied by φ(π) t (t 1, t 2,..., t ), where t i {j [i 1] π j > π i } is a bijectio satisfyig both Des π Asc t ad iv π t. For example, if π (5, 4, 1, 3, 2) the t φ(π) (0, 1, 2, 2, 3) I 5,1. statistics, Des π {1, 2, 4} Asc t ad iv π 8 t. Checkig the 5

6 Notig that, as sets, I,k ad C k S have the same cardiality, we set up a bijectio which traslates statistics from oe domai to the other i a useful way. Theorem 3. For each pair of itegers (, k) with 1, k 1, there is a bijectio Θ : C k S I,k with the followig properties. If Θ(π σ ) e (e 1,..., e ) the Proof. Defie Θ by Asc e Des π σ (8) N(e) σ i (9) Ifmaj e fmaj π σ (10) e (σ + 1) π (11) e iv π + iσ i fiv π σ. (12) e Θ(π σ 1 1, πσ 2 2,..., πσ ) (σ 1 + t 1, 2σ 2 + t 2,..., σ + t ), where (t 1, t 2,..., t ) φ(π), as i Lemma 1. For example, for π σ (5 1, 4 1, 1 0, 3 0, 2 2 ) C 3 S 5, t φ(5, 4, 1, 3, 2) (0, 1, 2, 2, 3), so we get e Θ(π σ ) (1, 3, 2, 2, 13). Note that properties (8) through (12) hold for this example: Asc e {0, 1, 4} Des π σ N(e) σ Ifmaj e 26 fmaj π σ e (σ 5 + 1) π 5 e 21 fiv π σ. Clearly, Θ(π σ ) I,k. Sice C k S ad I,k have the same cardiality, to show that Θ is a bijectio, it suffices to show that Θ is oto. Let e (e 1,..., e ) I,k. Defie σ (σ 1,... σ ) by σ i e i /i. The σ {0, 1,..., k 1}. Defie t (t 1,... t ) by t i e i iσ i. The t I,1. Fially, let π φ 1 (t) S. The π σ C k S ad Θ 1 (e) π σ. To prove properties (8) through (12), observe first that t π, so property (11) holds. It is clear from the defiitio of Θ that (12) is true. Also, ote that e i /i σ i sice 0 t i < i ad property (9) holds. So property (10) will follow oce we prove (8). By Lemma 1, sice t φ(π), we kow that Asc t Des π, so it remais to show Asc e Des π σ. 6

7 Note first that e 1 σ 1 + t 1 σ 1, sice t 1 0. So, 0 Des π σ σ 1 > 0 e 1 > 0 0 Asc e. For 1 i, i Asc e if ad oly if where 0 < e i+1 k(i + 1) e i ki So, i Asc e if ad oly if i > 0. If σ i σ i+1 the (i + 1)σ i+1 + t i+1 k(i + 1) iσ i + t i ki i(i + 1)(σ i+1 σ i ) + it i+1 (i + 1)t i ki(i + 1) i ki(i + 1), i i(i + 1)(σ i+1 σ i ) + it i+1 (i + 1)t i. i > 0 it i+1 (i + 1)t i > 0 i Asc t i Des π i Des π σ. For the remaiig cases, ote that sice 0 t i+1 i ad 0 t i i 1, i(i + 1)(σ i+1 σ i ) i i i(i + 1)(σ i+1 σ i ) + i 2. If σ i σ i+1, the i Des π σ if ad oly if σ i < σ i+1. But if σ i < σ i+1, the i i(i + 1) i i + 1 > 0, so i Asc e. Ad if σ i > σ i+1 the i i(i + 1) + i 2 i 0 ad i Asc e. This completes the proof. 6 Lecture hall polytopes ad s-iversio sequeces The s-lecture hall polytope was itroduced i [13], for a arbitrary sequece s {s i } i 1 of positive itegers, as { P (s) λ R λ 1 0 λ 2 λ } 1. s 1 s 2 s P (s) is a covex, simplicial polytope with the + 1 vertices: (0, 0,..., 0), (s 1, s 2,..., s ), (0, s 2,..., s ), (0, 0, s 3,..., s ),..., (0, 0,..., 0, s ), 7

8 all with iteger coordiates. The t-th dilatio of P (s) is the polytope { tp (s) λ R λ 1 0 λ 2 λ } t. s 1 s 2 s A multivariate fuctio, f (s) (t; q, y, z), was used i [13] to eumerate lattice poits i tp (s) accordig to statistics sigificat i the theory of lecture hall partitios: where λ s ɛ + (λ) f (s) (t; q, y, z), s 1 ( λ1 s 1 s 1 ( λ1 λ2 s 2,..., q λ tp (s) Z λ s λ 1, s 2 λ2 s 2 λ s y λ z ɛ+ (λ), ), (13) ) λ λ 2,..., s λ. (14) s The followig theorems show the coectio betwee statistics o s-iversio sequeces ad statistics o s-lecture hall partitios. Theorem 4. ([13]) For ay sequece s of positive itegers, ad ay positive iteger, f (s) (t; q, y, z) x t e I (s) x asc e q amaj e y lhp e z e i0 (1 xq i y s i+1+ +s ). (15) t 0 Theorem 5. ([13]) For ay sequece s of positive itegers, ad ay positive iteger, q λ s y λ z ɛ+ (λ) x λ/s e I (s) x asc e q amaj e y lhp e z e 1 i0 (1 xq i y s i+1+ +s ). (16) λ L (s) 7 Lecture hall partitios ad the iversio sequeces I,k I order to apply the results of the previous sectio to the problem of iterest, we eed a aalog of Ifmaj o I,k for lecture hall partitios. First observe that the followig sets of lecture hall partitios are all the same: L L (1,2,...,) L (2,4,...,2) L (3,6,...,3).... However, the lecture hall polytopes P,k defied by { P,k λ R λ 1 0 k λ 2 2k λ } k 1 8

9 are differet for differet k. O the other had, the followig dilatios are the same a fact we will exploit. Furthermore, t P,k kt P,1, (17) kt P,1 Z {λ L λ kt}. Sice the defiitios (13) ad (14) deped o the sequece s (k, 2k,..., k), we will make the depedece explicit i the otatio. For λ L ad k 1, let: ( ) λ1 λ2 λ λ k,,..., ; (18) k 2k k ) ɛ + k (k (λ) λ1 λ2 λ λ 1, 2k λ 2,..., k λ ; (19) k 2k k Note: for λ L, η k (λ) k λ k λ. (20) where λ was defied i Theorem 1. λ 1 λ, We ow show that the ew statistic η k o L correspods to the statistic N o I,k. Theorem 6. For positive itegers, k, let f,k (t; q, y, z, w) q λ k y λ z + ɛk (λ) w η k(λ). (21) Z The f,k (t; q, y, z, w) x t t 0 λ tp,k e I,k x asc e q amaj e y lhp e z e w N(e) i0 (1 xq i y k((+1) i(i+1))/2 ). (22) Proof. If w 1, this is just the case s (k, 2k,..., k) of Theorem 4. To iclude w, we appeal to the combiatorial proof of (15) i Theorem 4 that was preseted i [13]. I that proof, λ (tp,k Z ) is associated with the iversio sequece ɛ + k (λ), which, by defiitio, is i I,k. It suffices to check that η k (λ) N(ɛ + k (λ)): ik N(ɛ + k (λ)) λi /(ik) λ i i k λ i /(ik) λ i /i (k λ i /(ik) λ i /i ) k λ k λ 1 η k (λ). 9

10 The Ifmaj statistic is obtaied by settig q q k ad w q 1 i Theorem 6. Corollary 1. For positive itegers, k, t 0 q λ y λ z + ɛk (λ) x t λ ktp,1 Z e I,k x asc e q Ifmaj e y lhp e z e i0 (1 xqk( i) y k((+1) i(i+1))/2 ). (23) Proof. With q q k ad w q 1, the umerator i the right-had side of (22) becomes x asc e q k amaj e N(e) y lhp e z e x asc e q Ifmaj e y lhp e z e. From (21), the left-had side summad of (22) becomes by (18)-(20) ad by (17). f,k (t; q k, y, z, q 1 ) Corollary 2. For positive itegers, k, q k λ k ηk(λ) y λ z ɛ λ tp,k Z q λ y λ z + ɛk (λ) λ ktp,1 Z + k (λ) q λ y λ z + ɛk (λ) x λ/(k) λ L e I,k x asc e q Ifmaj e y lhp e z e 1 i0 (1 xqk( i) y k((+1) i(i+1))/2 ). (24) Proof. For t > 0, let H(t) λ ktp,1 Z q λ 1 y λ z ɛ+ k (λ) from (23), with H(0) 1. The for t > 0, sice { } { } { } λ λ λ λ L ; t λ L ; t λ L ; t 1 k k k (ktp,1 Z ) (k(t 1)P,1 Z ), 10

11 we have λ L q λ y λ z ɛ + k (λ) x λ/(k) t 0 x t λ L ; λ k t q λ y λ z ɛ+ k (λ) 1 + (H(t) H(t 1))x t t t 1 H(t)x t t 1 H(t 1)x t t 0 H(t)x t x t 0 H(t)x t (1 x) t 0 H(t)x t. But t 0 H(t)xt is the left-had side of (23), so we simply multiply the right-had side of (23) by (1 x) to complete the proof. We ca ow apply these results to the wreath product groups. expected result that the pair (des, fmaj ) is Euler-Mahoia. First, we have the Theorem 7. For positive itegers, k, [ kt + 1 ] q xt t 0 π σ C k S q fmaj πσ xdes πσ i0 (1. xqki ) Proof. Set y z 1 i (23). O the left-had side, i the summad, we get λ ktp,1 Z q λ. Sice kt P,1 Z {λ L λ kt}, by Theorem 2, For the right-had side, we get λ ktp,1 Z q λ [ kt + 1 ] q. e I,k x asc e q Ifmaj e i0 (1 xqk( i) ). Reidex the product i the deomiator ad for the umerator, use the fact that by Theorem 3, the distributio of (des, fmaj ) o C k S is the same as the distributio of (asc, Ifmaj ) o I,k. 11

12 Now, to iterpret the distributio (des, fmaj, fiv ) o C k S i terms of lecture hall partitios, set y 1 i (24) ad use Theorem 3. Theorem 8. For positive itegers, k, q λ z + ɛk (λ) x λ/(k) λ L π σ C k S q fmaj πσ x des πσ zfiv πσ (1. xqki ) The implicatio of Theorem 8 for z 1 is quite iterestig. We have π q λ x λ/(k) σ C k S q fmaj πσ xdes πσ λ L (1. (25) xqki ) I the left-had side of (25), the oly depedece o k is i the expoet of x, i a statistic ivolvig oly the last part of λ. We take this further i Sectio 9. 8 A lecture hall statistic o C k S From the poit of view of partitio theory, the most importat statistic for a lecture hall partitio λ is the umber λ λ 1 + +λ beig partitioed. So, what does λ correspod to o C k S? I [6], a quadratic versio of the major idex was defied o S by bi π i Des π I that spirit, we defie cobi o C k S by cobi π σ (( ) ( )) + 1 i i Des π σ Now defie the statistic lhall o C k S by lhall π σ k cobi π σ fiv π σ. ( i+1 ) 2. Observe that uder the bijectio Θ of Theorem 3, if e Θ(π σ ) the lhall π σ lhp e. This ca be see as follows, sice e fiv π σ ad Asc e Des e: lhp e e + (k(i + 1) + + k) i Asc e e + k (( ) ( )) + 1 i i Asc e fiv π σ + k (( ) ( )) + 1 i i Des e fiv π σ + kcobi π σ lhall π σ. The joit distributio of (lhall, fmaj ) o C k S has the followig form. 12

13 Theorem 9. For positive itegers, k, lhall πσ y π σ C k S q fmaj πσ (1 + qy i )(1 q k(+1 i) y k(i+ +) /2 1 q 2 y +i [ k(2i 1) ] qy +1 i /2 ([ 2 ] qy i [ ki ] q 2 y 2( i)+1) Proof. Uder the bijectio Θ of Theorem 3, if e Θ(π σ ) the lhall π σ lhp e ad fmaj π σ Ifmaj e. So, lhall πσ q fmaj πσ y lhp e q Ifmaj e. e I,k π σ C k S y So, by Corollary 2 with x z 1. π σ C k S y lhall πσ qfmaj πσ 1 i0 (1 qk( i) y k((+1) i(i+1))/2 ) Now apply Theorem 1 to get So, lhall πσ y π σ C k S π σ C k S y lhall πσ qfmaj πσ 1 i0 (1 qk( i) y k((+1) i(i+1))/2 ) q fmaj πσ which, after simplificatio, gives the theorem. Settig y 1 i Theorem 9 ad simplifyig, we get e I,k y lhp e q Ifmaj e 1 i0 (1 qk( i) y k((+1) i(i+1))/2 ) λ L y λ q λ. 1 + qy i 1 q 2 y +i. (1 q k( i+1) y k((+1) i(i+1))/2 1 + qy i ) 1 q 2 y +i, fmaj πσ q π σ C k S [ ki ] q, the same distributio as fiv, Ifmaj, ad e, as expected. But the statistic lhall itself also has a surprisigly simple distributio: Theorem 10. For positive itegers, k, lhall πσ q π σ C k S [ ki ] q 2( i)+1. 13

14 Proof. Set q 1 ad y q i the proof of the Theorem 9, but apply (1) istead of (2) to get: e I (1,2,...,) q lhp e /2 1 q k(i+ +) 1 q 2i 1 1 q k(2i 1)( i+1) 1 q 2i 1 [ ki ] q 2( i)+1. /2 1 q ki(2( i)+1) 1 q 2( i)+1 9 Iflated Euleria polyomials for C k S We showed i [11] how to obtai more refied iformatio about the s-lecture hall partitios by cosiderig the ratioal lecture hall polytope R (s) : { R (s) λ R λ 1 0 λ 2 λ } ad λ 1. s 1 s 2 s R (s) is a covex simplicial polytope, whose vertices are ( s1, s 2,..., s ) (, 0, s 2,..., s ), s s s s s (0, 0,..., 0), ( 0, 0, s 3 s,..., s s ) (,..., 0, 0,..., 0, s ), s with ratioal (but ot ecessarily iteger) coordiates. Let g (s) λ (t; q, y, z) k y λ z ɛ+ k (λ). (26) q λ tr (s) Z The followig theorems were proved i [11]. These are aalogs of Theorems 4 ad 5. Theorem 11. ([11]) For ay sequece s of positive itegers, ad positive iteger, g (s) (t; q, y, z)x t e I (s) q amaj e y lhp e z e xsasc e e (1 x) 1 i0 (1 xs q i y s i+1+ +s ). t 0 Theorem 12. ([11]) For ay sequece s of positive itegers, ad positive iteger, q λ k y λ z ɛ+ k (λ) x λ e I (s) q amaj e y lhp e z e xsasc e e 1 i0 (1. xs q i y s i+1+ +s ) λ L (s) 14

15 We ca specialize Theorems 11 ad 12 to s (k, 2k,..., k) ad modify to track Ifmaj as i Theorem 6 ad its corollaries. We should expect somethig iterestig because R (1,2,...,) R (2,4,...,2) R (3,6,...,3).... We get the followig theorem, which is a aalog of Theorem 6. aalogous to that of Theorem 6, is omitted. The proof, which is Theorem 13. For positive itegers, k, let g,k (t; q, y, z, w) q λ k y λ z + ɛk (λ) w η k(λ). (27) λ tr Z The g,k (t; q, y, z, w) x t t 0 e I,k x kasc e e q amaj e y lhp e z e w N(e) (1 x) 1 i0 (1 xk q i y k((+1) i(i+1))/2 ). (28) The followig corollaries of Theorem 13 are aalogs of Corollaries 1 ad 2 with y z 1. Note that i the right-had sides of the equatios there is o depedece o k. Corollary 3. For positive itegers, k, t 0 λ tr Z q λ x t e I,k x kasc e e q Ifmaj e (1 x) 1 i0 (1 xk q k( i) ). Corollary 4. For positive itegers, k, λ L q λ x λ e I,k x kasc e e q Ifmaj e 1 i0 (1. xk q k( i) ) Makig use of Theorem 3 givig the correspodece betwee statistics o I,k ad o C k S, we have the followig aalogs of Theorems 7 ad 8. First, We eed a result from [8]: Lemma 2. ([8]) For itegers t 0 ad > 0, let j ad i be the uique itegers satisfyig t j + i where j 0 ad 0 i <. The [ j + 1 ] i q [ j + 2 ] i q. λ tr Z q λ 15

16 Theorem 14. For positive itegers, k, 1 [ j + 1 ] i q [ j + 2 ] i q xj+i j 0 i0 π σ C k S q fmaj πσ x (k des πσ 1 σ )+π (1 x) (1 xk q ki. ) Proof. By Lemma 2, 1 [ j + 1 ] i q j 0 i0 [ j + 2 ] i q xj+i j 0 1 i0 λ (j+i)r Z q λ x j+i. Sice every t 0 ca be writte uiquely as t j + i for oegative itegers j ad i with i <, the last expressio ca be rewritte as q λ x t, t 0 λ tr Z which, by Corollary 3, is equal to e I,k x kasc e e q Ifmaj e i0 (1 xk q k( i). ) Uder the bijectio Θ of Theorem 3, if e Θ(π σ ) the Ifmaj e fmaj π σ, asc e des π σ, ad e (σ + 1) π. The result follows the, sice k asc e e k des π σ (σ + 1) + π. Theorem 15. For ay positive itegers, k, q λ x λ π σ C k S q fmaj πσ x (k des πσ 1 σ )+π λ L (1 xk q ki. ) Proof. Start from Corollary 4 ad apply Theorem 3. (Note: There is o depedece o k i the left-had side). Let Q,k (x) be the q 1 specializatio: Q,k (x) x (k des πσ 1 σ)+π. π σ C k S The Q,k (x) are referred to as iflated Euleria polyomials i [11]. For cotrast the usual, Euleria polyomials for C k S are E,k (x) des πσ. π σ C k S x It is iterestig that Q,k (x) is self-reciprocal, but i geeral E,k (x) is ot whe k > 2. 16

17 10 Cocludig remarks It is iterestig from the results i Sectios 7-9 that for fixed, statistics o C k S such as descet, flag-major idex, ad flag-iversio umber appear aturally i the geometry of the same simplicial coe, R, idepedet of k. It would be iterestig to see to what extet other statistics o C k S ca be iterpreted i terms of lecture hall partitios. Differet orderigs o C k S ad differet bijectios C k S I,k would give differet results. Lecture hall partitios were discovered i the settig of affie Coxeter groups, ad Theorem 1 was ispired by Bott s formula. It should be possible to trace through backwards to discover the algebraic sigificace of the statistic lhall, at least i the Coxeter groups A C 1 S or B C 2 S but we have ot see how to do this. Ackowledgemets. The secod author would like to thak Matthias Beck, Bejami Brau, ad Mattias Koeppe for discussios o Ehrhart theory ad siged permutatios. Thaks also to the America Istitute of Mathematics where some of those discussios were hosted. We are grateful to the referee for a careful readig of the mauscript ad for may helpful suggestios to improve the presetatio. Refereces [1] Ro M. Adi, Fracesco Breti, ad Yuval Roichma. Descet umbers ad major idices for the hyperoctahedral group. Adv. i Appl. Math., 27(2-3): , Special issue i hoor of Domiique Foata s 65th birthday (Philadelphia, PA, 2000). [2] Riccardo Biagioli ad Jiag Zeg. Eumeratig wreath products via Garsia-Gessel bijectios. Europea J. Combi., 32(4): , [3] Mireille Bousquet-Mélou ad Kimmo Eriksso. Lecture hall partitios. Ramauja J., 1(1): , [4] Mireille Bousquet-Mélou ad Kimmo Eriksso. A refiemet of the lecture hall theorem. J. Combi. Theory Ser. A, 86(1):63 84, [5] Fracesco Breti. q-euleria polyomials arisig from Coxeter groups. Eur. J. Comb., 15: , September [6] Katie L. Bright ad Carla D. Savage. The geometry of lecture hall partitios ad quadratic permutatio statistics. DMTCS Proceedigs, 22d Iteratioal Coferece o Formal Power Series ad Algebraic Combiatorics (FPSAC 2010), Sa Fracisco, (AN):569,580,

18 [7] Chak-O Chow ad Toufik Masour. A Carlitz idetity for the wreath product C r S. Adv. i Appl. Math., 47(2): , [8] Sylvie Corteel, Suyoug Lee, ad Carla D. Savage. Eumeratio of sequeces costraied by the ratio of cosecutive parts. Sém. Lothar. Combi., 54A:Art. B54Aa, 12 pp. (electroic), 2005/07. [9] Hilario L. M. Faliharimalala ad Arthur Radriaarivoy. Flag-major idex ad flagiversio umber o colored words ad wreath product. Sém. Lothar. Combi., 62:Art. B62c, 10, 2009/10. [10] Matthew Hyatt. Quasisymmetric fuctios ad permutatio statistics for Coxeter groups ad wreath product groups Ph.D. Thesis, Uiversity of Miami. [11] Thomas W. Pesyl ad Carla D. Savage. Ratioal lecture hall polytopes ad iflated Euleria polyomials. Ramauja J., DOI: /s , to appear. [12] Victor Reier. Siged permutatio statistics. Europea J. Combi., 14(6): , [13] Carla D. Savage ad Michael J. Schuster. Ehrhart series of lecture hall polytopes ad Euleria polyomials for iversio sequeces. J. Combi. Theory Ser. A, 119: , [14] Eiar Steigrímsso. Permutatio statistics of idexed permutatios. Europea J. Combi., 15(2): ,

ANTI-LECTURE HALL COMPOSITIONS AND ANDREWS GENERALIZATION OF THE WATSON-WHIPPLE TRANSFORMATION

ANTI-LECTURE HALL COMPOSITIONS AND ANDREWS GENERALIZATION OF THE WATSON-WHIPPLE TRANSFORMATION ANTI-LECTURE HALL COMPOSITIONS AND ANDREWS GENERALIZATION OF THE WATSON-WHIPPLE TRANSFORMATION SYLVIE CORTEEL, JEREMY LOVEJOY AND CARLA SAVAGE Abstract. For fixed ad k, we fid a three-variable geeratig

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity

More information

A symmetrical Eulerian identity

A symmetrical Eulerian identity Joural of Combiatorics Volume 17, Number 1, 29 38, 2010 A symmetrical Euleria idetity Fa Chug, Ro Graham ad Do Kuth We give three proofs for the followig symmetrical idetity ivolvig biomial coefficiets

More information

SOME TRIBONACCI IDENTITIES

SOME TRIBONACCI IDENTITIES Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

Lecture Hall Sequences, q-series, and Asymmetric Partition Identities

Lecture Hall Sequences, q-series, and Asymmetric Partition Identities Georgia Souther Uiversity Digital Commos@Georgia Souther Mathematical Scieces Faculty Publicatios Mathematical Scieces, Departmet of 3-2-202 Lecture Hall Sequeces, q-series, ad Asymmetric Partitio Idetities

More information

Course : Algebraic Combinatorics

Course : Algebraic Combinatorics Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,

More information

Sequences of Definite Integrals, Factorials and Double Factorials

Sequences of Definite Integrals, Factorials and Double Factorials 47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology

More information

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

A Note on the Symmetric Powers of the Standard Representation of S n

A Note on the Symmetric Powers of the Standard Representation of S n A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) = COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.

More information

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

More information

The r-generalized Fibonacci Numbers and Polynomial Coefficients

The r-generalized Fibonacci Numbers and Polynomial Coefficients It. J. Cotemp. Math. Scieces, Vol. 3, 2008, o. 24, 1157-1163 The r-geeralized Fiboacci Numbers ad Polyomial Coefficiets Matthias Schork Camillo-Sitte-Weg 25 60488 Frakfurt, Germay mschork@member.ams.org,

More information

Entropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP

Entropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

The log-behavior of n p(n) and n p(n)/n

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

ON THE DESCENT NUMBERS AND MAJOR INDICES FOR THE HYPEROCTAHEDRAL GROUP

ON THE DESCENT NUMBERS AND MAJOR INDICES FOR THE HYPEROCTAHEDRAL GROUP ON THE DESCENT NUMBERS AND MAJOR INDICES FOR THE HYPEROCTAHEDRAL GROUP CHAK-ON CHOW AND IRA M. GESSEL Abstract. Adi, Breti, ad Roichma [Adv. i Appl. Math. 27 (2001), 210 224], i aswerig a questio posed

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

David Vella, Skidmore College.

David Vella, Skidmore College. David Vella, Skidmore College dvella@skidmore.edu Geeratig Fuctios ad Expoetial Geeratig Fuctios Give a sequece {a } we ca associate to it two fuctios determied by power series: Its (ordiary) geeratig

More information

An enumeration of flags in finite vector spaces

An enumeration of flags in finite vector spaces A eumeratio of flags i fiite vector spaces C Rya Viroot Departmet of Mathematics College of William ad Mary P O Box 8795 Williamsburg VA 23187 viroot@mathwmedu Submitted: Feb 2 2012; Accepted: Ju 27 2012;

More information

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Legendre-Stirling Permutations

Legendre-Stirling Permutations Legedre-Stirlig Permutatios Eric S. Egge Departmet of Mathematics Carleto College Northfield, MN 07 USA eegge@carleto.edu Abstract We first give a combiatorial iterpretatio of Everitt, Littlejoh, ad Wellma

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

CLOSED FORM FORMULA FOR THE NUMBER OF RESTRICTED COMPOSITIONS

CLOSED FORM FORMULA FOR THE NUMBER OF RESTRICTED COMPOSITIONS Submitted to the Bulleti of the Australia Mathematical Society doi:10.1017/s... CLOSED FORM FORMULA FOR THE NUMBER OF RESTRICTED COMPOSITIONS GAŠPER JAKLIČ, VITO VITRIH ad EMIL ŽAGAR Abstract I this paper,

More information

arxiv: v1 [math.co] 23 Mar 2016

arxiv: v1 [math.co] 23 Mar 2016 The umber of direct-sum decompositios of a fiite vector space arxiv:603.0769v [math.co] 23 Mar 206 David Ellerma Uiversity of Califoria at Riverside August 3, 208 Abstract The theory of q-aalogs develops

More information

On a general q-identity

On a general q-identity O a geeral -idetity Aimi Xu Istitute of Mathematics Zheiag Wali Uiversity Nigbo 3500, Chia xuaimi009@hotmailcom; xuaimi@zwueduc Submitted: Dec 2, 203; Accepted: Apr 24, 204; Published: May 9, 204 Mathematics

More information

Central limit theorem and almost sure central limit theorem for the product of some partial sums

Central limit theorem and almost sure central limit theorem for the product of some partial sums Proc. Idia Acad. Sci. Math. Sci. Vol. 8, No. 2, May 2008, pp. 289 294. Prited i Idia Cetral it theorem ad almost sure cetral it theorem for the product of some partial sums YU MIAO College of Mathematics

More information

Enumerative & Asymptotic Combinatorics

Enumerative & Asymptotic Combinatorics C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,

More information

Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients

Proof of a conjecture of Amdeberhan and Moll on a divisibility property of binomial coefficients Proof of a cojecture of Amdeberha ad Moll o a divisibility property of biomial coefficiets Qua-Hui Yag School of Mathematics ad Statistics Najig Uiversity of Iformatio Sciece ad Techology Najig, PR Chia

More information

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

More information

Polynomial identity testing and global minimum cut

Polynomial identity testing and global minimum cut CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION J Korea Math Soc 44 (2007), No 2, pp 487 498 GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION Gi-Sag Cheo ad Moawwad E A El-Miawy Reprited from the Joural of the Korea Mathematical

More information

Factors of alternating sums of products of binomial and q-binomial coefficients

Factors of alternating sums of products of binomial and q-binomial coefficients ACTA ARITHMETICA 1271 (2007 Factors of alteratig sums of products of biomial ad q-biomial coefficiets by Victor J W Guo (Shaghai Frédéric Jouhet (Lyo ad Jiag Zeg (Lyo 1 Itroductio I 1998 Cali [4 proved

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

Week 5-6: The Binomial Coefficients

Week 5-6: The Binomial Coefficients Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers

More information

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV

More information

Math 475, Problem Set #12: Answers

Math 475, Problem Set #12: Answers Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe

More information

Matrix representations of Fibonacci-like sequences

Matrix representations of Fibonacci-like sequences NTMSCI 6, No. 4, 03-0 08 03 New Treds i Mathematical Scieces http://dx.doi.org/0.085/tmsci.09.33 Matrix represetatios of Fiboacci-like sequeces Yasemi Tasyurdu Departmet of Mathematics, Faculty of Sciece

More information

Some remarks for codes and lattices over imaginary quadratic

Some remarks for codes and lattices over imaginary quadratic Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract

More information

1 Generating functions for balls in boxes

1 Generating functions for balls in boxes Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

Asymptotic distribution of products of sums of independent random variables

Asymptotic distribution of products of sums of independent random variables Proc. Idia Acad. Sci. Math. Sci. Vol. 3, No., May 03, pp. 83 9. c Idia Academy of Scieces Asymptotic distributio of products of sums of idepedet radom variables YANLING WANG, SUXIA YAO ad HONGXIA DU ollege

More information

The Choquet Integral with Respect to Fuzzy-Valued Set Functions

The Choquet Integral with Respect to Fuzzy-Valued Set Functions The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i

More information

On q-analogs of recursions for the number of involutions and prime order elements in symmetric groups

On q-analogs of recursions for the number of involutions and prime order elements in symmetric groups O -aalogs of recursios for the umber of ivolutios ad prime order elemets i symmetric groups Max B Kutler ad C Rya Viroot Abstract The umber of elemets which suare to the idetity i the symmetric group S

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

ON POINTWISE BINOMIAL APPROXIMATION

ON POINTWISE BINOMIAL APPROXIMATION Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece

More information

An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions

An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions A Asymptotic Expasio for the Number of Permutatios with a Certai Number of Iversios Lae Clark Departmet of Mathematics Souther Illiois Uiversity Carbodale Carbodale, IL 691-448 USA lclark@math.siu.edu

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

~W I F

~W I F A FIBONACCI PROPERTY OF WYTHOFF PAIRS ROBERT SILBER North Carolia State Uiversity, Raleigh, North Carolia 27607 I this paper we poit out aother of those fasciatig "coicideces" which are so characteristically

More information

EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES

EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES LE MATEMATICHE Vol. LXXIII 208 Fasc. I, pp. 3 24 doi: 0.448/208.73.. EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES THOMAS ERNST We preset idetities of various kids for

More information

Counting Well-Formed Parenthesizations Easily

Counting Well-Formed Parenthesizations Easily Coutig Well-Formed Parethesizatios Easily Pekka Kilpeläie Uiversity of Easter Filad School of Computig, Kuopio August 20, 2014 Abstract It is well kow that there is a oe-to-oe correspodece betwee ordered

More information

Appendix to Quicksort Asymptotics

Appendix to Quicksort Asymptotics Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala

More information

Automated Proofs for Some Stirling Number Identities

Automated Proofs for Some Stirling Number Identities Autoated Proofs for Soe Stirlig Nuber Idetities Mauel Kauers ad Carste Scheider Research Istitute for Sybolic Coputatio Johaes Kepler Uiversity Altebergerstraße 69 A4040 Liz, Austria Subitted: Sep 1, 2007;

More information

arxiv: v1 [math.fa] 3 Apr 2016

arxiv: v1 [math.fa] 3 Apr 2016 Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

Topics in Probability Theory and Stochastic Processes Steven R. Dunbar. Stirling s Formula Derived from the Gamma Function

Topics in Probability Theory and Stochastic Processes Steven R. Dunbar. Stirling s Formula Derived from the Gamma Function Steve R. Dubar Departmet of Mathematics 23 Avery Hall Uiversity of Nebraska-Licol Licol, NE 68588-3 http://www.math.ul.edu Voice: 42-472-373 Fax: 42-472-8466 Topics i Probability Theory ad Stochastic Processes

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

On the Linear Complexity of Feedback Registers

On the Linear Complexity of Feedback Registers O the Liear Complexity of Feedback Registers A. H. Cha M. Goresky A. Klapper Northeaster Uiversity Abstract I this paper, we study sequeces geerated by arbitrary feedback registers (ot ecessarily feedback

More information

Let us consider the following problem to warm up towards a more general statement.

Let us consider the following problem to warm up towards a more general statement. Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math

More information

A q-analogue of some binomial coefficient identities of Y. Sun

A q-analogue of some binomial coefficient identities of Y. Sun A -aalogue of some biomial coefficiet idetities of Y. Su arxiv:008.469v2 [math.co] 5 Apr 20 Victor J. W. Guo ad Da-Mei Yag 2 Departmet of Mathematics, East Chia Normal Uiversity Shaghai 200062, People

More information

Sums Involving Moments of Reciprocals of Binomial Coefficients

Sums Involving Moments of Reciprocals of Binomial Coefficients 1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 14 (2011, Article 11.6.6 Sums Ivolvig Momets of Reciprocals of Biomial Coefficiets Hacèe Belbachir ad Mourad Rahmai Uiversity of Scieces ad Techology Houari

More information

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals

More information

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION Iteratioal Joural of Pure ad Applied Mathematics Volume 103 No 3 2015, 537-545 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://wwwijpameu doi: http://dxdoiorg/1012732/ijpamv103i314

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Factors of sums and alternating sums involving binomial coefficients and powers of integers

Factors of sums and alternating sums involving binomial coefficients and powers of integers Factors of sums ad alteratig sums ivolvig biomial coefficiets ad powers of itegers Victor J. W. Guo 1 ad Jiag Zeg 2 1 Departmet of Mathematics East Chia Normal Uiversity Shaghai 200062 People s Republic

More information

Minimal surface area position of a convex body is not always an M-position

Minimal surface area position of a convex body is not always an M-position Miimal surface area positio of a covex body is ot always a M-positio Christos Saroglou Abstract Milma proved that there exists a absolute costat C > 0 such that, for every covex body i R there exists a

More information

Linear chord diagrams with long chords

Linear chord diagrams with long chords Liear chord diagrams with log chords Everett Sulliva Departmet of Mathematics Dartmouth College Haover New Hampshire, U.S.A. everett..sulliva@dartmouth.edu Submitted: Feb 7, 2017; Accepted: Oct 7, 2017;

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

gcd(n, k) = 1 Kwang Ho Kim 1 and Sihem Mesnager 2 Pyongyang, Democratic People s Republic of Korea

gcd(n, k) = 1 Kwang Ho Kim 1 and Sihem Mesnager 2 Pyongyang, Democratic People s Republic of Korea Solvig x 2k + + x + a = 0 i F 2 gcd, k = with Kwag Ho Kim ad Sihem Mesager 2 Istitute of Mathematics, State Academy of Scieces ad PGItech Corp., Pyogyag, Democratic People s Republic of Korea khk.cryptech@gmail.com

More information

Large holes in quasi-random graphs

Large holes in quasi-random graphs Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,

More information

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

On Generalized Fibonacci Numbers

On Generalized Fibonacci Numbers Applied Mathematical Scieces, Vol. 9, 215, o. 73, 3611-3622 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.215.5299 O Geeralized Fiboacci Numbers Jerico B. Bacai ad Julius Fergy T. Rabago Departmet

More information

De la Vallée Poussin Summability, the Combinatorial Sum 2n 1

De la Vallée Poussin Summability, the Combinatorial Sum 2n 1 J o u r a l of Mathematics ad Applicatios JMA No 40, pp 5-20 (2017 De la Vallée Poussi Summability, the Combiatorial Sum 1 ( 2 ad the de la Vallée Poussi Meas Expasio Ziad S. Ali Abstract: I this paper

More information

Injections, Surjections, and the Pigeonhole Principle

Injections, Surjections, and the Pigeonhole Principle Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs

More information

Lecture 2 Clustering Part II

Lecture 2 Clustering Part II COMS 4995: Usupervised Learig (Summer 8) May 24, 208 Lecture 2 Clusterig Part II Istructor: Nakul Verma Scribes: Jie Li, Yadi Rozov Today, we will be talkig about the hardess results for k-meas. More specifically,

More information

Mathematical Induction

Mathematical Induction Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients: Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!

More information

Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers

Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers Ope Joural o Discrete Mathematics,,, - http://dxdoiorg/46/odm6 Published Olie Jauary (http://wwwscirporg/oural/odm) Polyomial Geeralizatios ad Combiatorial Iterpretatios or Seueces Icludig the Fiboacci

More information

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun Korea J. Math. 23 2015) No. 3 pp. 371 377 http://dx.doi.org/10.11568/kjm.2015.23.3.371 COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q } Sag Pyo Ju Abstract. I this ote we cosider a geeralized

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about

More information

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA RISES, LEVELS, DROPS AND + SIGNS IN COMPOSITIONS: EXTENSIONS OF A PAPER BY ALLADI AND HOGGATT S. Heubach Departmet of Mathematics, Califoria State Uiversity Los Ageles 55 State Uiversity Drive, Los Ageles,

More information

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

A 2nTH ORDER LINEAR DIFFERENCE EQUATION A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy

More information

1 Counting and Stirling Numbers

1 Counting and Stirling Numbers 1 Coutig ad Stirlig Numbers Natural Numbers: We let N {0, 1, 2,...} deote the set of atural umbers. []: For N we let [] {1, 2,..., }. Sym: For a set X we let Sym(X) deote the set of bijectios from X to

More information

Mi-Hwa Ko and Tae-Sung Kim

Mi-Hwa Ko and Tae-Sung Kim J. Korea Math. Soc. 42 2005), No. 5, pp. 949 957 ALMOST SURE CONVERGENCE FOR WEIGHTED SUMS OF NEGATIVELY ORTHANT DEPENDENT RANDOM VARIABLES Mi-Hwa Ko ad Tae-Sug Kim Abstract. For weighted sum of a sequece

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1 . Ifiite Series Oce we have a sequece of umbers, the ext thig to do is to sum them up. Give a sequece a be a sequece: ca we give a sesible meaig to the followig expressio? a = a a a a While summig ifiitely

More information