Related papers: An explicit generating function arising in countin…

Motivated by permutation statistics, we define for any complex reflection group W a family of bivariate generating functions. They are defined either in terms of Hilbert series for W-invariant polynomials when W acts diagonally on two sets…

We study the sequence of zeta functions $Z(C_p,T)$ of a generic Picard curve $C:y^3=f(x)$ defined over $\mathbb{Q}$ at primes $p$ of good reduction for $C$. We define a degree 9 polynomial $\psi_f\in \mathbb{Q}[x]$ such that the splitting…

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…

The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…

Let $T$ be an underlying space with a non-atomic measure $\sigma$ on it. In [{\it Comm.\ Math.\ Phys.}\ {\bf 292} (2009), 99--129] the Meixner class of non-commutative generalized stochastic processes with freely independent values,…

This paper studies properties of the integer sequence $\overline{\overline{G}}_n=\prod_{k=0}^n\binom{n}{k}_{\mathbb{Z},\mathbb{N}}$ which is analogous to $\overline{G}_n=\prod_{k=0}^n\binom{n}{k}$, the product of the elements of the $n$-th…

We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and solve it by using bivariate exponential generating functions. The family of recurrence relations considered in the problem contains many…

In this document will be proved a formula to compute the $p$-adic valuation of a hyperfactorial. We call a hyperfactorial the result of multiplying a given number of consecutive integers from 1 to the given number,each raised to its own…

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Suppose $((\cdots((x^{2}-c_{1})^{2}-c_{2})^{2}\cdots)^{2}-c_{k-1})^{2}-c_{k}$ splits into linear factors over $\mathbb{Z}$ and $c_{k}\neq0$. We show that for each $j$ and each prime $p$, if $p\leq2^{j-1}$ then $p$ divides $c_{j}$.…

Let $c=(C_n)_{n\ge 0}$ be the Catalan sequence and $T$ a linear and bounded operator on a Banach space $X$ such $4T$ is a power-bounded operator. The Catalan generating function is defined by the following Taylor series, $$…

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…

Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in…

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Given an operad P with a finite Groebner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function…

Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…