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

Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called {\it…

A method is described which identifies a wide variety of AF algebra dimension groups with groups of continuous functions. Since the continuous functions in these groups have domains which correspond to the set of all infinite paths in what…

We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

The notion of isomorphism of stable AF-C*-algebras is considered in this paper in the case when the corresponding Bratteli diagram is stationary, i.e., is associated with a single square primitive nonsingular incidence matrix.…

We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…

The problem of classifying all short multiplets of superconformal algebras still seems to be an open question. A generic short multiplet is non-unitary, which nevertheless is of interest in various contexts. Even if one is interested in…

We discuss the notion of essential dimension of a finite group and explain its relation with birational algebraic geometry. We show how this leads to a (partial) classification of simple finite groups of essential dimension less than or…

We consider classification problems for manifolds and discrete subgroups of Lie groups from a descriptive set-theoretic point of view. This work is largely foundational in conception and character, recording both a framework for general…

We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…

We classify, up to isomorphism, all gradings by an arbitrary abelian group on simple finitary Lie algebras of linear transformations (special linear, orthogonal and symplectic) on infinite-dimensional vector spaces over an algebraically…

Several structural results about permutation groups of finite rank definable in differentially closed fields of characteristic zero (and other similar theories) are obtained. In particular, it is shown that every finite rank definably…

We introduce a geometric invariant, called finite decomposition complexity (FDC), to study topological rigidity of manifolds. We prove for instance that if the fundamental group of a compact aspherical manifold M has FDC, and if N is…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…

This is an expository paper about the Borel complexity of structure and classification theorems. It sorts several classical problems relative to known benchmarks of complexity. As a corollary various problems proposed by people such as von…