Results 1 to 10 of about 20,496,262 (209)
ON THE GENERATING GRAPH OF A SIMPLE GROUP [PDF]
Journal of the Australian Mathematical Society, 2016 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
Simple group fMRI modeling and inference. [PDF]
Neuroimage, 2009 While many advanced mixed-effects models have been proposed and are used in fMRI, the simplest, ordinary least squares (OLS), is still the one that is most widely used. A survey of 90 papers found that 92% of group fMRI analyses used OLS.
Mumford JA, Nichols T.
europepmc +2 more sources
Classifying cubic symmetric graphs of order 52p2; pp. 55–60 [PDF]
Proceedings of the Estonian Academy of Sciences, 2023 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]
International Conference on Machine Learning, 2023 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
A NEW CHARACTERIZATION OF SIMPLE GROUP G 2 (q) WHERE q ⩽ 11 [PDF]
Journal of Algebraic Systems, 2020 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
Mathematics, 2021 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]
AUT Journal of Mathematics and Computing, 2023 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
Basic 3-Transpositions of the Symplectic Group Sp(2n, 2) [PDF]
Advances in Group Theory and Applications, 2021 In this paper we aim to study maximal pairwise commuting sets of 3-transpositions (transvections) of the simple symplectic group Sp(2n, 2), and to construct designs from these sets.
Jamshid Moori
doaj +1 more source
On the nilpotency of the solvable radical of a finite group isospectral to a simple group [PDF]
Journal of group theroy, 2019 We refer to the set of the orders of elements of a finite group as its spectrum and say that groups are isospectral if their spectra coincide. We prove that, except for one specific case, the solvable radical of a nonsolvable finite group isospectral to ...
N. Yang +2 more
semanticscholar +1 more source
On the uniform domination number of a finite simple group [PDF]
Transactions of the American Mathematical Society, 2017 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