English
Related papers

Related papers: Algorithmic construction of representations of fin…

200 papers

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…

Group Theory · Mathematics 2019-05-31 S. P. Glasby

In this paper we determine the irreducible projective representations of sporadic simple groups over an arbitrary algebraically closed field F, whose image contains an almost cyclic matrix of prime-power order. A matrix M is called cyclic…

Representation Theory · Mathematics 2012-10-24 L. Di Martino , M. A. Pellegrini , A. E. Zalesski

The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…

Representation Theory · Mathematics 2018-11-30 Valdemar V. Tsanov

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…

Logic in Computer Science · Computer Science 2019-01-18 Ziyuan Gao , Sanjay Jain , Bakhadyr Khoussainov , Wei Li , Alexander Melnikov , Karen Seidel , Frank Stephan

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

Computational Complexity · Computer Science 2025-06-05 Chin Ho Lee , Emanuele Viola

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…

Group Theory · Mathematics 2015-09-17 Rostislav Grigorchuk , Konstantin Medynets

In this paper subcentral (resp., central) idempotent series and composition subcentral (resp., central) idempotent series in an inverse semigroup are introduced and investigated. It is shown that if $S=EG$ is a factorizable inverse monoids…

Group Theory · Mathematics 2024-12-30 Dong-lin Lei , Jin-xing Zhao , Xian-zhong Zhao

If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be…

Group Theory · Mathematics 2008-04-04 S. Liriano S. Majewicz

In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…

Representation Theory · Mathematics 2024-12-30 Anatolii V. Tushev

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

Group Theory · Mathematics 2009-11-04 Joao Araujo , J. D. Mitchell , Csaba Schneider

A subset $\left\{x_{1},x_{2},\hdots,x_{d}\right\}$ of a group $G$ \emph{invariably generates} $G$ if $\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$ generates $G$ for every $d$-tuple $(g_{1},g_{2}\hdots,g_{d})\in G^{d}$.…

Group Theory · Mathematics 2018-01-31 Gareth M. Tracey

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 construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

Group Theory · Mathematics 2015-10-27 Anton A. Klyachko , Ayrana K. Mongush

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

Group Theory · Mathematics 2007-05-23 Inna Bumagin , Olga Kharlampovich , Alexei Miasnikov

We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…

Group Theory · Mathematics 2016-07-18 Bettina Eick , Max Horn

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

Group Theory · Mathematics 2007-05-23 Seymour Bachmuth

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Group Theory · Mathematics 2020-09-22 Vitaly Roman'kov

We study a family of complex representations of the group GL(n,O), where O is the ring of integers of a non-archimedean local field F. These representations occur in the restriction of the Grassmann representation of GL(n,F) to its maximal…

Representation Theory · Mathematics 2012-10-08 Uri Bader , Uri Onn

Schur multiplier $M(G)$ of a finite group $G$ has been studied heavily. To proceed further to the study of projective (or spin) representations of $G$ and their characters (called spin characters), it is necessary to construct explicitly a…

Representation Theory · Mathematics 2024-07-12 Takeshi Hirai , Itsumi Mikami , Tatsuya Tsurii , Satoe Yamanaka

A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…

Classical Analysis and ODEs · Mathematics 2019-06-18 K. S. Kazarian