Non-split linear sharply 2-transitive groups
نویسندگان
چکیده
We give examples of countable linear groups $\Gamma < \operatorname {SL}_{{\mathbf {3}}}({\mathbf {R}})$, with no nontrivial normal abelian subgroups, that admit a faithful sharply $2$-transitive action on set. Without the linearity assumption, such were recently constructed by Rips, Segev, and Tent in [J. Eur. Math. Soc. 19 (2017), pp. 2895â??2910]. Our are permutational characteristic $2$, sense involutions do not fix point action.
منابع مشابه
Sharply 2-transitive groups
We give an explicit construction of sharply 2-transitive groups with fixed point free involutions and without nontrivial abelian normal subgroup.
متن کاملSharply 3-transitive groups
We construct the first sharply 3-transitive groups not arising from a near field, i.e. point stabilizers have no nontrivial abelian normal subgroup.
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملSharply 2-transitive groups of projectivities in generalized polygons
The group of projectivities of (a line of) a projective plane is always 3-transitive. It is well known that the projective planes with a sharply 3-transitive group of projectivities are classi/ed: they are precisely the Pappian projective planes. It is also well known that the group of projectivities of a generalized polygon is 2-transitive. Here, we classify all generalized quadrangles, all /n...
متن کاملSimple tournaments and sharply transitive groups
If the relation E is transitive, i.e., if (x, y) E E and (y, z) E E imply that (x, z) E E, we speak of a transitive tournament or a total order. Clearly (Z, <) is a total order. We tend to visualize tournaments by considering every edge (x, y) E E as an arrow leading from x to y. In this sense every tournament can also be considered as a complete graph in which every edge is oriented in some di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2021
ISSN: ['2330-1511']
DOI: https://doi.org/10.1090/proc/15360