نتایج جستجو برای: characterizable group‎

تعداد نتایج: 979331  

2016
Shitian Liu Zhanghua Zhang

Let [Formula: see text] be an alternating group of degree n. We know that [Formula: see text] is 2-fold OD-characterizable and [Formula: see text] is 6-fold OD-characterizable. In this note, we first show that [Formula: see text] and [Formula: see text] are 14-fold and 7-fold OD-characterizable, respectively, and second show that certain groups [Formula: see text] with that [Formula: see text] ...

M. R. Darafsheh P. Nosratpour,

Let $L := U_3(11)$. In this article, we classify groups with the same order and degree pattern as an almost simple group related to $L$. In fact, we prove that $L$, $L:2$ and $L:3$ are OD-characterizable, and $L:S_3$ is $5$-fold OD-characterizable.

Journal: :journal of linear and topological algebra (jlta) 2012
p nosratpour m.r darafsheh

let l := u3(11). in this article, we classify groups with the same order and degree pattern as an almost simple group related to l. in fact, we prove that l, l:2 and l:3 are od-characterizable, and l:s3 is 5-fold od-characterizable.

Journal: :transactions on combinatorics 2012
mohammad reza darafsheh pedram yousefzadeh

the non commuting graph of a non-abelian finite group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we prove some new results about this graph. in particular we will give a new proof of theorem 3.24 of [2]. we also prove that if $g_1$, $g_2$, ..., $...

Journal: :Notre Dame Journal of Formal Logic 2014
Ioannis A. Souldatos

Building on [4], [8] and [9] we study which cardinals are characterizable by a Scott sentence, in the sense that φM characterizes κ, if it has a model of size κ, but not of κ. We show that if אα is characterizable by a Scott sentence and β < ω1, then אα+β is characterizable by a Scott sentence. If 0 < γ < ω1, then the same is true for 2אα+γ . Also, אא0 α is characterizable by a Scott sentence. ...

Let $G$ be a finite group and $pi_{e}(G)$ be the set of orders of all elements in $G$. The set $pi_{e}(G)$ determines the prime graph (or Grunberg-Kegel graph) $Gamma(G)$ whose vertex set is $pi(G)$, the set of primes dividing the order of $G$, and two vertices $p$ and $q$ are adjacent if and only if $pqinpi_{e}(G)$. The degree $deg(p)$ of a vertex $pin pi(G)$, is the number of edges incident...

Journal: :CoRR 2012
Wei Mao Matthew Thill Babak Hassibi

It is well known that there is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from a finite group and n of its subgroups [1]. However, if one restricts attention to abelian groups then not all entropy vectors can be obtained. This is an explanation for the fact shown by Dougherty et al [2] that lin...

2012
Wei Mao Matthew Thill Babak Hassibi

It is well known that there is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from a finite group and n of its subgroups [1]. However, if one restricts attention to abelian groups then not all entropy vectors can be obtained. This is an explanation for the fact shown by Dougherty et al [2] that lin...

Journal: :CoRR 2014
Markus Lange-Hegermann

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it decides equality of characterizable differential ideals contained in each other.

Journal: :J. Symb. Comput. 2008
Oleg Golubitsky

We call a differential ideal universally characterizable, if it is characterizable w.r.t. any ranking on partial derivatives. We propose a factorization-free algorithm that represents a radical differential ideal as a finite intersection of universally characterizable ideals. The algorithm also constructs a universal characteristic set for each universally characterizable component, i.e., a fin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید