English
Related papers

Related papers: Computability of dimension groups

200 papers

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

Rings and Algebras · Mathematics 2025-01-06 Ahmed Zahari Abdou , Bouzid Mosbahi

Given a symmetrizable generalized Cartan matrix $A$, for any index $k$, one can define an automorphism associated with $A,$ of the field $\mathbf{Q}(u_1, >..., u_n)$ of rational functions of $n$ independent indeterminates $u_1,..., u_n.$ It…

Representation Theory · Mathematics 2015-06-26 Bin Zhu

For a finite group $G$, the representation dimension is the smallest integer realizable as the degree of a complex faithful representation of $G$. In this article, we compute representation dimension for some $p$-groups, their direct…

Group Theory · Mathematics 2023-08-04 Gurleen Kaur , Amit Kulshrestha , Anupam Singh

We introduce a dimension group for a self-similar map as the ${\rm K}_0$-group of the core of the $C^*$-algebra associated with the self-similar map together with the canonical endomorphism. The key step for the computation is an explicit…

Operator Algebras · Mathematics 2018-03-26 Tsuyoshi Kajiwara , Yasuo Watatani

We show that locally solvable subgroups of PLo(I) are countable. Then for each countable ordered set, we construct a locally solvable subgroup of Thompson's Group F. We develop machinery for understanding embeddings from solvable subgroups…

Group Theory · Mathematics 2018-05-23 Amanda Taylor

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu

Let G be a countable group. We proof that there is a model companion for the approximate theory of a Hilbert space with a group G of automorphisms. We show that G is amenable if and only if the structure induced by countable copies of the…

Logic · Mathematics 2007-05-23 Alexander Berenstein

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

Number Theory · Mathematics 2022-11-03 Chun Yin Hui

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

Group Theory · Mathematics 2019-05-13 W. A. de Graaf , A. S. Detinko , D. L. Flannery

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Group Theory · Mathematics 2026-03-10 Saveliy V. Skresanov

A dimension group is an ordered abelian group that is an inductive limit of a sequence of simplicial groups, and a stationary dimension group is such an inductive limit in which the homomorphism is the same at every stage. If a simple…

Group Theory · Mathematics 2015-07-14 Gregory R. Maloney

We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…

Complex Variables · Mathematics 2017-03-21 Cristobal Rojas , Michael Yampolsky

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

Information Theory · Computer Science 2022-08-16 Kenneth M. Mackenthun

We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…

Representation Theory · Mathematics 2018-03-06 Vladimir V. Kornyak

An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…

Representation Theory · Mathematics 2015-06-18 Ted Hurley

The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…

Group Theory · Mathematics 2022-06-14 Jane Gilman

Isomorphisms are constructed between generalized Schur algebras in different degrees. The construction covers both the classical case (of general linear groups over infinite fields of arbitrary characteristic) and the quantized case (in…

Representation Theory · Mathematics 2007-08-31 Ming Fang , Anne Henke , Steffen Koenig

Given a group G and a G-module A, we show how to determine up to isomorphism the extensions E of A by G so that A embeds as smallest non-trivial term of the derived series or of the lower central series into E.

Group Theory · Mathematics 2014-04-17 Andreas Distler , Bettina Eick

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Commutative Algebra · Mathematics 2014-01-25 Markus Lange-Hegermann

Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…

Symbolic Computation · Computer Science 2016-08-11 Jérémy Berthomieu , Jean-Charles Faugère , Ludovic Perret
‹ Prev 1 3 4 5 6 7 10 Next ›