Related papers: On the excedance number of colored permutation gro…

We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…

We consider a generalization of the fundamental theorem of finitely generated abelian groups for some non-abelian groups, which is called OGS. First, we consider the dihedral group, which is a non-abelian extension of an abelian group by an…

In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all given i,j<=n. We use a new technique involving diagonals of…

We characterize a comprehensive family of $d$-variate exogenous shock models. Analytically, we consider a family of multivariate distribution functions that arises from ordering, idiosyncratically distorting, and finally multiplying the…

Let $G$ be a transitive permutation group of degree $n$. We say that $G$ is $2'$-elusive if $n$ is divisible by an odd prime, but $G$ does not contain a derangement of odd prime order. In this paper we study the structure of quasiprimitive…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…

Entringer numbers occur in the Andr\'e permutation combinatorial set-up under several forms. This leads to the construction of a matrix-analog refinement of the tangent (resp. secant) numbers. Furthermore, closed expressions for the…

A recent article on generalised linear mixed model asymptotics, Jiang et al. (2022), derived the rates of convergence for the asymptotic variances of maximum likelihood estimators. If $m$ denotes the number of groups and $n$ is the average…

This paper introduces a colored generalization of the Eulerian polynomials, denoted the $\alpha$-colored Eulerian polynomials. We first compute these polynomials by taking the $h$-vector of the $\alpha$-colored permutohedron, a colored…

In this paper we extend the 1/N expansion introduced in [1] to group field theories in arbitrary dimension and prove that only graphs corresponding to spheres S^D contribute to the leading order in the large N limit.

Let $K_n$ denote Ganyushkin-Kudryavtseva-Mazorchuk's generalization of Kiselman's semigroups. We show that the sequence $2^{-n/2}\cdot \log|K_n|$ admits finite limits as $n$ grows to infinity both on odd and even values.

We provide the combinatorial proofs of the log-convexity for the derangement numbers in the symmetric group $\mathfrak{S}_n$, hyperoctahedral group $\mathfrak{B}_n$, and the demihyperoctahedral group $\mathfrak{D}_n$. We also show that the…

There were defined by R. Shwartz OGS for non-abelian groups, as an interesting generalization of the basis of finite abelian groups. The definition of OGS states that that every element of a group has a unique presentation as a product of…

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern…

In a recent paper, Regev and Roichman introduced the <_L order and the L-descent number statistic, des_L, on the group of colored permutations, C_a \wr S_n. Here we define the L-reverse major index statistic, rmaj_L, on the same group and…

We investigate Mahonian and Eulerian probability distributions given by inversions and descents in general finite Coxeter groups. We provide uniform formulas for the means and variances in terms of Coxeter group data in both cases. We also…

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.

The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…