Related papers: Writing representations over minimal fields
We continue the study of glider representations of finite groups $G$ with given structure chain of subgroups $e \subset G_1 \subset \ldots \subset G_d = G$. We give a characterization of irreducible gliders of essential length $e \leq d$…
A method to construct irreducible unitary representations of a hyperspecial compact subgroup of a reductive group over p-adic field with odd p is presented. Our method is based upon Cliffods theory and Weil representations over finite…
We consider the low rank matrix completion problem over finite fields. This problem has been extensively studied in the domain of real/complex numbers, however, to the best of authors' knowledge, there exists merely one efficient algorithm…
A parametrization of irreducible unitary representations associated with the regular adjoint orbits of a hyperspecial compact subgroup of a reductive group over a non-dyadic non-archimedean local filed is presented. The parametrization is…
This paper uses tools in group theory and symbolic computing to give a classification of the representations of finite groups with order lower than 9 that can be derived from the study of local reversible-equivariant vector fields in…
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…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
This paper proposes a new approach to deriving a finite particle content, suitable for the construction of a gauge theory. Specifically, the outlined construction generates a finite set of irreducible gauge representations, which are…
In this paper we consider symmetric powers representation and exterior powers representation of finite groups, which generated by the representation which has finite dimension over the complex field. We calculate the multiplicity of…
The aim of the present paper is to obtain a classification of all the irreducible modular representations of the symmetric group on $n$ letters of dimension at most $n^3$, including dimension formulae. This is achieved by improving an idea,…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…
We show that any irreducible representation $\rho$ of a finite group $G$ of exponent $n$, realisable over $\mathbb{R}$, is realisable over the field $E:=\mathbb{Q}(\zeta_n)\cap\mathbb{R}$ of real cyclotomic numbers of order $n$, and…
We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…
We give an algorithm for computing the irreducible admissible representations of a real reductive group with regular integral infinitesimal character. This algorithm has been implemented on a computer, as part of the Atlas of Lie Groups and…
Let $A$ be a ring with $1\neq 0$, not necessarily finite, endowed with an involution~$*$, that is, an anti-automorphism of order $\leq 2$. Let $H_n(A)$ be the additive group of all $n\times n$ hermitian matrices over $A$ relative to $*$.…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
A group is called matricial field (MF) if it admits finite dimensional approximate unitary representations which are approximately faithful and approximately contained in the left regular representation. This paper provides a new class of…
Shift registers/Primitive polynomials find applications in various branches of Mathematics, Coding Theory and Cryptography. Matrix analogues of primitive polynomials do exist. In this paper, an algorithmic approach to generating all such…
In this paper we discuss various aspects of the problem of determining the minimal dimension of an injective linear representation of a finite semigroup over a field. We outline some general techniques and results, and apply them to…