Searcharxiv⌕ Search

arXiv subjects

A. R. Ashrafi

Publications and source records attributed to A. R. Ashrafi.

10 recordsLinked to original sources
arXiv2021

Normal Subgyrogroups of Certain Gyrogroups

Suppose that $(T,\star)$ is a groupoid with a left identity such that each element $a\in T$ has a left inverse. Then $T$ is called a \textit{gyrogroup} if and only if $(i)$ there exists a function $gyr:T\times T\longrightarrow Aut(T)$ such that for all $a,b,c\in T$, $a\star(b\star c)= (a\star b)\star gyr[a,b]c$, where $gyr[a,b]c=gyr(a,b)(c)$; and $(ii)$ for all $a,b\in T$, $gyr[a,b]=gyr[a\star b,b]$. In this paper, the structure of normal subgyrogroups of certain gyrogroups are investigated.

math.GR↗
arXiv2021

Counting Centralizers of a Finite Group with an Application in Constructing the Commuting Conjugacy Class Graph

The set of all centralizers of elements in a finite group $G$ is denoted by $Cent(G)$ and $G$ is called $n-$centralizer if $|Cent(G)| = n$. In this paper, the structure of centralizers in a non-abelian finite group $G$ with this property that $\frac{G}{Z(G)} \cong Z_{p^2} \rtimes Z_{p^2}$ is obtained. As a consequence, it is proved that such a group has exactly $[(p+1)^2+1]$ element centralizers and the structure of the commuting conjugacy class graph of $G$ is completely determined.

math.GR↗
arXiv2020

Construction of New Gyrogroups and the Structure of their Subgyrogroups

Suppose that $G$ is a groupoid with binary operation $\otimes$. The pair $(G,\otimes)$ is said to be a gyrogroup if the operation $\otimes$ has a left identity, each element $a \in G$ has a left inverse and the gyroassociative law and the left loop property are satisfied in $G$. In this paper, a method for constructing new gyrogroups from old ones is presented and the structure of subgyrogroups of these gyrogroups are also given. As a consequence of this work, five $2-$gyrogroups of order $2^n$, $n\geq 3$, are presented. Some open questions are also proposed.

math.GR↗
arXiv2020

Counting the Number of Centralizers of 2-Element Subsets in a Finite Group

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.

math.GR↗
arXiv2019

An Algorithm for Constructing All Supercharacter Theories of a Finite Group

In 2008, Diaconis annd Isaacs introduced the notion of a supercharacter theory of a finite group in which supercharacters replace with irreducible characters and superclasses by conjugacy classes. In this paper, we introduce an algorithm for constructing supercharacter theories of a finite group by which all supercharacter theories of groups containing up to 14 conjugacy classes are calculated.

math.GR↗
arXiv2019

The Existence of Minimal Logarithmic Signatures for some Finite Simple Unitary Groups

The $MLS$ conjecture states that every finite simple group has a minimal logarithmic signature. The aim of this paper is proving the existence of a minimal logarithmic signature for some simple unitary groups $PSU_{n}(q)$. We report a gap in the proof of the main result of [H. Hong, L. Wang, Y. Yang, Minimal logarithmic signatures for the unitary group $U_n(q)$, \textit{Des. Codes Cryptogr.} \textbf{77} (1) (2015) 179--191] and present a new proof in some special cases of this result. As a consequence, the $MLS$ conjecture is still open.

math.GR↗
arXiv2019

Laplacian Spectral Determination of Path-Friendship Graphs

A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is known to be the case only for a very few families. In some recent papers it is proved that the friendship graphs and starlike trees are DLS. If a friendship graph and a starlike tree are joined by merging their vertices of degree greater than 2, then the resulting graph is called a path-friendship graph. In this paper, it is proved that the path-friendship graphs are also DLS.

math.CO↗
arXiv2017

The Order Supergraph of the Power Graph of a Finite Group

The power graph $\mathcal{P}(G)$ is a graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph $\mathcal{P}(G)$ is a graph with vertex set $G$ in which two elements $x, y \in G$ are joined if $o(x) | o(y)$ or $o(y) | o(x)$. The purpose of this paper is to study certain properties of this new graph together with the relationship between $\mathcal{P}(G)$ and $\mathcal{S}(G)$.

math.GR↗
arXiv2017

Note on the Number of Finite Groups of a Given Order

Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,ϕ(n)) = 1$, where $ϕ(n)$ and $(a, b)$ denote the Euler's totient function and the greatest common divisor of $a$ and $b$, respectively. The aim of this paper is to first present a new proof for the case of $G(n) = 2$ and then give a solution to the equation of $G(n) = 3$.

math.GR↗