Results 11 to 20 of about 82,404,384 (192)
The Dade group of a fusion system. [PDF]
, 2009 We define the notion of the Dade group of a fusion system and show that some of the gluing and detection results for Dade groups of finite p-groups due to Bouc and Thévenaz in [S. Bouc and J. Thévenaz. Gluing torsion endo-permutation modules. (Preprint.)]
Mazza, Nadia, Linckelmann, Markus
core +5 more sources
Prime order derangements in primitive permutation groups [PDF]
, 2011 Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|.
Giudici, M. +10 more
core +2 more sources
Computing in permutation groups without memory [PDF]
, 2013 Funding: UK Engineering and Physical Sciences Research Council (EP/K033956/1)Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory.
Maximilien Gadouleau +10 more
core +4 more sources
Minimal and random generation of permutation and matrix groups [PDF]
, 2012 We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases.
Derek F. Holt +5 more
core +1 more source
The group of endotrivial modules for the symmetric and alternating groups. [PDF]
, 2010 We complete a classification of the groups of endotrivial modules for the modular group algebras of symmetric groups and alternating groups. We show that, for n ≥ p2, the torsion subgroup of the group of endotrivial modules for the symmetric groups is ...
Mazza, Nadia, Hemmer, Dave, Carlson, Jon
core +4 more sources
On base sizes for symmetric groups [PDF]
, 2011 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. +7 more
core +2 more sources
Topics in computational group theory : primitive permutation groups and matrix group normalisers [PDF]
, 2012 Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each O'Nan-Scott class.
Coutts, Hannah Jane
core +2 more sources
Endo-permutation modules as sources of simple modules. [PDF]
, 2003 The source of a simple $kG$-module, for a finite $p$-solvable group $G$ and an algebraically closed field $k$ of prime characteristic $p$, is an endo-permutation module (see~\cite{Pu1} or~\cite{Th}). L.
Mazza, Nadia
core +4 more sources
Most primitive groups are full automorphism groups of edge-transitive hypergraphs [PDF]
, 2014 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
Permutation inference for the general linear model [PDF]
, 2014 Permutation methods can provide exact control of false positives and allow the use of non-standard statistics, making only weak assumptions about the data.
Winkler, Anderson +13 more
core +1 more source