Related papers: A Testing Algorithm of an Universal Algebra to be …
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
We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
Given an ample, Hausdorff groupoid $\mathcal{G}$, and a unital commutative ring $R$, we consider the Steinberg algebra $A_R(\mathcal {G})$. First we prove a uniqueness theorem for this algebra and then, when $\mathcal{G}$ is graded by a…
The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and proof…
We give three programs on computer for finding the subgroupoids, wide subgroupoids and normal subgroupoids of a finite groupoid.
The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…
The main purpose of this paper is to study the vector groupoids. This is an algebraic structure which combines the concepts of Brandt groupoid and vector space such that these are compatible.
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…
We introduce a general notion of quantum universal enveloping algebroids (QUE algebroids), or quantum groupoids, as a unification of quantum groups and star-products. Some basic properties are studied including the twist construction and…
An uncomplicated and easily handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the…
We prove that the Galois groupoid of the category of $G$-spectra for a finite group $G$ is algebraic, i.e. equivalent to the \'etale fundamental groupoid of the Burnside ring of $G$. We implement an algorithm that computes the latter from…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
In the work we investigate some groupoids which are the Abelian algebras and the Hamiltonian algebras. An algebra is Abelian if for every polynomial operation and for all elements $a,b,\bar c,\bar d$ the implication $t(a,\bar c)=t(a,\bar…
In this paper we give a way of equipping the derivation algebra of a group algebra with the structure of a graded algebra. The derived group is used as the grading group. For the proof, the identification of the derivation with the…
Automated Theorem Proving (ATP) is an established branch of Artificial Intelligence. The purpose of ATP is to design a system which can automatically figure out an algorithm either to prove or disprove a mathematical claim, on the basis of…
We present an ongoing effort to implement Universal Algebra in the UniMath system. Our aim is to develop a general framework for formalizing and studying Universal Algebra in a proof assistant. By constituting a formal system for isolating…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
Using the computational algebra system GAP (http://www.gap-system.org) and the GAP package LAGUNA (http://www.cs.st-andrews.ac.uk/~alexk/laguna.htm), we checked that all 2-groups of order not greater than 32 are determined by normalized…