Related papers: Groups definable in Presburger arithmetic

We complete the description of group gradings on finite-dimensional incidence algebras. Moreover, we classify the finite-dimensional graded algebras that can be realized as incidence algebras endowed with a group grading.

The finite groups having an indecomposable polynomial invariant whose degree is at least half of the order of the group are classified. Apart from four sporadic exceptions these are exactly the groups having a cyclic subgroup of index at…

The groups distinguish their von Neumann algebras, in the case when these are factors.

Using graph-theoretic techniques for f.g. subgroups of $F^{\mathbb{Z}[t]}$ we provide a criterion for a f.g. subgroup of a f.g. fully residually free group to be of finite index. Moreover, we show that this criterion can be checked…

We study locally definable abelian groups $\CU$ in various settings and examine conditions under which the quotient of $\CU$ by a discrete subgroup might be definable. This turns out to be related to the existence of the type-definable…

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

For a dependent theory T, in C_T for every type definable group G, the intersection of type definable subgroups with bounded index is a type definable subgroup with bounded index.

We compute Euler characteristics of p-subgroup categories of finite groups

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…

It is known that a group G definable in the field of p-adic numbers is definably locally isomorphic to the group of Q_p-points of a connected algebraic group H defined over Q_p. We show that if H is commutative then G is…

A characterization of the maximal abelian sub-algebras of matrix algebras that are normalized by the canonical representation of a finite Heisenberg group is given. Examples are constructed using a classification result for finite…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

Computations in the cohomology of finite groups.

In this paper, we classify the finite simple groups with an abelian Sylow subgroup.

Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…

Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by this approach. In this paper, we prove an upper bound on the the…

We consider abelain subgroups of small index in finite groups. More generally, we consider subgroups such that the product of their index by the index of their centralizer is small.