نتایج جستجو برای: finite rank

تعداد نتایج: 326062  

2017
Tuna Altinel Jeffrey Burdges Olivier Frécon MORLEY RANK

We prove that generous non-nilpotent Borel subgroups of connected minimal simple groups of finite Morley rank are self-normalizing. We use this to introduce a uniform approach to the analysis of connected minimal simple groups of finite Morley rank through a case division incorporating four mutually exclusive classes of groups. We use these to analyze Carter subgroups and Weyl groups in connect...

2012
MORLEY RANK

We prove that generous non-nilpotent Borel subgroups of connected minimal simple groups of finite Morley rank are self-normalizing. We use this to introduce a uniform approach to the analysis of connected minimal simple groups of finite Morley rank through a case division incorporating four mutually exclusive classes of groups. We use these to analyze Carter subgroups and Weyl groups in connect...

Journal: :Proceedings of the Edinburgh Mathematical Society 2021

Abstract We study the structure and compute stable rank of $C^{*}$ -algebras finite higher-rank graphs. completely determine -algebra when $k$ -graph either contains no cycle with an entrance or is cofinal. also exactly which finite, locally convex -graphs yield unital stably -algebras. give several examples to illustrate our results.

2005
JEFFREY BURDGES

There is a longstanding conjecture, due to Gregory Cherlin and Boris Zilber, that all simple groups of finite Morley rank are simple algebraic groups. The most successful approach to this conjecture has been Borovik’s program analyzing a minimal counterexample, or simple K-group. We show that a simple K-group of finite Morley rank and odd type is either aalgebraic of else has Prufer rank at mos...

2015
Alessandro Facchini Filip Murlak Michal Skrzypczak

Game automata are known to recognise languages arbitrarily high in both the non-deterministic and alternating Rabin–Mostowski index hierarchies. Recently it was shown that for this class both hierarchies are decidable. Here we complete the picture by showing that the weak index hierarchy is decidable as well. We also provide a procedure computing for a game automaton an equivalent weak alternat...

Journal: :J. Logic & Analysis 2010
Olivier Frécon

We exhibit counterexamples to a Conjecture of Nesin, since we build a connected solvable group with finite center and of finite Morley rank in which no normal nilpotent subgroup has a nilpotent complement. The main result says that each centerless connected solvable group G of finite Morley has a normal nilpotent subgroup U and an abelian subgroup T such that G = U o T , if and only if, for any...

Journal: :Linear Algebra and its Applications 1992

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید