Block-transitive \(2-(v,5,\lambda)\) designs with sporadic socle

<p>This paper contributes to the classification of non-trivial <span class="math inline">\(2\)</span>-designs with block size <span class="math inline">\(5\)</span> admitting a block-transitive automorphism group. Let <span class="math inline">\({\cal D=(P,B)}\)</span> be a non-trivial 2-<span class="math inline">\((v,5,\lambda)\)</span> design and <span class="math inline">\(G\)</span> be a block-transitive automorphism group of <span class="math inline">\(\mathcal{D}\)</span>. The main aim of this paper is to determine all pairs <span class="math inline">\((\mathcal{D},G)\)</span> when Soc(<span class="math inline">\(G\)</span>) is a sporadic simple group.</p>

Authors

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-09-28
DOI
https://doi.org/10.61091/jcmcc127-10
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Block-transitive \(2-(v,5,\lambda)\) designs with sporadic socle

Chao Lei, Xiaoqin Zhan
Journal of Combinatorial Mathematics and Combinatorial Computing
graph theory and CDMA systems
article

Block-transitive \(2-(v,5,\lambda)\) designs with sporadic socle

Chao Lei, Xiaoqin Zhan
article en

Abstract

<p>This paper contributes to the classification of non-trivial <span class="math inline">\(2\)</span>-designs with block size <span class="math inline">\(5\)</span> admitting a block-transitive automorphism group. Let <span class="math inline">\({\cal D=(P,B)}\)</span> be a non-trivial 2-<span class="math inline">\((v,5,\lambda)\)</span> design and <span class="math inline">\(G\)</span> be a block-transitive automorphism group of <span class="math inline">\(\mathcal{D}\)</span>. The main aim of this paper is to determine all pairs <span class="math inline">\((\mathcal{D},G)\)</span> when Soc(<span class="math inline">\(G\)</span>) is a sporadic simple group.</p>

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 127
Openalex Percentile: Top 74%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.