In this paper, we describe an elementary method for counting the number of non-isomorphic algebras of a fixed, finite dimension over a given finite field. We show how this method works in the case of 2-dimensional algebras over the field F2.</p
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
AbstractWe present a formula enumerating matrices over a finite field of a given rank and a given nu...
AbstractLet n be a positive integer, and let k be a field (of arbitrary characteristic) accessible t...
Abstract. We obtain the PORC formulae for the number of non-associative algebras of dimension 2, 3 a...
Abstract. This paper is concerned with the problem of determining the number of division algebras wh...
In this paper we address some algorithmic problems related to computations in finite-dimensional ass...
Let Fq be a finite field of q elements. E. Howe has shown that there is a natural correspondence bet...
This dissertation describes algorithms for computing information about finite dimensional associativ...
The aim of this thesis is the enumeration of isomorphism types of nilpotent associative finite dimen...
In this paper we apply Polya’s theory of counting to compute the number of isomorphism types of redu...
AbstractWe describe an algorithm for computing automorphism groups and testing isomorphisms of finit...
Abstract. Let k be an algebraically closed field. We list the finitely many isomorphism types of ran...
We consider various counting questions for irreducible binomials of the form Xt-a over finite fields...
Finite-Dimensional Division Algebras over fields determine, by the Wedderburn Theorem, the semi-simp...
Abstract. Let n be a positive integer, and let k be a field (of arbitrary characteristic) accessible...
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
AbstractWe present a formula enumerating matrices over a finite field of a given rank and a given nu...
AbstractLet n be a positive integer, and let k be a field (of arbitrary characteristic) accessible t...
Abstract. We obtain the PORC formulae for the number of non-associative algebras of dimension 2, 3 a...
Abstract. This paper is concerned with the problem of determining the number of division algebras wh...
In this paper we address some algorithmic problems related to computations in finite-dimensional ass...
Let Fq be a finite field of q elements. E. Howe has shown that there is a natural correspondence bet...
This dissertation describes algorithms for computing information about finite dimensional associativ...
The aim of this thesis is the enumeration of isomorphism types of nilpotent associative finite dimen...
In this paper we apply Polya’s theory of counting to compute the number of isomorphism types of redu...
AbstractWe describe an algorithm for computing automorphism groups and testing isomorphisms of finit...
Abstract. Let k be an algebraically closed field. We list the finitely many isomorphism types of ran...
We consider various counting questions for irreducible binomials of the form Xt-a over finite fields...
Finite-Dimensional Division Algebras over fields determine, by the Wedderburn Theorem, the semi-simp...
Abstract. Let n be a positive integer, and let k be a field (of arbitrary characteristic) accessible...
summary:We present an algorithm for constructing the free algebra over a given finite partial algebr...
AbstractWe present a formula enumerating matrices over a finite field of a given rank and a given nu...
AbstractLet n be a positive integer, and let k be a field (of arbitrary characteristic) accessible t...
DOI
Add to ORKG