Let $Y,X$ be two sets of size n,m. Let $Y\subset X$. What is the maximal group(in size) $G< Sym(X)$ such that gY=Y imply that $g=1$? Here since I mean that the only permutation which permutes elements of $G Y$ between themselves is identity.
|
2 | added 104 characters in body; deleted 70 characters in body | ||
|
|
||||
|
|
1 |
|
||
Group not leaving subset invariantLet $Y,X$ be two sets of size n,m. Let $Y\subset X$. What is the maximal group(in size) $G< Sym(X)$ such that gY=Y imply that $g=1$? Here since $G
|
||||
