Covering by Centralizers

Abstract In this paper, we consider covers of finite groups by centralizers of elements. We show that the set of centralizers that are maximal under the partial ordering form a cover of the group. We also show that the set of centralizers that are minimal under the partial ordering form a cover of the group. We show for F -groups that are nonabelian p -groups that the number of distinct nontrivial centralizers is congruent to 1 modulo p .

Authors

Institutions

Publication Details

Journal
Monatshefte für Mathematik
Published
2026-02-17
DOI
https://doi.org/10.1007/s00605-026-02165-7
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Covering by Centralizers

Ryan McCulloch, Mark L. Lewis
Monatshefte für Mathematik
Finite Group Theory Research
article

Covering by Centralizers

Ryan McCulloch, Mark L. Lewis
article en

Abstract

Abstract In this paper, we consider covers of finite groups by centralizers of elements. We show that the set of centralizers that are maximal under the partial ordering form a cover of the group. We also show that the set of centralizers that are minimal under the partial ordering form a cover of the group. We show for F -groups that are nonabelian p -groups that the number of distinct nontrivial centralizers is congruent to 1 modulo p .

Monatshefte für Mathematik
Binghamton University (US), Kent State University (US)
Reduced inequalities
Openalex Percentile: Top 50%
Finite Group Theory Research
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.