Abstract
A characterization of sharply n-transitive sets of permutations or of mappings is given by means of Buekenhout diagrams. As a by-product, a characterization is obtained in the same style for finite Minkowski and Laguerre planes. Two preliminary results are used to obtain these diagram-theoretic descriptions. One of them gives us a characterization of the complement of a square lattice graph by means of the nonexistence of certain configurations. The other one states that every net of degree s + 1 with s + 2 points on each line is embeddable in a projective plane of order s + 2. This latter result is exploited to get control over the geometries appearing as rank 2 residues on top in the diagrams we consider. Next, we can use the earlier result to obtain the information we need on the point-graphs of the geometries we want to describe.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
