Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 97 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 36 tok/s
GPT-5 High 34 tok/s Pro
GPT-4o 91 tok/s
GPT OSS 120B 462 tok/s Pro
Kimi K2 217 tok/s Pro
2000 character limit reached

Counting the Number of Centralizers of 2-Element Subsets in a Finite Group (2003.04146v1)

Published 9 Mar 2020 in math.GR

Abstract: Suppose $G$ is a finite group. The set of all centralizers of $2-$element subsets of $G$ is denoted by $2-Cent(G)$. A group $G$ is called $(2,n)-$centralizer if $|2-Cent(G)| = n$ and primitive $(2,n)-$centralizer if $|2-Cent(G)| = |2-Cent(\frac{G}{Z(G)})| = n$, where $Z(G)$ denotes the center of $G$. The aim of this paper is to present the main properties of $(2,n)-$centralizer groups among them a characterization of $(2,n)-$centralizer and primitive $(2,n)-$centralizer groups, $n \leq 9$, are given.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.