Boolean analogues of the Pascal triangle with maximal possible number of ones

DOI10.1515/DMA-2021-0029MaRDI QIDQ2064374zbMATH OpenOpenAlexFDO

Authors F. M. Malyshev

Publication date 5 January 2022

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2021-0029

zbMATH Keywords

\((0, 1)\)-matricesextremal combinatorial configurations

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Recommendations

• Distribution of the extreme values of the number of ones in Boolean analogues of the Pascal triangle
• On the distribution of the number of ones in a Boolean Pascal's triangle
• scientific article; zbMATH DE number 2235054
• Steinhaus triangles with generalized Pascal addition
• Periodic balanced binary triangles

Cites work

• Bases of recurrent sequences
• Basises of integers under the multiplace shift operations
• Distribution of the extreme values of the number of ones in Boolean analogues of the Pascal triangle
• On the distribution of the number of ones in a Boolean Pascal's triangle

Cited in

(3)

• Distribution of the extreme values of the number of ones in Boolean analogues of the Pascal triangle
• On the distribution of the number of ones in a Boolean Pascal's triangle
• scientific article; zbMATH DE number 2235054 (Why is no real title available?)

This page was built for publication: Boolean analogues of the Pascal triangle with maximal possible number of ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064374)