Results 21 to 30 of about 71,897 (268)

Extremely primitive groups

open access: yesGroups, Geometry, and Dynamics, 2007
A primitive permutation group is called extremely primitive if a point stabilizer acts primitively on each of its orbits. We prove that finite extremely primitive groups are of affine type or almost simple. Moreover, we determine the affine type examples up to finitely many exceptions.
Mann, Avinoam   +2 more
openaire   +3 more sources

Ansai peasant paintings: inheritance of Chinese primitive culture and primitive philosophy

open access: yesTrans/Form/Ação, 2023
Chinese primitive philosophy, as the unity of cosmological ontology, epistemology and methodology of the Chinese philosophical system, is a complete and mature philosophical system formed in the late primitive society as early as before the Xia, Shang ...
Yaqian Chang   +3 more
doaj   +1 more source

On the order of primitive groups. IV [PDF]

open access: yesTransactions of the American Mathematical Society, 1915
1. The last result under the above title was to the effect that a primitive group G of class greater than 3 which contains a substitution of prime order p and of degree qp, p > 2q 2, and q > 1, is of degree less than or equal to qp + 4q 4, and that p2 does not divide its order. t Of course it is probable that this limit is higher than need be.
openaire   +2 more sources

Primitive Permutation Groups with Primitive Jordan Sets

open access: yesJournal of the London Mathematical Society, 1996
Let \(\Omega\) be a set and \(G\) a group of permutations of \(\Omega\). A subset \(\Sigma\) of \(\Omega\) is said to be a Jordan set (for \(G\) in \(\Omega\)) if \(|\Sigma|>1\) and there is a subgroup \(H\) of \(G\) that is transitive on \(\Sigma\) and fixes the complement \(\Omega\setminus\Sigma\) pointwise.
Adeleke, SA, Neumann, P
openaire   +1 more source

A cryptographic primitive based on hidden-order groups

open access: yesJournal of Mathematical Cryptology, 2009
Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known.
Saxena Amitabh, Soh Ben
doaj   +1 more source

The Unipotency of the Free Group with Linear Representation of Dimension 11

open access: yesJournal of Harbin University of Science and Technology, 2022
For the unipotent problem of binary-generated free groups, the new trace equations are obtained by intensive study of combinatorial properties of the primitive element of the binary-generated free groups.
YANG Xin-song, XIA Xiao-dan
doaj   +1 more source

2-closures of primitive permutation groups of holomorph type

open access: yesOpen Mathematics, 2019
The 2-closure G(2) of a permutation group G on a finite set Ω is the largest subgroup of Sym(Ω) which has the same orbits as G in the induced action on Ω × Ω.
Yu Xue, Pan Jiangmin
doaj   +1 more source

Covering monolithic groups with proper subgroups [PDF]

open access: yesInternational Journal of Group Theory, 2013
Given a finite non-cyclic group $G$, call $sigma(G)$ the smallest number of proper subgroups of $G$ needed to cover $G$. Lucchini and Detomi conjectured that if a nonabelian group $G$ is such that $sigma(G) < sigma(G/N)$ for every non-trivial normal ...
Martino Garonzi
doaj  

The Sum of a Finite Group of Weights of a Hopf Algebra

open access: yesAxioms, 2012
Motivated by the orthogonality relations for irreducible characters of a finite group, we evaluate the sum of a finite group of linear characters of a Hopf algebra, at all grouplike and skew-primitive elements.
Apoorva Khare
doaj   +1 more source

Whitehead groups of exchange rings with primitive factors artinian

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2001
We show that if R is an exchange ring with primitive factors artinian then K1(R)≅U(R)/V(R), where U(R) is the group of units of R and V(R) is the subgroup generated by {(1+ab)(1+ba)−1|a,b∈R   with   1+ab∈U(R)}.
Huanyin Chen, Fu-an Li
doaj   +1 more source

Home - About - Disclaimer - Privacy