Related papers: On Linear Representation, Complexity and Inversion…
Functor morphing provides a method to translate complex representations of automorphism groups of finite modules over finite rings to representations of automorphism groups of functors in some abelian category. In this paper we give an…
A representation $\Phi: G \to \mathrm{GL}_n(\mathbb{F})$ of a finite group $G$ is called unisingular if the matrix $\Phi(g)$ admits $1$ as an eigenvalue for any $g\in G$. In this paper, we determine all the complex irreducible unisingular…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic…
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…
We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…
The independence number of a square matrix $A$, denoted by $\alpha(A)$, is the maximum order of its principal zero submatrices. Let $S_n^{+}$ be the set of $n\times n$ nonnegative symmetric matrices with zero trace. Denote by $J_n$ the…
We study a coarse moduli space of irreducible representations of the group of unipotent matrices of order $\mathbb{4}$ over the ring of integers which have finite weight. All such representations are known to be monomial. To describe a…
We investigate the question which Q-valued characters and characters of Q-representations of finite groups are Z-linear combinations of permutation characters. This question is known to reduce to that for quasi-elementary groups, and we…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
We describe several families of permutation polynomials obtained using functions with linear translators.
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…
In this paper we study the integral cohomology of pure mapping class groups of surfaces, and other related groups and spaces, as FI-modules. We use recent results from Church, Miller, Nagpal and Reinhold to obtain explicit linear bounds for…
Representation theorems for formal systems often take the form of an inductive translation that satisfies certain invariants, which are proved inductively. Theory morphisms and logical relations are common patterns of such inductive…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem…
In this paper, we extend notions of the weighted core-EP right and left inverses, the weighted DMP and MPD inverses, and the CMP inverse to matrices over the quaternion skew field H that have some features in comparison to these inverses…
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…
Non-negative Matrix Factorization (NMF) is an intensively used technique for obtaining parts-based, lower dimensional and non-negative representation. Researchers in biology, medicine, pharmacy and other fields often prefer NMF over other…