Haissam Yassine Chehade

Prof. Dr. Haissam Yassine Chehade


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020 in Filomat
Verified
Journal Article
Open access
PDF file
Yahia AwadYahia Awad
Yahia Awad
Haissam ChehadeHaissam Chehade
Haissam Chehade
RMRagheb Hatem Mghames
Ragheb Hatem Mghames
In this paper, we use a generalized form for the Jordan totient function in order to extend the Reciprocal power GCDQ matrices and power LCMQ matrices from the standard domain of natural integers to Euclidean domains. Structural theorems and determinantal arguments defined on both arbitrary and factor-closed q-ordered sets are presented over such domains. We illustrate our work in the case of Gaussian integers.

1 September 2024 in The Eurasia Proceedings of Science Technology Engineering and Mathematics
Verified
Journal Article
Open access
PDF file
Haissam ChehadeHaissam Chehade
Haissam Chehade
YAYahia Awad
Yahia Awad
WZWiam Zeid
Wiam Zeid
In this paper, we extend the concept of lcem matrices beyond the classical domain of natural integers into the domain of unique factorization domains. We investigate the structure of these matrix types when applied to both arbitrary sets and gced-closed sets. Furthermore, we find the determinant, the trace and the inverse of such matrices. To simplify these ideas, we employ domains such as the Gaussian integers domain and the domain of polynomials defined over finite fields.

20 March 2023 in Baghdad Science Journal
Verified
Journal Article
Open access
PDF file
YAYahia Awad
Yahia Awad
RHRamiz Hindi
Ramiz Hindi
Haissam ChehadeHaissam Chehade
Haissam Chehade
In this article, a new deterministic primality test for Mersenne primes is presented. It also includes a comparative study between well-known primality tests in order to identify the best test. Moreover, new modifications are suggested in order to eliminate pseudoprimes. The study covers random primes such as Mersenne primes and Proth primes. Finally, these tests are arranged from the best to the worst according to strength, speed, and effectiveness based on the results obtained through programs prepared and operated by Mathematica, and the results are presented through tables and graphs.

30 November 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
Haissam ChehadeHaissam Chehade
Haissam Chehade
DMDomoo Miari
Domoo Miari
Yousuf AlkheziYousuf Alkhezi
Yousuf Alkhezi
A divisor B of a nonzero polynomial A, defined over the prime field of two elements, is unitary (resp. bi-unitary) if gcd(B,A/B)=1 (resp. gcdu(B,A/B)=1), where gcdu(B,A/B) denotes the greatest common unitary divisor of B and A/B. We denote by σ**(A) the sum of all bi-unitary monic divisors of A. A polynomial A is called a bi-unitary superperfect polynomial over F2 if the sum of all bi-unitary monic divisors of σ**(A) equals A. In this paper, we give all bi-unitary superperfect polynomials divisible by one or two irreducible polynomials over F2. We prove the nonexistence of odd bi-unitary superperfect polynomials over F2.

17 October 2023 in Preprints.org
Verified
Preprint
Open access
PDF file
Haissam ChehadeHaissam Chehade
Haissam Chehade
DMDomoo Miari
Domoo Miari
Yousuf AlkheziYousuf Alkhezi
Yousuf Alkhezi
In this paper, we give all non splitting bi-unitary superperfect polynomials divisible by one or two irreducible polynomials over the prime field of two elements. We prove the nonexistence of odd bi-unitary superperfect polynomials over F2.

22 April 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
WZWiam Yassine Zeid
Wiam Yassine Zeid
Haissam ChehadeHaissam Chehade
Haissam Chehade
IKIssam Kaddoura
Issam Kaddoura
Yahia AwadYahia Awad
Yahia Awad
Let k be a positive integer. A polynomial A∈F_2[x] is called k-unitary perfect if the sum of the k-th powers of its distinct unitary divisors equals A^k. In this paper, we focus on the case k=2^n and prove that every 2^n-unitary perfect polynomial over F_2 is necessarily even. Moreover, we obtain a complete classification of all even 2^n-unitary perfect polynomials having at most three distinct irreducible factors. In particular, we characterize all such polynomials of the formA=x^a (x+1)^b P^h, where P is a Mersenne prime over F_2 and a, b, and h are positive integers. As a consequence, several explicit infinite families of k-unitary perfect polynomials over F_2 are obtained.