English
Related papers

Related papers: Algorithmic construction of representations of fin…

200 papers

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

Group Theory · Mathematics 2008-10-03 Martin R. Bridson

We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…

Representation Theory · Mathematics 2021-08-24 Yury A. Neretin

Let us consider the group $G = < x,y \mid x^m = y^n>$ with $m$ and $n$ nonzero integers. In this paper, we study the variety of epresentations $R(G)$ and the character variety $X(G)$ in $SL(2,\C)$ of the group $G$,obtaining by elementary…

Algebraic Geometry · Mathematics 2009-09-29 Jorge Martin-Morales , Antonio M. Oller-Marcen

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

Combinatorics · Mathematics 2019-11-22 Carmelo Cisto , Manuel Delgado , Pedro A. García-Sánchez

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

General Mathematics · Mathematics 2007-05-23 G. Bergdolt

We investigate the finite soluble groups $G$ with the following property (replacement property): for every irredundant generating set $\{g_1,\dots,g_m\}$ of maximal size and for any $1\neq g\in G$ there exists an $i\in \{1,\dots,m\}$ so…

Group Theory · Mathematics 2017-10-31 A. Lucchini

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…

Data Structures and Algorithms · Computer Science 2014-12-02 David J. Rosenbaum

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

Commutative Algebra · Mathematics 2025-06-18 Martin Kreuzer , Florian Walsh

Using our recent results on eigenvalues of invariants associated to the Lie superalgebra gl(m|n), we use characteristic identities to derive explicit matrix element formulae for all gl(m|n) generators, particularly non-elementary…

Mathematical Physics · Physics 2015-06-17 Mark D. Gould , Phillip S. Isaac , Jason L. Werry

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

Group Theory · Mathematics 2014-10-29 Eloisa Detomi , Andrea Lucchini , Colva M. Roney-Dougal

We compute the rank of the group of central units in the integral group ring $\Z G$ of a finite strongly monomial group $G$. The formula obtained is in terms of the strong Shoda pairs of $G$. Next we construct a virtual basis of the group…

Rings and Algebras · Mathematics 2013-04-25 Eric Jespers , Gabriela Olteanu , Ángel del Río , Inneke Van Gelder

The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent…

Data Structures and Algorithms · Computer Science 2017-04-12 Joshua A. Grochow , Youming Qiao

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…

Group Theory · Mathematics 2017-01-13 Andrea Lucchini

We study lowest-weight irreducible representations of rational Cherednik algebras attached to the complex reflection groups G(m,r,n) in characteristic p. Our approach is mostly from the perspective of commutative algebra. By studying the…

Representation Theory · Mathematics 2015-01-08 Sheela Devadas , Steven V Sam

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X]^G in the case where G is reductive. Furthermore, we address the case where G is connected and…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen , Gregor Kemper

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 study the problem of finding generators for the fundamental group G of a space of the following sort: one removes a family of complex hyperplanes from n dimensional complex vector space, or n dimensional complex hyperbolic space, or the…

Geometric Topology · Mathematics 2016-05-04 Daniel Allcock , Tathagata Basak

For the second fundamental representation of the general linear group over a commutative ring $R$ we construct straightforward and uniform polynomial expressions of elementary generators as products of elementary conjugates of an arbitrary…

Group Theory · Mathematics 2024-05-31 Roman Lubkov

We construct a resolution of irreducible complex representations of the symmetric group $S_n$ by restrictions of representations of $GL_n(\mathbb{C})$ (where $S_n$ is the subgroup of permutation matrices). This categorifies a recent result…

Representation Theory · Mathematics 2018-12-19 Christopher Ryba

A finite group $G$ is coprimely-invariably generated if there exists a set of generators $\{g_1, \ldots, g_d\}$ of $G$ with the property that the orders $|g_1|, \ldots, |g_d|$ are pairwise coprime and that for all $x_1, \ldots, x_d \in G$…

Group Theory · Mathematics 2014-09-04 Eloisa Detomi , Andrea Lucchini