Thirty-six Full Matrix Forms of the Pascal Triangle: Derivation and Symmetry Relations

Abstract For all 2 ≤ n ∈ N , the four vertices ( 0 0 ) , ( n 0 ) , ( 2 n n ) , ( n n ) of the Pascal Triangle expanded from level 0 to level 2 n define the greatest embedded rhomboid sub-block denoted n − GRSB in this paper. The n − GRSB is canonically partitioned into two triangular sub-blocks G and g , with respective vertex sets { ( 0 0 ) , ( n 0 ) , ( n n ) } and { ( n + 1 1 ) , ( 2 n n ) , ( n + 1 n ) } . The G -sub-block (resp. g -sub-block) has twelve distinct triangular matrix arrangements, numbered from 1 to 12 and designated here G -matrix set (resp. g -matrix set): three northeast, three northwest, three southwest and three distinct triangular southeast arrangements. From the n − GRSB we define thirty-six full matrix forms of the Pascal triangle (FP-matrices for short) simply adding pairwise complementary subblocks of the G - and g -matrices. We then identify and present the invariant groups underlying two significant partitions of the FP-matrix set. The insight gained from a previous study of the twelve G-matrices led us to derive the 36 full matrix forms presented in this paper. Several papers in the literature have dealt with some matrix forms of the Pascal Triangle. Only two of these are so far encountered in the literature. Our work is the first to focus on the hitherto little known 36 full matrix forms as mathematical objects in their own right. As novelty, this paper presents, for the first time, the set of the thirty-six full Pascal matrices. This work focuses on a systematic study of matrix forms derived from the Pascal Triangle, on the individual properties of these forms, their applications, and on the groups of transformations that structure their relations.

[1]  R. Hunter-Duvar,et al.  A more efficient public-key cryptosystem using the Pascal triangle , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[2]  Moawwad E. A. El-Mikkawy On solving linear systems of the Pascal type , 2003, Appl. Math. Comput..

[3]  Xiang Wang,et al.  A fast algorithm for solving linear systems of the Pascal type , 2006, Appl. Math. Comput..

[4]  Roland Bacher,et al.  Symmetric Pascal matrices modulo p , 2004, Eur. J. Comb..

[5]  Sheng-Liang Yang,et al.  Explicit inverse of the Pascal matrix plus one , 2006, Int. J. Math. Math. Sci..

[6]  Ashkan Ashrafi,et al.  Eigenvalues of Hadamard powers of large symmetric Pascal matrices , 2005 .

[8]  Lidia Aceto,et al.  The Matrices of Pascal and Other Greats , 2001, Am. Math. Mon..

[9]  Xiang Wang,et al.  A fast eigenvalue algorithm for Pascal matrices , 2006, Appl. Math. Comput..

[10]  Robert Brawer,et al.  The linear algebra of the pascal matrix , 1992 .

[11]  Teijo Arponen,et al.  Matrix Approach to Polynomials 2 , 2003 .

[12]  Wayne Patterson,et al.  A Public Key Encryption System Derived from the Pascal Parallelogram , 2019, 2019 SoutheastCon.

[13]  Michael Zaus Crisp and soft computing with hypercubical calculus : new approaches to modeling in cognitive science and technology with parity logic, fuzzy logic, and evolutionary computing , 1999 .

[14]  Ting-Zhu Huang,et al.  Letter to the editor: A new algorithm for linear systems of the Pascal type , 2009 .

[15]  Babiga Birregah,et al.  A systematic approach to matrix forms of the Pascal triangle: The twelve triangular matrix forms and relations , 2010, Eur. J. Comb..

[16]  Lowell Abrams,et al.  Reflecting the pascal matrix about its main antidiagonal , 2000 .

[17]  André Barbé,et al.  Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2 , 2000, Discret. Appl. Math..

[18]  Moawwad E. A. El-Mikkawy,et al.  Extended symmetric Pascal matrices via hypergeometric functions , 2004, Appl. Math. Comput..

[19]  Neng Xu,et al.  Subclasses of α-spirallike functions associated with Ruscheweyh derivatives , 2006, Int. J. Math. Math. Sci..

[20]  Richard J. Kozick,et al.  Discrete polynomial transform representation using binary matrices and flow diagrams , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[21]  Michael Zaus Crisp and Soft Computing with Hypercubical Calculus , 1999 .