Related papers: On simultaneous conjugation of permutations

A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with…

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

We prove that the examples by Smith and McMullen-Taubes provide infinitely many counterexamples to one direction of Donaldson's 4-6 question and the closely related Stabilising Conjecture. These are the first known counterexamples. In the…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

The $n$-th rencontres number with the parameter $r$ is the number of permutations having exactly $r$ fixed points. In particular, a derangement is a permutation without any fixed point. We presents a short combinatorial proof for a weighted…

We study maps on the set of permutations of n generated by the R\'enyi-Foata map intertwined with other dihedral symmetries (of a permutation considered as a 0-1 matrix). Iterating these maps leads to dynamical systems that in some cases…

In this paper, we introduce a generalized notion of monotone property and prove some results regarding existence and uniqueness of multi-tupled fixed points for nonlinear contraction mappings satisfying monotone property in ordered complete…

In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…

Let A be a quasi-finite R-algebra (i.e., a direct limit of module finite algebras) with identity. Let I_i, i=0,...,m, be two-sided ideals of A, \GL_n(A,I_i) the principal congruence subgroup of level I_i in GL_n(A) and E_n(A,I_i) be the…

In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an…

We study the derangement graph $\Gamma_n$ whose vertex set consists of all permutations of $\{1,\ldots,n\}$, where two vertices are adjacent if and only if their corresponding permutations differ at every position. It is well-known that…

We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…

We prove that under fairly general conditions an iterated exchange move gives infinitely many non-conjugate braids. As a consequence, every knot has infinitely many conjugacy classes of n-braid representations if and only if it has one…

This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are…

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

Given a set $A=\{a_1,\ldots,a_n\}$ of real numbers and real coefficients $b_1,\ldots,b_n$, consider the distribution of the sum obtained by pairing the $a_i$'s with the $b_i$'s according to a uniformly random permutation. A recent theorem…

We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the…

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…