Related papers: Computability of dimension groups

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

To any trace preserving action $\sigma: G \curvearrowright A$ of a countable discrete group on a finite von Neumann algebra $A$ and any orthogonal representation $\pi:G \to \mathcal O(\ell^2_{\mathbb{R}}(G))$, we associate the generalized…

The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…

Let M be a surface (possibly nonorientable) with punctures and/or boundary components. The paper is a study of ``geometric subgroups'' of the mapping class group of M, that is subgroups corresponding to inclusions of subsurfaces (possibly…

We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a…

Let X be a normal complex algebraic variety, and p a prime. We show that there exists an integer N=N(X, p) such that: any non-trivial, irreducible representation of the fundamental group of X, which arises from geometry, must be non-trivial…

We investigate the notions of amenability and its related homological notions for a class of $I\times I$-upper triangular matrix algebra, say $UP(I,A)$, where $A$ is a Banach algebra equipped with a non-zero character. We show that…

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…

Let X be a proper hyperbolic geodesic metric space and let G be a closed subgroup of the isometry group Iso(X) of X. We show that if G is not amenable then its second continuous bounded cohomology group with coefficients the regular…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Answering a question of J. Rosenberg, we construct the first examples of infinite characters on $GL_n(\mathbf{K})$ for a global field $\mathbf{K}$ and $n\geq 2.$ The case $n=2$ is deduced from the following more general result. Let $G$ a…

Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…

This paper concerns the enumeration of isomorphism classes of modules of a polynomial algebra in several variables over a finite field. This is the same as the classification of commuting tuples of matrices over a finite field up to…

Let $G$ be a finite group isomorphic to $SL_n(q)$ or $SU_n(q)$ for some prime power $q$. In this paper, we give an explicit description of the action of automorphisms of $G$ on the set of its irreducible complex characters. This is done by…

In this paper we analyze the structure of some subalgebras of quantized enveloping algebras corresponding to unipotent and solvable subgroups of a simple Lie group G. These algebras have the non--commutative structure of iterated algebras…

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

Assume that $A_{1},...,A_{s}$ are complex $n\times n$ matrices. We give a computable criterion for existence of a common eigenvector of $A_{i}$ which generalize the result of D. Shemesh established for two matrices. We use this criterion to…

Given a computably locally compact Polish space $M$, we show that its 1-point compactification $M^*$ is computably compact. Then, for a computably locally compact group $G$, we show that the Chabauty space $\mathcal S(G)$ of closed…