Results 31 to 40 of about 97,370 (265)
Invariance groups of finite functions and orbit equivalence of permutation groups
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question.
Horváth Eszter K. +3 more
doaj +1 more source
Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles [PDF]
In this paper, we extend upon the results of B. Suceav{u{a}} and R. Stong [Amer. Math. Monthly, 110 (2003) 162--162], which they computed the minimum number of 3-cycles needed to generate an even permutation.
Zohreh Mostaghim +1 more
doaj +1 more source
Information transmission and signal permutation in active flow networks
Recent experiments show that both natural and artificial microswimmers in narrow channel-like geometries will self-organise to form steady, directed flows.
Francis G Woodhouse +2 more
doaj +1 more source
The round functions of KASUMI generate the alternating group
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
On leaf permutative theories and occurrence permutation groups
AbstractLeaf permutative theories contain variable-permuting equations, so that rewriting a term may lead to an exponential number of terms which are only permutations of it. In [1] Avenhaus and Plaisted propose to represent such sets by stratified terms, and to deduce directly with these.
Thierry Boy de la Tour, Mnacho Echenim
openaire +1 more source
Permutation polytopes and indecomposable elements in permutation groups
18 pages. To appear in the Journal of Combinatorial Theory, Series A. A corollary about solvable primitive permutation groups has been added.
Robert M. Guralnick, David Perkinson
openaire +2 more sources
On derangements in simple permutation groups
Let $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
ABSTRACT Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu +8 more
wiley +1 more source
Permutation groups, partition lattices and block structures
Let 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
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

