Related papers: Signed Hultman Numbers and Signed Generalized Comm…

For $\alpha>0$ and $\sigma > 0$, we consider the following probability distribution on $\alpha\mathbb N_0$: $\pi_{\alpha,\sigma} = \exp \big(- \frac{\sigma}{{\alpha}^2}\big) \sum_{n=0}^{\infty} \frac{1}{n!}…

We present conditions that allow us to pass from the convergence of probability measures in distribution to the uniform convergence of the associated quantile functions. Under these conditions, one can in particular pass from the asymptotic…

We prove rapid mixing for certain Markov chains on the set $S_n$ of permutations on $1,2,\dots,n$ in which adjacent transpositions are made with probabilities that depend on the items being transposed. Typically, when in state $\sigma$, a…

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

We study the isoperimetric and spectral profiles of certain families of finitely generated groups defined via actions on labelled Schreier graphs and simple {\em gluing} of such. In one of our simplest constructions---the {\em…

Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…

Let $G$ be an algebraic group. For $d\geq 1$, we define the commuting probabilities $cp_d(G) = \frac{dim(\mathfrak C_d(G))}{dim(G^d)}$, where $\mathfrak C_d(G)$ is the variety of commuting $d$-tuples in $G$. We prove that for a reductive…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

The commuting probability of a finite ring $R$, denoted by $\Pr(R)$, is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain several bounds for $\Pr(R)$ through a generalization of $\Pr(R)$.…

We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…

In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…

Let a deck of n cards be shuffled by successively exchanging the cards in positions 1, 2, ..., n with cards in randomly chosen positions. We show that for n equal to 18 or greater, the identity permutation is the most likely. We prove a…

We consider a random walk on the hyperoctahedral group $B_n$ generated by the signed permutations of the forms $(i,n)$ and $(-i,n)$ for $1\leq i\leq n$. We call this the flip-transpose top with random shuffle on $B_n$. We find the spectrum…

In group sequential designs, where several data looks are conducted for early stopping, we generally assume the vector of test statistics from the sequential analyses follows (at least approximately or asymptotially) a multivariate normal…

For subsets $X,Y$ of a finite group $G$, let $Pr(X,Y)$ denote the probability that two random elements $x\in X$ and $y\in Y$ commute. Obviously, a finite group $G$ is nilpotent if and only if $Pr(P,Q)=1$ whenever $P$ and $Q$ are Sylow…

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

The concept of subgroup commutativity degree of a finite group $G$ is arising interest in several areas of group theory in the last years, since it gives a measure of the probability that a randomly picked pair $(H,K)$ of subgroups of $G$…

In this paper we investigate the minimum number of maximal subgroups H_i for i=1 ...k of the symmetric group S_n (or the alternating group A_n) such that each element in the group S_n (respectively A_n) lies in some conjugate of one of the…