Related papers: Decomposing Linear Representations of Finite Group…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
We present a MATLAB/Octave toolbox to decompose finite dimensionial representations of compact groups. Surprisingly, little information about the group and the representation is needed to perform that task. We discuss applications to…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…
In this note, we show that the decomposition group $Dec(I)$ of a zero-dimensional radical ideal $I$ in ${\bf K}[x_1,\ldots,x_n]$ can be represented as the direct sum of several symmetric groups of polynomials based upon using Gr\"{o}bner…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
Representation disentanglement aims at learning interpretable features, so that the output can be recovered or manipulated accordingly. While existing works like infoGAN and AC-GAN exist, they choose to derive disjoint attribute code for…
Let G be a finite group and \rho: G--> End(E) be a group representation of G on a coherent sheaf over an integral scheme. The purpose of this paper shall give a decomposition theorem of such representations in non-splitting components and…
Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including…
In this paper we study the universal lifting spaces of local Galois representations valued in arbitrary reductive group schemes when $\ell \neq p$. In particular, under certain technical conditions applicable to any root datum we construct…
Let $\mathfrak{g}$ be a Lie algebra over an algebraically closed field $\Bbbk$ of characteristic zero. Define the universal grading group $\mathcal{C}(\mathfrak{g})$ as having one generator $g_{\rho}$ for each irreducible…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
This work begins the process of using the decomposition of the diagonal as a tool for studying the rationality of invariant fields of finite groups $G$. Our ground field must be characteristic 0 because of the use we make of Bertini…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
The main goal of representation learning is to acquire meaningful representations from real-world sensory inputs without supervision. Representation learning explains some aspects of human development. Various neural network (NN) models…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
We use Galois cohomology methods to produce optimal mod $p^d$ level lowering congruences to a $p$-adic Galois representation that we construct as a well chosen lift of a given residual mod $p$ representation. Using our explicit Galois…
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…