Results 21 to 30 of about 5,522,853 (247)
The primitive 𝑝-Frobenius groups [PDF]
Let p p be a fixed prime. A finite primitive permutation group
Fleischmann, P. +2 more
openaire +2 more sources
Most primitive groups are full automorphism groups of edge-transitive hypergraphs [PDF]
We prove that, for a primitive permutation group G acting on a set X of size n, other than the alternating group, the probability that Aut (X,YG) = G for a random subset Y of X, tends to 1 as n → ∞.
Cameron, Peter Jephson +2 more
core +1 more source
On base sizes for symmetric groups [PDF]
A base of a permutation group G on a set is a subset B of such that the pointwise stabilizer of B in G is trivial. The base size of G, denoted by b(G), is the minimal cardinality of a base.
Guralnick, Robert M. +2 more
core +2 more sources
We consider some conditions for imprimitivity of irreducible representations of a metebelian group $G$ of finite rank over a field $k$. We shoved that in the case where $char\; k = p > 0$ these conditions strongly depend on existence of infinite $p ...
A.V. Tushev
doaj +1 more source
Ansai peasant paintings: inheritance of Chinese primitive culture and primitive philosophy
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
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
Most switching classes with primitive automorphism groups contain graphs with trivial groups [PDF]
The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and non-edges between X and its complement, leaving the rest of the graph unchanged.
Cameron, Peter Jephson, Spiga, Pablo
core +2 more sources
On the order of primitive groups. IV [PDF]
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
A cryptographic primitive based on hidden-order groups
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
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

