Results 11 to 20 of about 278,863 (274)
Non-Nudgable Subgroups of Permutations [PDF]
Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is called non-nudgable,
Netzer, Tim
core +2 more sources
Fixed Point Polynomials of Permutation Groups [PDF]
In this paper we study, given a group $G$ of permutations of a finite set, the so-called fixed point polynomial $\sum_{i=0}^{n}f_{i}x^{i}$, where $f_{i}$ is the number of permutations in $G$ which have exactly $i$ fixed points.
Harden, CM, Penman, DB
core +1 more source
Minimal generation of transitive permutation groups [PDF]
It is proved in [21] that there is a constant $c$ such that each transitive permutation group of degree $d\ge 2$ can be generated by $\lfloor cd/\sqrt{\log{d}}\rfloor$ elements. In this paper, we explicitly estimate $c$
Tracey, Gareth M.
core +2 more sources
Cubic Cayleygraphs with small diameter. [PDF]
In this paper we apply Polya's Theorem to the problem of enumerating Cayley graphs on permutation groups up to isomorphisms induced by conjugacy in the symmetric group.
Eugene Curtin
doaj +2 more sources
Normalizers of Primitive Permutation Groups [PDF]
Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size.
Guralnick, Robert M. +2 more
core +2 more sources
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
Permutation 2-groups I: structure and splitness [PDF]
By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group.
Elgueta, Josep
core +3 more sources
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
Transitive permutation groups of prime-squared degree [PDF]
We explicitly determine all of the transitive groups of degree p-squared, p a prime, whose Sylow p-subgroup is not the wreath product of two cyclic groups of order p.
Dobson, Edward, Witte, Dave
core +2 more sources
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

