S \ - Z) *! for j = 1.2,---,k + l. i=i i=i

Similar documents
COMPOSITIONS AND FIBONACCI NUMBERS

AND OCCUPANCY PROBLEMS

f = 0 (n < 0), fj = 1, f = J2 f. (n > 1).

LATTICE AND BOOLEAN ALGEBRA

ALTERNATIVE DERIVATION OF SOME REGULAR CONTINUED FRACTIONS

A NEW GENERAL SERIES OF BALANCED INCOMPLETE BLOCK DESIGNS

INNER DERIVATIONS OF NON-ASSOCIATIVE ALGEBRAS

GENERAL SOLUTION OF A FIBONACCI-LIKE RECURSION RELATION AND APPLICATIONS

GOLDEN SEQUENCES OF MATRICES WITH APPLICATIONS TO FIBONACCI ALGEBRA

Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)

function provided the associated graph function g:x -) X X Y defined

w = X ^ = ^ ^, (i*i < ix

A Structure of KK-Algebras and its Properties

It is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a

Problems and Solutions

Math 2030 Assignment 5 Solutions

SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS

RUSSELL JAY HENDEL. F i+1.

n n P} is a bounded subset Proof. Let A be a nonempty subset of Z, bounded above. Define the set

CONVOLUTION TREES AND PASCAL-T TRIANGLES. JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 1986) 1.

Asymptotics of generating the symmetric and alternating groups

CHAPTER 4: EXPLORING Z

THE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I

Sums of Products of Bernoulli Numbers*

Problem Set 5 Solutions

PARTITIONS, COMPOSITIONS AND CYCLOMATIC NUMBER OF FUNCTION LATTICES

Chapter 7. Linear Algebra: Matrices, Vectors,

Y. H. Harris Kwong SUNY College at Fredonia, Fredonia, NY (Submitted May 1987)

SYMMETRIC POLYNOMIALS WITH NON-NEGATIVE COEFFICIENTS

Explicit evaluation of the transmission factor T 1. Part I: For small dead-time ratios. by Jorg W. MUller

ON THE RANK OF AN ELEMENT OF A FREE LIE ALGEBRA

EXPANSION OF ANALYTIC FUNCTIONS IN TERMS INVOLVING LUCAS NUMBERS OR SIMILAR NUMBER SEQUENCES

Sb1) = (4, Az,.-., An),

arxiv:math/ v1 [math.co] 13 Jul 2005

(1) Lj(u) = ldm + (-1) DA u = 0, j = 0,1; k = 1,2,,

Zaslavsky s Theorem. As presented by Eric Samansky May 11, 2002

SOME APPLICATIONS OF INFORMATION THEORY TO CELLULAR AUTOMATA

THE ZECKENDORF ARRAY EQUALS THE WYTHOFF ARRAY

INVERSE THEOREMS FOR SUBSET SUMS MELVYN. B. NATHANSON

Partition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS

arxiv: v2 [math.nt] 4 Jun 2016

Fundamentals of Engineering Analysis (650163)

Section Summary. Sequences. Recurrence Relations. Summations Special Integer Sequences (optional)

SOME IDENTITIES INVOLVING THE FIBONACCI POLYNOMIALS*

±i-iy (j)^> = P"±(-iy (j)#> (2)

ADVANCED PROBLEMS AND SOLUTIONS

COM BIN ATOR 1 A L MATHEMATICS YEA R

Transformations Preserving the Hankel Transform

Some constructions of integral graphs

or - CHAPTER 7 Applications of Integration Section 7.1 Area of a Region Between Two Curves 1. A= ~2[0- (x :2-6x)] dr=-~2(x 2-6x) dr

DIRECT CALCULATION OF k-generalized FIBONACCI NUiBERS

On the normal completion of a Boolean algebra

A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs

A Geometrical Proof of a Theorem of Hurwitz.

MULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng

A hyperfactorial divisibility Darij Grinberg *long version*

