<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>02223873</id>
  <dt>j</dt>
  <an>02223873</an>
  <augroup>
    <au>Kobayashi, Yuji</au>
  </augroup>
  <ti>Undecidability of the centers of groups and group algebras.</ti>
  <so>Arch. Math. 85, No. 3, 227-232 (2005).</so>
  <py>2005</py>
  <pu>Birkh\"auser Verlag (Springer), Basel</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>group algebras</ut>
    <ut>word problem</ut>
    <ut>algorithms</ut>
    <ut>centers</ut>
    <ut>finitely presented groups</ut>
    <ut>monoid algebras</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s00013-005-1235-z</li>
  </ligroup>
  <abgroup>
    <ab>The main result of the article says that for any fixed integer $k>2$ (or $k=\infty$) and a field $K$, there exists a recursive family $\{G_n\}_{n\in\bbfN}$ of finitely presented groups with trivial centers such that each $G_n$ has solvable word problem, the dimension $d(n)$ of the center of the group algebra $KG_n$ equals either $k$ or $1$, and it is undecidable for a given $n$ whether $d(n)=1$ or $d(n)=k$. The author also discusses other (un)decidability questions related to the centers of groups, monoids and the centers of their group (monoid) algebras.</ab>
    <rv>Michael Dokuchaev (Murcia)</rv>
  </abgroup>
</item>