Binary Matrixes Based on Pascal’s Triangle’s Arithmetics and Char Sequences

Abstract

This work describes consisting of zeroes and ones mathematical model, binary matrix obtained by the arithmetical and combinatorial transformations of Pascal's triangle. Some options of a method of building of binary matrices by the choice of certain generatrix are listed. The example of the binary matrix formed in conditions when dimension of a matrix exceeds template length is given. The known method of creation of a binary matrix by reduction of a triangle of Pascal on the simple or compound module is given. Its comparison with the method offered in this work is carried out and the difference in creation of bigger number of fractal structures is specified. Fractal, algebraic and combinatory properties, features and distinctions of two creation of binary matrixes by means of templates [1 0] [1] and [0 1] [1] are described. The self-similarity properties of the binary matrixes are being examined. The theorem of the sequence of not repeating lines of the described binary matrixes is formulated and proved. The objects and their properties investigated in this work are used at the solution of tasks of the theory of information and used as models of natural processes which show property of self-organization.

Keywords

• combinatory analysis
• combinatorics on words
• binary matrixes
• Pascal’s triangle
• fractals
• fractal matrix