Skip to main content
added 104 characters in body; deleted 70 characters in body
Source Link
Klim Efremenko
  • 2.2k
  • 15
  • 31

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 $G<Sym(X)$ G acts on $X$ and thus also on subsets Here I mean that the only permutation which permutes elements of $X$$Y$ between themselves is identity.

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 $G<Sym(X)$ G acts on $X$ and thus also on subsets of $X$.

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 I mean that the only permutation which permutes elements of $Y$ between themselves is identity.

Source Link
Klim Efremenko
  • 2.2k
  • 15
  • 31

Group not leaving subset invariant

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 $G<Sym(X)$ G acts on $X$ and thus also on subsets of $X$.