We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
In this paper, we shall present strong laws of large numbers (SLLN's) for independent (not necessary identically distributed) fuzzy set-valued random variables whose base spa...
Background: When conducting multiple hypothesis tests, it is important to control the number of false positives, or the False Discovery Rate (FDR). However, there is a tradeoff be...
In this paper, following the way opened by a previous paper deposited on arXiv, see[7], we give an upper bound to the number of states for a hyperbolic cellular automaton in the pe...