In the present paper we show a new algorithm for random generation of boolean square invertible matrices nxn. This algorithm has, as initial parameter, a randomly selected boolean matrix A={ai,j}nxn , which has as the only restriction that there is not any I∈ {1…n}, such that ai,i = ai,i+1 = … ai,n = 0. The program is presented in the Mathematic language. [ABSTRACT FROM AUTHOR]
Rodríguez Avi, José, Conde Sánchez, Antonio, and Sáez Castillo, Antonio José
Subjects
*HYPERGEOMETRIC functions, *COMPUTATIONAL mathematics, *POLYNOMIALS, *DISTRIBUTION (Probability theory), *OPERATIONS research
Abstract
In this paper we present a family of Pearson's discrete distributions which are generated by the hypergeometric function p+1Fp, an univariate extension of the Gaussian hypergeometric function. It allows us to generalize the study of this type of distributions, whatever the order of the hypergeometric function which is considered. We study the properties that they present, like a recurrence relation that the moments verify, from which we can use the moment's method to estimate the parameters. Also we have obtained a summation result through which we can calculate the probability mass function and the moments of a wide class of distributions. [ABSTRACT FROM AUTHOR]
Published
2001
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.