Sukran Uygun

Dr. Sukran Uygun

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
30 September 2019 in Communications in Mathematics and Applications
Verified
Journal Article
Open access
PDF file
SUSukran Uygun
Sukran Uygun
HKHasan Karatas
Hasan Karatas
A New Generalization of Pell-Lucas Numbers (Bi-Periodic Pell-Lucas Sequence)

25 November 2016 in Journal of Mathematics Research
Verified
Journal Article
Open access
PDF file
SUSukran Uygun
Sukran Uygun
In this paper we investigate upper and lower bounds of the norms of thecirculant matrices whose elements are $k-$Jacobsthal numbers and $k-$%Jacobsthal Lucas numbers.

30 June 2021 in Cumhuriyet Science Journal
Verified
Journal Article
Closed access
PDF file
SUSukran Uygun
Sukran Uygun
In this paper, one of the special integer sequences, Jacobsthal and Jacobsthal Lucas sequences which are encountered in computer science is generalized according to parity of the index of the entries of the sequences, called bi-periodic Jacobsthal and Jacobsthal Lucas sequences. The definitions of the bi-periodic Jacobsthal and Jacobsthal Lucas sequences are given by using classic Jacobsthal and Jacobsthal Lucas sequences. In literature, there were some relations for the bi-periodic Jacobsthal and Jacobsthal Lucas sequences. We find new identities for these sequences. If we substitute a=b=1 in the results, we get identities for classic Jacobsthal and Jacobsthal Lucas sequences.

27 September 2025 in International Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
SUSukran Uygun
Sukran Uygun
This paper describes a new coding and decoding technique based on the Guglielmo sequence. Our version isbased on a blocked message matrix, with every message matrix encrypted using a special key. The amount of information transmitted over the internet has increased as internetuse has become more prevalent. Consequently, the importance of the algorithms used in data encryption methodshas increased. The proposed method is fast because it isbased on fundamental matrix operations and is suitable forcryptographic applications due to its use of the ASCII character encoding system. For this reason, it differs from classical algebraic methods described in the literature. Using447Received: July 30, 2025International Journal of Applied Mathematics Volume 38 No. 4s, 2025 ISSN: 1311-1728 (printed version); ISSN: 1314-8060 (on-line version) Guglielmo numbers we define Guglielmo G-matrices. Wecan process any given message with a special encryptionand we can decode the encrypted massage with the methodwe use.Math. Subject Classification: 68P30, 11B39, 11B50,11B37, 11T71, 11B83

2 July 2020 in Academic Journal of Applied Mathematical Sciences
Verified
Journal Article
Open access
SUSukran Uygun
Sukran Uygun
HKH. Karataş
H. Karataş
Academic Research Publishing Group - ARPG is an academic publisher of open access peer-reviewed journals. It publishes all relevant research papers in relevant journals.

1 December 2020 in Sakarya University Journal of Science
Verified
Journal Article
Closed access
SUSukran Uygun
Sukran Uygun
In this paper Jacobsthal, Jacobsthal Lucas and generalized Jacobsthal sequences are denoted by aid of first or second type of Chebyshev polynomials by different equalities. Then using these equalities a relation is obtained between Jacobsthal and generalized Jacobsthal numbers. Moreever, the nth powers of some special matrices are found by using Jacobsthal numbers or Chebyshev polynomials. Some connections among Jacobsthal, Jacobsthal Lucas are revealed by using the determinant of the power of some special matrices. Then, the properties of Jacobsthal, Jacobsthal Lucas numbers are obtained by using the identities of Chebyshev polynomials.