Geodesic
On the distribution of the number of ones in a Boolean Pascal's triangle
Diskretnaya Matematika, Tome 18 (2006) no. 2, pp. 123-131 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This research is devoted to estimating the number of Boolean Pascal's triangles of large enough size $s$ containing a given number of ones $\xi\le ks$, $k>0$. We demonstrate that any such Pascal's triangle contains a zero triangle whose size differs from $s$ by at most constant depending only on $k$. We prove that there is a monotone unbounded sequence of rational numbers $0=k_0$ such that the distribution of the number of triangles is concentrated in some neighbourhoods of the points $k_is$. The form of the distribution in each neighbourhood depends not on $s$ but on the residue of $s$ some modulo depending on $i\ge 0$. 
@article{DM_2006_18_2_a8,
     author = {F. M. Malyshev and E. V. Kutyreva},
     title = {On the distribution of the number of ones in a {Boolean} {Pascal's} triangle},
     journal = {Diskretnaya Matematika},
     pages = {123--131},
     year = {2006},
     volume = {18},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2006_18_2_a8/}
}
TY  - JOUR
AU  - F. M. Malyshev
AU  - E. V. Kutyreva
TI  - On the distribution of the number of ones in a Boolean Pascal's triangle
JO  - Diskretnaya Matematika
PY  - 2006
SP  - 123
EP  - 131
VL  - 18
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_2006_18_2_a8/
LA  - ru
ID  - DM_2006_18_2_a8
ER  - 
%0 Journal Article
%A F. M. Malyshev
%A E. V. Kutyreva
%T On the distribution of the number of ones in a Boolean Pascal's triangle
%J Diskretnaya Matematika
%D 2006
%P 123-131
%V 18
%N 2
%U http://geodesic.mathdoc.fr/item/DM_2006_18_2_a8/
%G ru
%F DM_2006_18_2_a8
F. M. Malyshev; E. V. Kutyreva. On the distribution of the number of ones in a Boolean Pascal's triangle. Diskretnaya Matematika, Tome 18 (2006) no. 2, pp. 123-131. http://geodesic.mathdoc.fr/item/DM_2006_18_2_a8/

[1] Malyshev F. M., Kutyreva E. V., “Ob odnom svoistve bulevykh analogov treugolnika Paskalya”, Obozrenie prikladnoi i promyshlennoi matematiki, 11:2 (2004), 245–246

[2] Barbe A., “Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2”, Discrete Appl. Math., 105 (2000), 1–38 | DOI | MR | Zbl

[3] Crespo C., Ponteville Ch., de Spinadel V. W., “Divisibility cellular automata”, Chaos Solitons Fractals, 6 (1995), 105–112 | DOI | MR | Zbl

[4] Marañon G. Á., Encinas L. H., del Rey Á. M., Sharing secret color images using cellular automata with memory, http://arxiv.org/abs/cs/0312034

[5] Wolfram S., Cellular automata as simple self-organizing systems, Caltech preprint CALT-68-938, 1982 | MR

[6] Wolfram S., “Cellular automata”, Los Alamos Sci., 9 (1983), 2–21 | MR

[7] Wolfram S., “Statistical mechanics of cellular automata”, Rev. Mod. Phys., 55 (1983), 601–644 | DOI | MR

[8] Wolfram S., “Universality and complexity in cellular automata”, Physica D, 10 (1984), 1–35 | DOI | MR

[9] Wolfram S., Martin O., Odlyzko A. M., “Algebraic properties of cellular automata”, Comm. Math. Phys., 93 (1984), 219–258 | DOI | MR | Zbl

[10] Wolfram S., “Computation theory of cellular automata”, Comm. Math. Phys., 96 (1984), 15–57 | DOI | MR | Zbl

[11] Wolfram S., “Twenty problems in the theory of cellular automata”, Physica Scripta, T9 (1985), 170–183 | DOI | MR | Zbl

[12] Wolfram S., Theory and Applications of Cellular Automata, World Scientific, Singapore, 1986 | MR | Zbl

[13] Wolfram S., “Cryptography with cellular automata”, Lecture Notes Computer Sci., 218, 1986, 429–432