Sukran Uygun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sukran Uygun has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Hulya Aytar
Department of Mathematics, Science and Art Faculty, Gaziantep University, 27310 Gaziantep, Turkey
3 shared publications - Berna Aksu
Department of Mathematics, Faculty of Science and Art, Gaziantep University, 27580 Gaziantep, Turkey
2 shared publications - Ozan Haklıdır
Gaziantep University
2 shared publications - Ersen Akinci
Department of Mathematics, Science and Art Faculty, Gaziantep University, Gaziantep 27310, Turkey
1 shared publication Evans Owusu
Department of Mathematics, Faculty of Science and Arts, Gaziantep University, Gaziantep, Turkey
1 shared publication- Evans Owusu
Department of Mathematics -Faculty of Science and Arts Gaziantep University 27310 Gaziantep Turkey
1 shared publication
Latest Publications
- Open Access
A Block Encryption Construction Based on Bi-Periodic Pell Matrices and Elliptic Curve Group Operations
This paper presents a theoretical algebraic block transformation based on bi-periodic Pell matrices and elliptic-curve point-valued blocks. The construction uses block-dependent scalar key matrices to transform plaintext blocks whose entries lie in a selected elliptic-curve subgroup of prime order . The encryption operation is defined by the elliptic-curve scalar matrix action where the entries of act as scalar coefficients modulo , and point additions are performed in . The main purpose of the construction is to formalize the interaction between recursive Pell-type matrix sequences over and elliptic-curve point-valued block transformations. The algebraic correctness follows from the invertibility of over and the compatibility of the -action with the matrix multiplication. The deterministic version is not claimed to provide semantic security or IND-CPA security without additional randomization, nonce-dependent masking, and formal security proofs.Open AccessA Block Encryption Construction Based on Bi-Periodic Pell Matrices and Elliptic Curve Group Operations
This paper presents a theoretical algebraic block transformation based on bi-periodic Pell matrices and elliptic-curve point-valued blocks. The construction uses block-dependent scalar key matrices to transform plaintext blocks whose entries lie in a selected elliptic-curve subgroup of prime order . The encryption operation is defined by the elliptic-curve scalar matrix action where the entries of act as scalar coefficients modulo , and point additions are performed in . The main purpose of the construction is to formalize the interaction between recursive Pell-type matrix sequences over and elliptic-curve point-valued block transformations. The algebraic correctness follows from the invertibility of over and the compatibility of the -action with the matrix multiplication. The deterministic version is not claimed to provide semantic security or IND-CPA security without additional randomization, nonce-dependent masking, and formal security proofs. - Open Access
- 4 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1997
A Hybrid Matrix-Based Cryptographic Framework Using Multiple Linear Recurrence Sequences
In this study, we propose a matrix-based transformation framework constructed from special integer sequences, including Fibonacci, Lucas, Pell, and Jacobsthal numbers. The approach is based on block-wise matrix transformations that preserve key structural invariants, particularly the determinant, ensuring explicit invertibility of the scheme. By combining multiple recurrence-based matrices within a unified framework, the method provides flexible forward and inverse transformations without increasing matrix dimensions or introducing additional redundancy. The determinant-preserving property enables intrinsic consistency checking and supports an analytic error-detection and correction mechanism at the block level. Several illustrative examples are presented to demonstrate the applicability of the proposed scheme and its computational characteristics. The framework is purely algebraic and can be extended to other matrix families generated by linear recurrence relations, making it suitable for a wide range of applications in applied and computational mathematics.- 4 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1997
Open AccessA Hybrid Matrix-Based Cryptographic Framework Using Multiple Linear Recurrence Sequences
In this study, we propose a matrix-based transformation framework constructed from special integer sequences, including Fibonacci, Lucas, Pell, and Jacobsthal numbers. The approach is based on block-wise matrix transformations that preserve key structural invariants, particularly the determinant, ensuring explicit invertibility of the scheme. By combining multiple recurrence-based matrices within a unified framework, the method provides flexible forward and inverse transformations without increasing matrix dimensions or introducing additional redundancy. The determinant-preserving property enables intrinsic consistency checking and supports an analytic error-detection and correction mechanism at the block level. Several illustrative examples are presented to demonstrate the applicability of the proposed scheme and its computational characteristics. The framework is purely algebraic and can be extended to other matrix families generated by linear recurrence relations, making it suitable for a wide range of applications in applied and computational mathematics. - Open Access
- 24 April 2026
- Published by MDPI AG in Preprints.org
A Hybrid Matrix-Based Cryptographic Framework Using Multiple Linear Recurrence Sequences
In this study, we propose a matrix-based transformation framework constructed from special integer sequences, including Fibonacci, Lucas, Pell, and Jacobsthal numbers. The approach is based on block-wise 2×2 matrix transformations that preserve key structural invariants, particularly the determinant, ensuring explicit invertibility of the scheme. By combining multiple recurrence-based matrices within a unified framework, the method provides flexible forward and inverse transformations without increasing matrix dimensions or introducing additional redundancy. The determinant-preserving property enables intrinsic consistency checking and supports an analytic error-detection and correction mechanism at the block level. Several illustrative examples are presented to demonstrate the applicability of the proposed scheme and its computational characteristics. The framework is purely algebraic and can be extended to other matrix families generated by linear recurrence relations, making it suitable for a wide range of applications in applied and computational mathematics.
- 24 April 2026
- Published by MDPI AG in Preprints.org
Open AccessA Hybrid Matrix-Based Cryptographic Framework Using Multiple Linear Recurrence Sequences
In this study, we propose a matrix-based transformation framework constructed from special integer sequences, including Fibonacci, Lucas, Pell, and Jacobsthal numbers. The approach is based on block-wise 2×2 matrix transformations that preserve key structural invariants, particularly the determinant, ensuring explicit invertibility of the scheme. By combining multiple recurrence-based matrices within a unified framework, the method provides flexible forward and inverse transformations without increasing matrix dimensions or introducing additional redundancy. The determinant-preserving property enables intrinsic consistency checking and supports an analytic error-detection and correction mechanism at the block level. Several illustrative examples are presented to demonstrate the applicability of the proposed scheme and its computational characteristics. The framework is purely algebraic and can be extended to other matrix families generated by linear recurrence relations, making it suitable for a wide range of applications in applied and computational mathematics.
- Open Access
Different Bounds of Various Norms of Special Matrices with Generalized Pell–Lucas Sequence
Norm bounds for circulant-type matrices associated with the bi-periodic Pell–Lucas sequence are examined from a symmetry-driven perspective. By incorporating alternating recurrence coefficients, the results clarify how periodicity and circulant structure affect spectral norm behavior through explicit bounds. This framework extends existing Pell–Lucas-type matrix inequalities and emphasizes the role of symmetry in spectral analysis.
Open AccessDifferent Bounds of Various Norms of Special Matrices with Generalized Pell–Lucas Sequence
Norm bounds for circulant-type matrices associated with the bi-periodic Pell–Lucas sequence are examined from a symmetry-driven perspective. By incorporating alternating recurrence coefficients, the results clarify how periodicity and circulant structure affect spectral norm behavior through explicit bounds. This framework extends existing Pell–Lucas-type matrix inequalities and emphasizes the role of symmetry in spectral analysis.
- Open Access
Relations Established Between Hypergeometric Functions and Some Special Number Sequences
In this paper, we establish new hypergeometric representations for two classical integer sequences, namely the Pell and Jacobsthal sequences. Motivated by Dilcher’s hypergeometric formulations of the Fibonacci sequence, we extend this framework to other second-order linear recurrence sequences with distinct characteristic structures. By employing Binet-type formulas, recurrence relations, Chebyshev polynomial connections, and classical transformation properties of Gauss hypergeometric functions, we derive several explicit and alternative representations for the Pell and Jacobsthal numbers. These representations unify known identities, yield new closed-form expressions, and reveal deeper structural parallels between hypergeometric functions and linear recurrence sequences. The results demonstrate that hypergeometric functions provide a systematic and versatile analytical tool for studying special number sequences beyond the Fibonacci case, and they suggest potential extensions to broader families such as Horadam-type sequences and their generalizations.
Open AccessRelations Established Between Hypergeometric Functions and Some Special Number Sequences
In this paper, we establish new hypergeometric representations for two classical integer sequences, namely the Pell and Jacobsthal sequences. Motivated by Dilcher’s hypergeometric formulations of the Fibonacci sequence, we extend this framework to other second-order linear recurrence sequences with distinct characteristic structures. By employing Binet-type formulas, recurrence relations, Chebyshev polynomial connections, and classical transformation properties of Gauss hypergeometric functions, we derive several explicit and alternative representations for the Pell and Jacobsthal numbers. These representations unify known identities, yield new closed-form expressions, and reveal deeper structural parallels between hypergeometric functions and linear recurrence sequences. The results demonstrate that hypergeometric functions provide a systematic and versatile analytical tool for studying special number sequences beyond the Fibonacci case, and they suggest potential extensions to broader families such as Horadam-type sequences and their generalizations.
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
A Hybrid Matrix–Based Encoding Scheme With Error Detection via Third‐Order Recurrences
In this paper, we propose a novel encoding–decoding algorithm based on third‐order linear recurrence sequences and their associated matrix representations. In particular, third‐order Jacobsthal and third‐order Jacobsthal–Lucas matrix sequences are combined with Padovan and Perrin matrix sequences to construct a hybrid block–based coding scheme. The plaintext is arranged into 3 × 3 blocks, and each block is encoded by multiplication with specially selected matrix sequences determined by a sequence tree diagram. Determinant and trace properties of the involved matrices play a fundamental role in the decoding phase. A structural performance discussion is provided analyzing encoding key domain size and algebraic robustness against representation attacks. Compared to classical Fibonacci‐based coding schemes, the use of third‐order recurrences and hybrid matrix selection increases structural complexity and enlarges the encoding key domain. An explicit example is provided to illustrate correctness and feasibility of the method.
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Open AccessA Hybrid Matrix–Based Encoding Scheme With Error Detection via Third‐Order Recurrences
In this paper, we propose a novel encoding–decoding algorithm based on third‐order linear recurrence sequences and their associated matrix representations. In particular, third‐order Jacobsthal and third‐order Jacobsthal–Lucas matrix sequences are combined with Padovan and Perrin matrix sequences to construct a hybrid block–based coding scheme. The plaintext is arranged into 3 × 3 blocks, and each block is encoded by multiplication with specially selected matrix sequences determined by a sequence tree diagram. Determinant and trace properties of the involved matrices play a fundamental role in the decoding phase. A structural performance discussion is provided analyzing encoding key domain size and algebraic robustness against representation attacks. Compared to classical Fibonacci‐based coding schemes, the use of third‐order recurrences and hybrid matrix selection increases structural complexity and enlarges the encoding key domain. An explicit example is provided to illustrate correctness and feasibility of the method.
- Open Access
- 22 December 2025
- Published by Wiley
Notes on Bounds of the Norms of Various Circulant Matrices with bi-periodic Pell numbers
In this paper, we investigate spectral norm bounds of several classes of circulant-type matrices whose entries are generated by the bi-periodic Pell sequence. This sequence generalizes the classical Pell numbers and establishes connections with bi-periodic Fibonacci and Lucas sequences through two positive real parameters. We first derive new summation formulas for the bi-periodic Pell numbers, which play a key role in the norm analysis. Based on these results, we construct r -circulant, symmetric r-circulant, and geometric circulant matrices associated with the bi-periodic Pell sequence and obtain explicit upper and lower bounds for their spectral norms using different analytical approaches, including Frobenius norm inequalities, matrix norm relations, and entrywise estimates. Furthermore, we establish norm bounds for the Hadamard and Kronecker products of these matrices, providing a unified framework for analyzing matrix products arising from bi-periodic recursive structures. In addition, closed-form expressions for the eigenvalues of the r -circulant matrices are derived, allowing further insight into their spectral properties. The results presented here extend and generalize several existing norm inequalities for circulant matrices in the literature and contribute new analytical tools for the study of structured matrices generated by bi-periodic sequences.
- 22 December 2025
- Published by Wiley
Open AccessNotes on Bounds of the Norms of Various Circulant Matrices with bi-periodic Pell numbers
In this paper, we investigate spectral norm bounds of several classes of circulant-type matrices whose entries are generated by the bi-periodic Pell sequence. This sequence generalizes the classical Pell numbers and establishes connections with bi-periodic Fibonacci and Lucas sequences through two positive real parameters. We first derive new summation formulas for the bi-periodic Pell numbers, which play a key role in the norm analysis. Based on these results, we construct r -circulant, symmetric r-circulant, and geometric circulant matrices associated with the bi-periodic Pell sequence and obtain explicit upper and lower bounds for their spectral norms using different analytical approaches, including Frobenius norm inequalities, matrix norm relations, and entrywise estimates. Furthermore, we establish norm bounds for the Hadamard and Kronecker products of these matrices, providing a unified framework for analyzing matrix products arising from bi-periodic recursive structures. In addition, closed-form expressions for the eigenvalues of the r -circulant matrices are derived, allowing further insight into their spectral properties. The results presented here extend and generalize several existing norm inequalities for circulant matrices in the literature and contribute new analytical tools for the study of structured matrices generated by bi-periodic sequences.
- Open Access
- 18 December 2025
- Published by MDPI AG in Preprints.org
Relations Established Between Hypergeometric Functions and Some Special Number Sequences
In this study, we establish novel hypergeometric representations for the two classical sequences that are the Pell and Jacobsthal sequences. Building on Dilcher’s hypergeometric formulation of the Fibonacci sequence, we extend similar results and derive analogous structures for these two classical sequences. The results unify several known identities, provide new explicit representations, and offer a broader perspective on hypergeometric interpretations of linear second order recurrence sequences.
- 18 December 2025
- Published by MDPI AG in Preprints.org
Open AccessRelations Established Between Hypergeometric Functions and Some Special Number Sequences
In this study, we establish novel hypergeometric representations for the two classical sequences that are the Pell and Jacobsthal sequences. Building on Dilcher’s hypergeometric formulation of the Fibonacci sequence, we extend similar results and derive analogous structures for these two classical sequences. The results unify several known identities, provide new explicit representations, and offer a broader perspective on hypergeometric interpretations of linear second order recurrence sequences.
- Open Access
- 27 September 2025
- Published by Academic Publications in International Journal of Applied Mathematics
- Vol. 38 (4s) , 447-459
A NEW APPLICATION TO CODING THEORY VIA GUGLIELMO NUMBERS
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
- 27 September 2025
- Published by Academic Publications in International Journal of Applied Mathematics
- Vol. 38 (4s) , 447-459
Open AccessA NEW APPLICATION TO CODING THEORY VIA GUGLIELMO NUMBERS
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
- Open Access
- 28 March 2025
- Published by Gaziosmanpasa University in Journal of New Theory
- No. 50,p. 56-67
On Various Binomial Transforms of the Generalized Pell Matrix Sequences
The main aim of this study is to apply different binomial transforms to the generalized Pell matrix sequences. We define the binomial, $s$-binomial, rising, and falling transforms for the generalized Pell matrix sequence. We establish some algebraic properties, such as the recurrent formulas, Binet formulas, generating functions, and sum formulas, for binomial transforms of the generalized Pell matrix sequences. Finally, we discuss the need for further research.
- 28 March 2025
- Published by Gaziosmanpasa University in Journal of New Theory
- No. 50,p. 56-67
Open AccessOn Various Binomial Transforms of the Generalized Pell Matrix Sequences
The main aim of this study is to apply different binomial transforms to the generalized Pell matrix sequences. We define the binomial, $s$-binomial, rising, and falling transforms for the generalized Pell matrix sequence. We establish some algebraic properties, such as the recurrent formulas, Binet formulas, generating functions, and sum formulas, for binomial transforms of the generalized Pell matrix sequences. Finally, we discuss the need for further research.