Related papers: Generating Function for Pinsky's Combinatorial Sec…

Let $n$ and $k$ be positive integers with $n>k$. Given a permutation $(\pi_1,\ldots,\pi_n)$ of integers $1,\ldots,n$, we consider $k$-consecutive sums of $\pi$, i.e., $s_i:=\sum_{j=0}^{k-1}\pi_{i+j}$ for $i=1,\ldots,n$, where we let…

Let $P(x)\in \mathbb{Z}[x]$ be a polynomial with at least two distinct complex roots. We prove that the number of solutions $(x_1, \dots, x_k, y_1, \dots, y_k)\in [N]^{2k}$ to the equation \[ \prod_{1\le i \le k} P(x_i) = \prod_{1\le j \le…

A generating function is given for the number, $E(l,k)$, of irreducible $k$-fold Euler sums, with all possible alternations of sign, and exponents summing to $l$. Its form is remarkably simple: $\sum_n E(k+2n,k) x^n = \sum_{d|k}\mu(d)…

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

A century ago, P. A. MacMahon introduced two families of generating functions, $$ \sum_{1\leq n_1<n_2<\cdots<n_t}\prod_{k=1}^t\frac{q^{n_k}}{(1-q^{n_k})^2} \quad\text{ and } \sum_{\substack{1\leq n_1<n_2<\cdots<n_t\\…

In [BabStein] 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. In [Kit1] Kitaev considered simultaneous…

In this paper, we investigate the combinatorial structure and asymptotic distribution of the solution set of the equation $\sigma(n+1) = k\sigma(n)$ for a given integer $k>1$. From a combinatorial perspective, the solutions to this equation…

Nualart & Pecatti ([Nualart and Peccati, 2005, Thm 1]) established the first fourth-moment theorem for random variables in a fixed Wiener chaos, i.e. they showed that convergence of the sequence of fourth moments to the fourth moment of the…

In this paper, generalized Pell graphs $\Pi _{n,k}$, $k\ge 2$, are introduced. The special case of $k=2$ are the Pell graphs $\Pi _{n}$ defined earlier by Munarini. Several metric, enumerative, and structural properties of these graphs are…

General summation formulas have been proved to be very useful in analysis, number theory and other branches of mathematics. The Lipschitz summation formula is one of them. In this paper, we give its application by providing a new…

Zeckendorf proved that every integer can be written uniquely as a sum of non-adjacent Fibonacci numbers $\{1,2,3,5,\dots\}$. This has been extended to many other recurrence relations $\{G_n\}$ (with their own notion of a legal…

We identify a surprising inequality satisfied by elementary symmetric polynomials under the action of the fixed point measure of a random permutation. Concretely, for any collection of $n$ non-negative real numbers $a_1, \dots, a_n \in…

We find the generating function for $C(n,k,r)$, the number of compositions of $n$ into $k$ positive parts all of whose runs (contiguous blocks of constant parts) have lengths less than $r$, using recent generalizations of the method of…

A ballot permutation is a permutation {\pi} such that in any prefix of {\pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)},…

The article studies a class of generalized factorial functions and symbolic product sequences through Jacobi type continued fractions (J-fractions) that formally enumerate the divergent ordinary generating functions of these sequences. The…

Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n-$th Bernoulli numbers. In this paper, we will generalize…

The BK inequality (\cite{BK85}) says that,for product measures on $\{0,1\}^n$, the probability that two increasing events $A$ and $B$ `occur disjointly' is at most the product of the two individual probabilities. The conjecture in…

Sergey Kitaev has shown that the exponential generating function for permutations avoiding the generalized pattern $\sigma$-$k$, where $\sigma$ is a pattern without dashes and $k$ is one greater than the biggest element in $\sigma$, is…

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

Given $n\geq 2$, $z_{ij}\in\mathbb{T}$ such that $z_{ij}=\overline z_{ji}$ for $1\leq i,j\leq n$ and $z_{ii}=1$ for $1\leq i\leq n$, and integers $p_1,...,p_n\geq 1$, we show that the universal $\mathrm{C}^*$-algebra generated by unitaries…