Related papers: Arithmetic in Group Extensions

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…

In existing literature, while approximate approaches based on Monte-Carlo simulation technique have been proposed to compute the semantics of probabilistic argumentation, how to improve the efficiency of computation without using simulation…

We extend the well known characterization of $\vpws$ as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to do so we add additional memory to the computation of…

Let $F$ be a local field over $\mathbf{Q}_p$ or $\mathbf{F}_p((t))$, and let $D$ be a central simple division algebra over $F$ of degree $d$. In the $p$-adic case, we assume $p>de+1$ where $e$ is the ramification degree over $\mathbf{Q}_p$;…

In this article, we determine all inequivalent irreducible rational matrix representations of groups of order $p^5$, where $p$ is an odd prime. We also derive combinatorial formulations for the Wedderburn decomposition of rational group…

This note presents an elementary version of Sims's algorithm for computing strong generators of a given perm group, together with a proof of correctness and some notes about appropriate low-level data structures. Upper and lower bounds on…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Auxiliary matrix exponential method is used to derive simple and numerically efficient general expressions for the following, historically rather cumbersome and hard to compute, theoretical methods: (1) average Hamiltonian theory following…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

The peculiarity of adversarial team games resides in the asymmetric information available to the team members during the play, which makes the equilibrium computation problem hard even with zero-sum payoffs. The algorithms available in the…

Two fundamental ways to represent a group are as permutations and as matrices. In this paper, we study linear representations of groups that intertwine with a permutation representation. Recently, D'Alconzo and Di Scala investigated how…

Let $G$ be a reductive group over a nonarchimedean local field $F$. In the quest for a classification of irreducible smooth representations of $G$, it is critical to understand the case of supercuspidal representations -- those whose matrix…

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…

Diffusive representations of fractional derivatives have proven to be useful tools in the construction of fast and memory efficient numerical methods for solving fractional differential equations. A common challenge in many of the known…

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$…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…