Add to ORKGThe purpose of this note is to prove a counting Lemma from Peski [2015]. In the course of the proof, we use the Stirling’s approximation∣∣∣ ∣ 1n log n! − (log n − 1) ∣∣∣ ∣ ≤ 1n (5 + log n) =
We consider the logarithmic space counting classes #L, opt-L, and span-L, which are defined analogou...
Abstract We address the following natural but hitherto unstudied question: what are t...
AbstractWe consider noncentral Stirling numbers Snk(t) = (1k!)Δktn and give a combinatorial interpre...
Our goal is to prove the following asymptotic estimate for n!, called Stirling’s formula. Theorem 1....
Here, one can use the trick x = 2log x. The first function is a constant since n1000 / logn = 2(logn...
In a paper published in 1993, Erdös proved that if n!=a! b!, where 1 < a≤b, then the difference b...
Let B. denote the number ofpartitions ofa set of n distinct objects. B. are sometimes called exponen...
Let b ≥ 2 be an integer and denote by sb(m) the sum of the digits of the positive integer m when is ...
AbstractSzemerédi's regularity lemma proved to be a powerful tool in extremal graph theory. Many of ...
Our objective is to provide an upper bound for the length ℓN of the longest run of consecutive integ...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
htmlabstractWe consider the problem of determining mn, the number of matroids on n elements. The be...
AbstractIn this note, it is shown that, the number of total preorders on a finite set with n element...
We consider the logarithmic space counting classes #L, opt-L, and span-L, which are defined analogou...
Abstract We address the following natural but hitherto unstudied question: what are t...
AbstractWe consider noncentral Stirling numbers Snk(t) = (1k!)Δktn and give a combinatorial interpre...
Our goal is to prove the following asymptotic estimate for n!, called Stirling’s formula. Theorem 1....
Here, one can use the trick x = 2log x. The first function is a constant since n1000 / logn = 2(logn...
In a paper published in 1993, Erdös proved that if n!=a! b!, where 1 < a≤b, then the difference b...
Let B. denote the number ofpartitions ofa set of n distinct objects. B. are sometimes called exponen...
Let b ≥ 2 be an integer and denote by sb(m) the sum of the digits of the positive integer m when is ...
AbstractSzemerédi's regularity lemma proved to be a powerful tool in extremal graph theory. Many of ...
Our objective is to provide an upper bound for the length ℓN of the longest run of consecutive integ...
In this note we present a combinatorial proof of an identity involving the two kinds of Stirling num...
htmlabstractWe consider the problem of determining mn, the number of matroids on n elements. The be...
AbstractIn this note, it is shown that, the number of total preorders on a finite set with n element...
We consider the logarithmic space counting classes #L, opt-L, and span-L, which are defined analogou...
Abstract We address the following natural but hitherto unstudied question: what are t...
AbstractWe consider noncentral Stirling numbers Snk(t) = (1k!)Δktn and give a combinatorial interpre...