Related papers: The peak statistics on simsun permutations
In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…
In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of…
In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their…
Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…
The aim of the present study is to establish some properties for q-Bessel matrix polynomials such as several q-differential matrix equation, q-differential matrix relations and q-recurrence matrix relations, and integral representation,…
In this paper, we shall find a new connection between $n$th degree polynomial mod $p$ congruence with $n$ roots and higher-order Fibonacci and Lucas sequences. We shall first discuss the recent work been done in sequences and their…
We study the distribution of entries of a random permutation matrix under a "randomized basis," i.e., we conjugate the random permutation matrix by an independent random orthogonal matrix drawn from Haar measure. It is shown that under…
We continue our study on relationships between Fibonacci (Lucas) numbers and Bernoulli numbers and polynomials. The derivations of our results are based on functional equations for the respective generating functions, which in our case are…
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
We introduce a new generalization of Stirling numbers of the second kind and analyze their properties, including generating functions, integral representations, and recurrence relations. These numbers are used to approximate Riemann zeta…
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1,2,...,n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…
We study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…
We show that the pair (des, ides) of statistics on the set of permu- tations has the same distribution as the pair (asc, row) of statistics on the set of inversion tables, proving a conjecture of Visontai. The common generating function of…
We consider the set of permutations that are sorted after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns (classical and barred) and enumerate them according to the ascent statistic. Then we…
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,…
In this paper, we consider properties of coefficients of a generating functions composition, where the outer function is a logarithmic generating function and the inner function is an ordinary generating function with integer coefficients.…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain…