相关论文: Some Elementary Congruences for the Number of Weig…

By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we…

Integer compositions with certain colored parts were introduced by Andrews in 2007 to address a number-theoretic problem. Integer compositions allowing zero as some parts were introduced by Ouvry and Polychronakos in 2019. We give a…

A subset of positive integers $F$ is a Schreier set if it is non-empty and $|F|\leqslant \min F$ (here $|F|$ is the cardinality of $F$). For each positive integer $k$, we define $k\mathcal{S}$ as the collection of all the unions of at most…

Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

We discuss closed-form formulas for the (n; k)-th partial Bell polynomials derived in Cvijovic. We show that partial Bell polynomials are special cases of weighted integer compositions, and demonstrate how the identities for partial Bell…

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.

We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…

We study the average number of representations of an integer $n$ as $n = \phi(n_{1}) + \dots + \phi(n_{j})$, for polynomials $\phi \in \mathbb{Z}[n]$ with $\partial\phi = k\ge 1$, $\operatorname{lead}(\phi) = 1$, $j \ge k$, where $n_{i}$ is…

A composition of an integer is called Carlitz if adjacent parts are different. Several characteristics of random Carlitz compsitions have been studied recently by Knopfmacher and Prodinger. We complement their work by establishing the…

We derive a generating function for the number of integer compositions of $n$ into $k$ parts (i.e., $k$-compositions of $n$) with a given number of inversions, and obtain similar results for $k$-compositions of $n$ with a given number of…

A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…