Mathematics > Combinatorics
[Submitted on 10 Jun 2014]
Title:Wreath determinants for group-subgroup pairs
View PDFAbstract:The aim of the present paper is to generalize the notion of the group determinants for finite groups. For a finite group $G$ of order $kn$ and its subgroup $H$ of order $n$, one may define an $n$ by $kn$ matrix $X=(x_{hg^{-1}})_{h\in H,g\in G}$, where $x_g$ ($g\in G$) are indeterminates indexed by the elements in $G$. Then, we define an invariant $\Theta(G,H)$ for a given pair $(G,H)$ by the $k$-wreath determinant of the matrix $X$, where $k$ is the index of $H$ in $G$. The $k$-wreath determinant of $n$ by $kn$ matrix is a relative invariant of the left action by the general linear group of order $k$ and right action by the wreath product of two symmetric groups of order $k$ and $n$. Since the definition of $\Theta(G,H)$ is ordering-sensitive, representation theory of symmetric groups are naturally involved. In this paper, we treat abelian groups with a special choice of indeterminates and give various examples of non-abelian group-subgroup pairs.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.