Related papers: A versatile combinatorial approach of studying pro…
We introduce a combinatorial enumeration problem that is solved using generalized Catalan numbers. We also study generalizations of the Cycle Lemma beyond the computation of the generalized Catalan numbers.
We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…
We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…
We consider a new splitting based on the Sherman-Morrison-Woodbury formula, which is particularly effective with iterative methods for the numerical solution of large linear systems. These systems involve matrices that are perturbations of…
For a fixed prime $p$, we consider a filtration of the commuting complex of elements of order $p$ in the symmetric group $\mathfrak{S}_n$. The filtration is obtained by imposing successively relaxed bounds on the number of disjoint…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
This paper deals with two notions: a polarized partition relations $\left( \begin{array}{c} \alpha \beta \end{array} \right) \to \left( \begin{array}{cc} \gamma & \eta \delta & \lambda \end{array} \right)$ and product of generalized strong…
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…
A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the…
The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…
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…
In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated…
An $n\times n$ matrix $M=[m_{ij}]$ with $m_{ij}\in U_n=\{1,2,\ldots,n\}$ will be called a cycle matrix if $(U_n,\cdot)$ is a cycle set, where $i\cdot j=m_{ij}$. We study these matrices in this article. Using these matrices, we give some…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.