Related papers: Coset enumeration for certain infinitely presented…
A Coxeter group admits infinite-dimensional irreducible complex representations if and only if it is not finite or affine. In this paper, we provide a construction of some of those representations for certain Coxeter groups using some…
Let $K$ be a commutative Noetherian ring with identity, let $A$ be a $K$-algebra, and let $B$ be a subalgebra of $A$ such that $A/B$ is finitely generated as a $K$-module. The main result of the paper is that $A$ is finitely presented…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…
We give several algorithms addressing computations of intersections of conjugate subgroups.
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…
Given a finitely presented group $G$, Hopf's formula expresses the second integral homology of $G$ in terms of generators and relators. We give an algorithm that exploits Hopf's formula to estimate $H_2(G;k)$, with coefficients in a finite…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
In this article, we classify disconnected reductive groups over an algebraically closed field with a few caveats. Internal parts of our result are both a classification of finite groups and a classification of integral representations of a…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
We present novel constructions concerning the homology of finitely generated groups. Each construction draws on ideas of Gilbert Baumslag. There is a finitely presented acyclic group $U$ such that $U$ has no proper subgroups of finite index…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…
The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…
We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…
We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…
We study the problem of deciding whether or not the image of an irreducible representation of the braid group $\B_3$ of degree $\leq 5$ has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm…
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…
Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…