Confidence intervals and the Feldman-Cousins construction. Edoardo Milotti Advanced Statistics for Data Analysis A.Y

The M6bius Function of a Lattice

ASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES

(1.1) g(w) = fi T(w + o-i) / fi T(w + Pj),

10. Noether Normalization and Hilbert s Nullstellensatz

Two-boundary lattice paths and parking functions

LINEAR INEQUALITIES AND SOME RELATED PROPERTIES OF FUNCTIONS*

On completing partial Latin squares with two filled rows and at least two filled columns

ADDENDA TO GEOMETRY OF A GENERALIZED SIMSON'S FORMULA

Clearly C B, for every C Q. Suppose that we may find v 1, v 2,..., v n

GENERALIZED LUCAS SEQUENCES

{~}) n -'R 1 {n, 3, X)RU, k, A) = {J (" J. j =0

AND THEIR APPLICATIONS. MALVINA BAICA Marshall University, Huntington WV (Submitted June 1982) INTRODUCTION. * («).= E (-!

ƒ f(x)dx ~ X) ^i,nf(%i,n) -1 *=1 are the zeros of P«(#) and where the num

NORMAL CHARACTERIZATION BY ZERO CORRELATIONS

THE GAME QUANTIFIER1

Some Remarks on Elementary Divisor Rings II

BASES IN NON-CLOSED SUBSPACES OF a>

On Expected Gaussian Random Determinants

F ( B d > = d I 1 S (d,d-k) F _ k k=0

On Certain Sums of Stirling Numbers with Binomial Coefficients

Almost Product Evaluation of Hankel Determinants

THE FIXED POINT PROPERTY FOR CONTINUA APPROXIMATED FROM WITHIN BY PEANO CONTINUA WITH THIS PROPERTY

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.

arxiv: v2 [math.fa] 27 Sep 2016

RECURRENT SEQUENCES IN THE EQUATION DQ 2 = R 2 + N INTRODUCTION

Arithmetic properties of lacunary sums of binomial coefficients

Extreme Point Linear Fractional Functional Programming

The generalized order-k Fibonacci Pell sequence by matrix methods

Extreme points of compact convex sets

MATHEMATICS AND GAMES* Nagayoshi lwahori University of Tokyo

On Nevai's Characterization with Almost Everywhere Positive Derivative X. LI AND E. B. SAFF*

HADAMARD DETERMINANTS, MÖBIUS FUNCTIONS, AND THE CHROMATIC NUMBER OF A GRAPH

Monogamous decompositions of complete bipartite graphs, symmetric H -squares, and self-orthogonal I-factorizations

Function Practice. 1. (a) attempt to form composite (M1) (c) METHOD 1 valid approach. e.g. g 1 (5), 2, f (5) f (2) = 3 A1 N2 2

A q-analogue OF THE GENERALIZED FACTORIAL NUMBERS

A NEW CHARACTERIZATION OF COMPLETE HEYTING AND CO-HEYTING ALGEBRAS

A DISCRETE VIEW OF FAÀ DI BRUNO. 1. Introduction. How are the following two problems related?

arxiv: v1 [math.nt] 10 Dec 2009

GENERALIZED FIBONACCI POLYNOMIALS AND ZECKENDORFS THEOREM 1. INTRODUCTION

arxiv: v1 [math.ac] 7 Feb 2009

ON THE SOLVABILITY OF THE EQUATION Zr=i Xi/di s 0 (mod 1) AND ITS APPLICATION

Transcription:

RESTRICTED COMPOSITIONS S. G. MOHANTY McMaster University, Hamilton, Ontario, Canada As a continuation of [6] and [7], this paper deals with a restricted set of compositions of an integer (to be defined below) and presents extensions of some results of Gould [2], [ 3 ], [4], by interpreting the compositions through the corresponding lattice paths. By the definition in [? ], a (k + 1)-composition (t l9 t 2,, t^. +1 ) of an integer n (i e., k+i E i=i t. = n and t. > 1 1 1 for every i) dominates another (k + 1)-composition (tj,tj,,t^+1 ) of n if and only if 3 3 S \ - Z) *! for j = 1.2,---,k + l. i=i i=i Using the 1:1 correspondence in [6], we associate with each (k + ^-composition of n a minimal lattice path (onward and upward path through lattice points) from (0,0) to (n - k - l,k) such that the directed distance measured along the positive direction of x-axis, of the point (n - k - l,k - j), j = 1,2,, k from the path is 3 i=i Without any ambiguity, denote this path by 223

224 RESTRICTED COMPOSITIONS [Oct. 1 ' 1 2 ^ 'JL\- i = i Thus, it is evident that to the set C(n;si l9 a 2,, a^) of (k + 1)-compositions of n, dominated by the (k + 1-composition (a l3 a 2,, aj^+j) of n corresponds the set L(A 1? A 2 J ', A^) of lattice paths which do not cross to the left or above the path I A l9 A 2,*', A^ I aj - 1, a t + a 2-2,, ^2 a. i = i Let the number in the set C (equivalently in L) be represented by N(n;a l9 a 2,,ajj) for k > 1, and by N(n) for k = 0. Trivially, (1) N(n) (2) N(h;a,jL,_V^il) = k - 1 / a + - l \ k V / and (3) N(n;a 1,a 2,-"-,&k) - 0, if any a. is either zero or negative. Now consider the path [AJ,AJ 2 ' " " ' A k such that A\ < A. for all i 0 Every path in L passes through one of the points (n - k - A! + - 2, k - i), i = 0,1, 2,,k, (A' = AM before moving to (n - k - A! - 1, k - i) and then reaches (n - k - l,k) not crossing [AJ, A 2,..., A y. Therefore,

1967] RESTRICTED COMPOSITIONS 225 (4) N(n;a 1,a 2,---,a k ) = N(n;aj - aj 5 a 2s» sa k )N(n) + N(n;ai + a 2 - &[ - aj, a 3,, a k )N(n;aJ) + N(n;ai + a 2 + a 3 - a J - aj - a^, a 4,, ak)n(n;ai, aj) / k k \ ' + N b ; E a i " E allncnsai, aj,, a^ ) \ ifi i=i 7 + N(n)N(n;aJ,a5,...,aj 5.) We note that whenever A! = A., I r N(n;ai +... + aj - a\ - - aj, a +1,, a k ) = 0 It may be pointed out that relation (4) in some sense is a generalization of Vandermonde T s c onvolution!( )(-H x ; y )' a further discussion of which is given later. By setting ^ = A! + 1 and a 2 = a 3 = = a k = 1 in (4) and using (2), we get the recursive formula (5) N(n;ai,aJ,--«,a^) = /AJ + k \ k - i / A J - A! + k - i \ y \ J- E ( k k X i + 1 JN(Q;ai,aJ,...,al. 1 ) which is the same as (9) in [ l ] and (2) in [8], The solution of (5) is stated in the following theorem.

226 RESTRICTED COMPOSITIONS [Oct. Theorem 1: (6) N C r i ^ a ^. - ^ a k ) / A k - A 1 + k - l ^ A, + k - 2 k-2 k - 2 A T + k - 3 k-3 k - 3 ). ) > ( A k -!» / A k _ 2 - A 1 + k - 3 \ /A k _ 3 -A 1 + k-4x ( A, 7) 0 0 1 0 0 Another way of expressing the number in L leads to ( A, - A l ) Ai A 2 A k (7) N(n;a 1,a 2,-..,a k ) = E E... ' 1 Xi=o x 2 =Xi xk=xk-i Ao A, a-i * k = E E - E i Xi=o x 2 = Xl x k =x k _ A Ai A 2 A k + E E ' 0 0 E 1,0 < a < Aj + 1. x = Xj=a X 2 = x X l k k - l Substituting x. - a = x! for i = 1, 2, ",k, the second term on the right hand side becomes Aj-a A 2 -a A, -a (8) E E E x}=0 xj==xj[ x k = X k-i 2 = N ( n ; a t - a ^ g, - - -, ^ ). On the other hand, the first term can be written as

1 9 6 7 ] RESTRICTED COMPOSITIONS «-l A 2 Ak a-1 A 2 A 3 Ak (9) E E... E i = E E E E 1 Xi=0 X 2 = X X l k = X k - l X l = X 2 = X 3 = X l X k = X k - l 227 a - l Xj-1 A 3 A k - E E E E 1. Xf=l X 2 =0 X 3 = X l X ^ k. j whereas the last term in (9) can again be expressed as «- l Xj-i A 3 A 4 Ajj 0-1 Xj-i x 2 - i A 4 A ^ - E E E E... E '1+ E E E E E i. x l ~ 1 x 2 = 0 x 3 = 0 x 4 = x 3 x k = x k - l X l = 2 X 2 = 1 x l =0 x 4 = x 3 x k = x k - l When we proceed in the above manner, the final expression for (9) is (10) E ("D i+1 h) N(n;A. +i + 1, a. +2,, ^ ) by noting that E E E i = E E E i = m x p i - i x 2 =i-2 Xj=o x-po x 2 =o xi=o \ / and A i + i A i + 2 A k E E E 1 = N(n;A. + 1, a. +2,, a k ). V f X i + 2 =X i-m V * k - i Thus it follows from (7), (8) and (10) that

228 RESTRICTED COMPOSITIONS [Oct. (ID k. / v g (-1) 1 / " J N(n;A i + i + 1, a. +2, ' ", \ ) = N(n; a i - a, a 2, - -., a k ). An alternative way of simplifying the first t e r m on the right of (9) is a-i A 2 Ak «-i A 2 i - x 1 =o x 2 =: x 1 xk^0 x i = 0 x 2 = x i where the sums in the last t e r m for which x, Repetition of this p r o c e s s yields xk-i" 1 1. x k = 0-1 is negative a r e zero. k / (12) (-D 1 + 1 ( A k + i - i + 1 > J N ( n ; a 1, a 2, -. -, a k _ i ) = N(n;a 1? a 2,, a k ) i=i \ i / for c = a 1# Relation (12) has been obtained e a r l i e r in [ 7 ], which is equivalent to (3) in [ l ]. When c = SL 1$ the solution of either (11) or (12) is stated as Theorem 2, for which a direct elementary proof i s provided below. T h e o r e m 2: (13) N ( n ; a 1, a 2, - - -, a k ) -r) (v 1 ) * (v) ( \ + l fr.v) ft:. 1 ) ) Proofs Obviously

1967] RESTRICTED COMPOSITIONS 229 0 0 (: ) Using this in (7), we see that Ai A 2 xf=o x 2 =x t Ak-i E Xk-l =x k-2 (VHY'XH-C) \ + * Or) > (:;) Ai A 2 E Z Xj=0 X2=X! Ak-i V i x k-2 (\ +1 ) ft-)-0 0 ( k X - 1 2 ) s» - (?)

230 RESTRICTED COMPOSITIONS [Oct. The proof i s complete when the summation is continued to the end, T h e o r e m s 1 and 2 give r i s e to an interesting combinational identity on determinants, the direct proof of which is not obvious. We check either from the t h e o r e m s or directly that (14) N ( n ; a 1, a 2, * «-, a k ) + N ( n ; a! + a 2,a 3,--», a k ) = N(n;ai + l, a 2,, ak), (15) N ( n ; l, a 2, - - ", a k ) = N(n;a 2, a 3,, a k ) and (16) N ( ] a. + j ; a ^ a ^ - ' ^ k j = N I aj + 1; a l 9 a 2, - -, ak J j = 1,2,- A few important special c a s e s a r e considered below. Corollary 1. (17) KT, -u x.v a / a + kb\ N(n;a,b^b) = ^ ( k ) k - 1 This is directly verifiable from either one of the theorems 0 (Also see Theor e m 1 in [6]) In the next, we evaluate N ( a, b ; c, d ) = N(n;a,b,- % b, c, d ^ \*^d) p - 1 q - 1 which has been obtained by a different method as Theorem 3 in [ 6 ], Corollary 2. (18, N p>q <a, b; c,d, - < V ^^^^^ ('%*/,'.-, ""J x (q - i + l)b - c - (q - i)d / ( q - i + l ) b - c - q d + i\ (q - i + l)b - c - qd + i \ i /

1967] RESTRICTED COMPOSITIONS 231 Proof: F o r c + q(d - 1) ^ qb, the r e s u l t is immediate, by taking A! = (a - 1) + (i - l)(b - 1), i = 1, 2, ' 8, p + q in (4) and applying Corollary 1. When c + q(d - 1) < qb, let s(p i. s 4= p + q) be the l a r g e s t integer so that c + s(d - 1) ^ sbo N (a,b;c,d) and N ( n ; a, b,, b ), expressed with the PJQ ^ T n ^ T p H help of (4), where (a - 1) + (i - l)(b - 1) i = l, 2, ', s, A i ) (a - 1) + (p - l)(b - 1) + (c - 1) + (i - p - l)(d - 1) i = s + 1, s + 2, 0 8 *, p + q, lead to (18), after some simplification. F o r completeness, we present two m o r e special c a s e s which a r e known and can easily be derived. Corollary 3; (19) N ( a, b ; c, l ) = ( a + C - 2 + ( P ; 1 ) ( b - 1 ) + P ^ ) P>q \ P + <i / Corollary 4; P y ^ a / a + ( p + q - i ) b V c + q - ( q - i + l ) b - l i " i =4+i a + (p + q " i)b V P + c *-i A In his paper [ 2 ], Gould has defined A <B y) = p I 1 * + yk ) \v,y) - p + yk y k j and has shown that A, 0,y) satisfies the relation k (21) A. ^, r ) A k _. ( 8, y ) = A k (/3 + 8, 7 ) i=o

