If (Ai:1 ⩽ i ⩽ n) is a family of n finite sets, then two expressions for the number of SDRs for this family are obtained in terms of the cardinalities of unions and symmetric differences respectively. The proof makes use of the already known expression in terms of intersections. For this known expression is given a symbolic representation in the form of a determinant defined in a special manner. Also a representation, again as a determinant, for the number of SDRs in terms of the complements of the sets Ai is given
The range of validity of Dirichlet's formula for the number of primary representations of the p...
The notion of combinatorial class provides a deep method in order to solve a huge class of combinato...
AbstractAn explicit formula for the number of finite cyclic projective planes (or planar difference ...
AbstractA system of distinct representatives (SDR) of a family F=(A1,…,An) is a sequence (x1,…,xn) o...
A system of distinct representatives (SDR) of a family F = (A1, . . . , An) is a sequence (a1, . . ....
We give a closed formula for the number of partitions A of n such that the corresponding irreducible...
AbstractP(n) and Pm(n) denote the number of (unordered) partitions of n and the number of partitions...
In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmeti...
We prove an upper bound for the number of representations of a positive integer N as the sum of four...
Let rk(n) denote the number of representations of n as a sum of k squares and tk(n) the number of re...
If s is a positive integer, then let r(s;n) denote the number of representations of a non-negative i...
For a given integer \(n\) and a set \(\mathcal{S} \subseteq \mathbb{N}\) denote by \(R_{h,\mathcal{S...
There is a well-known formula due to Jacobi for the number r2(n) of representations of the number n ...
AbstractLet rs(n) denote the number of representations of n as the sum of s squares of integers. In ...
We reprove two results in additive number theory due to Dombi and Chen & Wang, respectively, on the ...
The range of validity of Dirichlet's formula for the number of primary representations of the p...
The notion of combinatorial class provides a deep method in order to solve a huge class of combinato...
AbstractAn explicit formula for the number of finite cyclic projective planes (or planar difference ...
AbstractA system of distinct representatives (SDR) of a family F=(A1,…,An) is a sequence (x1,…,xn) o...
A system of distinct representatives (SDR) of a family F = (A1, . . . , An) is a sequence (a1, . . ....
We give a closed formula for the number of partitions A of n such that the corresponding irreducible...
AbstractP(n) and Pm(n) denote the number of (unordered) partitions of n and the number of partitions...
In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmeti...
We prove an upper bound for the number of representations of a positive integer N as the sum of four...
Let rk(n) denote the number of representations of n as a sum of k squares and tk(n) the number of re...
If s is a positive integer, then let r(s;n) denote the number of representations of a non-negative i...
For a given integer \(n\) and a set \(\mathcal{S} \subseteq \mathbb{N}\) denote by \(R_{h,\mathcal{S...
There is a well-known formula due to Jacobi for the number r2(n) of representations of the number n ...
AbstractLet rs(n) denote the number of representations of n as the sum of s squares of integers. In ...
We reprove two results in additive number theory due to Dombi and Chen & Wang, respectively, on the ...
The range of validity of Dirichlet's formula for the number of primary representations of the p...
The notion of combinatorial class provides a deep method in order to solve a huge class of combinato...
AbstractAn explicit formula for the number of finite cyclic projective planes (or planar difference ...