相关论文: Algorithmic construction of representations of fin…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

In this paper, we consider the construction of irreducible representations of finite pattern groups in terms of Panov's associative polarization, which is a finite-field analogue of Kirillov's orbital method. Using this construction, first,…

We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups

For a finite group $G$, let $LC(G)$ be the subgroup generated by elements $x$ such that, for all $y \in G$ and all integers $n$, the order of $x^n y$ divides the least common multiple of the orders of $x$ and $y$. This subgroup is a…

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

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…

To a finite dimensional representation of a complex Lie group $G$, an associative algebra of adjoint covariant polynomial maps from the direct sum of $m$ copies of the Lie algebra $\mathfrak{g}$ of $G$ into an algebra of complex matrices is…

Our aim is to transfer several foundational results from the modular representation theory of finite groups to the wider context of profinite groups. We are thus interested in profinite modules over the completed group algebra k[[G]] of a…

Continuing earlier work, we show how to realize irreducible finite-dimensional representations of the complex group of type $G_2$ via tableaux, along the way exhibiting explicit generators of the defining ideal of the flag variety

Invariant theory provides more efficient tools, such as Molien generating functions and integrity bases, than basic group theory, that relies on projector techniques for the construction of symmetry--adapted polynomials in the symmetry…

In this paper, we study matricial representations of certain finitely presented groups with N-generators of order-2. As an application, we consider a group algebra under our representations. Specifically, we characterize the inverses of all…

In this article, we construct affine group schemes $GL(X)$ where $X$ is any object in the Verlinde category in characteristic $p$ and classify their irreducible representations. We begin by showing that for a simple object $X$ of…

In this note we study sets of normal generators of finitely presented residually $p$-finite groups. We show that if an infinite, finitely presented, residually $p$-finite group $G$ is normally generated by $g_1,\dots,g_k$ with order…

In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…

For $G$ a finite group, one way to construct irreducible quandle representations over $\mathbb{C}$ of the conjugacy quandle $Conj(G)$ is by taking the product of an irreducible linear group representation of $G$ by what we call a quandle…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

In quasi-Monte Carlo methods, generating high-dimensional low discrepancy sequences by generator matrices is a popular and efficient approach. Historically, constructing or finding such generator matrices has been a hard problem. In…

We construct real and complex matrices in terms of Kronecker products of a Witt basis of 2n null vectors in the geometric algebra over the real and complex numbers. In this basis, every matrix is represented by a unique sum of products of…