Related papers: Conjugacy in Permutation Representations of the Sy…

This paper is concentrated on the classification of permutation matrix with the permutation similarity relation, mainly about the canonical form of a permutational similar equivalence class, the cycle matrix decomposition of a permutation…

We compute the homology of the matching complex $M(\Gamma)$, where $\Gamma$ is the complete hypergraph on $n\geq 2$ vertices, and analyse the $S_n$-representations carried by this homology. These results are achieved using standard…

The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…

For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…

We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…

We present a representation for permutation groups as the automorphism group of an ordered set $U$ such that the automorphism group's action on a subset $T\subseteq U$ is the permutation group itself. For many imprimitive permutation…

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…

Let $G$ be a finite group, $N$ a normal subgroup of $G$ and $x\in G-N$. We discuss when the coset $Nx$ is contained in the union of two conjugacy classes, $K$ and $D$, of $G$. We show that $N$ need not be solvable, and can even be…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

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

Non-Hermitian random matrices have been utilized in such diverse fields as dissipative and stochastic processes, mesoscopic physics, nuclear physics, and neural networks. However, the only known universal level-spacing statistics is that of…

Using the standard Coxeter presentation for the symmetric group $S_n$, two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one expression from the other by applying a finite sequence of…

Natural linear and coalgebra transformations of tensor algebras are studied. The representations of certain combinatorial groups are given. These representations are connected to natural transformations of tensor algebras and to the groups…

We calculate all inequivalent irreducible representations of $\S_4$ by specifying the matrices for adjacent transpositions and indicating how to obtain general permutations in $\S_4$ from these transpositions. We employ standard Young…

Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…

We consider the problem of characterizing the class of those permutation groups that are the symmetry groups of Boolean functions. These are exactly the automorphism groups of hypergraphs. They are also called the relation groups. In this…

In this paper, we compute the number of z-classes (conjugacy classes of centralizers of elements) in the symmetric group S_n, when n is greater or equal to 3 and alternating group A_n, when n is greater or equal to 4. It turns out that the…