VAROL'S PERMUTATION AND ITS GENERALIZATION. Bolian Liu South China Normal University, Guangzhou, P. R. of China {Submitted June 1994)
|
|
- Dominick Randall
- 5 years ago
- Views:
Transcription
1 VROL'S PERMUTTION ND ITS GENERLIZTION Bolian Liu South China Normal University, Guangzhou, P. R. of China {Submitted June 994) INTRODUCTION Let S be the set of n! permutations II = a^x...a n of Z = (,,...,«}. For II es, we write II = a x a...a n, where n(/) = a t. Definition : P : = {U e S \a l+l * a { + for all i,\<i<n), P :={UGP \a n =n}, \P \ = p ; \P \ = p ; P; = {II e S \a i+ *a,-\ for all i, </<»}, P ' = p' n ; P '={ngp ' a =«}, P ' = ^. Definition : T :=<UGP _,aj > J-i - for any i,l<i <n>, % = *; Definitions: T'=\n^pj ^ i(i + l)~... l^oj > for any /, \<i <n>, j=i T{=c/>, \T n \ = t n, \T;\ = f n. ^:=P np ', G :=T nt^, GJ = r, \G \ = g. From Computer Science, Varol first studied T n and obtained the recurrence for t n (see []). In [], R. Luan discussed the enumeration of T and G n. This paper deals with the above problems in a way that is different from [] and []. series of new formulas of enumeration for t n9 t', and g n (Theorems -9) has been derived.. ENUMERTION OF t ND t' n n Lemma : «zj, n - k P = (n-\)\y d {-\f U ^ = D n + D n _ l, (.) Kl k= where D n = «!Zy = -^- is the number of derangement of {,,..., n) (see [3]). Proof: Consider the set S' = {(,); (, 3);...;(«-, ri)}. We say that an element (J, j +) of S' is in a permutation II if IT(/) = y, H(i +) = y + for some z. Let W k be the number of permutations in S containing at least k elements of S'. The number of ways of taking k elements from S' is ("JT ). Suppose the k elements have j digits in common. Then these k elements form (k-j) continuous sequences of natural numbers, each of which is 8 [MY
2 VROL'S PERMUTTION ND ITS GENERLIZTION called a block. Thus, the number of remaining elements in Z n is (n-k + j). The number of permutations of (n-k + j) elements and (k - j) blocks is [in -k + j) + (k- j)] \ = (n-k)\. Hence, W k =("?)(n-k)\. By the principle of inclusion and exclusion (see [3]): k=q V / k= K where D n ~n\ Z = ^-jr k\ is the number of derangement of {,,..., n) (see [3], p. 59). D Lemma : n-l K = l H r w P y, where p = l. (.) Proof: It is easy to see that p n = / V i ~ Pn-\ pplying the above recurrence repeatedly, we get (.). D Let oo PW^Pn*?. (.3) Theorem : '»=I(-ir'-fl^- j= / =! (i-4) Proof: Consider the following subset P of P. P ={(a a...a I...a n ) e P j for some/, \<i <n, i(i + l) u ~.. a +a a / = -, but fori <j<n, ; 7 +) }. If i < w -, then the number of such permutations is pfi^; if i = n -, the number is p n i. Thus, n- Hence, n- ' = Pn ~ I # I = Pn ~ X ft f n /= Substituting (.) into the above formula, we have (.4). D To simplify (.4), we establish a lemma as follows. 7 = -i~pn~^- Lemma 3: If then n- t n= a n-y, h i t n-n "*, z=l 996] 9
3 VROL'S PERMUTTION ND ITS GENERLIZTION L = b, i b \ i h- K-, a «3 a b x - Proof: This follows from the expansion of the determinant along the bottom row. D Hence, we car. write (.4) as (.5) Theorem : P -p + l ft-ft+" ft-ft+ft- + «>, (.6) i +, ( -! ) " Example : ft- + l h = ft ft ft-ft+ft-ft+" Let T(x) = " =? *", 'o =. Then we have = 33. Theorem 3: Hence, Proof: From (.4), P(X)T(X) = YsPn^y T(x) = (l + x y - ^, where P(x) = f> x". oo oo o o / o o «= «= = I I > O O / O O = S(-ir'/',k=S(-ir^,l/' <^,-i=(i+xr l^)-i. w= V= / w= «= T^-^-m n= (.7) Now we shall consider t' n Lemma 4: P'n=Pn- Proof: If (a l a...a ^ ep n, then {a n a n _ x...a a ] ) epj. The above correspondence is one-toone; thus, Pj = i>;. D (.8) no [MY
4 VROL'S PERMUTTION ND ITS GENERLIZTION rguing as in the proof of Theorem, we get Theorem 4: n-\ (.9) By recurrence (.9) and Lemma 4, we have an explicit formula for t' n as follows. Theorem 5: '» = l ft ft ft (.) \Pn-\ Pn- -i Pn Let the generating function for t' be T'(x) = Z" = ^x",? = Theorem 6: r(x) = i- i P(x) ivoo/- By (.9), Z^o C = ft'" ^! Thus > P(x)T(x) = P(x) -, and we have Lemma 5: r(x) = i- P(x) as required. (,) (.) i.e.. Proof: Since T(x) = / ( + x) - / [P(x)], T'(x) = - /[P(x)]; hence, 7(x)-r(x) = - ^, Zft,-^)*" = I(-l)"r". W= «= Comparing the coefficients of x n, we have t n ~f n - (-)", i.e., (.). D ccording to (.) and (.), we have a simple expression for t n as follows: Theorem 7: t = ft ft ft +(-)". (.3) ft-i ft- ft For Example, we can count t 5 by the above formula: 996]
5 VROL'S PERMUTTION ND ITS GENERLIZTION ft ft ft ft ft + (-l) 5 = 3 - = Since the enumeration for p n is simple (we may look it up in a table of values of D n ) counting t n by (.) and (.3) is easier than the method of [].. ENUMERTION OF g n Definition 4: i?v,:= {U = (a l a...a n ) es \H contains either (z,z + l) or (z + l,z), but for V/<z, II contains neither (y, j +) nor (J +,7)}. Let i^. = r.. Lemma 6: r nj = (n-)!, zz > ; r u =. Proof: By definition, i^j is all permutations of S containing either (,) or (,). If we regard (,) as an element, then (,) and the remaining (n-) elements of Z form (n-l)\ permutations. Note that there are two permutations of {,}. Thus, r nl = {n -)!. D Lemma 7: r a = (n -)!- {n - )!. Proof: Let us count the number of permutations containing either (, 3) or (3,) but neither (,) nor (,). rguing as in Lemma 6, we know that the number of permutations containing either (, 3) or (3,) is (n -)!. We have to eliminate those permutations containing (,, 3) or (3,,), the number of which is (^-)! by an argument analogous to Lemma 6. Thus, we have proved Lemma 7. Lemma 8: r nj - r ^ - r ^ ^ - r ^ ^, where <i <n, r n =. (.) Proof: Each permutation of R 7 contains (/', / +) or (/ +, i). If (/', i +) is followed by / - or if (/' +, /) is preceded by / -, then (z +) is removed, and we subtract from every digit that is greater than z +. Thus, we get an element of i^_ t _ x. Conversely, given a permutation of i^_i 5/ _i, we add to each element greater than i and then interpose an / + between (/,/'-l) or (z -, z). This yields an element of R^ i. If (z, z +) is not followed by z - or preceded by (z +, z), we regard (z, z -f ) or (z +, z) as a single element and subtract from every digit greater than z +. This yields an element i r i u u ^ u u - u ^ ) M. Thus, Hence, r n,i ~ r n-\,i-\ r nj =\ + 7- («-l)!-ev u J = 7- (^-l)!-i^-i,y f n-l,i-l> (.) [MY
6 VROL'S PERMUTTION ND ITS GENERLIZTION i.e., r n, i - Vn,i-l ~ r n-\,i-l) ~ V n-\, i-l ^ Using Lemmas 6, 7, and 8 above, we can express r n^k in terms ofr nl : r n,i =r n ~r n _ l = (/!-l)!-(n-)!, ^ = ^ M - 3 r» - u + ^. i = (H-l)!-6(ii-)!+(/i-3)!, In general, let r %k =a k (n-l)\-a k (n-)\ + -+a kk (-i) M ( n -k)\. Obviously a kj is independent of n. It only depends on k. We can prove Lemma 9: a t, ; = a *-i, > + a k-i, j-i + %-a. j-i, < 7 < *, ( - 3 ) ivoo/- Since r >k = y = ia fcy («-./)!(-l>' + by (.), we have: r n,k =r n, k-\ ~~ r n-\,k-\ ~ V n-\,k- y=i M M = %_ u (/i-l)!+ ;W>^^ Comparing the two formulas above, we obtain relations for a nk as follows: %,l = a fc-l,l> t h u s > a k,l = a k-l,l= a k-,l=-~= a l,l a fc,/ = %-l, y + %-l,/-l + %-,,-l> < J < *> = l > %,it = %-i,*-i, t h u s > * *, ^ = a k-i,ik-i = --- = «i.i a Lemma : a kj = a k^k+l _j. (.4) Proof: We prove the lemma by induction on k. For & =,, or 3, this is straightforward. Suppose that (.3) holds for k-l. By (.), a k, j ~ a k-\ j + a -l, j-l + a -, y- ~ a k-l, k-j + a -l, -./+l + a k-, k-j ~ a k, k+l-j By (.3) and (.4), we easily obtain the expression for r nk \ r n = (n-l)\, r n = (n-l)\-3-(n-)\ + (n-3)\, r JIi3 = (/i-l)!-5-(/f-)!+5-(«-3)!-(f!-4)!, r 4 = (/i-l)!-7-(#i-)! + 3-(/i-3)!-7-(#i-4)!+(#i-5)!. 996] 3
7 VROL'S PERMUTTION ND ITS GENERLIZTION For a k j, using u k-j-l + a k-l,j-l +a k-l,j we obtain the above formulas one by one. Now, using (.), we get the table for r nk shown below. TBLE. r ^ ( * < # i ), r n^n: = r n n * ~6~ Setting f n (x) = Z = o ^kx k, and letting / = n - in (.), we have Corollary: r n,n-i = (w-)! + V u - - / U ) (.5) Lemma : 'n ^ " +, w ' w. w - l / ' (.6) Proof: Denote the set of permutations containing neither (n-l,n + l, n) nor («,«+,«-) For any a GR, inserting n + l to the left or right of«in a, we get a' ei^+. Conversely, if a' ei^+ then eliminating w + yields a el^. Hence, r w = ^C-i,«l- Now we count i + i,j- ^ * s sufficient to subtract the number of permutations containing (n -, n +, w) or («,«+, n -) in i^+ n from r w+ w. Regard (n +,«) as a single element. Then ^r n n _ x is the number of permutations containing no (n-l,n +, ri). By a similar argument, the number of permutations containing no (/?, w +, w-) is y ^ ^. Thus, i^+i,j = ^ +i, -i^ -i-y^ -i- Since r n = ^* +> J, we get (.6). Lemma : where -! =. r = (»-)(«-)! +/ _ (l)-/ (l) + r _ ) / =X("-(»-! -/ ), ;= (.7) (.8) 4 [MY
8 VROL'S PERMUTTION ND ITS GENERLIZTION Proof: Substituting (.5) into (.6), we obtain rn=l [. n u r^_ l -f n (l)-(n-l)\-r n _^^ Using (.6), we get (.7). pplying (.7) repeatedly, we have Since r = and / n (l) =, we obtain (.8). D rn = n f(n-i)(n-i)\-f n (l) + r + f (l). By (.6), it is easy to get r n from r n>k. In Table we denote r n>n =r n. Thus, by (.6), the values ofr n on the principal diagonal can be obtained as half the difference between the two adjacent elements on the secondary diagonal. Unfortunately, we cannot count r n until we complete Table. But (.7) and (.8) can do that, namely, both r n k and r are counted without r w+ k. If we set / + (x) = T," k= r +hk x k, we have Lemma 3: Proof: By (.), we have By (.6), we have / (*) = l - x [(n-l)!-r _ ^- -(l + x)/,_ (x)]. (.9) n-\ n-\ n-\ w- ^rn,k I ' k= I - Z^rn,k-\ X ^rn~l,k-l X ^rn-l,k- X^ k= I' k= k= fn( X ) ~ r n, l X = X fni X ) ~ T n, n-l^ ~ X fn-l( X ) ~ ^ fn-l( X ) + V l, W - * " ( - x)/ (x) = {n-)!x -r n _ lx " - x(l + x)f^(x). D Example : Since / 4 (x) = x + 8x +x 3, r 4 =. We get / 5 (x) = - ^ [ - 4! - - x 4 - ( l + x)( + 8x + x 3 )] l - x X [48--x -x 3-6x 4 ] l - x = 48x + 36x + 6x 3 + 6x 4, i.e., r s> j = 48, r 5 = 36, r 53 = 6, r 5>4 = 6. From (.9), we may obtain / (*) = (l-x) n- n- X (-ly-^w - o! x I z '(i+xy-^i - xf -i- n- + x " X (- l )%-i( l +^r'c - *r /_ +(-i)"^_i (i+xfi=l (.) The application of (.) is not as convenient as that of (.9), but it provides the following information: r k must be even. It coincides with the expression of r n^k, i.e., 996] 5
9 VROL'S PERMUTTION ND ITS GENERLIZTION Theorem 7: j=i Proof: By a method similar to Theorem, it is easy to show that 7= n-l «-i j=\ on ~ 'n -a j&n-j ~~ n-l? 7= where T^~ x is the number of permutations in i ^ whose right-most entry is n -. Similar to Theorem, we have Now, substituting (.3) into (.), we obtain (.) as required. D ccording to (.), we can count g by recurrence. g x = g = g 3 =, we get an explicit formula for g n. Theorem 8: n-l 7= (.) (.) (.3) Using (.) and noticing that 8n r r 5 -r 4, «>4. (.4) r _,- + (-TV 4 n-l r _ 4 r _ 5 r r n -r n _ x + + ( - )V 4 Example 3: g 6 = r 4 r 5 -r 4 r r 6 -/- 5 +r Let G(x) = ^g x", R(x) = # *», r =. n= «= - i mr \, i\-i Theorem 9: G(x) = ( + x)" - (i?(x) +)". Proof: By (.), Noticing that g x =, we have thus, G(x) = (l + x)- -(i?(x) + l)-. D n-l I^u^l(-ir^(-i)" 7= 7= G(JC) R(x) + G(x) = ( + xy l R(x) + ( + x)~ l -; 6 [MY
10 VROL'S PERMUTTION ND ITS GENERLIZTION Corollary; CKNOWLEDGMENT The author would like to thank the referee for his/her valuable suggestions and careful corrections. REFERENCES. Y. L. Varol. "On a Subset of all the Permutations of n Marks." The Computer Journal 3.4 (98): Luan Rushu. "Enumeration of Certain Sets of Permutations." Monthly Journal of Science (China) 9. (984). 3. J. Riordan. n Introduction to Combinatorial nalysis. New York: Wiley, 958. MS Classification Number: 55 > > uthor and Title Index T h e UTHOR, TITLE, KEY-WORD, ELEMENTRY PROBLEMS, and DVNCED PROBLEMS indices for t h e first 3 volumes of The Fibonacci Quarterly have been completed by Dr. Charles K. Cook. Publication of the completed indices is on a 3.5-inch, high density disk. The price for a copyrighted version of the disk will be $4. plus postage for non-subscribers, while subscribers to The Fibonacci Quarterly need only pay $. plus postage. For additional information, or to order a disk copy of the indices, write to: PROFESSOR CHRLES K. COOK DEPRTMENT OF MTHEMTICS UNIVERSITY OF SOUTH CROLIN T SUMTER LOUISE CIRCLE SUMTER, SC 95 The indices have been compiled using WORDPERFECT. Should you wish to order a copy of the indices for another wordprocessor or for a non-compatible IBM machine, please explain your situation to Dr. Cook when you place your order and he will try to accommodate you. DO NOT SEND PYMENT WITH YOUR ORDER. You will be billed for the indices and postage by Dr. Cook when he sends you the disk. star is used in the indices to indicate unsolved problems. Furthermore, Dr. Cook is working on a SUBJECT index and will also be classifying all articles by use of the MS Classification Scheme. Those who purchase the indices will be given one free update of all indices when the SUBJECT index and the MS Classification of all articles published in The Fibonacci Quarterly are completed. I 996] 7
^z^=ff] log " x+0 ( lo8t " lx )-
Robert E. Kennedy and Curtis Cooper Department of Mathematics, Central Missouri State University, Warrensburg, MO 64093 (Submitted January 1992) 1. INTRODUCTION In a recent article [2], the authors showed
More informationDIFFERENTIAL PROPERTIES OF A GENERAL CLASS OF POLYNOMIALS. Richard Andre-Jeannin IUT GEA, Route de Romain, Longwy, France (Submitted April 1994)
DIFFERENTIAL PROPERTIES OF A GENERAL CLASS OF POLYNOMIALS Richard Andre-Jeannin IUT GEA, Route de Romain, 54400 Longwy, France (Submitted April 1994) 1. INTRODUCTION Let us consider the generalized Fibonacci
More informationREPRESENTATION GRIDS FOR CERTAIN MORGAN-VOYCE NUMBERS A. F. Horadam The University of New England, Annidale, 2351, Australia (Submitted February 1998)
REPRESENTATION GRIDS FOR CERTAIN MORGAN-VOYCE NUMBERS A. F. Horadam The University of New Engl, Annidale, 2351, Australia (Submitted February 1998) 1. BACKGROUND Properties of representation number sequences
More information*!5(/i,*)=t(-i)*-, fty.
ON THE DIVISIBILITY BY 2 OF THE STIRLING NUMBERS OF THE SECOND KIND T* Lengyel Occidental College, 1600 Campus Road., Los Angeles, CA 90041 {Submitted August 1992) 1. INTRODUCTION In this paper we characterize
More informationAny two numbers g, rj G R are equivalent (g ~ rj) if and only if there exists. ( a b" *lgc/(2? Z)^{^eM 2 (Z); detv4 =l} 5. ar/ + b = cr/+d S = /A(V)
DYNAMICS OF THE MOBIUS MAPPING AND FIBONACCI-LIKE SEQUENCES I. Jaroszewski and A* K e KwasniewsM* Institute of Physics, Warsaw University, Campus Bialystok Computer Science Laboratory ul. Przytorowa 2a
More informationCOMPOSITIONS AND FIBONACCI NUMBERS
COMPOSITIONS AND FIBONACCI NUMBERS V. E. HOGGATT, JR., and D. A. LIND San Jose State College, San Jose, California and University of Cambridge, England 1, INTRODUCTION A composition of n is an ordered
More informationDYNAMICS OF THE ZEROS OF FIBONACCI POLYNOMIALS M. X. He Nova Southeastern University, Fort Lauderdale, FL. D, Simon
M. X. He Nova Southeastern University, Fort Lauderdale, FL D, Simon Nova Southeastern University, Fort Lauderdale, FL P. E. Ricci Universita degli Studi di Roma "La Sapienza," Rome, Italy (Submitted December
More informationF O R M U L A S F O R CONVOLUTION F I B O N A C C I NUMBERS AND P O L Y N O M I A L S
F O R M U L A S F O R CONVOLUTION F I B O N A C C I NUMBERS AND P O L Y N O M I A L S Guodong Liu Dept. of Mathematics, Huizhou University, Huizhou, Guangdong, 516015, People's Republic of China (Submitted
More informationSOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS
SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS A. G. SHANNON* University of Papua New Guinea, Boroko, T. P. N. G. A. F. HORADAIVS University of New Engl, Armidale, Australia. INTRODUCTION In this
More informationHere, logx denotes the natural logarithm of x. Mrsky [7], and later Cheo and Yien [2], proved that iz;.(»)=^io 8 "0(i).
Curtis Cooper f Robert E* Kennedy, and Milo Renberg Dept. of Mathematics, Central Missouri State University, Warrensburg, MO 64093-5045 (Submitted January 1997-Final Revision June 1997) 0. INTRODUCTION
More informationSOME IDENTITIES INVOLVING THE FIBONACCI POLYNOMIALS*
* Yi Yuan and Wenpeeg Zhang Research Center for Basic Science, Xi'an Jiaotong University, Xi'an Shaanxi. P.R. China (Submitted June 2000-Final Revision November 2000) 1. INTROBUCTION AND RESULTS As usual,
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More information1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves?
1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves? This is most easily done by Prüfer codes. The number of times a vertex appears is the degree of the vertex.
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Russ Euler and Jawad Sadek
Edited by Russ Euler and Jawad Sadek Please submit all new problem proposals and corresponding solutions to the Problems Editor, DR. RUSS EULER, Department of Mathematics and Statistics, Northwest Missouri
More informationF. T. HOWARD AND CURTIS COOPER
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G
More informationDiscrete Mathematics. Kishore Kothapalli
Discrete Mathematics Kishore Kothapalli 2 Chapter 4 Advanced Counting Techniques In the previous chapter we studied various techniques for counting and enumeration. However, there are several interesting
More information1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as
SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 8 >< 0, if 0 n < r 1; G n = 1, if n = r
More informationGENERATING FUNCTIONS OF CENTRAL VALUES IN GENERALIZED PASCAL TRIANGLES. CLAUDIA SMITH and VERNER E. HOGGATT, JR.
GENERATING FUNCTIONS OF CENTRAL VALUES CLAUDIA SMITH and VERNER E. HOGGATT, JR. San Jose State University, San Jose, CA 95. INTRODUCTION In this paper we shall examine the generating functions of the central
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by Raymond E. Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HA VEN, PA 17745. This
More informationC O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS
C O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS Nathan D. Cahill, John R. D'Errico, and John P* Spence Eastman Kodak Company, 343 State Street, Rochester, NY 4650 {natfaan. cahill,
More informationDYNAMIC ONE-PILE NIM Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208
Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208 Harold Reiter Department of Mathematics, UNC Charlotte, Charlotte, NC 28223 James Riidzinski Undergraduate, Dept. of Math., UNC Charlotte,
More informationON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION
ON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION Leetsch C. Hsu* Dalian University of Technology, Dalian 116024, China (Submitted August 1995) 1. INTRODUCTION Let (t\h) p denote the generalized
More informationREFINED RESTRICTED PERMUTATIONS AVOIDING SUBSETS OF PATTERNS OF LENGTH THREE
REFINED RESTRICTED PERMUTATIONS AVOIDING SUBSETS OF PATTERNS OF LENGTH THREE Toufik Mansour LaBRI, Université Bordeaux 1, 51 cours de la Libération 405 Talence Cedex, France toufik@labri.fr Aaron Robertson
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by RAYMOND E. WHITNEY Please send all communications concerning to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HAVEN, PA 17745. This department especially welcomes problems
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by RAYMOND E. WHITNEY Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HA PA 17745, This department
More informationThe initial involution patterns of permutations
The initial involution patterns of permutations Dongsu Kim Department of Mathematics Korea Advanced Institute of Science and Technology Daejeon 305-701, Korea dskim@math.kaist.ac.kr and Jang Soo Kim Department
More informationSPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES
SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES M. D. ATKINSON Let V be an w-dimensional vector space over some field F, \F\ ^ n, and let SC be a space of linear mappings from V into itself {SC ^ Horn
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationIntroduction to Combinatorial Mathematics
Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 57
More informationAND OCCUPANCY PROBLEMS
COMBINATIONS, COMPOSITIONS AND OCCUPANCY PROBLEMS MORTON ABRAMSON York University, Downsview, Toronto, Canada Let r < k be positive integers,, INTRODUCTION By a composition of k into r parts (an r-composition
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationA GENERALIZATION OF STIRLING NUMBERS
Hongquan Yu Institute of Mathematical Sciences, Dalian University of Technology, Dalian 6024, China (Submitted September 996-Final Revision December 996). INTRODUCTION Let W(x), fix), g(x) be formal power
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
More informationLemma 8: Suppose the N by N matrix A has the following block upper triangular form:
17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix
More informationAalborg Universitet. The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl. Publication date: 2005
Aalborg Universitet The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl Publication date: 2005 Document Version Publisher's PDF, also known as Version of
More informationOn certain combinatorial expansions of the Legendre-Stirling numbers
On certain combinatorial expansions of the Legendre-Stirling numbers Shi-Mei Ma School of Mathematics and Statistics Northeastern University at Qinhuangdao Hebei, P.R. China shimeimapapers@163.com Yeong-Nan
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationAdvanced Counting Techniques
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Advanced Counting
More information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationTHE NUMBER OF SDR'S IN CERTAIN REGUlAR SYSTEMS DAVID A. KLARNER STAN-CS APRIL 1973
THE NUMBER OF SDR'S N CERTAN REGUlAR SYSTEMS BY DAVD A KLARNER STAN-CS-73-354 APRL 1973 COMPUTER SCENCE DEPARTMENT School of Humanities and Sciences STANFORD UNVERSTY The Number ofsdr's in Certain Regular
More informationM _ J 1, 0 ] - - ^ + 2 [ 1, 0 ],
ON THE MORGAN-VOYCE POLYNOMIAL GENERALIZATION OF THE FIRST KIND Jack Y. Lee 280 86th Street #D2, Brooklyn, NY 11209 (Submitted November 1999-Final Revision March 2000) 111 recent years, a number of papers
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 informationENUMERATION OF HAMILTONIAN CYCLES AND PATHS IN A GRAPH
proceedings of the american mathematical society Volume 111, Number 1, January 1991 ENUMERATION OF HAMILTONIAN CYCLES AND PATHS IN A GRAPH C. J. LIU (Communicated by Andrew Odlyzko) Abstract. First, we
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 informationON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES
ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES SANTOSH N. KABADI AND ABRAHAM P. PUNNEN Abstract. Polynomially testable characterization of cost matrices associated
More information±i-iy (j)^> = P"±(-iy (j)#> (2)
I D E N T I T I E S AND CONGRUENCES INVOLVING H I G H E R - O R D E R EULER-BERNOULLI NUMBERS AND P O L Y N O M I A L S Giiodong Liu Dept. of Mathematics, Huizhou University, Huizhou, Guangdong 516015,
More informationGaussian Elimination for Linear Systems
Gaussian Elimination for Linear Systems Tsung-Ming Huang Department of Mathematics National Taiwan Normal University October 3, 2011 1/56 Outline 1 Elementary matrices 2 LR-factorization 3 Gaussian elimination
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationTHE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE. 1. Introduction
SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 163 178 DOI: 10.5644/SJM.13.2.04 THE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE FENG-ZHEN ZHAO Abstract. In this
More informationThe generalized order-k Fibonacci Pell sequence by matrix methods
Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University
More informationw = X ^ = ^ ^, (i*i < ix
A SUMMATION FORMULA FOR POWER SERIES USING EULERIAN FRACTIONS* Xinghua Wang Math. Department, Zhejiang University, Hangzhou 310028, China Leetsch C. Hsu Math. Institute, Dalian University of Technology,
More informationPhysics 116A Determinants
Physics 116A Determinants Peter Young (Dated: February 5, 2014) I. DEFINITION The determinant is an important property of a square n n matrix. Such a matrix, A say, has n 2 elements, a ij, and is written
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 informationDirect Methods for Solving Linear Systems. Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le
Direct Methods for Solving Linear Systems Simon Fraser University Surrey Campus MACM 316 Spring 2005 Instructor: Ha Le 1 Overview General Linear Systems Gaussian Elimination Triangular Systems The LU Factorization
More informationInequalities associated with the Principle of Inclusion and Exclusion
Inequalities associated with the Principle of Inclusion and Exclusion K. M. Koh Department of Mathematics National University of Singapore The 30th International Mathematical Olympiad (IMO) was held in
More informationAdvanced Counting Techniques. Chapter 8
Advanced Counting Techniques Chapter 8 Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence Relations Nonhomogeneous Recurrence Relations Divide-and-Conquer
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 informationCDM Combinatorial Principles
CDM Combinatorial Principles 1 Counting Klaus Sutner Carnegie Mellon University Pigeon Hole 22-in-exclusion 2017/12/15 23:16 Inclusion/Exclusion Counting 3 Aside: Ranking and Unranking 4 Counting is arguably
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationTHE S 1 -EQUIVARIANT COHOMOLOGY RINGS OF (n k, k) SPRINGER VARIETIES
Horiguchi, T. Osaka J. Math. 52 (2015), 1051 1062 THE S 1 -EQUIVARIANT COHOMOLOGY RINGS OF (n k, k) SPRINGER VARIETIES TATSUYA HORIGUCHI (Received January 6, 2014, revised July 14, 2014) Abstract The main
More informationADVANCED PROBLEMS AND SOLUTIONS
Edited by Raymond E. Whitney Please send all communications concerning ADVANCED PROBLEMS AND SOLUTIONS to RAYMOND E. WHITNEY, MATHEMATICS DEPARTMENT, LOCK HAVEN UNIVERSITY, LOCK HA VEN, PA 17745. This
More informationCONVOLUTION TREES AND PASCAL-T TRIANGLES. JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 1986) 1.
JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 986). INTRODUCTION Pascal (6-66) made extensive use of the famous arithmetical triangle which now bears his name. He wrote
More informationOn Expected Gaussian Random Determinants
On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose
More informationCounting k-marked Durfee Symbols
Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:
More information{~}) n -'R 1 {n, 3, X)RU, k, A) = {J (" J. j =0
2l WEIGHTED STIRLING NUMBERS OF THE FIRST AND SECOND KIND II [Oct. 6. CONCLUSION We have proven a number-theoretical problem about a sequence, which is a computer-oriented type, but cannot be solved by
More informationSummation of certain infinite Fibonacci related series
arxiv:52.09033v (30 Dec 205) Summation of certain infinite Fibonacci related series Bakir Farhi Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes Université de Bejaia 06000 Bejaia Algeria
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
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 information^ ) = ^ : g ' f ^4(x)=a(xr + /xxr,
Edited by Stanley Rablnowitz Please send all material for ELEMENTARY PROBLEMS AND SOLUTIONS to Dr. STANLEY RABINOWITZ; 12 VINE BROOK RD; WESTFORD, MA 01886-4212 USA. Correspondence may also be sent to
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationPolynomial Formula for Sums of Powers of Integers
Polynomial Formula for Sums of Powers of Integers K B Athreya and S Kothari left K B Athreya is a retired Professor of mathematics and statistics at Iowa State University, Ames, Iowa. right S Kothari is
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
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 informationF 2k 1 = F 2n. for all positive integers n.
Question 1 (Fibonacci Identity, 15 points). Recall that the Fibonacci numbers are defined by F 1 = F 2 = 1 and F n+2 = F n+1 + F n for all n 0. Prove that for all positive integers n. n F 2k 1 = F 2n We
More informationMADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking
MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries
More informationThe Frequency of Summands of a Particular Size in Palindromic Compositions
The Frequency of Summands of a Particular Size in Palindromic Compositions Phyllis Chinn Dept. of Mathematics, Humboldt State University, Arcata, CA 95521 phyllis@math.humboldt.edu Ralph Grimaldi Dept.
More informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationarxiv: v1 [math.nt] 6 Apr 2018
THE GEOMETRY OF SOME FIBONACCI IDENTITIES IN THE HOSOYA TRIANGLE RIGOBERTO FLÓREZ, ROBINSON A. HIGUITA, AND ANTARA MUKHERJEE arxiv:1804.02481v1 [math.nt] 6 Apr 2018 Abstract. In this paper we explore some
More informationGENERALIZED POWER SYMMETRIC STOCHASTIC MATRICES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 27, Number 7, Pages 987 994 S 0002-9939(99)0526-6 Article electronically published on March 7, 999 GENERALIZED POWER SYMMETRIC STOCHASTIC MATRICES
More informationOn Boolean functions which are bent and negabent
On Boolean functions which are bent and negabent Matthew G. Parker 1 and Alexander Pott 2 1 The Selmer Center, Department of Informatics, University of Bergen, N-5020 Bergen, Norway 2 Institute for Algebra
More informationThe k-fibonacci matrix and the Pascal matrix
Cent Eur J Math 9(6 0 403-40 DOI: 0478/s533-0-0089-9 Central European Journal of Mathematics The -Fibonacci matrix and the Pascal matrix Research Article Sergio Falcon Department of Mathematics and Institute
More informationON THE MATRIX EQUATION XA AX = X P
ON THE MATRIX EQUATION XA AX = X P DIETRICH BURDE Abstract We study the matrix equation XA AX = X p in M n (K) for 1 < p < n It is shown that every matrix solution X is nilpotent and that the generalized
More informationPUTNAM TRAINING PROBLEMS
PUTNAM TRAINING PROBLEMS (Last updated: December 3, 2003) Remark This is a list of Math problems for the NU Putnam team to be discussed during the training sessions Miguel A Lerma 1 Bag of candies In a
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 informationPseudorandom Sequences I: Linear Complexity and Related Measures
Pseudorandom Sequences I: Linear Complexity and Related Measures Arne Winterhof Austrian Academy of Sciences Johann Radon Institute for Computational and Applied Mathematics Linz Carleton University 2010
More informationEx. Here's another one. We want to prove that the sum of the cubes of the first n natural numbers is. n = n 2 (n+1) 2 /4.
Lecture One type of mathematical proof that goes everywhere is mathematical induction (tb 147). Induction is essentially used to show something is true for all iterations, i, of a sequence, where i N.
More informationEnumeration of subtrees of trees
Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical
More informationSolving Linear Systems Using Gaussian Elimination. How can we solve
Solving Linear Systems Using Gaussian Elimination How can we solve? 1 Gaussian elimination Consider the general augmented system: Gaussian elimination Step 1: Eliminate first column below the main diagonal.
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationON THE N CANONICAL FIBONACCI REPRESENTATIONS OF ORDER AT
ON THE N CANONICAL FIBONACCI REPRESENTATIONS OF ORDER AT ROBERTSILBER North CaroSinaState University, Raleigh, North Carolina 27607 SUMMARY Carlitz, Scoville and Hoggatt [1, 2] have investigated Fibonacci
More informationbe a formal power series with h 0 = 1, v(h^) = \ and v(h n ) > 1 for n > 1. Define a n by
THE POWER OF 2 DIVIDING THE COEFFICIENTS OF CERTAIN POWER SERIES F. T. Howard Wake Forest University, Box 7388 Reynolda Station, Winston-Salem, NC 27109 (Submitted August 1999-Final Revision January 2000)
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 informationTopics in Algorithms. 1 Generation of Basic Combinatorial Objects. Exercises. 1.1 Generation of Subsets. 1. Consider the sum:
Topics in Algorithms Exercises 1 Generation of Basic Combinatorial Objects 1.1 Generation of Subsets 1. Consider the sum: (ε 1,...,ε n) {0,1} n f(ε 1,..., ε n ) (a) Show that it may be calculated in O(n)
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 information