Geodesic
Binary matrixes based on Pascal's triangle's arithmetics and char sequences
The Bulletin of Irkutsk State University. Series Mathematics, Tome 18 (2016), pp. 38-47 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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, fractals
Mots-clés : Pascal's triangle, fractal matrix. 
@article{IIGUM_2016_18_a2,
     author = {O. V. Kuzmin and B. A. Starkov},
     title = {Binary matrixes based on {Pascal's} triangle's arithmetics and char sequences},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {38--47},
     year = {2016},
     volume = {18},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2016_18_a2/}
}
TY  - JOUR
AU  - O. V. Kuzmin
AU  - B. A. Starkov
TI  - Binary matrixes based on Pascal's triangle's arithmetics and char sequences
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2016
SP  - 38
EP  - 47
VL  - 18
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2016_18_a2/
LA  - ru
ID  - IIGUM_2016_18_a2
ER  - 
%0 Journal Article
%A O. V. Kuzmin
%A B. A. Starkov
%T Binary matrixes based on Pascal's triangle's arithmetics and char sequences
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2016
%P 38-47
%V 18
%U http://geodesic.mathdoc.fr/item/IIGUM_2016_18_a2/
%G ru
%F IIGUM_2016_18_a2
O. V. Kuzmin; B. A. Starkov. Binary matrixes based on Pascal's triangle's arithmetics and char sequences. The Bulletin of Irkutsk State University. Series Mathematics, Tome 18 (2016), pp. 38-47. http://geodesic.mathdoc.fr/item/IIGUM_2016_18_a2/

[1] Bondarenko B. A., Generalized Pascal triangles and pyramids: their fractals, graphs and applications, The Fibonacci Association, Santa Clara, 1993, 253 pp.

[2] Kuzmin O. V., Orkina K. P., “Creation of the codes correcting errors by means of the Pascal type triangle”, Bulletin of Buryat State University, 2006, no. 13, 32–39 (in Russian)

[3] Kuzmin O. V., Generalized Pascal pyramids and their applications, Nauka, Siberian Publishing firm RAS, Novosibirsk, 2000, 294 pp. (in Russian)

[4] Novikov F. A., Discrete mathematics for Programmers, Textbook for Higher Schools, 2nd ed., SPB, Piter, 2004, 364 pp. (in Russian)

[5] Shur A. M., Combinatorics on words, Textbook, Publ. House of the Ural University, Ekaterinburg, 2003, 96 pp. (in Russian)

[6] S. Wolfram, “Geometry of binomial coefficients”, American Mathematical Monthly, 91:9 (1984), 566–571 | DOI | MR | Zbl