Tactical configurations and their generic ring (Q1115448): Difference between revisions

The author presents some new arguments for the proof of the Feit-Higman theorem [\textit{W. Feit} and \textit{G. Higman}, J. Algebra 1, 114-131 (1964; Zbl 0126.053)] in the context of tactical configurations. Further he shows what combinatorial data are necessary to determine the representations associated with a given configuration. The possible representations fall into three types. The author finds a bound for the size of certain configurations for which one of the three types fails to occur and for which the first bit of combinatorial data is sufficiently large.