Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A New Highly Accurate Approach to Compact Operators on Some Generalized Fibonacci Difference Sequence Spaces

Version 1 : Received: 29 December 2023 / Approved: 3 January 2024 / Online: 3 January 2024 (05:44:18 CET)

How to cite: Candan, M. A New Highly Accurate Approach to Compact Operators on Some Generalized Fibonacci Difference Sequence Spaces. Preprints 2024, 2024010143. https://doi.org/10.20944/preprints202401.0143.v1 Candan, M. A New Highly Accurate Approach to Compact Operators on Some Generalized Fibonacci Difference Sequence Spaces. Preprints 2024, 2024010143. https://doi.org/10.20944/preprints202401.0143.v1

Abstract

The current research examines the many characteristics of the $\ell_{p}(\widetilde{F}(\widetilde{r},\widetilde{s}))$ $(1\leq p<\infty)$ and $\ell_{\infty}(\widetilde{F}(\widetilde{r},\widetilde{s}))$ spaces which are the generalized forms of those by Candan in 2024 using Fibonacci numbers and two non-zero real numbers in accordance with a predetermined rule, we have made an effort to go through all the characteristics and features which the author of earlier versions thought are the most valuable. This manuscript contains all the information required to describe the matrix class $(\ell_{1},\ell_{p}(\widetilde{F}(\widetilde{r},\widetilde{s})))$ $(1\leq p<\infty)$ which are going to be given in detail in the following sections of the manuscript. We are going to offer estimates for the norms of the bounded linear operators $L_{A}$ formed by those matrix transformations utilizing the Hausdorff measure of non-compactness and identify prerequisites to derive the relevant subclasses of compact matrix operators. When the findings of the current study are compared to those found in the literature, it can be said that the newly found ones are more inclusive and comprehensive.

Keywords

Sequence spaces; Fibonacci numbers; Compact operators; Hausdorff measure of non-compactness

Subject

Computer Science and Mathematics, Analysis

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.