Výsledky vyhledávání - "Azizollah Azad"

Akademický článek

Commutativity Degree of Certain Finite AC-Groups

Autor: Azizollah Azad, Sakineh Rahbariyan

Publikováno v: Mathematics Interdisciplinary Research, Vol 6, Iss 4, Pp 309-317 (2021)

For a finite group G, the probability of two elements of G that commute is the commutativity degree of G denoted by P(G). As a matter of fact, if C = {(a; b) ∈ G×G | ab = ba}, then P(G) = |C|/|G|2 . In this paper, we are going to find few formulas

Externí odkaz: https://doaj.org/article/466e7ea17cab4829851f1cd6f3f5988c

Zobrazit plný text záznamu

Abelian coverings of finite general linear groups and an application to their non-commuting graphs

Autor: Cheryl E. Praeger, Azizollah Azad, Pablo Spiga, Mohammad A. Iranmanesh

Publikováno v: Journal of Algebraic Combinatorics. 34:683-710

In this paper we introduce and study a family An(q) of abelian subgroups of GLn(q) covering every element of GLn(q). We show that An(q) contains all the centralizers of cyclic matrices and equality holds if q > n. For q > 2, we obtain an infinite pro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc7ba209bd5b8af9e8941b2d10d3cde1
https://doi.org/10.1007/s10801-011-0288-2

Zobrazit plný text záznamu

ON NONNILPOTENT SUBSETS IN GENERAL LINEAR GROUPS

Autor: Azizollah Azad

Publikováno v: Bulletin of the Australian Mathematical Society. 83:369-375

Let G be a group. A subset X of G is said to be nonnilpotent if for any two distinct elements x and y in X, 〈x,y〉 is a nonnilpotent subgroup of G. If, for any other nonnilpotent subset X′ in G, ∣X∣≥∣X′ ∣, then X is said to be a maxi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0f7d8c597e1385552b8b5232eca4ec4f
https://doi.org/10.1017/s0004972711002012

Zobrazit plný text záznamu

On the Clique Numbers of Non-commuting Graphs of Certain Groups

Autor: Mohammad Zarrin, Alireza Abdollahi, Azizollah Azad, A. Mohammadi Hassanabadi

Publikováno v: Scopus-Elsevier

Let G be a non-abelian group. The non-commuting graph [Formula: see text] of G is defined as the graph whose vertex set is the non-central elements of G and two vertices are joint if and only if they do not commute. In a finite simple graph Γ, the m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c0e8b975d19f488bd3488a9feb02f6c
https://doi.org/10.1142/s1005386710000581

Zobrazit plný text záznamu

MAXIMAL SUBSETS OF PAIRWISE NONCOMMUTING ELEMENTS OF THREE-DIMENSIONAL GENERAL LINEAR GROUPS

Autor: Azizollah Azad, Cheryl E. Praeger

Publikováno v: Bulletin of the Australian Mathematical Society. 80:91-104

Let G be a group. A subset N of G is a set of pairwise noncommuting elements if xy⁄=yx for any two distinct elements x and y in N. If ∣N∣≥∣M∣ for any other set of pairwise noncommuting elements M in G, then N is said to be a maximal subse

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7e06af87b59c967e23f20cc7b7c0f302
https://doi.org/10.1017/s0004972709000057

Zobrazit plný text záznamu

Nilpotent covers and non-nilpotent subsets of finite groups of Lie type

Autor: Nick Gill, Azizollah Azad, John R. Britnell

Let $G$ be a finite group, and $c$ an element of $\mathbb{Z}\cup \{\infty\}$. A subgroup $H$ of $G$ is said to be {\it $c$-nilpotent} if it is nilpotent, and has nilpotency class at most $c$. A subset $X$ of $G$ is said to be {\it non-$c$-nilpotent}

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12861b83e73391d077df705594cc349c

Zobrazit plný text záznamu

B.H. Neumann's question on ensuring commutativity of finite groups

Autor: Mohammad Zarrin, Azizollah Azad, Alireza Abdollahi, A. Mohammadi Hassanabadi

Publikováno v: Scopus-Elsevier

This paper is an attempt to provide a partial answer to the following question put forward by Bernhard H. Neumann in 2000: “Let G be a finite group of order g and assume that however a set M of m elements and a set N of n elements of the group is c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69cd9793bf8b117cd251a653c2dc4176
http://www.scopus.com/inward/record.url?eid=2-s2.0-33748301913&partnerID=MN8TOARS

Zobrazit plný text záznamu