Related papers: Two notes on notation

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…

Let S be a set of states of a physical system and p(s) the probability of the occurrence of an event when the system is in state s. A function p from S to [0,1] is called a numerical event or alternatively, an S-probability. If a set P of…

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…

Here presented is a unified approach to Stirling numbers and their generalizations as well as generalized Stirling functions by using generalized factorial functions, $k$-Gamma functions, and generalized divided difference. Previous…

Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers…

In the note, the authors give a unified proof of Identities~67, 84, and~85 in the monograph "M. Z. Spivey, The Art of Proving Binomial Identities, Discrete Mathematics and its Applications, CRC Press, Boca Raton, FL, 2019; available online…

In a rather straightforward manner, we develop the well-known formula for the Stirling numbers of the first kind in terms of the (exponential) complete Bell polynomials where the arguments include the generalised harmonic numbers. We also…

In this paper, by virtue of a determinantal formula for derivatives of the ratio between two differentiable functions, in view of the Fa\`a di Bruno formula, and with the help of several identities and closed-form formulas for the partial…

Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. A bipartition of $n$ is an ordered pair of partitions $(\pi_1, \pi_2)$ with the sum of all of the parts being…

Through a series of elementary exercises, we explain the fractal structure of Pascal's triangle when written modulo $p$ using an 1852 theorem due to Kummer: A prime $p$ divides $\dfrac {n!}{i!j!} $ if and only if there is a carry in the…

Let K_n denote the smaller mode of the nth row of Stirling numbers of the second kind S(n, k). Using a probablistic argument, it is shown that for all n>=2, [exp(w(n))]-2<=K_n<=[exp(w(n))]+1, where [x] denotes the integer part of x, and…

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 provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

We discuss the procedure of different partitions in the finite set of $N$ integer numbers and construct generic formulas for a bijective map of real numbers $s_y$, where $y=1,2,\ldots,N$, $N=\prod \limits_{k=1}^{n} X_k$, and $X_k$ are…

We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear…