Related papers: A Generalization of Descent Polynomials

One of the most central result in combinatorics says that the descent statistic and the excedance statistic are equidistribued over the symmetric group. As a continuation of the work of Shareshian-Wachs (Adv. Math., 225(6) (2010),…

The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of…

The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also…

Given an $n$-vertex digraph $D$ and a labeling $\sigma:V(D)\to [n]$, we say that an arc $u\to v$ of $D$ is a descent of $\sigma$ if $\sigma(u)>\sigma(v)$. Foata and Zeilberger introduced a generating function $A_D(t)$ for labelings of $D$…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…

Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \geq 2$ and in this paper we try to…

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

We consider the inversion enumerator I_n(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = -1 into this generalized polynomial…

Let $s_0,s_1,s_2,\ldots$ be a sequence of rational numbers whose $m$th divided difference is integer-valued. We prove that $s_n$ is a polynomial function in $n$ if $s_n \ll \theta^n$ for some positive number $\theta$ satisfying $\theta <…

The aim of this paper is a quantitative analysis of the solution set of a system of polynomial nonlinear differential equations, both in the ordinary and partial case. Therefore, we introduce the differential counting polynomial, a common…

In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…

Given sets X and Y of positive integers and a permutation sigma = sigma_1, sigma_2, ..., sigma_n in S_n, an X,Y-descent of sigma is a descent pair sigma_i > sigma_{i+1} whose "top" sigma_i is in X and whose "bottom" sigma_{i+1} is in Y. We…

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which are proposed by Ye, Dai, Lam (1999) and Faug$\mu$ere, Perret…

Let $G$ be a topological commutative semigroup with unit. We prove that a continuous function $f\colon G\to \cc$ is a generalized exponential polynomial if and only if there is an $n\ge 2$ such that $f(x_1 +\ldots +x_n )$ is decomposable;…

In this paper, we consider sums of values of degenerate falling factorials and give a probabilistic proof of a recurrence relation for them. This may be viewed as a degenerate version of the recent probabilistic proofs on sums of powers of…

We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally…