Linear closures of finite geometries

DOI10.1007/S00022-016-0322-6zbMATH Open1365.05038OpenAlexW2290750645MaRDI QIDQ506949FDOQ506949

Authors: Wolfgang D. Knapp 

Publication date: 2 February 2017

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-016-0322-6

Recommendations

• Line-closed combinatorial geometries
• scientific article; zbMATH DE number 7006781
• Extensions of line-closed combinatorial geometries
• The geometry of complete linear maps
• scientific article; zbMATH DE number 1368682
• scientific article; zbMATH DE number 863482
• scientific article; zbMATH DE number 3257050
• Finite geometries
• scientific article; zbMATH DE number 749974
• Closed linear relations and their regular points

zbMATH Keywords

graphblock designautomorphism groupdigraphfinite geometrylinear codepermutation groupHamming weighttactical configurationadjacency geometryincidence structure

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of block designs (05B05) Combinatorial aspects of finite geometries (05B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial codes (94B25) Applications of graph theory to circuits and networks (94C15) Group actions on combinatorial structures (05E18) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications of design theory to circuits and networks (94C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dale Mesner, Higman \& Sims, and the strongly regular graph with parameters \((100,22,0,6)\)
• Binary codes of strongly regular graphs
• Codes with prescribed permutation group
• On the codes related to the Higman-Sims graph
• Self-orthogonal Steiner systems and projective planes
• Title not available (Why is that?)

Cited In (3)

• DESARGUESIAN CLOSURE OF BINOMIAL GRAPHS
• Title not available (Why is that?)
• Finite linear spaces in which any n-gon is Euclidean

Uses Software

• GAP

This page was built for publication: Linear closures of finite geometries

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