Generating subsets is the process of finding all the subsets of a given set. A subset is a collection of elements from the original set, where the order of the elements does not matter and duplicates ...

Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather ...

Introduction, Statements, and Notation, Connectives, Well-formed formulas, Tautology, Duality law, Equivalence, Implication, Normal Forms, Functionally complete set of connectives, Inference Theory of ...

Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...

ABSTRACT: We obtain a closed form expression for the joint probability mass function of the occupation times for a Three-State Markov chain. Our representation extends the long-standing result for a ...

Abstract: Discrete orthogonal matrices have applications in information coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to ...

Abstract: In this work, we first introduce a discrete version of generalized Fisher information measure and develop some new results for it. We then propose Jensen-generalized discrete Fisher ...