相关论文: On the Basis Polynomials in the Theory of Permutat…

Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

For any integer $k$, M.Kaneko defined $k$-th poly-Bernoulli numbers as a kind of generalization of classical Bernoulli numbers using $k$-th polylogarithm. In case when $k$ is positive, $k$-th poly-Bernoulli numbers is a sequence of rational…

In this work, we completely characterize (i) permutation binomials of the form $x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb{F}_{2^n}[x], n = 2^st, a \in \mathbb{F}_{2^{2t}}^{*}$, and (ii) permutation trinomials of the form…

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…

Upper and lower bounds are derived for the mode(s) of the negative binomial distribution of order k, type I, with parameters r and p, which are employed to establish an explicit formula for the mode(s) in terms of r and k when p equals 0.5.…

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

We propose sum rules for permutations $p_n(k)$ of the ensemble $\left\{1,2,\cdots,n\right\}$ with $k$ fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind…

In this paper, we show that a $D$-type map $\Phi_D:M_n\rightarrow M_n$ with $D=(n-2)I_n+P_{\pi_1}+P_{\pi_2}$ induced by a pair $\{\pi_1,\pi_2\}$ of permutations of $(1,2,..., n)$ is positive if $\{\pi_1,\pi_2\}$ has property (C). The…

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

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…

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…

Let R(n,k) be the number of permutations of $\{1,2,\ldots,n\}$ with k alternating runs. In this paper, we establish the relationships between R(n,k) and the central factorial numbers of even indices as well as the number of signed…

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

The number of $k$-roots of an arbitrary permutation is expressed as an alternating sum of $\mu$-unimodal $k$-roots of the identity permutation.

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

A king-non-attacking permutation is a permutation $\pi \in S_n$ such that $|\pi(i)-\pi(i-1)|\neq 1$ for each $i \in \{2,\dots,n\}$. We investigate the structure of the poset of these permutations under the containment relation, and also…

We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…