نتایج جستجو برای: solvable
تعداد نتایج: 11273 فیلتر نتایج به سال:
we describe under various conditions abelian subgroups of the automorphism group $mathrm{aut}(t_{n})$ of the regular $n$-ary tree $t_{n}$, which are normalized by the $n$-ary adding machine $tau =(e, dots, e,tau )sigma _{tau }$ where $sigma _{tau }$ is the $n$-cycle $left( 0,1, dots, n-1right) $. as an application, for $n=p$ a prime number, and for $n=4$, we prove that...
the concept of the bipartite divisor graph for integer subsets has been considered in [graph combinator., 26 (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g$ is a solvable group, then the number of connected components of this graph is at most $2$ and if $g...
In this paper we prove that a finite group $G$ having at most three conjugacy classes of non-normal non-abelian proper subgroups is always solvable except for $Gcong{rm{A_5}}$, which extends Theorem 3.3 in [Some sufficient conditions on the number of non-abelian subgroups of a finite group to be solvable, Acta Math. Sinica (English Series) 27 (2011) 891--896.]. Moreover, we s...
let $s$ be a subset of a finite group $g$. the bi-cayley graph ${rm bcay}(g,s)$ of $g$ with respect to $s$ is an undirected graph with vertex set $gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin g, sin s}$. a bi-cayley graph ${rm bcay}(g,s)$ is called a bci-graph if for any bi-cayley graph ${rm bcay}(g,t)$, whenever ${rm bcay}(g,s)cong {rm bcay}(g,t)$ we have $t=gs^alpha$ for some $...
let $g$ be a finite group. we say that the derived covering number of $g$ is finite if and only if there exists a positive integer $n$ such that $c^n=g'$ for all non-central conjugacy classes $c$ of $g$. in this paper we characterize solvable groups $g$ in which the derived covering number is finite.
We define an obstruction for a knot to be ?[?]-homology ribbon, and use this provide restrictions on the integers that can occur as triple linking numbers of derivative links knots are either homotopy ribbon or doubly slice. Our main application finds new non-doubly slice knots. In particular, gives information solvable filtration Taehee Kim: algebraically need not (1)-solvable, (0.5, 1)-solvab...
in this paper, we verify the solvability of free product of finite cyclic groups with topological methods. we use cayley graphs and everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. in particular, using these methods, we prove that the commutator subgroup of $mathbb{z}_{m}*mathbb{z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید