Results 31 to 40 of about 6,465,245 (340)
Recognition by degree prime-power graph and order of some characteristically simple groups [PDF]
In this paper, by the order of a group and triviality of $O_p(G)$ for some prime $p$, we give a new characterization for some characteristically simple groups. In fact, we prove that if {$p \in \{5, 17, 23, 37, 47, 73\}$ and $n \leqslant p$, where $n$ is
Afsane Bahri +2 more
doaj +1 more source
The minimum sum of element orders of finite groups [PDF]
Let $ G $ be a finite group and \( \psi(G)=\sum_{g\in G}o(g) \), where $ o(g) $ denotes the order of $g\in G$. We show that the Conjecture 4.6.5 posed in [Group Theory and Computation, (2018) 59-90], is incorrect.
Maghsoud Jahani +3 more
doaj +1 more source
ON THE GENERATING GRAPH OF A SIMPLE GROUP [PDF]
The generating graph $\unicode[STIX]{x1D6E4}(H)$ of a finite group $H$ is the graph defined on the elements of $H$, with an edge between two vertices if and only if they generate $H$. We show that if $H$ is a sufficiently large simple group with $\unicode[STIX]{x1D6E4}(G)\cong \unicode[STIX]{x1D6E4}(H)$ for a finite group $G$, then $G\cong H$.
LUCCHINI, ANDREA +2 more
openaire +3 more sources
Simple Viscous Flows: from Boundary Layers to the Renormalization Group [PDF]
The seemingly simple problem of determining the drag on a body moving through a very viscous fluid has, for over 150 years, been a source of theoretical confusion, mathematical paradoxes, and experimental artifacts, primarily arising from the complex ...
Allen, H. S. +48 more
core +2 more sources
Groups and simple languages [PDF]
With any finitely generated presentation (pi) = of a group G, one can associate a formal language WP(,0)((pi)), the reduced word problem of (pi), consisting of all words on the generators and their inverses which are equal to the identity of G but have no proper prefix equal to the identity.
openaire +2 more sources
A lower bound on the number of finite simple groups
Let S(n ...
Michael E. Mays
doaj +1 more source
ON THE PRIME GRAPH OF SIMPLE GROUPS [PDF]
AbstractLet $G$ be a finite group, let ${\it\pi}(G)$ be the set of prime divisors of $|G|$ and let ${\rm\Gamma}(G)$ be the prime graph of $G$. This graph has vertex set ${\it\pi}(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an element of order $rs$.
Burness, Tim C, Covato, Elisa
openaire +3 more sources
Quasirecognition by prime graph of U_3(q) where 2 < q =p^{alpha} < 100 [PDF]
Let G be a finite group and let Gamma(G) be the prime graphof G. Assume 2 < q = p^{alpha} < 100 . We determine finite groupsG such that Gamma(G) = Gamma(U_3(q)) and prove that if q neq3, 5, 9, 17, then U_3(q) is quasirecognizable by prime graph,i.e., if ...
Ali Iranmanesh +3 more
doaj
Simple relations in the Cremona group
We give a simple set of generators and relations for the Cremona group of the plane. Namely, we show that the Cremona group is the amalgamated product of the de Jonqui\`eres group with the group of automorphisms of the plane, divided by one relation ...
Blanc, Jérémy
core +1 more source
On the Fundamental Group of a Simple Lie Group [PDF]
Let G be a simply connected simple Lie group and C the center of G, which is isomorphic with the fundamental group of the adjoint group of G. For an element c of C, an element x of the Lie algebra g of G is called a representative of c in g if exp x = c.
openaire +3 more sources

