2019/07/22 by Krzysztof Prażmowski, Prażmowski, Krzysztof
Engineering · Computer Science · Mathematics · #graph theory and CDMA systems #Coding theory and cryptography #Finite Group Theory Research
paper · pdf · doi:10.48550/arxiv.1907.09165
An elegant procedure which characterizes a decomposition of some class of binomial configurations into two other, resembling a definition of Pascal's Triangle, was given in \citegevay. In essence, this construction was already presented in \citeperspect. We show that such a procedure is a result of fixing in configurations in some class \mathcal K suitable hyperplanes which both: are in this class, and deleting such a hyperplane results in a configuration in this class. By a way of example we show two more (added to that of \citegevay) natural classes of such configurations, discuss some other, and propose some open questions that seem also natural in this context.