GENERALIZATION OF UNIVERSAL PARTITION AND BIPARTITION THEOREMS. Hacène Belbachir 1
|
|
- Erik Gibson
- 5 years ago
- Views:
Transcription
1 #A59 INTEGERS 3 (23) GENERALIZATION OF UNIVERSAL PARTITION AND BIPARTITION THEOREMS Hacène Belbachir USTHB, Faculty of Mathematics, RECITS Laboratory, Algiers, Algeria hbelbachir@usthb.dz, hacenebelbachir@gmail.com Miloud Mihoubi 2 USTHB, Faculty of Mathematics, RECITS Laboratory, Algiers, Algeria. mmihoubi@usthb.dz, miloudmihoubi@gmail.com Received: 5/24/2, Revised: 5/4/3, Accepted: 8//3, Published: 9/26/3 Abstract Let A = (a i,j ), i =, 2,..., j =,, 2,..., be an infinite matrix with elements a i,j = or ; p (n, k; A) the number of partitions of n into k parts whose number y i of parts which are equal to i belongs to the set i = {j : a i,j = }, i =, 2,.... The universal theorem on partitions states that n p (n, k; A) u k t n a i,j u j t ij A. n=k= In this paper, we present a generalization of this result. We show that this generalization remains true when a i,j are indeterminate. We also take into account the bi-partite and multi-partite situations. i= j=. Introduction Let A = (a i,j ), i =, 2,..., j =,, 2,... be an infinite matrix with elements a i,j = or ; p (n, k; A) the number of partitions of n into k parts whose number y i of parts which are equal to i belongs to the set i = {j : a i,j = }, i =, 2,.... The universal theorem on partitions states that n p (n, k; A) u k t n a i,j u j t ij A ; () n= k= The research is partially supported by the LITIS Laboratory of Rouen University and the PNR project 8/u6/ This research is supported by the PNR project 8/u6/372. i= j=
2 INTEGERS: 3 (23) 2 see for instance [2] and [3]. In Section 2, we will provide an extension of the above identity and show that it remains true when a i,j are indeterminate. In Section 3, we will present an equivalent version in terms of complete Bell polynomials when a i, =, i. Similarly, a partition of an ordered pair (m, n) 6= (, ), of nonnegative integers, is a non-ordered collection of nonnegative integers (x i, y i ) 6= (, ), i =, 2,..., whose sum equals (m, n). Given a partition of (m, n), let k i,j be the number of parts which are equal to (i, j), i =,, 2,..., m, j =,, 2,..., n, (i, j) 6= (, ), such that m n n m i k i,j = m, j k i,j = n. (2) i= j= For a partition of (m, n) into k parts, we add m n k i,j = k. (3) i= j= Let p (m, n) be the number of partitions of the bi-partite number (m, n) with p (, ) = and p (m, n, k) be the number of partitions of (m, n) into k parts with p (,, ) =. The universal bipartition theorem states that F (t, u, w) = m,n j= i= p (m, n, k) w k t m u n = k= j=i= (i,j)6=(,) wt i u j ; (4) see [2, p. 43, pb. 24]. A generalization of identity (4) is dealt with in Section 4. Section 5 is devoted to the concept of multipartition. 2. Generalized Universal Partition Theorem Theorem. Let = (x i,j ), i =, 2,..., j =,, 2,..., be an infinite matrix of indeterminates; (n, k) the set of all nonnegative integer solutions of k + k k n = k and k + 2k nk n = n; and (n) = S n k= (n, k) be the set of all nonnegative integer solutions of k + 2k nk n = n. For every solution k, k 2,..., k n, we set p (n, k; ) := x,k x 2,k2 x n,kn. Then G (t, u; ) := n= k= (n,k) n p (n, k; ) u k t n x i,j u j t ij A. i= j=
3 INTEGERS: 3 (23) 3 Proof. We have G (t, u; ) = n=k= x,k x 2,k2 x n,kn u k+ +kn t k+2k2+ +nkn A. (n,k) Since these sums apply for all k =,,..., n and n =,,..., it follows that n G (t, u; ) x,k (ut) x k 2,k2 ut 2 k2 x n,kn (ut n ) kn A n=k= (n,k) n= (n) = x,k (ut) k = k i= j= x,k (ut) k x 2,k2 ut 2 k2 x i,j ut i j which is the required expression. A, x 2,k2 ut 2 k2 k 2= x n,kn (ut n ) kn A For x i,j = a i,j with i =, 2,..., j =,, 2,..., in Theorem, we obtain the universal theorem on partitions. For x i,j = ai,j ji with i =, 2,..., j =,, 2,..., in j Theorem, we obtain: Corollary 2. Let A = (a i,j ), i =, 2,..., j =,, 2,..., be an infinite matrix with elements a i,j = or and c (n, k; A) the number of permutations of a finite set W n, of n elements, that are decomposed into k cycles such that the number of cycles of length i belongs to the set i = {j : a i,j = }. Then n c (n, k; A) u k tn n u j t i j a i,j A. j i n=k= For x i,j = z i j j i ai,j, z i 2 C, i =, 2,..., j =,, 2,..., in Theorem, we obtain a remarkable identity according to the partial Bell polynomials: Corollary 3. Let A = (a i,j ), i =, 2,..., j =,, 2,..., be an infinite matrix with elements a i,j = or and B n,k;a (z, z 2,..., z n ) := (n,k) i= n k k n j= z k zn kn a,k a n,kn. n
4 INTEGERS: 3 (23) 4 Then we obtain n B n,k;a (z, z 2,..., z n ) u k tn n n=k= i= j= a i,j j t uz i j i A. i Remark 4. For a i,j =, i =, 2,... and j =,,..., Corollary 3 gives n B n,k (z, z 2,..., z n ) u k tn n = exp u t i z i, i n=k= which is the definition of the partial Bell polynomials B n,k (z,..., z n ). See [, 3, 4]. i= 3. Connection With the Complete Bell Polynomials Recall that the complete Bell polynomials A n (x, x 2,... ) are defined by A n (x, x 2,... ) tn n = exp t m x m. m See [, 3, 4]. n=k In this section, we provide another formulation of Theorem according to the complete Bell polynomials. We determine the generating functions of the sequences (p (n, k; )) n and (p (n, k; )) k, where = (x i,j ), i =, 2,..., j =,, 2,..., is an infinite matrix with indeterminates x i,j such that x i, = for every i. m= Theorem 5. Let q, u be indeterminate. Then, for n, we have p (j, n; ) q j = n A n ( (q; ), 2 (q; ),..., n (q; )), (5) j=n n p (n, j; ) u j = n A n ( (u; ), 2 (u; ),..., n (u; )), (6) j= where with n u n (q; ) := n (i) q i=b ni k and n (u; ) := n b k k k, k n b n (i) = n ( ) k (k )B n,k (x i,, 2x i,2,..., jx i,j,... ). k=
5 INTEGERS: 3 (23) 5 Proof. From Theorem, we get n G (q, u; ) := p (n, k; ) u k q n = + (jx i,j ) uqi j AA. j n=k= i= j= Using the following known expansion (see [2, Theorem.7]) q k q n ln + g k = c n k n, k= with c n = P n k= ( )k (k )B n,k (g, g 2,... ), we obtain G (q, u; ) = exp b k (i) uk u k k qki = exp b k (i) q ki k i=k= k= i= = exp k (q; ) uk k k= = + A k ( (q; ),..., k (q; )) uk k. On the other hand, we have G (q, u; ) = n=k= n= k= n p (n, k; ) u k q n = k= p (n, k; ) q n u k. The first identity follows from identification, where as the second identity follows from the expansion n G (q, u; ) = p (n, k; ) u k q n n= k= n=k = + (jx i,j ) uqi j AA j i= j= = exp b k (i) u k qik k i=k= = n=q n n u k b k A k k k n = exp n (u; ) qn n n= = + A n ( (u; ), 2 (u; ),..., n (u; )) qn n. n= 2
6 INTEGERS: 3 (23) 6 Corollary 6. Let and q be two indeterminates. We then have A n q n,..., (n ) q n n = n q n i= q i and A ) u,..., (n ku n/k ( u) n AA = n (p n (u) up n (u)), k n P where p n (u) := n p (n, j) u j. j= Proof. We put in identity (5) x, =, x,j = q j ( ) for j and x i,j = q j (n ) n for i 2, j, and use identity B n,k (, 2, 3,... ) = (k ) k (Lah numbers). We obtain b n () = (n ) ( n ) q n, b n (i) = (n )q n, i 2, n (q; ) = b n (i) q ni = (n ) q n n, i= p (n, k; ) = q k + q k ( ) (n,k), k = = q k (n k,k) (n,k), k + ( ) q k (n,k ) = q k [p (n k, k) + ( ) p (n, k )], where p (n, k) is the number of partitions of n into k parts, which satisfy p (n, k) = p (n k, k) + p (n, k ). Thus, we obtain p (j, n; ) q j = q p (j, n) q j j=n = j=n n q n i= p (j, n ) q j A j=n q i, which gives the first identity. For the second identity, we take x, =, x,j = for j and x i,j = for
7 INTEGERS: 3 (23) 7 i 2, j, in relation (6) to get b n () = (n ) ( n ), b n (i) = (n ), i 2, n (u; ) = n n u k b k k k = (n ) ( u)n + (n ) ku n/k, k n k n p (n, k; ) = p (n, k) p (n, k ), thus n p (n, j; ) u j = p n (u) up n (u), j= which provides the second identity. 4. Generalized Universal Bipartition Theorem In this section, we provide a generalization of identity (4) and deduce some known identities. Let us start with the following example: how do we partition (2, 3) into di erent parts? Let p (2, 3, k) be the number of partitions of the bi-partite number (2, 3) into k parts, k =,..., 5 and p (2, 3) be the total number of partitions of (2, 3). We have (2, 3) p (2, 3, ) = (, ) + (2, 2) = (, 2) + (2, ) = (, 3) + (2, ) = (, ) + (, 3) = (, ) + (, 2) p (2, 3, 2) = 5 (, ) + (, ) + (2, ) = (, ) + (, 2) + (2, ) = (, ) + (, ) + (, ) = (, ) + (, ) + (, 2) = (, 3) + (, ) + (, ) p (2, 3, 3) = 5 (, ) + (, ) + (, ) + (2, ) = (, ) + (, ) + (, ) + (, ) = (, ) + (, ) + (, ) + (, 2) p (2, 3, 4) = 3 (, ) + (, ) + (, ) + (, ) + (, ) p (2, 3, 5) = p (2, 3) = 5 P k= p (2, 3, k) = = 5. Theorem 7. Let = (x i,j,s ), i, j, s =,, 2,..., be a sequence of indeterminates with x,,s =, (m, n, k) the set of all nonnegative integers k i,j satisfying (2) and (3) and (m, n) := S n+m k= (m, n, k) the set of all nonnegative integers satisfying (2). For every partition of the bi-partite number (m, n) into k parts, we set p (m, n, k; ) := m n x i,j,ki,j. (m,n,k) i=j=
8 INTEGERS: 3 (23) 8 Then we have F (t, u, ; ) := m,n p (m, n, k; ) k t m u n = k= i+j x i,j,s t i u j s. s= Proof. We have F (t, u, ; ) = m,n = m,n k= = p (m, n, k; ) k t m u n m,n (m,n) = (m,n,k) mp P i n np P k i,j j m mp np k i,j k i,j m i= j= u j= i= i=j= t m x i,j,ki,j t i u j ki,j A i=j= x i,j,ki,j t i u j ki,j A. k i,j= n i=j= x i,j,ki,j A Corollary 8. Let A = (a i,j,s ), i, j, s =,, 2,..., with a i,j,s = or for (i, j) 6= (, ) and let p (m, n, k; A) be the number of partitions of (m, n) into k parts whose number y i,j of parts which are equal to (i, j) belongs to the set i,j = {s : a i,j,s = }, i, j =,, 2,..., (i, j) 6= (, ). Then F (t, u, ; A) := p (m, n, k; A) k t m u n = a i,j,s t i u j s. m,n k= i+j For x i,j,s = for all i, j, s =,, 2,..., (i, j) 6= (, ), Theorem 7 becomes: Corollary 9. Let p (m, n) be the number of partitions of the bi-partite number (m, n) with p (, ) = and p (m, n, k) the number of partitions of (m, n) into k parts, with p (,, ) =. Then p (m, n, k) k t m u n = t i u j. m,n k= i+j Remark. Let (y i,j ), i, j =,,..., be a sequence of indeterminates and let s x i,j,s = yi,j s ij, i, j =,, 2,..., we have p (m, n, k; ) = m n k i,j (m,n,k) i=j= ki,j yi,j ij s= = A m,n,k, mn
9 INTEGERS: 3 (23) 9 where and A m,n,k := A m,n,k (y,, y,,..., y m,n ), F (t, u, ; ) = i+j k i,j m,n A m,n,k k k= t m m u n n. From Theorem 7, we obtain F (t, u, ; ) t y i u j ki,j i,j A t i u j y i,j AA. k i,j i j i j i+j From the two expressions of F (t, u;, ), we retrieve the exponential partial bipartitional polynomials: A m,n,k (y,, y,,..., y m,n ) k t m u n m n t i u j y i,j AA ; i j m,n k= see [2, pp: ]. i+j 5. Universal Multipartition Theorem More generally, a multipartition of order r of n = (n,..., n r ), di erent from = (,..., ), of nonnegative integers, is a non-ordered collection of nonnegative integers x () i,..., x (r) i, i =, 2,..., whose sum equals n. In a partition of an r-partite number n, let k i := k i,...,i r be the number of ordered r numbers that are equal to i = (i,..., i r ) 2 {,, 2,..., n } {,, 2,..., n r }, (i,..., i r ) 6=, such that n n r i j k i,...,i r = n j, j =,..., r. (7) i = i r= For the partition of n into k parts, we add n i = n r k i,...,i r = k. (8) i r= Let p (n) be the number of partitions of the r-partite n with p () = and p (n, k) the number of partitions of the r-partite number n into k parts, with p (, ) =. Theorem. Let = (x i,s ), i = (i,..., i r ) 2 N r, i 6=, s =,, 2,..., be a sequence of indeterminates with r + indices, with x,s =, (n, k) the set of all nonnegative integers k i,...,i r satisfying (7) and (8) and (n) := S n + +n r k= (n, k)
10 INTEGERS: 3 (23) the set of all nonnegative integers solutions of (7). For every partition of n into k parts, we set p (n; k, ) := n x i,ki. Then F (t, ; ) = n (n,k) i= n p (n, k; ) k t n = k= i x i,s t i s. where t n := t n... tnr r, n : = n + + n r, n, n,..., n r. Proof. We have the following s= F (t, ; ) = n p (n, k; ) k t n n k= = n P i x i,ki j applen k i r j t n k= (n,k) i= j= = n x i,ki t i k i, n (n) i= P i j applen i j jk i j and exploiting x, =, the last expression i,ki ki x t i k ia i,ki ki x t i k ia. i i A For x i,s = a i,s 2 {, } for all i 2 N r, i 6=, s =,, 2,..., we obtain: Corollary 2. Let A = (a i,s ), i 2 N r, i 6=, s =,, 2,..., with a i,s = or and p (n, k; A) be the number of partitions of n into k parts whose number y i of parts which are equal to i belongs to the set i = {s : a i,s = }, i 2 N r, i 6=. Then F (t, u, ; A) := n p (n, k; A) k t n a i,s t i s A. n s k= i For x i,s = for all i 2 N r, i 6=, s =,, 2,..., we obtain:
11 INTEGERS: 3 (23) Corollary 3. Let p (n) be the number of partitions of the r-partite number n with p () = and p (n, k) the number of partitions of the r-bipartite number n into k parts, with p (, ) =. Then n p (n, k) k t n = t i. Consequently n k= p (n) t n = n i i t i. Remark 4. If we take t = = t r = t, we obtain t i ( i+r r ) n = i n k= = n n + +n r=n n + +n r=n p n () p (n, k) t n, k t n and more generally, for nonnegative integers a,..., a r and t = t a,..., t r = t ar, we obtain t i f(i,r) = p n () t n, where i p n () = n a n + +a rn r k= a n + +a rn r=n p (n, k) k, and where f (n, r) is the number of solutions of the integer equation a n + a 2 n a r n r = n. Acknowledgments The authors wish to express their gratitude to the referee for his/her valuable advice and comments which helped to greatly in improving the quality of the paper. References [] E. T. Bell, Exponential polynomials. Ann. Math. 35 (934), [2] Charalambos A. Charalambides, Enumerative Combinatorics. Chapman & Hall/CRC, A CRC Press Company, Boca Raton, London, New ork, Washington, D.C. (2). [3] L. Comtet, Advanced Combinatorics. D. Reidel Publishing Company, Dordrecht-Holland / Boston-U.S.A, (974). [4] M. Mihoubi, Bell polynomials and binomial type sequences. Discrete Math., 38 (28),
#A29 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART II
#A29 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART II Hacène Belbachir 1 USTHB, Faculty of Mathematics, El Alia, Bab Ezzouar, Algeria hbelbachir@usthb.dz
More informationSome Congruences for the Partial Bell Polynomials
3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationA New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009, Article 09.3. A New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan Sadek Bouroubi University of Science and Technology
More informationInteger partitions into Diophantine pairs
Availaible on line at http://www.liforce.usthb.dz bulletin-liforce@usthb.dz Bulletin du Laboratoire 04 (015) 8-35 Integer partitions into Diophantine pairs Zahra YAHI 1, Nesrine BENYAHIA TANI, Sadek BOUROUBI
More informationarxiv: v1 [math.co] 14 Nov 2018
Plateau Polycubes and Lateral Area arxiv:181105707v1 [mathco] 14 Nov 2018 Abderrahim Arabi USTHB, Faculty of Mathematics RECITS Laboratory BP 32, El Alia 16111, Bab Ezzouar Algiers, Algeria rarabi@usthbdz
More informationThe q-exponential generating function for permutations by consecutive patterns and inversions
The q-exponential generating function for permutations by consecutive patterns and inversions Don Rawlings Abstract The inverse of Fedou s insertion-shift bijection is used to deduce a general form for
More informationNew identities for Bell s polynomials New approaches
Rostoc. Math. Kolloq. 6, 49 55 2006) Subject Classification AMS) 05A6 Sade Bouroubi, Moncef Abbas New identities for Bell s polynomials New approaches ABSTRACT. In this wor we suggest a new approach to
More informationOn Certain Sums of Stirling Numbers with Binomial Coefficients
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015, Article 15.9.6 On Certain Sums of Stirling Numbers with Binomial Coefficients H. W. Gould Department of Mathematics West Virginia University
More informationInteger Partitions and Convexity
2 3 47 6 23 Journal of Integer Sequences, Vol. 0 (2007), Article 07.6.3 Integer Partitions and Convexity Sadek Bouroubi USTHB Faculty of Mathematics Department of Operational Research Laboratory LAID3
More informationSolutions to the recurrence relation u n+1 = v n+1 + u n v n in terms of Bell polynomials
Volume 31, N. 2, pp. 245 258, 2012 Copyright 2012 SBMAC ISSN 0101-8205 / ISSN 1807-0302 (Online) www.scielo.br/cam Solutions to the recurrence relation u n+1 = v n+1 + u n v n in terms of Bell polynomials
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationA196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers
Karlsruhe October 14, 2011 November 1, 2011 A196837: Ordinary Generating Functions for Sums of Powers of the First n Positive Integers Wolfdieter L a n g 1 The sum of the k th power of the first n positive
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More informationReceived: 2/7/07, Revised: 5/25/07, Accepted: 6/25/07, Published: 7/20/07 Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 2007, #A34 AN INVERSE OF THE FAÀ DI BRUNO FORMULA Gottlieb Pirsic 1 Johann Radon Institute of Computational and Applied Mathematics RICAM,
More informationSimplifying Coefficients in a Family of Ordinary Differential Equations Related to the Generating Function of the Laguerre Polynomials
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Applications and Applied Mathematics: An International Journal (AAM Vol. 13, Issue 2 (December 2018, pp. 750 755 Simplifying Coefficients
More informationarxiv: v1 [math.ac] 7 Feb 2009
MIXED MULTIPLICITIES OF MULTI-GRADED ALGEBRAS OVER NOETHERIAN LOCAL RINGS arxiv:0902.1240v1 [math.ac] 7 Feb 2009 Duong Quoc Viet and Truong Thi Hong Thanh Department of Mathematics, Hanoi University of
More informationPartial Bell Polynomials and Inverse Relations
1 2 3 47 6 23 11 Joural of Iteger Seueces, Vol. 13 (2010, Article 10.4.5 Partial Bell Polyomials ad Iverse Relatios Miloud Mihoubi 1 USTHB Faculty of Mathematics P.B. 32 El Alia 16111 Algiers Algeria miloudmihoubi@hotmail.com
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationPartitions and the FermiDirac Distribution
Journal of Combinatorial Theory, Series A 9, 173185 (000) doi10.1006jcta.000.3059, available online at httpwww.idealibrary.com on Partitions and the FermiDirac Distribution Jean-Marie Boe and Fabrice Philippe
More information#A18 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART I
#A18 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART I Miloud Mihoubi 1 Uiversité des Scieces et de la Techologie Houari Bouediee Faculty
More informationInteger partitions into arithmetic progressions
Rostock. Math. Kolloq. 64, 11 16 (009) Subject Classification (AMS) 05A17, 11P81 Saek Bouroubi, Nesrine Benyahia Tani Integer partitions into arithmetic progressions ABSTRACT. Every number not in the form
More informationPermutations with Inversions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 4 2001, Article 01.2.4 Permutations with Inversions Barbara H. Margolius Cleveland State University Cleveland, Ohio 44115 Email address: b.margolius@csuohio.edu
More informationOn a generalization of addition chains: Addition multiplication chains
Discrete Mathematics 308 (2008) 611 616 www.elsevier.com/locate/disc On a generalization of addition chains: Addition multiplication chains Hatem M. Bahig Computer Science Division, Department of Mathematics,
More informationF ( B d > = d I 1 S (d,d-k) F _ k k=0
Canad. Math. Bull. Vol. 26 (3), 1983 ORDERED FIBONACCI PARTITIONS BY HELMUT PRODINGER (1) ABSTRACT. Ordered partitions are enumerated by F n = k fc! S(n, k) where S(n, k) is the Stirling number of the
More informationCounting Peaks and Valleys in a Partition of a Set
1 47 6 11 Journal of Integer Sequences Vol. 1 010 Article 10.6.8 Counting Peas and Valleys in a Partition of a Set Toufi Mansour Department of Mathematics University of Haifa 1905 Haifa Israel toufi@math.haifa.ac.il
More informationEXPLICIT INVERSE OF THE PASCAL MATRIX PLUS ONE
EXPLICIT INVERSE OF THE PASCAL MATRIX PLUS ONE SHENG-LIANG YANG AND ZHONG-KUI LIU Received 5 June 005; Revised September 005; Accepted 5 December 005 This paper presents a simple approach to invert the
More informationTHE STRUCTURE OF A RING OF FORMAL SERIES AMS Subject Classification : 13J05, 13J10.
THE STRUCTURE OF A RING OF FORMAL SERIES GHIOCEL GROZA 1, AZEEM HAIDER 2 AND S. M. ALI KHAN 3 If K is a field, by means of a sequence S of elements of K is defined a K-algebra K S [[X]] of formal series
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationOn the Sylvester Denumerants for General Restricted Partitions
On the Sylvester Denumerants for General Restricted Partitions Geir Agnarsson Abstract Let n be a nonnegative integer and let ã = (a 1... a k be a k-tuple of positive integers. The term denumerant introduced
More informationCOMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS
COMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS AE JA YEE 1 Abstract In his memoir in 1984 George E Andrews introduces many general classes of Frobenius partitions (simply F-partitions)
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationOn the log-convexity of combinatorial sequences arxiv:math/ v3 [math.co] 27 Nov 2006
On the log-convexity of combinatorial sequences arxiv:math/0602672v3 [math.co] 27 Nov 2006 Lily L. Liu, Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, PR China
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationMathematics 228(Q1), Assignment 3 Solutions
Mathematics 228(Q1), Assignment 3 Solutions Exercise 1.(10 marks)(a) If m is an odd integer, show m 2 1 mod 8. (b) Let m be an odd integer. Show m 2n 1 mod 2 n+2 for all positive natural numbers n. Solution.(a)
More informationDeterminants of Partition Matrices
journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised
More informationA RECURSION FORMULA FOR THE COEFFICIENTS OF ENTIRE FUNCTIONS SATISFYING AN ODE WITH POLYNOMIAL COEFFICIENTS
Georgian Mathematical Journal Volume 11 (2004), Number 3, 409 414 A RECURSION FORMULA FOR THE COEFFICIENTS OF ENTIRE FUNCTIONS SATISFYING AN ODE WITH POLYNOMIAL COEFFICIENTS C. BELINGERI Abstract. A recursion
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationLaura Chihara* and Dennis Stanton**
ZEROS OF GENERALIZED KRAWTCHOUK POLYNOMIALS Laura Chihara* and Dennis Stanton** Abstract. The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given.
More informationOn the expansion of Fibonacci and Lucas polynomials, revisited
Les Annales RECITS http://www.lrecits.usthb.dz Vol. 01, 2014, pages 1-10 On the expansion of Fibonacci Lucas polynomials, revisited Hacène Belbachir a Athmane Benmezai b,c a USTHB, Faculty of Mathematics,
More informationMULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng
Indian J. pure appl. Math., 39(: 37-55, April 008 c Printed in India. MULTISECTION METHOD AND FURTHER FORMULAE FOR π De-Yin Zheng Department of Mathematics, Hangzhou Normal University, Hangzhou 30036,
More informationCommentationes Mathematicae Universitatis Carolinae
Commentationes Mathematicae Universitatis Carolinae Bogdan Szal Trigonometric approximation by Nörlund type means in L p -norm Commentationes Mathematicae Universitatis Carolinae, Vol. 5 (29), No. 4, 575--589
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationNoncommutative Abel-like identities
Noncommutative Abel-like identities Darij Grinberg detailed version draft, January 15, 2018 Contents 1. Introduction 1 2. The identities 3 3. The proofs 7 3.1. Proofs of Theorems 2.2 and 2.4......................
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationON THE COEFFICIENTS OF AN ASYMPTOTIC EXPANSION RELATED TO SOMOS QUADRATIC RECURRENCE CONSTANT
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math. x (xxxx), xxx xxx. doi:10.2298/aadmxxxxxxxx ON THE COEFFICIENTS OF AN ASYMPTOTIC
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationThe following two problems were posed by de Caen [4] (see also [6]):
BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES JIN ZHONG Abstract A matrix is binary if each of its entries is either or The binary rank of a nonnegative integer matrix A is the
More informationMOMENTS AND CUMULANTS OF THE SUBORDINATED LEVY PROCESSES
MOMENTS AND CUMULANTS OF THE SUBORDINATED LEVY PROCESSES PENKA MAYSTER ISET de Rades UNIVERSITY OF TUNIS 1 The formula of Faa di Bruno represents the n-th derivative of the composition of two functions
More informationHIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION
ISSN 2066-6594 Ann Acad Rom Sci Ser Math Appl Vol 10, No 1/2018 HIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION Mircea Merca Dedicated to Professor Mihail Megan on
More informationCONVERGENT SEQUENCES IN SEQUENCE SPACES
MATHEMATICS CONVERGENT SEQUENCES IN SEQUENCE SPACES BY M. DORLEIJN (Communicated by Prof. J. F. KoKSMA at the meeting of January 26, 1957) In the theory of sequence spaces, given by KoTHE and ToEPLITZ
More informationLecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321
Lecture 11: Introduction to Markov Chains Copyright G. Caire (Sample Lectures) 321 Discrete-time random processes A sequence of RVs indexed by a variable n 2 {0, 1, 2,...} forms a discretetime random process
More informationA Blossoming Algorithm for Tree Volumes of Composite Digraphs
A Blossoming Algorithm for Tree Volumes of Composite Digraphs Victor J. W. Guo Center for Combinatorics, LPMC, Nankai University, Tianjin 30007, People s Republic of China Email: jwguo@eyou.com Abstract.
More informationGenerating Functions of Partitions
CHAPTER B Generating Functions of Partitions For a complex sequence {α n n 0,, 2, }, its generating function with a complex variable q is defined by A(q) : α n q n α n [q n ] A(q). When the sequence has
More informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationPersistence and global stability in discrete models of Lotka Volterra type
J. Math. Anal. Appl. 330 2007 24 33 www.elsevier.com/locate/jmaa Persistence global stability in discrete models of Lotka Volterra type Yoshiaki Muroya 1 Department of Mathematical Sciences, Waseda University,
More informationTHE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I
J Korean Math Soc 46 (009), No, pp 95 311 THE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I Sung Sik Woo Abstract The purpose of this paper is to identify the group of units of finite local rings of the
More informationSymmetric functions and the Vandermonde matrix
J ournal of Computational and Applied Mathematics 172 (2004) 49-64 Symmetric functions and the Vandermonde matrix Halil Oruç, Hakan K. Akmaz Department of Mathematics, Dokuz Eylül University Fen Edebiyat
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More informationResearch Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
More informationSuper edge-magic labeling of graphs: deficiency and maximality
Electronic Journal of Graph Theory and Applications 5 () (017), 1 0 Super edge-magic labeling of graphs: deficiency and maximality Anak Agung Gede Ngurah a, Rinovia Simanjuntak b a Department of Civil
More informationA Note on Some Wishart Expectations
Metrika, Volume 33, 1986, page 247-251 A Note on Some Wishart Expectations By R. J. Muirhead 2 Summary: In a recent paper Sharma and Krishnamoorthy (1984) used a complicated decisiontheoretic argument
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationOn the Primitivity of some Trinomials over Finite Fields
On the Primitivity of some Trinomials over Finite Fields LI Yujuan & WANG Huaifu & ZHAO Jinhua Science and Technology on Information Assurance Laboratory, Beijing, 100072, P.R. China email: liyj@amss.ac.cn,
More informationB n (x) zn n! n=0. E n (x) zn n! n=0
UDC 517.9 Q.-M. Luo Chongqing Normal Univ., China) q-apostol EULER POLYNOMIALS AND q-alternating SUMS* q-полiноми АПОСТОЛА ЕЙЛЕРА ТА q-знакозмiннi СУМИ We establish the basic properties generating functions
More informationON THE COMPLETE CONVERGENCE FOR WEIGHTED SUMS OF DEPENDENT RANDOM VARIABLES UNDER CONDITION OF WEIGHTED INTEGRABILITY
J. Korean Math. Soc. 45 (2008), No. 4, pp. 1101 1111 ON THE COMPLETE CONVERGENCE FOR WEIGHTED SUMS OF DEPENDENT RANDOM VARIABLES UNDER CONDITION OF WEIGHTED INTEGRABILITY Jong-Il Baek, Mi-Hwa Ko, and Tae-Sung
More informationMath Bootcamp 2012 Miscellaneous
Math Bootcamp 202 Miscellaneous Factorial, combination and permutation The factorial of a positive integer n denoted by n!, is the product of all positive integers less than or equal to n. Define 0! =.
More informationLecture #8: We now take up the concept of dynamic programming again using examples.
Lecture #8: 0.0.1 Dynamic Programming:(Chapter 15) We now take up the concept of dynamic programming again using examples. Example 1 (Chapter 15.2) Matrix Chain Multiplication INPUT: An Ordered set of
More informationCOMBINATORICS OF GENERALIZED q-euler NUMBERS. 1. Introduction The Euler numbers E n are the integers defined by E n x n = sec x + tan x. (1.1) n!
COMBINATORICS OF GENERALIZED q-euler NUMBERS TIM HUBER AND AE JA YEE Abstract New enumerating functions for the Euler numbers are considered Several of the relevant generating functions appear in connection
More informationInterpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials
Interpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials Lawrence A. Harris Abstract. We extend the definition of Geronimus nodes to include pairs of real numbers where
More information12. Cholesky factorization
L. Vandenberghe ECE133A (Winter 2018) 12. Cholesky factorization positive definite matrices examples Cholesky factorization complex positive definite matrices kernel methods 12-1 Definitions a symmetric
More informationRepresentations of disjoint unions of complete graphs
Discrete Mathematics 307 (2007) 1191 1198 Note Representations of disjoint unions of complete graphs Anthony B. Evans Department of Mathematics and Statistics, Wright State University, Dayton, OH, USA
More informationRECURRENCE RELATION FOR COMPUTING A BIPARTITION FUNCTION
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 48, Number, 08 RECURRENCE RELATION FOR COMPUTING A BIPARTITION FUNCTION D.S. GIREESH AND M.S. MAHADEVA NAIKA ABSTRACT. Recently, Merca [4] found the recurrence
More informationDoubly Indexed Infinite Series
The Islamic University of Gaza Deanery of Higher studies Faculty of Science Department of Mathematics Doubly Indexed Infinite Series Presented By Ahed Khaleel Abu ALees Supervisor Professor Eissa D. Habil
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationSOME IDENTITIES INVOLVING GENERALIZED GENOCCHI POLYNOMIALS AND GENERALIZED FIBONACCI-LUCAS SEQUENCES
SOME IDENTITIES INVOLVING GENERALIZED GENOCCHI POLYNOMIALS AND GENERALIZED FIBONACCI-LUCAS SEQUENCES Zhizheng Zhang and Jingyu Jin Department of mathematics, Luoyang Teachers College, Luoyang, Henan, 471022,
More informationABSTRACT. Department of Mathematics. interesting results. A graph on n vertices is represented by a polynomial in n
ABSTRACT Title of Thesis: GRÖBNER BASES WITH APPLICATIONS IN GRAPH THEORY Degree candidate: Angela M. Hennessy Degree and year: Master of Arts, 2006 Thesis directed by: Professor Lawrence C. Washington
More informationDirected Plateau Polyhypercubes
Directed Plateau Polyhypercubes arxiv:190100668v1 [mathco] 3 Jan 2019 Abderrahim Arabi USTHB, Faculty of Mathematics RECITS Laboratory BP 32, El Alia 16111, Bab Ezzouar Algiers, Algeria rarabi@usthbdz
More informationCombinatorial Dimension in Fractional Cartesian Products
Combinatorial Dimension in Fractional Cartesian Products Ron Blei, 1 Fuchang Gao 1 Department of Mathematics, University of Connecticut, Storrs, Connecticut 0668; e-mail: blei@math.uconn.edu Department
More informationRMT 2013 Power Round Solutions February 2, 2013
RMT 013 Power Round Solutions February, 013 1. (a) (i) {0, 5, 7, 10, 11, 1, 14} {n N 0 : n 15}. (ii) Yes, 5, 7, 11, 16 can be generated by a set of fewer than 4 elements. Specifically, it is generated
More informationPermutation Statistics and q-fibonacci Numbers
Permutation Statistics and q-fibonacci Numbers Adam M Goyt and David Mathisen Mathematics Department Minnesota State University Moorhead Moorhead, MN 56562 Submitted: April 2, 2009; Accepted: August 2,
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationThe best expert versus the smartest algorithm
Theoretical Computer Science 34 004 361 380 www.elsevier.com/locate/tcs The best expert versus the smartest algorithm Peter Chen a, Guoli Ding b; a Department of Computer Science, Louisiana State University,
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationHENG HUAT CHAN, SONG HENG CHAN AND SHAUN COOPER
THE q-binomial THEOREM HENG HUAT CHAN, SONG HENG CHAN AND SHAUN COOPER Abstract We prove the infinite q-binomial theorem as a consequence of the finite q-binomial theorem 1 The Finite q-binomial Theorem
More informationON POLYNOMIAL REPRESENTATION FUNCTIONS FOR MULTILINEAR FORMS. 1. Introduction
ON POLYNOMIAL REPRESENTATION FUNCTIONS FOR MULTILINEAR FORMS JUANJO RUÉ In Memoriam of Yahya Ould Hamidoune. Abstract. Given an infinite sequence of positive integers A, we prove that for every nonnegative
More informationInvestigating Geometric and Exponential Polynomials with Euler-Seidel Matrices
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.4.6 Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices Ayhan Dil and Veli Kurt Department of Mathematics
More informationANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM
q-hypergeometric PROOFS OF POLYNOMIAL ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM S OLE WARNAAR Abstract We present alternative, q-hypergeometric
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationCovering the Plane with Translates of a Triangle
Discrete Comput Geom (2010) 43: 167 178 DOI 10.1007/s00454-009-9203-1 Covering the Plane with Translates of a Triangle Janusz Januszewski Received: 20 December 2007 / Revised: 22 May 2009 / Accepted: 10
More informationBook announcements. Sukumar Das Adhikari ASPECTS OF COMBINATORICS AND COMBINATORIAL NUMBER THEORY CRC Press, Florida, 2002, 156pp.
Discrete Mathematics 263 (2003) 347 352 www.elsevier.com/locate/disc Book announcements Sukumar Das Adhikari ASPECTS OF COMBINATORICS AND COMBINATORIAL NUMBER THEORY CRC Press, Florida, 2002, 156pp. Notations
More informationSTOCHASTIC COAGULATION-FRAGMENTATION PROCESSES WITH A FINITE NUMBER OF PARTICLES AND APPLICATIONS
Submitted to the Annals of Applied Probability STOCHASTIC COAGULATION-FRAGMENTATION PROCESSES WITH A FINITE NUMBER OF PARTICLES AND APPLICATIONS By Nathanael Hoze and David Holcman,, Institute of Integrative
More information-V-2 ^ r-\ a, r-2. ar-l
APPLICATION OF MARKOV CHAINS PROPERTIES TO r-generalized FIBONACCI SEQUENCES Mehdi Mouline and Mustapha Rachidi Departement de Mathematiques et Informatique Faculte des Sciences, Universite Mohammed V,
More informationCOMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 COMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION MARIE JAMESON AND ROBERT P. SCHNEIDER (Communicated
More informationNoncommutative Abel-like identities
Noncommutative Abel-like identities Darij Grinberg draft, January 15, 2018 Contents 1. Introduction 1 2. The identities 3 3. The proofs 7 3.1. Proofs of Theorems 2.2 and 2.4...................... 7 3.2.
More informationSection II.2. Finitely Generated Abelian Groups
II.2. Finitely Generated Abelian Groups 1 Section II.2. Finitely Generated Abelian Groups Note. In this section we prove the Fundamental Theorem of Finitely Generated Abelian Groups. Recall that every
More informationProof by Induction. Andreas Klappenecker
Proof by Induction Andreas Klappenecker 1 Motivation Induction is an axiom which allows us to prove that certain properties are true for all positive integers (or for all nonnegative integers, or all integers
More information