中文
相关论文

相关论文: The Classification Problem for Simple Unital Finit…

200 篇论文

We consider groups of finite Morley rank with solvable local subgroups of even and mixed types. We also consider miscellaneous aspects of small groups of finite Morley rank of odd type.

群论 · 数学 2008-09-15 Adrien Deloro , Eric Jaligot

Let $L$ be one of the finite simple classical groups $L_8(q)$, $U_8(q)$, $O_{10}^+(q)$, $O_{10}^-(q)$ or $O_{12}^+(q)$, with $q$ odd. We prove that every finite group having the same set of element orders as $L$ is an almost simple group…

群论 · 数学 2026-04-06 Maria A. Grechkoseeva , Vladislav M. Rodionov

We refer to the set of the orders of elements of a finite group as its spectrum and say that finite groups are isospectral if their spectra coincide. In the paper we determine all finite groups isospectral to the simple groups $S_6(q)$,…

群论 · 数学 2021-09-14 M. A. Grechkoseeva , A. V. Vasil'ev , M. A. Zvezdina

After a historical discussion of classical uniformisation results for Riemann surfaces, of problems appearing in higher dimensions, and of uniformisation results for projective manifolds with trivial or ample canonical bundle, we introduce…

代数几何 · 数学 2019-02-22 Daniel Greb , Stefan Kebekus , Behrouz Taji

By an $\ell$-group $G$ we mean a lattice-ordered abelian group. This paper is concerned with the category $\FP$ of finitely presented {\it unital} $\ell$-groups, those $\ell$-groups having a distinguished order-unit $u$. Using the duality…

组合数学 · 数学 2012-02-28 Leonardo Manuel Cabrer

Bell and Zhang have shown that if $A$ and $B$ are two connected graded algebras finitely generated in degree one that are isomorphic as ungraded algebras, then they are isomorphic as graded algebras. We exploit this result to solve the…

量子代数 · 数学 2018-05-16 Jason Gaddis

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

逻辑 · 数学 2021-01-20 Christian Herrmann

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…

环与代数 · 数学 2007-05-23 U. D. Bekbaev , I. S. Rakhimov

Greg Hjorth and Simon Thomas proved that the classification problem for torsion-free abelian groups of finite rank \emph{strictly increases} in complexity with the rank. Subsequently, Thomas proved that the complexity of the classification…

逻辑 · 数学 2019-08-16 Samuel Coskey

We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…

逻辑 · 数学 2020-01-09 Kyle Beserra , Samuel Coskey

We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…

逻辑 · 数学 2024-05-22 Maciej Malicki

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

计算机科学中的逻辑 · 计算机科学 2021-11-24 Jendrik Brachter , Pascal Schweitzer

We show that the classification of simple finite group schemes over an algebraically closed field reduces to the classification of abstract simple finite groups and of simple restricted Lie algebras in positive characteristic. Both these…

代数几何 · 数学 2015-03-13 Filippo Viviani

Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…

表示论 · 数学 2019-10-15 Gabriella D'Este , Fatma Kaynarca , Derya Keskin Tütüncü

In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…

表示论 · 数学 2026-02-24 Frank Lübeck

The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…

最优化与控制 · 数学 2016-11-08 Shin-ichi Tanigawa

For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…

形式语言与自动机理论 · 计算机科学 2021-10-01 Viktor Henriksson , Manfred Kufleitner

For a class of expanding maps with neutral singularities we prove the validity of a finite rank approximation scheme for the analysis of Sinai-Ruelle-Bowen measures. Earlier results of this sort were known only in the case of hyperbolic…

动力系统 · 数学 2007-09-18 Michael Blank

Let $(X,x)$ be a pointed geometrically connected smooth projective variety over a sub-$p$-adic field $K$. For any given rank $n$, we prove that there are only finitely many isomorphism classes of representations…

代数几何 · 数学 2026-04-23 Xiaodong Yi

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

群论 · 数学 2014-03-24 Goulnara Arzhantseva , Jean-Francois Lafont , Ashot Minasyan