Results 11 to 20 of about 89,011,091 (196)

Quarter-BPS states, multi-symmetric functions and set partitions

Journal of High Energy Physics, 2021
We give a construction of general holomorphic quarter BPS operators in N $$ \mathcal{N} $$ = 4 SYM at weak coupling with U(N) gauge group at finite N. The construction employs the Möbius inversion formula for set partitions, applied to multi-symmetric ...
Christopher Lewis-Brown, Sanjaye Ramgoolam   +1 more
doaj   +1 more source

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

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, Cameron, P., Gadouleau, Maximilien, Cameron, Peter Jephson, Gadouleau, M., Cameron, Peter, Fairbairn, Ben, Cameron, P.J., Peter J. Cameron, Ben Fairbairn, Gadoleau, M.   +10 more
core   +4 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., Giudici, Michael, Robert A. Wilson, Wilson, R.A., Wilson, Robert, Timothy C. Burness, Wilson, Robert A., Burness, Tim C, Burness, Timothy C., Burness, T.C., Michael Giudici   +10 more
core   +2 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, Holt, Derek, Roney-Dougal, Colva M., Colva M. Roney-dougal, Holt, Derek F., Roney-Dougal, Colva Mary   +5 more
core   +1 more source

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

Automorphisms of Some Magmas of Order $k+k^2$

Известия Иркутского государственного университета: Серия "Математика", 2018
This paper is devoted to the study of automorphisms of finite magmas and to the representation of the symmetric permutation group $ S_k $ and some of its subgroups by automorphism groups of finite magmas.
A.V. Litavrin
doaj   +1 more source

Endotrivial modules for finite groups of Lie type. [PDF]

, 2006
We classify the endotrivial modules for all finite groups of Lie type in defining ...
Mazza, Nadia, Nakano, Daniel, Carlson, Jon   +2 more
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, Cameron, P. J., Babai, László   +2 more
core   +1 more source

Totally -closed finite groups with trivial Fitting subgroup

Bulletin of Mathematical Sciences
A finite permutation group [Formula: see text] is called [Formula: see text]-closed if [Formula: see text] is the largest subgroup of [Formula: see text] which leaves invariant each of the [Formula: see text]-orbits for the induced action on [Formula ...
Majid Arezoomand, Mohammad A. Iranmanesh, Cheryl E. Praeger, Gareth Tracey   +3 more
doaj   +1 more source