232 RESTRICTED COMPOSITIONS [Oct Suppose that /3, y and 8 are non-negative integers 0 Then (21) immediately follows from (4) and (17) by putting a A = /3 + 8, a. t = a 3 = = a, = y, a\ = 0, and aj = a f 3 = = a* = y in (4). Relation (11) in [2] can similarly be verified. Also, the convolution (5.5) in [3] for t = 0 can be compared with (11) and their equivalence is easily established. In what follows, the results on restricted compositions are analogous to those on unrestricted compositions in Gould's pa^er [4j (Theorems 1 and 5 or equivalentry Theorem 6) Fix a 2, a 3,, a^ and let i=2 From (14), (15) and (16) we infer that (22) N(m + a 4 + 1; a 1? a 2,, a^) = N < m + i; a 2-1 + i, a 3,, a k ) i=i j3 L m + i J N {m + i; a 2 - l + i, a 3,-», akf where fz] is the greatest integer less than or equal to z and NJm + i;a 2-1 + i, a 3,, a^ is the number of compositions in the set S(m + i;a 2-1 + i, a 3,, a k ) which is defined as follows: For i negative or equal to -zero, S(m + i; a 2-1 + i, a 3,, a k ) is empty; S(m + 1; a 2j a 3>.,ak) = C(m + 1; a 2, a 3,, a k ) ; For i > 2, S(m + i;a 2-1 + i, a 3,, a k ) is the subset of C(m + i;a 2-1 + i, a 3?, ak) with the property that if (x 1? x 2 ) ",, x ] { ) E S(m + u;a 2-1 + u, a 3,, ak), u = 1, 2,, i - 1, then for r a positive integer (rx 1? rx 2,, rx,) ( S(m + i;a 2-1 + i, a 3,, ak). Expression (22) corresponds to Theorem 1 in [4].

1967] RESTRICTED COMPOSITIONS 233 00 00 j = 1 j=i? [ m r 4 ] N ^ m + i; a 2-1 + i> as,, a k } i i N { m + I ; a 1 - l oo + i,^...,a k } [S+J.] J m+i J x E N { m + i ; a 2 - l + i, a 3, -. -, a k [ m + i X m + 1=1 ( l - x ) ( l - X ) by (3) in [4j. Therefore, m+i (23) E N { m + i; a 2-1 + i, a 3?, a k } m x + i i=i (1 - x ) by (14), (15) and (16). But (23) can be written as 00 i (24) N { i ; a 2 - m - l + i,a 5,---,ak}- x r i=m+l 1 - x oo = X) N(m + i + l;i, a 2 /-- J ak)x m+1 (l-x) 1=1 00 = X)-N(m + i ; a 2 r - l + i, a3,, a k ) x m 1 i=l = H N d j a a - m - l + ijagj-'-jakjx 1. i=m+i In order to extend the summation to i = 1, 2,, m in (24), define M-*/. -,, x _ / 0 for i = 1,2,, m N ( i ; a 2 - m - l + i, a 3, - - -, a k ) ~ } N ( i ; a 2 _ m _ 1 + if g ^... > a k) for i = m+l, m+2- Thus, following the procedure in [4], (25) N n;n + a 2 - m - l, a 3, 8 9 % a k } - ^ N^(n;n + a 2 - m - l, a 3, ' - % a k ) ^ ~ I, iln \ /

