Related papers: Combinatorial Aspects of the Splitting Number
Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…
The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…
We give a combinatorial description of sl(n)-fusion coefficients in the case where one partition has at most two columns and establih other properties for this case.
We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…
In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…
We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
We look at a class of transcendental real numbers xi which, together with their square, satisfy some extremal property of simultaneous approximation by rational numbers with the same denominator. We give a sufficient condition for such a…
In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…
We explore the notion of sectional number of a group homomorphism, leading to a generalization of the covering number of a group, and present several characterizations when the sectional number is finite, providing estimates for computing…
Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
We address the question of whether a reflecting stationary set may be partitioned into two or more reflecting stationary subsets, providing various affirmative answers in ZFC. As an application to singular cardinals combinatorics, we infer…
We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kur\c{s}ung\"oz. We also present some related polynomial and $q$-series…
We prove that if there is a real-valued measurable cardinal then the splitting number is $\aleph_1$. Likewise, if the continuum is real-valued measurable then the reaping number equals the continuum.
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…
In this note, we first bound the intersection number of the regular simplicial partitions.
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved