Repository logoGCRIS
  • English
  • Türkçe
  • Русский
Log In
New user? Click here to register. Have you forgotten your password?
Home
Communities
Browse GCRIS
Entities
Overview
GCRIS Guide
  1. Home
  2. Browse by Author

Browsing by Author "Savas, Ekrem"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Article
    THE NOVEL TAUBERIAN CONDITIONS ASSOCIATED WITH THE (N-p-q) SUMMABILITY OF DOUBLE SEQUENCES
    (YOKOHAMA PUBL, 2024) Zerrin Onder; Ekrem Savas; Ibrahim Canak; Onder, Zerrin; Canak, Ibrahim; Savas, Ekrem
    . In this paper our primary objective is to provide a fresh perspective on the relationship between the (N (p q)) method which is a product of relevant one-dimensional summability methods and P-convergence for double sequences. To accomplish this objective we establish certain Tauberian conditions that control the behavior of a double sequence in terms of both O-L-oscillation and 0oscillation in certain senses building a bridge between (N (p q)) summability and P-convergence while imposing certain restrictions on the weight sequences. As special circumstances of our findings we demonstrate that Landau-type O-L condition with respect to (Pm) and (CM as well as Hardy-type 0 condition with respect to (P-m) and (Q(n)) serve as Tauberian conditions for (N (p q)) summability under particular additional conditions. Consequently these results encompass all classical Tauberian theorems including conditions such as slow decrease or slow oscillation in certain senses.
Repository logo
Collections
  • Scopus Collection
  • WoS Collection
  • TrDizin Collection
  • PubMed Collection
Entities
  • Research Outputs
  • Organizations
  • Researchers
  • Projects
  • Awards
  • Equipments
  • Events
About
  • Contact
  • GCRIS
  • Research Ecosystems
  • Feedback
  • OAI-PMH

Log in to GCRIS Dashboard

GCRIS Mobile

Download GCRIS Mobile on the App StoreGet GCRIS Mobile on Google Play

Powered by Research Ecosystems

  • Privacy policy
  • End User Agreement
  • Feedback