234 RESTRICTED COMPOSITIONS Oct. 1967 which is similar to that of T h e o r e m 5 in [ 4 ]. We finally r e m a r k that such results can also be obtained for the number of lattice paths in the set L.(A l5 A 2,,A, ) defined as follows: L 0 ( A 1, A 2, - ", A k ) = L ( A i, A 2, ' - ', A k ) ; L.(A 1? A 2,, A k ) is the subset of L(A A + i, A 2 + i,», A, + i) such that if [ x l 9 x 2,, x ^ l E L (A l5 A 2,, A k ), u = 0, 1,.., i - 1, then [ r x l 5 rx 2,, r x k J ^ L^Aj, A 2,, A^ ). REFERENCES 1. F. Gobel, n Some R e m a r k s on Ballot P r o b l e m s, " Report S321a, Math Centrum, Amsterdam, 1964. 2 0 H. W. Gould, "Some Generalizations of Vandermonde T s Convolutions," Amer. Math. Monthly, Vol. 63, 1956, pp. 84-91. 3. H. W. Gould, "A New Convolution F o r m u l a and Some N e w Orthogonal Relations for Inversion of Series, M Duke Math. Journal, Vol, 29, 1962, 4. H. W. Gould, " Binomial Coefficients, The Bracket. Function, and C o m- positions with Relative P r i m e Summands, " Fibonacci Quarterly, Vol. 2, 1964, pp. 241-260. 5. S. G. Mohanty, "Some P r o p e r t i e s of Compositions and Their Application to the Ballot Problem, " Can. Math. Bull. Vol. 8, 1965, pp. 359-372. 6. S. G. Mohanty and T. V. Narayana, "Some P r o p e r t i e s of Compositions a n d Their Application t o Probability and Statistics I, " Biometrische Zeitschrift, Vol. 3, 1961, pp. 252-258. 7. T. V. Narayana and G. E. Fulton, "A Note on the Compositions of an Integer, " Can. Math. Bull., Vol. 1, 1958, pp. 169-173. 8. P. Switzer, "Significance Probability Bounds for Rank Orderings, " Ann. Math. Statist., Vol. 35, 1964, pp. 891-894.

2024 © sciencedocbox.com Privacy Policy | Terms of Service | Feedback