Results 1 to 10 of about 22,743,371 (384)
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$.
A. Lucchini +2 more
semanticscholar +4 more sources
Classifying cubic symmetric graphs of order 52p2; pp. 55–60 [PDF]
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular.
Shangjing Hao, Shixun Lin
doaj +1 more source
Simple and Fast Group Robustness by Automatic Feature Reweighting [PDF]
A major challenge to out-of-distribution generalization is reliance on spurious features -- patterns that are predictive of the class label in the training data distribution, but not causally related to the target.
Shi Qiu +3 more
semanticscholar +1 more source
Simple groups contain minimal simple groups [PDF]
It is a consequence of the classification of finite simple groups that every non-abelian simple group contains a subgroup which is a minimal simple group.
Barry, M. J. J., Ward, M. B.
openaire +6 more sources
A NEW CHARACTERIZATION OF SIMPLE GROUP G 2 (q) WHERE q ⩽ 11 [PDF]
Let G be a finite group , in this paper using the order and largest element order of G we show that every finite group with the same order and largest element order as G 2 (q), where q ⩽ 11 is necessarily isomorphic to the group G 2 (q)
M. Bibak +2 more
doaj +1 more source
A 2-arc Transitive Hexavalent Nonnormal Cayley Graph on A119
A Cayley graph Γ=Cay(G,S) is said to be normal if the base group G is normal in AutΓ. The concept of the normality of Cayley graphs was first proposed by M.Y.
Bo Ling, Wanting Li, Bengong Lou
doaj +1 more source
Reduced designs constructed by Key-Moori Method $2$ and their connection with Method $3$ [PDF]
For a 1-$(v,k,\lambda)$ design $\mathcal{D}$ containing a point $x$, we study the set $I_x$, the intersection of all blocks of $\mathcal{D}$ containing $x$.
Amin Saeidi
doaj +1 more source
On the uniform domination number of a finite simple group [PDF]
Let $G$ be a finite simple group. By a theorem of Guralnick and Kantor, $G$ contains a conjugacy class $C$ such that for each non-identity element $x \in G$, there exists $y \in C$ with $G = \langle x,y\rangle$. Building on this deep result, we introduce
Timothy C. Burness, Scott Harper
semanticscholar +1 more source
Symmetric graphs of valency seven and their basic normal quotient graphs
We characterize seven valent symmetric graphs of order 2pqn2p{q}^{n} with ...
Pan Jiangmin, Huang Junjie, Wang Chao
doaj +1 more source
A finitely presented infinite simple group of homeomorphisms of the circle [PDF]
We construct a finitely presented, infinite, simple group that acts by homeomorphisms on the circle, but does not admit a non‐trivial action by C1 ‐diffeomorphisms on the circle. This is the first such example.
Y. Lodha
semanticscholar +1 more source

