Related papers: Conjugacy in Permutation Representations of the Sy…

We introduce representations of the Cuntz algebra $\con$ which are parameterized by sequences in the set of unit vectors in ${\bf C}^{N}$. These representations are natural generalizations of permutative representations by…

In this paper, we announce results from our thesis, which studies for the first time the categorification of the theory of generalized permutohedra. The vector spaces in the categorification are tightly constrained by certain continuity…

Given a finite group $G$ acting on a set $X$ let $\delta_k(G,X)$ denote the proportion of elements in $G$ that have exactly $k$ fixed points in $X$. Let $\mathrm{S}_n$ denote the symmetric group acting on $[n]=\{1,2,\dots,n\}$. For…

State symmetries are defined as permutations which act on vector spaces of column vectors and square matrices, resulting in isotropy groups for specific vector spaces. A large number of properties for such objects is shown, to provide a…

Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…

Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices…

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…

We study various conditions under which a unitary in an ultraproduct of matrices is conjugated to an ultraproduct of permutations.

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with…

It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…

We classify all finite groups G such that the product of any two non-inverse conjugacy classes of G is always a conjugacy class of G. We also classify all finite groups G for which the product of any two G-conjugacy classes which are not…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the graph $\Gamma_G(N)$, which is the graph associated to the conjugacy classes of $G$ contained in $N$, has no triangles and when the graph…

We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…

We prove that the natural permutation representation of highly transitive finite groups cannot be realized as the full automorphism group of an idempotent, finite-dimensional evolution algebra acting on the set of lines spanned by its…

Suppose that $G$ is a finite group and $K$ a non-trivial conjugacy class of $G$ such that $KK^{-1}=1\cup D\cup D^{-1}$ with $D$ a conjugacy class of $G$. We prove that $G$ is not a non-abelian simple group. We also give arithmetical…

The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity,…

We say that a Euclidean lattice in $\mathbb R^n$ is permutation invariant if its automorphism group has non-trivial intersection with the symmetric group $S_n$, i.e., if the lattice is closed under the action of some non-identity elements…

Let $N(G)$ be the set of conjugacy classes sizes of $G$. We prove that if $N(G)=\Omega\times \{1,n\}$ for specific set $\Omega$ of integers, then $G\simeq A\times B$ where $N(A)=\Omega$, $N(B)=\{1,n\}$, and $n$ is a power of prime.