Results 21 to 30 of about 278,863 (274)
The round functions of KASUMI generate the alternating group
Journal of Mathematical Cryptology, 2015 We show that the round functions of the KASUMI block cipher for odd and even round type generate the alternating group on the message space. Moreover, under the assumption of independent round keys, we prove that also the KASUMI two-round functions and ...
Sparr Rüdiger, Wernsdorf Ralph
doaj +1 more source
Trivial source bimodule rings for blocks and p-permutation equivalences [PDF]
, 2009 We associate with any p-block of a finite group a Grothendieck ring of certain p-permutation bimodules. We extend the notion of p-permutation equivalences introduced by Boltje and Xu [4] to source algebras of p-blocks of finite groups.
Linckelmann, M.
core +1 more source
On derangements in simple permutation groups
Forum of Mathematics, SigmaLet $G \leqslant \mathrm {Sym}(\Omega )$ be a finite transitive permutation group and recall that an element in G is a derangement if it has no fixed points on $\Omega $ . Let $\Delta (G)$ be the set of derangements in G and define
Timothy Burness, Marco Fusari
doaj +1 more source
Quasi-permutation Representations of Borel and Parabolic Subgroups of Steinberg's triality groups [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2009 If G is a finite linear group of degree n, that is, a finite group of automor-phisms of an n-dimensional complex vector space, or equivalently, a finite group of non-singular matrices of order n with complex coefficients, we shall say that G is a quasi ...
M. Ghorbany
doaj +1 more source
Base sizes of primitive groups of diagonal type
Forum of Mathematics, Sigma, 2023 Let G be a permutation group on a finite set $\Omega $ . The base size of G is the minimal size of a subset of $\Omega $ with trivial pointwise stabiliser in G. In this paper, we extend earlier work of Fawcett by determining the precise base
Hong Yi Huang
doaj +1 more source
Some Primitive Permutation Groups
Proceedings of the London Mathematical Society, 1985 Let \(\Omega\) be a countable infinite set. A subset \(\Sigma\) of \(\Omega\) is called a moiety iff \(\Sigma\) and \(\Omega\)-\(\Sigma\) are infinite. The following theorem is proved: If G is a primitive permutation group of \(\Omega\) that has no countable orbits on moieties, then G is 2-fold transitive. Furthermore, either G is highly transitive or \
openaire +2 more sources
Permutation groups, partition lattices and block structures
Forum of Mathematics, SigmaLet G be a finite transitive permutation group on $\Omega $ . The G-invariant partitions form a sublattice of the lattice of all partitions of $\Omega $ , having the further property that all its elements are uniform (that is, have all parts ...
Marina Anagnostopoulou-Merkouri +2 more
doaj +1 more source
On the Erdos-Ko-Rado property of finite groups of order a product of three primes
Electronic Journal of Graph Theory and Applications, 2019 Let G be a subgroup of the symmetric group Sn. Then G has the Erdos-Ko-Rado (EKR) property, if the size of any intersecting subset of G is bounded above by the size of a point stabilizer of G.
Modjtaba Ghorbani, Mina Rajabi-Parsa
doaj +1 more source
Application of a permutation group on sasirangan pattern
Desimal, 2021 A permutation group is a group of all permutations of some set. If the set that forms a permutation group is the n-first of natural number, then a permutation group is called a symmetry group.
Na'imah Hijriati +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neuroblastoma is the most common extracranial solid tumor in early childhood. Its clinical behavior is highly variable, ranging from spontaneous regression to fatal outcome despite intensive treatment. The International Society of Pediatric Oncology Europe Neuroblastoma Group (SIOPEN) Radiology and Nuclear Medicine Specialty Committees ...
Annemieke Littooij +11 more
wiley +1 more source