Related papers: Decomposing Linear Representations of Finite Group…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
We show that for algebraic groups over local fields of characteristic zero, the following are equivalent: Every homomorphism has a closed image, every unitary representation decomposes into a direct sum of finite-dimensional and mixing…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, $F:=\mathbb{F}_q(T)$ and $F^{\operatorname{sep}}$ a separable closure of $F$. Set $A$ to denote the polynomial ring $\mathbb{F}_q[T]$. Let $\mathfrak{p}$ be a non-zero prime ideal of…
Bilevel optimization has been widely used in decision-making process. However, there still lacks an efficient algorithm to determine an optimal solution of a bilevel optimization problem, especially for a large-size problem. To bridge the…
Let $F$ be an algebraically closed field of characteristic $p$. We fashion an infinite dimensional basic algebra $\underleftarrow{\mathcal{C}}_p(F)$, with a transparent combinatorial structure, which we expect to control the rational…
We introduce a termination method for the algebraic graph transformation framework PBPO+, in which we weigh objects by summing a class of weighted morphisms targeting them. The method is well-defined in rm-adhesive quasitoposes (which…
The linearity inherent in quantum mechanics limits current quantum hardware from directly solving nonlinear systems governed by nonlinear differential equations. One can opt for linearization frameworks such as Carleman linearization, which…
In this article, we present a combinatorial formula for computing the Wedderburn decomposition of the rational group algebra associated with an ordinary metacyclic $p$-group $G$, where $p$ is any prime. We also provide a formula for…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
An approach to representations of finite groups is presented without recourse to character theory. Considering the group algebra C[G] as an algebra of linear maps on C[G] (by left multiplication), we derive the primitive central idempotents…
We establish a $K-$type decomposition of the Harish-Chandra Schwartz algebra $\mathcal{C}^{p}(G),$ for any real-rank $1$ reductive group $G$ with a maximal compact subgroup $K$ and $0<p\leq2.$ This decomposition is then used to give an…
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
Let G be the group of rational points of a connected reductive group over a finite field. Based on work of Lusztig and Yun, we make the Jordan decomposition for irreducible G-representations canonical. It comes in the form of an equivalence…
Inspired by rational canonical forms, we introduce and analyze two decompositions of dynamic programming (DP) problems for systems with linear dynamics. Specifically, we consider both finite and infinite horizon DP problems in which the…
We have sorted the SmallGroups library of all the finite groups of order smaller than 2000 to identify the groups that possess a faithful three-dimensional irreducible representation (`irrep') and cannot be written as the direct product of…
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an…
Let $G$ denote the unramified quasi-split unitary group $\mathbb{U}(1,1)(F)$ over a $p$-adic field $F$ with residual characteristic $p \neq 2$. In this paper, we first construct a large family of irreducible representations of the maximal…
To classify the finite dimensional pointed Hopf algebras with $G= {\rm McL}$ we obtain the representatives of conjugacy classes of $G$ and all character tables of centralizers of these representatives by means of software {\rm GAP}.
In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…