Related papers: Group and algebra hyperdeterminant
The representation theory of finite groups began with Frobenius's factorization of Dedekind's group determinant. In this paper, we consider the case of the semigroup determinant. The semigroup determinant is nonzero if and only if the…
We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…
We give a further extension and generalization of Dedekind's theorem over those presented by Yamaguchi. In addition, we give two corollaries on irreducible representations of finite groups and a conjugation of the group algebra of the…
For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…
We introduce a new approach to representation theory of finite groups that uses some basic algebraic geometry and allows to do all the theory without using characters. With this approach, to any finite group $G$ we associate a finite number…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
Frobenius built a representation theory of finite groups in the process of obtaining the irreducible factorization of the group determinant. Here, we give a generalization of Frobenius' theorem. The generalization leads to a corollary on…
Ferdinand Georg Frobenius is generally considered the creator of character theory of finite groups. This achievement came from the study of the group determinant, which is the determinant of a matrix coming from the regular representation.…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
We generalize linear superalgebra to higher gradings and commutation factors, given by arbitrary abelian groups and bicharacters. Our central tool is an extension, to monoidal categories of modules, of the Nekludova-Scheunert faithful…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
In this paper, we give a refinement of a generalized Dedekind's theorem. In addition, we show that all possible values of integer group determinants of any group are also possible values of integer group determinants of its any abelian…
This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…
In his $1994$ survey, Kleinert defined formally and formulated the problem to obtain unit theorems for unit groups of orders in a semisimple algebra $A$. If $A$ is a group algebra $FG$, it boils down to classifying all finite groups $G$…
We study the geometry and partial differential equations arising from the consideration of group-determinants, and representation theory. The simplest and most striking such example is undoubtedly that of the Humbert operator, associated…
Polytopes are ubiquitous in different areas of mathematics. Gleason and Hubard established a factorisation theorem, stating that every abstract polytope has a unique factorisation into prime polytopes. We compute the automorphism group of a…
Cayley's first hyperdeterminant is a straightforward generalization of determinants for tensors. We prove that nonzero hyperdeterminants imply lower bounds on some types of tensor ranks. This result applies to the slice rank introduced by…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in connection with dual canonical bases. Let U be a cluster algebra of type A_n. We associate to each cluster C of U an abelian category Cat_C such that the indecomposable…
A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…