J. Wiscons

activity

20142024

most citedA reduction theorem for primitive binary permutation groups

9 citations · 16 across the 9 of their papers we have counts for

collaborators

Showing math.GRShow all

6 papers · 1 filter

math.GR2024

Bounding the degree of generic sharp transitivity

Tuna Altınel, Joshua Wiscons

We show that a generically sharply $t$ -transitive permutation group of finite Morley rank on a set of rank $r$ satisfies $t \leq r + 2$ provided the pointwise stabilizer of a generic $…

math.GR2024

On $Alt (n)$ -modules with an additive dimension when $n \leq 6$

Barry Chin, Adrien Deloro, Joshua Wiscons +1

Working in the general context of "modules with an additive dimension," we complete the determination of the minimal dimension of a faithful Alt(n)-module and classify those module…

math.GR2022

Actions of $Alt (n)$ on groups of finite Morley rank without involutions

Tuna Altınel, Joshua Wiscons

We investigate faithful representations of $Alt (n)$ as automorphisms of a connected group $G$ of finite Morley rank. We target a lower bound of $n$ on the rank of su…

math.GR2021

Sym(n)- and Alt(n)-modules with an additive dimension

Luis Jaime Corredor, Adrien Deloro, Joshua Wiscons

We revisit, clarify, and generalise classical results of Dickson and (much later) Wagner on minimal Sym(n)- and Alt(n)-modules. We present a new, natural notion of 'modules with an…

math.GR2015★ 9 cited

A reduction theorem for primitive binary permutation groups

Joshua Wiscons

A permutation group $(X, G)$ is said to be binary, or of relational complexity $2$ , if for all $n$ , the orbits of $G$ (acting diagonally) on $X^{2}$ determine the orbits of $G$ on $X^…

math.GR2014★ 1 cited

Moufang sets of finite Morley rank of odd type