Related papers: The last patch for classifying shuffle groups
The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…
We study an example of a {\em hit-and-run} random walk on the symmetric group $\mathbf S_n$. Our starting point is the well understood {\em top-to-random} shuffle. In the hit-and-run version, at each {\em single step}, after picking the…
The rising algebra is a subalgebra of the group algebra of the symmetric group S_n, gotten by lumping together permutations having the same number of rising sequences. This well-known algebra arises naturally when studying riffle shuffles.…
The pairs $(\mathcal{D},G)$, where $\mathcal{D}$ is a non-trivial $2$-$(k^{2},k,\lambda )$ design, with $\lambda \mid k$, and $G$ is a flag-transitive automorphism group of $\mathcal{D}$ of affine type such that $G \nleq A \Gamma…
Given two subgroups $H,K$ of a finite group $G$, the probability that a pair of random elements from $H$ and $K$ commutes is denoted by $Pr(H,K)$. Suppose that a finite group $G$ admits a group of coprime automorphisms $A$ and let…
The Kneser graph $K(n, k)$ has as vertices all $k$-element subsets of $[n]=\{1,2,...,n \}$ and an edge between any two vertices that are disjoint. If $n=2k+1$, then $K(n, k)$ is called an odd graph. Let $ n >4$ and $1< k < \frac{n}{2} $. In…
By the investigation of $k$-orbits symmetry properties it is obtained a simple proof of the B. Fein, W. M. Kantor and M. Schacher Theorem: any transitive permutation group contains a non-trivial fixed-point-free prime-power element. Key…
We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…
An $(n,k)$-perfect sequence covering array with multiplicity $\lambda$, denoted PSCA$(n,k,\lambda)$, is a multiset whose elements are permutations of the sequence $(1,2, \dots, n)$ and which collectively contain each ordered length $k$…
In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets S, T and U of a group G satisfying the Triple Product Property (TPP) as a means to bound the exponent $\omega$…
Let $K$ be a finite group and let $G$ be a finite group acting on $K$ by automorphisms. In this paper we study two different but intimately related subjects: on the one side we classify all possible multiplicative and associative structures…
We say that the sequence $g_n$, $n\ge 3$, $n \rightarrow \infty$ of polynomial transformation bijective maps of free module $K^n$ over commutative ring $K$ is a sequence of stable degree if the order of $g_n$ is growing with $n$ and the…
Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…
For nonempty subsets $X$ and $Y$ of a group $G$, we say that $(X,Y)$ is a tiling of $G$ if every element of $G$ can be uniquely expressed as $xy$ for some $x\in X$ and $y\in Y$. In 1966, Rothaus and Thompson studied whether the symmetric…
This paper deals with finite cubic ($3$-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these…
Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…
Given two subgroups $H,K$ of a compact group $G$, the probability that a random element of $H$ commutes with a random element of $K$ is denoted by $Pr(H,K)$. We show that if $G$ is a profinite group containing a Sylow $2$-subgroup $P$, a…
Let $k \,=\, \mathbb{Q}(\sqrt[5]{n},\zeta_5)$, where $n$ is a positive integer, $5^{th}$ power-free, whose $5-$class group is isomorphic to $\mathbb{Z}/5\mathbb{Z}\times\mathbb{Z}/5\mathbb{Z}$. Let $k_0\,=\,\mathbb{Q}(\zeta_5)$ be the…
Let $G$ be a simple graph of order $n$ with eigenvalues $\lambda_1(G)\geq \cdots \geq \lambda_n(G)$. Define \[s^+(G)=\sum_{\lambda_i >0} \lambda_i^2(G), \quad s^-(G)=\sum_{\lambda_i<0} \lambda_i^2(G).\] It was conjectured by Elphick,…
For all Frobenius groups and a large class of finite multiply transitive permutation groups, we show that the corresponding group-subgroup subfactors are completely characterized by their principal graphs. The class includes all the sharply…