On the New Generalized Hahn Sequence Space h d Q3 Mathematics Abstract and Applied Analysis Pub Date : 2022-09-16 DOI:10.1155/2022/6832559 Orhan Tuǧ, E. Malkowsky, B. Hazarika, Taja Yaying 求助PDF {"title":"On the New Generalized Hahn Sequence Space <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\">\n <msubsup>\n <mrow>\n <mi>h</mi>\n </mrow>\n <mrow>\n <mi>d</mi","authors":"Orhan Tuǧ, E. Malkowsky, B. Hazarika, Taja Yaying","doi":"10.1155/2022/6832559","DOIUrl":null,"url":null,"abstract":"<jats:p>In this article, we define the new generalized Hahn sequence space <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M2\">\n <msubsup>\n <mrow>\n <mi>h</mi>\n </mrow>\n <mrow>\n <mi>d</mi>\n </mrow>\n <mrow>\n <mi>p</mi>\n </mrow>\n </msubsup>\n </math>\n </jats:inline-formula>, where <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M3\">\n <mi>d</mi>\n <mo>=</mo>\n <msubsup>\n <mrow>\n <mfenced open=\"(\" close=\")\">\n <mrow>\n <msub>\n <mrow>\n <mi>d</mi>\n </mrow>\n <mrow>\n <mi>k</mi>\n </mrow>\n </msub>\n </mrow>\n </mfenced>\n </mrow>\n <mrow>\n <mi>k</mi>\n <mo>=</mo>\n <mn>1</mn>\n </mrow>\n <mrow>\n <mo>∞</mo>\n </mrow>\n </msubsup>\n </math>\n </jats:inline-formula> is monotonically increasing sequence with <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M4\">\n <msub>\n <mrow>\n <mi>d</mi>\n </mrow>\n <mrow>\n <mi>k</mi>\n </mrow>\n </msub>\n <mo>≠</mo>\n <mn>0</mn>\n </math>\n </jats:inline-formula> for all <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M5\">\n <mi>k</mi>\n <mo>∈</mo>\n <mi>ℕ</mi>\n </math>\n </jats:inline-formula>, and <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M6\">\n <mn>1</mn>\n <mo><</mo>\n <mi>p</mi>\n <mo><</mo>\n <mo>∞</mo>\n </math>\n </jats:inline-formula>. Then, we prove some topological properties and calculate the <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M7\">\n <mi>α</mi>\n <mo>−</mo>\n </math>\n </jats:inline-formula>, <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M8\">\n <mi>β</mi>\n <mo>−</mo>\n </math>\n </jats:inline-formula>, and <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M9\">\n <mi>γ</mi>\n <mo>−</mo>\n </math>\n </jats:inline-formula>duals of <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M10\">\n <msubsup>\n <mrow>\n <mi>h</mi>\n </mrow>\n <mrow>\n <mi>d</mi>\n </mrow>\n <mrow>\n <mi>p</mi>\n </mrow>\n </msubsup>\n </math>\n </jats:inline-formula>. Furthermore, we characterize the new matrix classes <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M11\">\n <mfenced open=\"(\" close=\")\">\n <mrow>\n <msub>\n <mrow>\n <mi>h</mi>\n </mrow>\n <mrow>\n <mi>d</mi>\n </mrow>\n </msub>\n <mo>,</mo>\n <mi>λ</mi>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula>, where <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M12\">\n <mi>λ</mi>\n <mo>=</mo>\n <mfenced open=\"{\" close=\"}\">\n <mrow>\n <mi>b</mi>\n <mi>v</mi>\n <mo>,</mo>\n <mi>b</mi>\n <msub>\n <mrow>\n <mi>v</mi>\n </mrow>\n <mrow>\n <mi>p</mi>\n </mrow>\n </msub>\n <mo>,</mo>\n <mi>b</mi>\n <msub>\n <mrow>\n <mi>v</mi>\n </mrow>\n <mrow>\n <mo>∞</mo>\n </mrow>\n </msub>\n <mo>,</mo>\n <mi>b</mi>\n <mi>s</mi>\n <mo>,</mo>\n <mi>c</mi>\n <mi>s</mi>\n <mo>,</mo>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula>, and <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M13\">\n <mfenced open=\"(\" close=\")\">\n <mrow>\n <mi>μ</mi>\n <mo>,</mo>\n <msub>\n <mrow>\n <mi>h</mi>\n </mrow>\n <mrow>\n <mi>d</mi>\n </mrow>\n </msub>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula>, where <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M14\">\n <mi>μ</mi>\n <mo>=</mo>\n <mfenced open=\"{\" close=\"}\">\n <mrow>\n <mi>b</mi>\n <mi>v</mi>\n <mo>,</mo>\n <mi>b</mi>\n <msub>\n <mrow>\n <mi>v</mi>\n </mrow>\n <mrow>\n <mn>0</mn>\n </mrow>\n </msub>\n <mo>,</mo>\n <mi>b</mi>\n <mi>s</mi>\n <mo>,</mo>\n <mi>c</mi>\n <msub>\n <mrow>\n <mi>s</mi>\n </mrow>\n <mrow>\n <mn>0</mn>\n </mrow>\n </msub>\n <mo>,</mo>\n <mi>c</mi>\n <mi>s</mi>\n </mrow>\n </mfenced>\n </math>\n </jats:inline-formula>. In the last section, we prove the necessary and sufficient conditions of the matrix transformations from <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M15\">\n <msubsup>\n <mrow>\n <mi>h</mi>\n </mrow>\n <mrow>\n <mi>d</mi>\n </mrow>\n <mrow>\n <mi>p</mi>\n </mrow>\n </msubsup>\n </math>\n </jats:inline-formula> into <jats:inline-formula>\n <math xmlns=\"http://www.w3.org/1998/Math/MathML\" id=\"M16\">\n <mi>λ</mi>\n ","PeriodicalId":7061,"journal":{"name":"Abstract and Applied Analysis","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Abstract and Applied Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/6832559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0} 引用次数: 1 引用 批量引用 Abstract In this article, we define the new generalized Hahn sequence space h d p , where d = d k k = 1 ∞ is monotonically increasing sequence with d k ≠ 0 for all k ∈ ℕ , and 1 < p < ∞ . Then, we prove some topological properties and calculate the α − , β − , and γ − duals of h d p . Furthermore, we characterize the new matrix classes h d , λ , where λ = b v , b v p , b v ∞ , b s , c s , , and μ , h d , where μ = b v , b v 0 , b s , c s 0 , c s . In the last section, we prove the necessary and sufficient conditions of the matrix transformations from h d p into λ 查看原文 分享 微信好友 朋友圈 QQ好友 复制链接 本刊更多论文 关于新的广义Hahn序列空间h d 在本文中，我们定义了新的广义Hahn序列空间hdp，其中d=dk k=1∞是具有dk的单调递增序列对于所有k∈ℕ , 和1P∞。然后，我们证明了一些拓扑性质，并计算了α−，h d的γ-对偶p 本文章由计算机程序翻译，如有差异，请以英文原文为准。 求助全文 约1分钟内获得全文 去求助 相关文献 来源期刊 Abstract and Applied Analysis 数学-数学 CiteScore 2.30 自引率 0.00% 发文量 36 审稿时长 3.5 months 期刊介绍： Abstract and Applied Analysis is a mathematical journal devoted exclusively to the publication of high-quality research papers in the fields of abstract and applied analysis. Emphasis is placed on important developments in classical analysis, linear and nonlinear functional analysis, ordinary and partial differential equations, optimization theory, and control theory. Abstract and Applied Analysis supports the publication of original material involving the complete solution of significant problems in the above disciplines. Abstract and Applied Analysis also encourages the publication of timely and thorough survey articles on current trends in the theory and applications of analysis. 期刊最新文献 Multiplicity of Solutions for a Class of Kirchhoff–Poisson Type Problem Frequently Hypercyclic Semigroup Generated by Some Partial Differential Equations with Delay Operator The Solvability and Explicit Solutions of Singular Integral–Differential Equations with Reflection Efficient Numerical Method for Solving a Quadratic Riccati Differential Equation A Complex Dynamic of an Eco-Epidemiological Mathematical Model with Migration × 引用 GB/T 7714-2015 复制 MLA 复制 APA 复制 导出至 BibTeX EndNote RefMan NoteFirst NoteExpress × 快捷登录 密码登录 未注册的手机号，验证通过后自动注册 获取验证码 勾选即代表同意 《Book学术使用协议》 注册新账号 两周内记住我 忘记密码？ 注册新账号 打开微信，扫描二维码 您必须已注册Book学术，并关注『Book学术』公众号绑定账户。 请完成安全验证× × 求助内容： 标题： DOI： 期刊： 作者： 出版日期： 数据库： 积分： 文献类型： 期刊论文 学位论文 图书 其他 (专利、报告等) 补充材料： 只需要正文 仅需补充材料 注：不可同时求助正文和补充材料，需分开求助。 应助结果提醒方式： 微信（请自行确认已关注Book学术公众号） 邮件 保存 保存后同步修改账户信息中的邮箱 确认发布求助 × 没积分了 多种获得积分方式，供你选择！ 查看如何获取积分 × 处理提示 您的部分求助已有人上传文件，您还尚未处理，请先处理完毕再发起新的求助 点击查看 × 努力提交中 提交成功 继续求助查看详情 × 提示 您的信息不完整，为了账户安全，请先补充。 现在去补充 × 提示 您因"违规操作" 具体请查看互助需知 我知道了 × 提示 现在去查看 取消 × 提示 确定 0 微信 客服QQ 扫码关注我们 反馈 顶部 × 意见反馈 请填写您的意见或建议 请填写您的手机或邮箱 已复制链接 快去分享给好友吧! 我知道了 × 扫码分享 var isSubmit = false; $(function () { var title = $("#title").val(); var id = $("#id").val(); $.post("/Literature/GetRelatedLiterature", { id: id, title: title }, function (result) { if (result != null) { var html = ``; for (var i = 0; i < result.length; i++) { html += `<div class="xglist" id="xglist">`; html += `<a class="caption" href="` + $("#url1").val() + result[i].ArticleID + `.htm">` + result[i].Title + `</a>`; html += ` <div class="substance">`; html += `<span class="IF">IF ` + result[i].PeriodicalIF + ` </span>`; if (result[i].RegionNum > 0) { html += `<span class="fq` + result[i].RegionNum + `">` + result[i].RegionNum + `区 ` + result[i].RegionCategory + `</span>`; } html += `<a href="` + $("#url2").val() + "_d" + result[i].PeriodicalID + `.htm" target="_blank"><em>` + result[i].PeriodicalName + `</em></a>`; html += `<span class="Pub">Pub Date : ` + result[i].PublishDate + `</span>`; html += ` <span class="Pub">DOI: ` + result[i].DOI + `</span>`; html += `</div>`; html += ` <div class="author">`; html += result[i].AuthorName; html += `</div>`; html += `</div>`; } if (html.length > 0) { $("#xglist").show(); $("#xglist").append(html); } } }); $.post("/Common/GetArticleDetailAd", { id: id }, function (result) { if (result != null) { var html = ''; for (var i = 0; i < result.length; i++) { html += '<a href="' + result[i].AdUrl + '" target="_blank"><img src="' + result[i].AdPath + '" width="270" height="160" alt="' + result[i].CompanyName + '" data-module="sciad" data-two-module="articledetail" data-key-value1="' + result[i].CompanyName + '" data-log-type="20"/></a>'; } if (html != "") { $(".ADbox").html(html); $(".ADbox").show(); /*$("div[data-google-ad='true']").remove();*/ } } }); $("div[data-more='true']").click(function () { var adid = $(this).attr("data-more-ad-id"); $("tr[data-hide-row='true'][data-ad-id='" + adid + "']").toggle(); if ($(this).hasClass("ckqb1")) { $(this).removeClass("ckqb1"); $(this).addClass("ckqb2"); } else { $(this).removeClass("ckqb2"); $(this).addClass("ckqb1"); } }) }) Book学术文献互助群群 号：481959085 文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 Book学术 All rights reserved. 京公网安备 11010802042870号 京ICP备2023020795号-1 × var fclearShow $(function () { $("#fkeyword").val($("#tkeyword").val()); if ($("#fkeyword").val().trim().length > 0) { $("#fclear").show(); fclearShow = true; } $("#fclear").click(function () { $("#fkeyword").val(""); $("#fclear").hide(); fclearShow = false; $("#fkeyword").focus(); }); $("#fkeyword").keyup(function (event) { var which = event.which; if ($(this).val().trim().length > 0) { if (!fclearShow) { $("#fclear").show(); fclearShow = true; } } else { if (fclearShow) { $("#fclear").hide(); fclearShow = false; } } if (which==13) { $("#fsearch").click(); } }); $("#fkeyword").change(function () { if ($(this).val().trim().length > 0) { if (!fclearShow) { $("#fclear").show(); fclearShow = true; } } else { if (fclearShow) { $("#fclear").hide(); fclearShow = false; } } }); $("#fsearch").click(function () { if ($("#fkeyword").val().trim() == "") { alert("请输入搜索关键字"); $("#fkeyword").focus(); return; } var regex = /\b(10[.][0-9]{4,}(?:[.][0-9]+)*\/(?:(?![\|"&\'])\S)+)(?:\+?|\b)/g; const optionarr = $("#fkeyword").val().trim().match(regex); if ((optionarr != undefined && optionarr.length > 0) || isPaperGo($("#fkeyword").val().trim())) { window.open("/literature/literaturelist?keyword=" + encodeURIComponent($("#fkeyword").val())); } else { window.location.href = "/literature/literaturelist?keyword=" + encodeURIComponent($("#fkeyword").val()); } }); $(window).scroll(function () { var scrollTop = $(this).scrollTop(); if (scrollTop > $("#menufloat").offset().top) { $("#fkeyword").val($("#tkeyword").val()); $("#menufloat2").show(); $("#menufloat").css("visibility", "hidden"); } else if (scrollTop <= $("#menufloat").offset().top) { $("#menufloat2").hide(); $("#menufloat").css("visibility", ""); } }) }) function isPaperGo(s) { let pos = 0; let digitCount = 0; let flag = false; const searchCleanArr = s.split(/[., ]/).map(item => item.trim()).filter(item => item !== ''); for (const item of searchCleanArr) { if (!flag) { if (!isNaN(parseInt(item[0]))) { flag = !flag; } else { pos += item.length; } } else { for (const i of item) { if (!isNaN(i)) { digitCount++; } } } } const sLength = (searchCleanArr.join('')).substring(pos).length; if (sLength === 0 || digitCount / sLength < 0.5) { return false; } return true; } var clearShow = false; $(function () { if ($("#tkeyword").val().trim().length > 0) { $("#clear").show(); clearShow = true; } $("#tkeyword").keydown(function (e) { var curKey = e.which; if (curKey == 13) { } }); $("#SearchBtn").click(function () { var keyWordHome = $("#tkeyword").val(); var fullWidthRegex = /[\u3000-\u303F\u3040-\u309F\u30A0-\u30FF\u3100-\u312F\u3130-\u318F\u3190-\u319F\u31A0-\u31BF\u31C0-\u31EF\u31F0-\u31FF\u3200-\u32FF\u3300-\u33FF\uFF00-\uFFEF\u4E00-\u9FFF]/; if (keyWordHome.trim().length == 0) { alert("请输入搜索关键字"); $("#tkeyword").focus(); return; } if (/[\u4e00-\u9fa5]/.test($("#tkeyword").val())) { if ($("#tkeyword").val().trim().length > 200) { alert("关键词长度不能大于200个字符"); return; } } else { if ($("#tkeyword").val().trim().length > 500) { alert("关键词长度不能大于500个字符"); return; } } if (fullWidthRegex.test(keyWordHome)) { keyWordHome = toHalfWidth(keyWordHome); } var regex = /\b(10[.][0-9]{4,}(?:[.][0-9]+)*\/(?:(?![\|"&\'])\S)+)(?:\+?|\b)/g; const optionarr = keyWordHome.trim().match(regex); if ((optionarr != undefined && optionarr.length > 0) || isPaperGo(keyWordHome.trim())) { window.open('/literature/literaturelist?keyword=' + encodeURIComponent(keyWordHome)); } else { window.location.href = '/literature/literaturelist?keyword=' + encodeURIComponent(keyWordHome); } }); $(":text.ssi").unbind().keyup(function (event) { var which = event.which; if (which != 13) { if ($("[data-module='scisearch']").length > 0) { $("[data-module='scisearch']").attr("data-search-value", $(this).val()); } } else { $("#SearchBtn").click(); } }); $(":text.ssi").on('input', function () { if ($("[data-module='scisearch']").length > 0) { $("[data-module='scisearch']").attr("data-search-value", $(this).val()); } }); $("#clear").click(function () { $("#tkeyword").val(""); $("#clear").hide(); clearShow = false; $("#tkeyword").focus(); }); $("#tkeyword").keyup(function () { if ($(this).val().trim().length > 0) { if (!clearShow) { $("#clear").show(); clearShow = true; } } else { if (clearShow) { $("#clear").hide(); clearShow = false; } } }); $("#tkeyword").change(function () { if ($(this).val().trim().length > 0) { if (!clearShow) { $("#clear").show(); clearShow = true; } } else { if (clearShow) { $("#clear").hide(); clearShow = false; } } }) if (getCookie("userName") == null) { if (getCookie("_sci_uid") == null) { var uuidstr = getuuid(); setCookie("_sci_uid", "sci_" + uuidstr, 9999); } } }); function isPaperGo(s) { let pos = 0; let digitCount = 0; let flag = false; const searchCleanArr = s.split(/[., ]/).map(item => item.trim()).filter(item => item !== ''); for (const item of searchCleanArr) { if (!flag) { if (!isNaN(parseInt(item[0]))) { flag = !flag; } else { pos += item.length; } } else { for (const i of item) { if (!isNaN(i)) { digitCount++; } } } } const sLength = (searchCleanArr.join('')).substring(pos).length; if (sLength === 0 || digitCount / sLength < 0.5) { return false; } return true; }

Abstract

In this article, we define the new generalized Hahn sequence space $h_d^p$ , where $d={\left(d_k\right)}_{k=1}^{\infty }$ is monotonically increasing sequence with $d_k\ne 0$ for all $k\in \mathbb{N}$ , and $1<p<\infty$ . Then, we prove some topological properties and calculate the $\alpha -$ , $\beta -$ , and $\gamma -$ duals of $h_d^p$ . Furthermore, we characterize the new matrix classes $\left(h_d,\lambda \right)$ , where $\lambda =\left\{bv,b{v}_p,b{v}_{\infty },bs,cs,\right\}$ , and $\left(\mu ,h_d\right)$ , where $\mu =\left\{bv,b{v}_0,bs,c{s}_0,cs\right\}$ . In the last section, we prove the necessary and sufficient conditions of the matrix transformations from $h_d^p$ into $\lambda$