Related papers: Constructive Recognition of Special Linear Groups

We provide algorithms to compute a complete irredundant set of extremely strong Shoda pairs of a finite group $G$ and the set of the primitive central idempotents of the rational group algebra $\mathbb{Q}[G]$ realized by them. These…

Graph Neural Networks (GNNs) have received increasing attention in many fields. However, due to the lack of prior graphs, their use for semantic labeling has been limited. Here, we propose a novel architecture called the Self-Constructing…

In this paper, we develop a representation-theoretic formulation of discrete-time linear systems. We show that such systems are naturally viewed as representations of time groups acting on vector spaces, thereby endowing the state space…

We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they…

We use hypergeometric sheaves on $G_m/F_q$, which are particular sorts of rigid local systems, to construct explicit local systems whose arithmetic and geometric monodromy groups are the finite general linear groups $GL_n(q)$ for any $n \ge…

Let $K$ be a finitely generated field. We construct an $n$-dimensional linear system $\mathcal{L}$ of hypersurfaces of degree $d$ in $\mathbb{P}^n$ defined over $K$ such that each member of $\mathcal{L}$ defined over $K$ is smooth, under…

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…

For every finite abelian group $G$, there are positive integers $n$ and $d$ such that $G$ is isomorphic to the multiplicative group of $d$-th powers of reduced residues modulo $n$.

The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…

We construct the finite-dimensional continuous complex representations of $\mathrm{SL}_2$ over compact discrete valuation rings of even residual characteristic. We also prove that the complex group algebras of $\mathrm{SL}_2$ over finite…

We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…

First time, we introduce Extended special linear group $ESL_2(F)$, which is generalization of matrix group $SL_2(F)$ over arbitrary field $F$. Extended special linear group $ESL_2(k)$, where $k$ is arbitrary perfect field, is storage of all…

We study how to generate captions that are not only accurate in describing an image but also discriminative across different images. The problem is both fundamental and interesting, as most machine-generated captions, despite phenomenal…

We present Generative Logic (GL), a deterministic architecture that starts from user-supplied axiomatic definitions written in a minimalist Mathematical Programming Language (MPL) and systematically explores a configurable region of their…

This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…

We construct extensions of the field of rational numbers with the Galois group G_2(F_p) by reducing p-adic representations attached to automorphic representations.

If A is a finite dimensional nilpotent associative algebra over a finite field k, the set G=1+A of all formal expressions of the form 1+a, where a is an element of A, has a natural group structure, given by (1+a)(1+b)=1+(a+b+ab). A finite…

The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

In this paper, we show that projective special linear groups $S:=L_3(q)$ with $q$ less than $100$ are uniquely determined by their orders and degree patterns of their prime graphs. Indeed, we prove that if $G$ is a finite group whose order…