نتایج جستجو برای: to denote
تعداد نتایج: 10616995 فیلتر نتایج به سال:
let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...
For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.
Let $G$ be a finite group and $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. In this paper, all nilpotent groups $G$ with $nu(G)=3$ are classified.
this page was created using nitro pdf trial software. to purchase, go to http://www.nitropdf.com/ this page was created using nitro pdf trial software. to purchase, go to http://www.nitropdf.com/ this page was created using nitro pdf trial software. to purchase, go to http://www.nitropdf.com/ this page was created using nitro pdf trial software. to purchase, go to http://www.nitropdf.com...
Let $I$ denote an ideal of a Noetherian ring $R$. The purpose of this article is to introduce the concepts of quintasymptotic sequences over $I$ and quintasymptotic cograde of $I$, and to show that they play a role analogous to quintessential sequences over $I$ and quintessential cograde of $I$. We show that, if $R$ is local, then the quintasymptotic cograde of $I$ is una...
for any group g, let c(g) denote the set of centralizers of g.we say that a group g has n centralizers (g is a cn-group) if |c(g)| = n.in this note, we prove that every finite cn-group with n ≤ 21 is soluble andthis estimate is sharp. moreover, we prove that every finite cn-group with|g| < 30n+1519 is non-nilpotent soluble. this result gives a partial answer to aconjecture raised by a. ashrafi in ...
for two given graphs g1 and g2, the ramseynumber r(g1,g2) is the smallest integer n such that for anygraph g of order n, either $g$ contains g1 or the complementof g contains g2. let tn denote a tree of order n andwm a wheel of order m+1. to the best of our knowledge, only r(tn,wm) with small wheels are known.in this paper, we show that r(tn,wm)=3n-2 for odd m with n>756m^{10}.
for a finite group G, we denote by p(G) the minimal degree of faithful permutation representations of G, and denote by c(G), the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field C. In this paper we will assume that, G is a p-group of exponent p and class 2, where p is prime and cd(G) = {1, |G : Z(G)|^1/2}. Then we will s...
in this paper, the reduced dierential transform method is investigated fora nonlinear partial dierential equation modeling nematic liquid crystals, itis called the hunter-saxton equation. the main advantage of this methodis that it can be applied directly to nonlinear dierential equations withoutrequiring linearization, discretization, or perturbation. it is a semi analytical-numerical metho...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید