On some locally 3-transposition graphs
Let ∑_n^ε be the graph defined on the (+)- points of an n-dimensional GF(3)-space carrying a nondegenerate symmetric bilinear form with discriminant ε, points are adjacent if they are perpendicular. We prove that if ε = 1, n ≥ 6 (resp.ε=-1,n≥7) then ∑_(n+1)^εis the unique connected locally ∑_n^ε gra...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/97315 http://hdl.handle.net/10220/6955 |
| _version_ | 1826109748016054272 |
|---|---|
| author | Pasechnik, Dmitrii V. |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Pasechnik, Dmitrii V. |
| author_sort | Pasechnik, Dmitrii V. |
| collection | NTU |
| description | Let ∑_n^ε be the graph defined on the (+)- points of an n-dimensional GF(3)-space carrying a nondegenerate symmetric bilinear form with discriminant ε, points are adjacent if they are perpendicular. We prove that if ε = 1, n ≥ 6 (resp.ε=-1,n≥7) then ∑_(n+1)^εis the unique connected locally ∑_n^ε graph. One may view this result as a characterization of a class of c^k. C_2-geometries (or 3-transposition groups). We briefly discuss an application of the result to a characterization of Fischer's sporadic groups. |
| first_indexed | 2024-10-01T02:23:24Z |
| format | Conference Paper |
| id | ntu-10356/97315 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T02:23:24Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | ntu-10356/973152023-02-28T19:17:02Z On some locally 3-transposition graphs Pasechnik, Dmitrii V. School of Physical and Mathematical Sciences Finite Geometry and Combinatorics (2nd : 1993 : Deinze, Belgian) DRNTU::Science::Mathematics::Geometry Let ∑_n^ε be the graph defined on the (+)- points of an n-dimensional GF(3)-space carrying a nondegenerate symmetric bilinear form with discriminant ε, points are adjacent if they are perpendicular. We prove that if ε = 1, n ≥ 6 (resp.ε=-1,n≥7) then ∑_(n+1)^εis the unique connected locally ∑_n^ε graph. One may view this result as a characterization of a class of c^k. C_2-geometries (or 3-transposition groups). We briefly discuss an application of the result to a characterization of Fischer's sporadic groups. Published version 2011-08-11T02:56:56Z 2019-12-06T19:41:25Z 2011-08-11T02:56:56Z 2019-12-06T19:41:25Z 1993 1993 Conference Paper Pasechnik, D. V. (1993). On some locally 3-transposition graphs. The Second International Conference at Deinze, pp. 319-326. https://hdl.handle.net/10356/97315 http://hdl.handle.net/10220/6955 10.1017/CBO9780511526336.030 en © 1993 Cambridge University Press. This paper was published in Finite geometry and combinatorics and is made available as an electronic reprint (preprint) with permission of Cambridge University Press. The paper can be found at the following DOI: http://dx.doi.org/10.1017/CBO9780511526336.030. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. application/pdf |
| spellingShingle | DRNTU::Science::Mathematics::Geometry Pasechnik, Dmitrii V. On some locally 3-transposition graphs |
| title | On some locally 3-transposition graphs |
| title_full | On some locally 3-transposition graphs |
| title_fullStr | On some locally 3-transposition graphs |
| title_full_unstemmed | On some locally 3-transposition graphs |
| title_short | On some locally 3-transposition graphs |
| title_sort | on some locally 3 transposition graphs |
| topic | DRNTU::Science::Mathematics::Geometry |
| url | https://hdl.handle.net/10356/97315 http://hdl.handle.net/10220/6955 |
| work_keys_str_mv | AT pasechnikdmitriiv onsomelocally3transpositiongraphs |