Searcharxiv⌕ Search

arXiv subjects

Tuna Altınel

Publications and source records attributed to Tuna Altınel.

7 recordsLinked to original sources
arXiv2025

Bounding the degree of generic sharp transitivity

We show that a generically sharply $t$-transitive permutation group of finite Morley rank on a set of rank $r$ satisfies $t\le r+2$ provided the pointwise stabilizer of a generic $(t-1)$-tuple is an $L$-group, which holds, for example, when this stabilizer is solvable or when $r\le 5$. This makes progress on the Borovik-Cherlin conjecture that every generically $(r+2)$-transitive permutation group of finite Morley rank on a set of rank $r$ is of the form $\operatorname{PGL}_{r+1}(F)$ acting naturally on $\mathbb{P}^r(F)$. Our proof is assembled from three key ingredients that are independent of the main theorem - these address actions of $\operatorname{Alt}(n)$ on $L$-groups of finite Morley rank, generically $2$-transitive actions with abelian point stabilizers, and simple groups of rank $6$.

math.GR↗
arXiv2023

Actions of $\operatorname{Alt}(n)$ on groups of finite Morley rank without involutions

We investigate faithful representations of $\operatorname{Alt}(n)$ as automorphisms of a connected group $G$ of finite Morley rank. We target a lower bound of $n$ on the rank of such a nonsolvable $G$, and our main result achieves this in the case when $G$ is without involutions. In the course of our analysis, we also prove a corresponding bound for solvable $G$ by leveraging recent results on the abelian case. We conclude with an application towards establishing natural limits to the degree of generic transitivity for permutation groups of finite Morley rank.

math.GR↗
arXiv2018

Towards the recognition of $\operatorname{PGL}_n$ via a high degree of generic transitivity

In 2008, Borovik and Cherlin posed the problem of showing that the degree of generic transitivity of an infinite permutation group of finite Morley rank $(X,G)$ is at most $n+2$ where $n$ is the Morley rank of $X$. Moreover, they conjectured that the bound is only achieved (assuming transitivity) by $\operatorname{PGL}_{n+1}(\mathbb{F})$ acting naturally on projective $n$-space. We solve the problem under the two additional hypotheses that (1) $(X,G)$ is $2$-transitive, and (2) $(X-\{x\},G_x)$ has a definable quotient equivalent to $(\mathbb{P}^{n-1}(\mathbb{F}),\operatorname{PGL}_{n}(\mathbb{F}))$. The latter hypothesis drives the construction of the underlying projective geometry and is at the heart of an inductive approach to the main problem.

math.LO↗
arXiv2009

Interpretation of the Arithmetic in certain groups of piecewise affine permutations of an interval

The Arithmetic is interpreted in all the groups of Richard Thompson and Graham Higman, as well as in other groups of piecewise affine permutations of an interval which generalize the groups of Thompson and Higman. In particular, the elementary theories of all these groups are undecidable. Moreover, Thompson's group $F$ and some of its generalizations interpret the Arithmetic without parameters.

math.GR↗
arXiv2009

Interprétation de l'Arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle

The Arithmetic is interpreted in all the groups of Richard Thompson and Graham Higman, as well as in other groups of piecewise affine permutations of an interval which generalize the groups of Thompson and Higman. In particular, the elementary theories of all these groups are undecidable. Moreover, Thompson's group $F$ and some of its generalizations interpret the Arithmetic without parameters.

math.LO↗