首页 > 最新文献

Open Mathematics最新文献

英文 中文
Construction of 4 x 4 symmetric stochastic matrices with given spectra 构建具有给定频谱的 4 x 4 对称随机矩阵
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-03-16 DOI: 10.1515/math-2023-0176
Jaewon Jung, Donggyun Kim
The symmetric stochastic inverse eigenvalue problem (SSIEP) asks which lists of real numbers occur as the spectra of symmetric stochastic matrices. When the cardinality of a list is 4, Kaddoura and Mourad provided a sufficient condition for SSIEP by a mapping and convexity technique. They also conjectured that the sufficient condition is the necessary condition. This study presents the same sufficient condition for SSIEP, but we do it in terms of the list elements. In this way, we provide a different but more straightforward construction of symmetric stochastic matrices for SSIEP compared to those of Kaddoura and Mourad.
对称随机逆特征值问题(SSIEP)询问哪些实数列表会出现在对称随机矩阵的谱中。当列表的卡片数为 4 时,Kaddoura 和 Mourad 通过映射和凸性技术为 SSIEP 提供了充分条件。他们还猜想,充分条件就是必要条件。本研究为 SSIEP 提出了同样的充分条件,但我们是从列表元素的角度提出的。这样,与 Kaddoura 和 Mourad 的研究相比,我们为 SSIEP 提供了一种不同但更直接的对称随机矩阵构造。
{"title":"Construction of 4 x 4 symmetric stochastic matrices with given spectra","authors":"Jaewon Jung, Donggyun Kim","doi":"10.1515/math-2023-0176","DOIUrl":"https://doi.org/10.1515/math-2023-0176","url":null,"abstract":"The symmetric stochastic inverse eigenvalue problem (SSIEP) asks which lists of real numbers occur as the spectra of symmetric stochastic matrices. When the cardinality of a list is 4, Kaddoura and Mourad provided a sufficient condition for SSIEP by a mapping and convexity technique. They also conjectured that the sufficient condition is the necessary condition. This study presents the same sufficient condition for SSIEP, but we do it in terms of the list elements. In this way, we provide a different but more straightforward construction of symmetric stochastic matrices for SSIEP compared to those of Kaddoura and Mourad.","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"72 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140147303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhanced Young-type inequalities utilizing Kantorovich approach for semidefinite matrices 利用半有限矩阵的康托洛维奇方法增强杨式不等式
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-03-14 DOI: 10.1515/math-2023-0185
Feras Bani-Ahmad, Mohammad Hussein Mohammad Rashid
This article introduces new Young-type inequalities, leveraging the Kantorovich constant, by refining the original inequality. In addition, we present a range of norm-based inequalities applicable to positive semidefinite matrices, such as the Hilbert-Schmidt norm and the trace norm. The importance of these results lies in their dual significance: they hold inherent value on their own, and they also extend and build upon numerous established results within the existing literature.
本文通过完善原始不等式,利用康托洛维奇常数引入了新的杨式不等式。此外,我们还提出了一系列适用于正半有限矩阵的基于规范的不等式,如希尔伯特-施密特规范和迹规范。这些结果的重要性在于它们的双重意义:它们本身具有内在价值,同时还扩展并建立在现有文献中的众多既定结果之上。
{"title":"Enhanced Young-type inequalities utilizing Kantorovich approach for semidefinite matrices","authors":"Feras Bani-Ahmad, Mohammad Hussein Mohammad Rashid","doi":"10.1515/math-2023-0185","DOIUrl":"https://doi.org/10.1515/math-2023-0185","url":null,"abstract":"This article introduces new Young-type inequalities, leveraging the Kantorovich constant, by refining the original inequality. In addition, we present a range of norm-based inequalities applicable to positive semidefinite matrices, such as the Hilbert-Schmidt norm and the trace norm. The importance of these results lies in their dual significance: they hold inherent value on their own, and they also extend and build upon numerous established results within the existing literature.","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"32 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140147297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Combined system of additive functional equations in Banach algebras 巴拿赫代数中的加法函数方程组合系统
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-03-14 DOI: 10.1515/math-2023-0177
Siriluk Donganont, Choonkil Park
In this study, we solve the system of additive functional equations: h ( x + y ) = h ( x ) + h ( y ) , g ( x + y ) = f ( x ) + f ( y ) , 2 f x + y 2 = g ( x ) + g ( y ) , left{begin{array}{l}hleft(x+y)=hleft(x)+h(y), gleft(x+y)=fleft(x)+f(y), 2fleft(frac{x+y}{2}right)=gleft(x)+g(y),end{array}right. and we investigate the stability of (homomorphism, derivation)-systems in Banach algebras.
在本研究中,我们求解的是加法函数方程组: h ( x + y ) = h ( x ) + h ( y ) , g ( x + y ) = f ( x ) + f ( y ) , 2 f x + y 2 = g ( x ) + g ( y ) 、 h(x+y)=h(left(x)+h(y),(g(left(x+y)=f(left(x)+f(y),(2f(left(frac{x+y}{2}right)=g(left(x)+g(y),(end{array}right. 并研究了巴拿赫代数中(同态、派生)系统的稳定性。
{"title":"Combined system of additive functional equations in Banach algebras","authors":"Siriluk Donganont, Choonkil Park","doi":"10.1515/math-2023-0177","DOIUrl":"https://doi.org/10.1515/math-2023-0177","url":null,"abstract":"In this study, we solve the system of additive functional equations: <jats:disp-formula> <jats:alternatives> <jats:graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0177_eq_001.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\" display=\"block\"> <m:mfenced open=\"{\" close=\"\"> <m:mrow> <m:mtable displaystyle=\"true\"> <m:mtr> <m:mtd columnalign=\"left\"> <m:mi>h</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>+</m:mo> <m:mi>y</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>=</m:mo> <m:mi>h</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>+</m:mo> <m:mi>h</m:mi> <m:mrow> <m:mrow> <m:mo>(</m:mo> </m:mrow> <m:mrow> <m:mi>y</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>,</m:mo> </m:mtd> </m:mtr> <m:mtr> <m:mtd columnalign=\"left\"> <m:mi>g</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>+</m:mo> <m:mi>y</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>=</m:mo> <m:mi>f</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>+</m:mo> <m:mi>f</m:mi> <m:mrow> <m:mrow> <m:mo>(</m:mo> </m:mrow> <m:mrow> <m:mi>y</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>,</m:mo> </m:mtd> </m:mtr> <m:mtr> <m:mtd columnalign=\"left\"> <m:mn>2</m:mn> <m:mi>f</m:mi> <m:mfenced open=\"(\" close=\")\"> <m:mrow> <m:mfrac> <m:mrow> <m:mi>x</m:mi> <m:mo>+</m:mo> <m:mi>y</m:mi> </m:mrow> <m:mrow> <m:mn>2</m:mn> </m:mrow> </m:mfrac> </m:mrow> </m:mfenced> <m:mo>=</m:mo> <m:mi>g</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>x</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>+</m:mo> <m:mi>g</m:mi> <m:mrow> <m:mrow> <m:mo>(</m:mo> </m:mrow> <m:mrow> <m:mi>y</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>,</m:mo> </m:mtd> </m:mtr> </m:mtable> </m:mrow> </m:mfenced> </m:math> <jats:tex-math>left{begin{array}{l}hleft(x+y)=hleft(x)+h(y), gleft(x+y)=fleft(x)+f(y), 2fleft(frac{x+y}{2}right)=gleft(x)+g(y),end{array}right.</jats:tex-math> </jats:alternatives> </jats:disp-formula> and we investigate the stability of (homomorphism, derivation)-systems in Banach algebras.","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"84 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140147290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Local and global solvability for the Boussinesq system in Besov spaces 贝索夫空间中布西尼斯克系统的局部和全局可解性
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-03-14 DOI: 10.1515/math-2023-0182
Shuokai Yan, Lu Wang, Qinghua Zhang
This article focuses on local and global existence and uniqueness for the strong solution to the Boussinesq system in <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0182_eq_001.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msup> <m:mrow> <m:mi mathvariant="double-struck">R</m:mi> </m:mrow> <m:mrow> <m:mi>n</m:mi> </m:mrow> </m:msup> </m:math> <jats:tex-math>{{mathbb{R}}}^{n}</jats:tex-math> </jats:alternatives> </jats:inline-formula> (<jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0182_eq_002.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>n</m:mi> <m:mo>≥</m:mo> <m:mn>3</m:mn> </m:math> <jats:tex-math>nge 3</jats:tex-math> </jats:alternatives> </jats:inline-formula>) with full viscosity in Besov spaces. Under the hypotheses <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0182_eq_003.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mn>1</m:mn> <m:mo><</m:mo> <m:mi>p</m:mi> <m:mo><</m:mo> <m:mi>∞</m:mi> </m:math> <jats:tex-math>1lt plt infty </jats:tex-math> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0182_eq_004.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mo>−</m:mo> <m:mi>min</m:mi> <m:mrow> <m:mo>{</m:mo> <m:mrow> <m:mi>n</m:mi> <m:mo>∕</m:mo> <m:mi>p</m:mi> <m:mo>,</m:mo> <m:mn>2</m:mn> <m:mo>−</m:mo> <m:mi>n</m:mi> <m:mo>∕</m:mo> <m:mi>p</m:mi> </m:mrow> <m:mo>}</m:mo> </m:mrow> <m:mo><</m:mo> <m:mi>s</m:mi> <m:mo>≤</m:mo> <m:mi>n</m:mi> <m:mo>∕</m:mo> <m:mi>p</m:mi> </m:math> <jats:tex-math>-min left{n/p,2-n/pright}lt sle n/p</jats:tex-math> </jats:alternatives> </jats:inline-formula>, and the initial condition <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0182_eq_005.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>θ</m:mi> </m:mrow> <m:mrow> <m:mn>0</m:mn> </m:mrow> </m:msub> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>u</m:mi> </m:mrow> <m:mrow> <m:mn>0</m:mn> </m:mrow> </m:msub> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>∈</m:mo> <m:msubsup> <m:mrow> <m:mover accent="true"> <m:mrow> <m:mi>B</m:mi> </m:mrow> <m:mrow> <m:mo>˙</m:mo> </m:mrow> </m:mover> </m:mrow> <m:mrow> <m:mi>p</m:mi> <m:mo>,</m:mo> <m:mn>1</m:mn> </m:mrow> <m:mrow> <m:mi>s</m:mi> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msubsup> <m:mo>×</m:mo> <m:msubsup> <m:mrow> <m:mover accent="true"> <m:mrow> <m:mi>B</m:mi> </m:mrow> <m:mrow> <m:mo>˙</m:mo> </m:mrow> </m:mover> </m:mrow> <m:mrow> <m:mi>p</m:mi> <m:mo>,</m:mo> <m:mn>1</m:m
本文主要研究在贝索夫空间中,R n {{mathbb{R}}}^{n} ( n ≥ 3 nge 3 ) 中具有全粘性的布森斯克系统强解的局部和全局存在性与唯一性。在假设 1 < p < ∞ 1lt plt infty 和 - min { n ∕ p , 2 - n ∕ p } <;s ≤ n ∕ p -min left{n/p,2-n/plt sle n/p , 和初始条件 ( θ 0 , u 0 ) ∈ B ˙ p , 1 s - 1 × B ˙ p 、1 n ∕ p - 1 left({theta }_{0},{u}_{0})in {dot{B}}_{p,1}^{s-1}times {dot{B}}_{p,1}^{n/p-1}, 证明布西尼斯克系统有唯一的局部强解。在 n ≤ p < ∞ nle plt infty 和 - n ∕ p < s ≤ n ∕ p -n/plt sle n/p 的假设条件下,或者特别是 n ≤ p < 2 n nle plt 2n 和 - n ∕ p < s <;n ∕ p - 1 -n/plt slt n/p-1 ,初始条件 ( θ 0 , u 0 ) ∈ ( B ˙ p 、1 s - 1 ∩ L n ∕ 3 ) × ( B ˙ p , 1 n ∕ p - 1 ∩ L n ) left({theta }_{0},{u}_{0})in left({dot{B}}_{p、1}^{s-1}cap {L}^{n/3})times left({dot{B}}_{p、1}^{n/p-1}cap {L}^{n}) 具有足够小的规范‖ θ 0 ‖ L n ∕ 3 {Vert {theta }_{0}Vert }_{{L}^{n/3}} 和‖ u 0 ‖ L n {Vert {u}_{0}Vert }_{{L}^{n}} 。 证明布辛斯方程组有唯一的全局强解。
{"title":"Local and global solvability for the Boussinesq system in Besov spaces","authors":"Shuokai Yan, Lu Wang, Qinghua Zhang","doi":"10.1515/math-2023-0182","DOIUrl":"https://doi.org/10.1515/math-2023-0182","url":null,"abstract":"This article focuses on local and global existence and uniqueness for the strong solution to the Boussinesq system in &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0182_eq_001.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:msup&gt; &lt;m:mrow&gt; &lt;m:mi mathvariant=\"double-struck\"&gt;R&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msup&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{{mathbb{R}}}^{n}&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; (&lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0182_eq_002.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;≥&lt;/m:mo&gt; &lt;m:mn&gt;3&lt;/m:mn&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;nge 3&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;) with full viscosity in Besov spaces. Under the hypotheses &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0182_eq_003.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;m:mo&gt;&lt;&lt;/m:mo&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;m:mo&gt;&lt;&lt;/m:mo&gt; &lt;m:mi&gt;∞&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;1lt plt infty &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; and &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0182_eq_004.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mi&gt;min&lt;/m:mi&gt; &lt;m:mrow&gt; &lt;m:mo&gt;{&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;∕&lt;/m:mo&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;∕&lt;/m:mo&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;}&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;&lt;&lt;/m:mo&gt; &lt;m:mi&gt;s&lt;/m:mi&gt; &lt;m:mo&gt;≤&lt;/m:mo&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;∕&lt;/m:mo&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;-min left{n/p,2-n/pright}lt sle n/p&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;, and the initial condition &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0182_eq_005.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;θ&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mn&gt;0&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;u&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mn&gt;0&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;∈&lt;/m:mo&gt; &lt;m:msubsup&gt; &lt;m:mrow&gt; &lt;m:mover accent=\"true\"&gt; &lt;m:mrow&gt; &lt;m:mi&gt;B&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mo&gt;˙&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:mover&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;s&lt;/m:mi&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msubsup&gt; &lt;m:mo&gt;×&lt;/m:mo&gt; &lt;m:msubsup&gt; &lt;m:mrow&gt; &lt;m:mover accent=\"true\"&gt; &lt;m:mrow&gt; &lt;m:mi&gt;B&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mo&gt;˙&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:mover&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mn&gt;1&lt;/m:m","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"11 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140147288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The product of a quartic and a sextic number cannot be octic 四元数与六元数的乘积不可能是八元数
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-03-12 DOI: 10.1515/math-2023-0184
Artūras Dubickas, Lukas Maciulevičius
In this article, we prove that the product of two algebraic numbers of degrees 4 and 6 over <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0184_eq_001.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi mathvariant="double-struck">Q</m:mi> </m:math> <jats:tex-math>{mathbb{Q}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> cannot be of degree 8. This completes the classification of so-called product-feasible triplets <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0184_eq_002.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>a</m:mi> <m:mo>,</m:mo> <m:mi>b</m:mi> <m:mo>,</m:mo> <m:mi>c</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>∈</m:mo> <m:msup> <m:mrow> <m:mi mathvariant="double-struck">N</m:mi> </m:mrow> <m:mrow> <m:mn>3</m:mn> </m:mrow> </m:msup> </m:math> <jats:tex-math>left(a,b,c)in {{mathbb{N}}}^{3}</jats:tex-math> </jats:alternatives> </jats:inline-formula> with <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0184_eq_003.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>a</m:mi> <m:mo>≤</m:mo> <m:mi>b</m:mi> <m:mo>≤</m:mo> <m:mi>c</m:mi> </m:math> <jats:tex-math>ale ble c</jats:tex-math> </jats:alternatives> </jats:inline-formula> and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0184_eq_004.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>b</m:mi> <m:mo>≤</m:mo> <m:mn>7</m:mn> </m:math> <jats:tex-math>ble 7</jats:tex-math> </jats:alternatives> </jats:inline-formula>. The triplet <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0184_eq_005.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>a</m:mi> <m:mo>,</m:mo> <m:mi>b</m:mi> <m:mo>,</m:mo> <m:mi>c</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>left(a,b,c)</jats:tex-math> </jats:alternatives> </jats:inline-formula> is called product-feasible if there are algebraic numbers <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0184_eq_006.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>α</m:mi> <m:mo>,</m:mo> <m:mi>β</m:mi> </m:math> <jats:tex-math>alpha ,beta </jats:tex-math> </jats:alternatives> </jats:inline-formula>, and <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0184_eq_007.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>γ</m:mi> </m:math>
在这篇文章中,我们证明了在 Q {mathbb{Q}} 上,度数为 4 和 6 的两个代数数的乘积不可能是度数为 8 的。这就完成了在{{mathbb{N}}^{3}中 a ≤ b ≤ c ale ble c 和 b ≤ 7 ble 7 的所谓乘积可行三元组 ( a , b , c ) ∈ N 3 left(a,b,c) 的分类。如果在 Q {mathbb{Q} 上存在代数数 α , β alpha , beta , 和 γ gamma 的度数分别为 a , b a,b , 和 c c c ,那么三元组 ( a , b , c ) left(a,b,c)被称为乘积可行。} 分别,使得 α β = γ alpha beta = gamma 。在证明过程中,我们使用了一个命题,它描述了 Q [ x ] {mathbb{Q}} 左[x]中所有具有相等模数的四根的一元四次不可还原多项式,并且具有独立的意义。我们还证明了一个更一般的说法,即对于任意整数 n ≥ 2 nge 2 和 k ≥ 1 kge 1,三元组 ( a , b , c ) = ( n , ( n - 1 ) k , n k ) left(a,b,c)=left(n,left(n-1)k,nk) 是乘积可行的,当且仅当 n n 是一个素数。选择 ( n , k ) = ( 4 , 2 ) left(n,k)=left(4,2)也可以恢复 ( a , b , c ) = ( 4 , 6 , 8 ) left(a,b,c)=left(4,6,8)的情况。
{"title":"The product of a quartic and a sextic number cannot be octic","authors":"Artūras Dubickas, Lukas Maciulevičius","doi":"10.1515/math-2023-0184","DOIUrl":"https://doi.org/10.1515/math-2023-0184","url":null,"abstract":"In this article, we prove that the product of two algebraic numbers of degrees 4 and 6 over &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0184_eq_001.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi mathvariant=\"double-struck\"&gt;Q&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{mathbb{Q}}&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; cannot be of degree 8. This completes the classification of so-called product-feasible triplets &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0184_eq_002.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;a&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mi&gt;b&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mi&gt;c&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;∈&lt;/m:mo&gt; &lt;m:msup&gt; &lt;m:mrow&gt; &lt;m:mi mathvariant=\"double-struck\"&gt;N&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mn&gt;3&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msup&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;left(a,b,c)in {{mathbb{N}}}^{3}&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; with &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0184_eq_003.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;a&lt;/m:mi&gt; &lt;m:mo&gt;≤&lt;/m:mo&gt; &lt;m:mi&gt;b&lt;/m:mi&gt; &lt;m:mo&gt;≤&lt;/m:mo&gt; &lt;m:mi&gt;c&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;ale ble c&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; and &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0184_eq_004.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;b&lt;/m:mi&gt; &lt;m:mo&gt;≤&lt;/m:mo&gt; &lt;m:mn&gt;7&lt;/m:mn&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;ble 7&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;. The triplet &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0184_eq_005.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;a&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mi&gt;b&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mi&gt;c&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;left(a,b,c)&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; is called product-feasible if there are algebraic numbers &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0184_eq_006.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;α&lt;/m:mi&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mi&gt;β&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;alpha ,beta &lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;, and &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0184_eq_007.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;γ&lt;/m:mi&gt; &lt;/m:math&gt;","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"21 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140114889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Weighted Hermite-Hadamard-type inequalities without any symmetry condition on the weight function 加权赫米特-哈达马德式不等式,加权函数不带任何对称条件
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-03-12 DOI: 10.1515/math-2023-0178
Mohamed Jleli, Bessem Samet
We establish weighted Hermite-Hadamard-type inequalities for some classes of differentiable functions without assuming any symmetry property on the weight function. Next, we apply our obtained results to the approximation of some classes of weighted integrals.
我们为某些类别的可微函数建立了加权赫米特-哈达马德式不等式,而无需假设加权函数的任何对称性。接下来,我们将获得的结果应用于某些类别加权积分的逼近。
{"title":"Weighted Hermite-Hadamard-type inequalities without any symmetry condition on the weight function","authors":"Mohamed Jleli, Bessem Samet","doi":"10.1515/math-2023-0178","DOIUrl":"https://doi.org/10.1515/math-2023-0178","url":null,"abstract":"We establish weighted Hermite-Hadamard-type inequalities for some classes of differentiable functions without assuming any symmetry property on the weight function. Next, we apply our obtained results to the approximation of some classes of weighted integrals.","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"46 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140114987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On certain functional equation related to derivations 论某些与导数有关的函数方程
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-09 DOI: 10.1515/math-2023-0166
Benjamin Marcen, Joso Vukman
In this article, we prove the following result. Let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0166_eq_001.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>n</m:mi> <m:mo>≥</m:mo> <m:mn>3</m:mn> </m:math> <jats:tex-math>nge 3</jats:tex-math> </jats:alternatives> </jats:inline-formula> be some fixed integer and let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0166_eq_002.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>R</m:mi> </m:math> <jats:tex-math>R</jats:tex-math> </jats:alternatives> </jats:inline-formula> be a prime ring with <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0166_eq_003.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi mathvariant="normal">char</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>R</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>≠</m:mo> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>n</m:mi> <m:mo>+</m:mo> <m:mn>1</m:mn> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>!</m:mo> <m:msup> <m:mrow> <m:mn>2</m:mn> </m:mrow> <m:mrow> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mn>2</m:mn> </m:mrow> </m:msup> </m:math> <jats:tex-math>{rm{char}}left(R)ne left(n+1)&#x0021;{2}^{n-2}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. Suppose there exists an additive mapping <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0166_eq_004.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>D</m:mi> <m:mo>:</m:mo> <m:mi>R</m:mi> <m:mo>→</m:mo> <m:mi>R</m:mi> </m:math> <jats:tex-math>D:Rto R</jats:tex-math> </jats:alternatives> </jats:inline-formula> satisfying the relation <jats:disp-formula> <jats:alternatives> <jats:graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0166_eq_005.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="block"> <m:mrow> <m:mtable displaystyle="true" columnspacing="0.33em"> <m:mtr> <m:mtd columnalign="right"> <m:msup> <m:mrow> <m:mn>2</m:mn> </m:mrow> <m:mrow> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mn>2</m:mn> </m:mrow> </m:msup> <m:mi>D</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:msup> <m:mrow> <m:mi>x</m:mi> </m:mrow> <m:mrow> <m:mi>n</m:mi> </m:mrow> </m:msup> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:mtd> <m:mtd columnalign="center"> <m:mo>=</m:mo> </m:mtd> <m:mtd columnalign="left"> <m:mfenced open="(" close=")"> <m:mrow> <m:munderover> <m:mrow> <m:mstyle displaystyle="true"> <m:mo>∑</m:mo> </m:mstyle> </m:mrow> <m:mrow> <m:mi>i</m:mi> <m:mo>=</m:mo> <m:mn>0</m:mn> </m:mrow> <m:mrow> <m:mi>n</m:mi> <m:mo>−</m:mo> <m:mn>2</m:mn> </m:mrow> </m:munderover> <m:mfenced open="(" close=")"> <m:mfrac linethickness="0.0pt"> <m:mrow> <m:mi>n</m:mi> <m
在本文中,我们将证明以下结果。设 n ≥ 3 nge 3 是某个固定整数,设 R R 是质环,char ( R ) ≠ ( n + 1 ) ! 2 n - 2 {rm{char}}left(R)ne left(n+1)&#x0021;{2}^{n-2} 。假设存在一个加法映射 D : R → R D:Rto R 满足关系式 2 n - 2 D ( x n ) = ∑ i = 0 n - 2 n - 2 i x i D ( x 2 ) x n - 2 - i + ( 2 n - 2 - 1 ) ( D ( x ) x n - 1 + x n - 1 D ( x ) ) + ∑ i = 1 n - 2 ∑ k = 2 i ( 2 k - 1 - 1 ) n - k - 2 i - k + ∑ k = 2 n - 1 - i ( 2 k - 1 - 1 ) n - k - 2 n - i - k - 1 x i D ( x ) x n - 1 - i begin{array}{rcl}{2}^{n-2}Dleft({x}^{n})&;=& left(mathop{displaystyle sum }limits_{i=0}^{n-2}left(genfrac{}{}{0.0pt}{}{n-2}{i}right){x}^{i}Dleft({x}^{2}){x}^{n-2-i}right)+left({2}^{n-2}-1)left(Dleft(x){x}^{n-1}+{x}^{n-1}Dleft(x)) & &+mathop{displaystyle sum }limits_{i=1}^{n-2}left(mathop{displaystyle sum }limits_{k=2}^{i}left({2}^{k-1}-1)left(genfrac{}{}{0.0pt}{}{n-k-2}{i-k}right)+mathop{displaystyle sum }limits_{k=2}^{n-1-i}left({2}^{k-1}-1)left(genfrac{}{}{0.0pt}{}{n-k-2}{n-i-k-1}right){x}^{i}Dleft(x){x}^{n-1-i}end{array} for all x∈ R. xin R. In this case, D D is a derivation.这个结果与赫斯坦的一个经典结果有关,它指出在质环上任何char ( R ) ≠ 2 {rm{char}}left(R)ne 2 的乔丹导数都是一个导数。
{"title":"On certain functional equation related to derivations","authors":"Benjamin Marcen, Joso Vukman","doi":"10.1515/math-2023-0166","DOIUrl":"https://doi.org/10.1515/math-2023-0166","url":null,"abstract":"In this article, we prove the following result. Let &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0166_eq_001.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;≥&lt;/m:mo&gt; &lt;m:mn&gt;3&lt;/m:mn&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;nge 3&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; be some fixed integer and let &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0166_eq_002.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;R&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;R&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; be a prime ring with &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0166_eq_003.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi mathvariant=\"normal\"&gt;char&lt;/m:mi&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;R&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;≠&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;+&lt;/m:mo&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;!&lt;/m:mo&gt; &lt;m:msup&gt; &lt;m:mrow&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msup&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{rm{char}}left(R)ne left(n+1)&amp;#x0021;{2}^{n-2}&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;. Suppose there exists an additive mapping &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0166_eq_004.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;D&lt;/m:mi&gt; &lt;m:mo&gt;:&lt;/m:mo&gt; &lt;m:mi&gt;R&lt;/m:mi&gt; &lt;m:mo&gt;→&lt;/m:mo&gt; &lt;m:mi&gt;R&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;D:Rto R&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; satisfying the relation &lt;jats:disp-formula&gt; &lt;jats:alternatives&gt; &lt;jats:graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0166_eq_005.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\" display=\"block\"&gt; &lt;m:mrow&gt; &lt;m:mtable displaystyle=\"true\" columnspacing=\"0.33em\"&gt; &lt;m:mtr&gt; &lt;m:mtd columnalign=\"right\"&gt; &lt;m:msup&gt; &lt;m:mrow&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msup&gt; &lt;m:mi&gt;D&lt;/m:mi&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:msup&gt; &lt;m:mrow&gt; &lt;m:mi&gt;x&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msup&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:mtd&gt; &lt;m:mtd columnalign=\"center\"&gt; &lt;m:mo&gt;=&lt;/m:mo&gt; &lt;/m:mtd&gt; &lt;m:mtd columnalign=\"left\"&gt; &lt;m:mfenced open=\"(\" close=\")\"&gt; &lt;m:mrow&gt; &lt;m:munderover&gt; &lt;m:mrow&gt; &lt;m:mstyle displaystyle=\"true\"&gt; &lt;m:mo&gt;∑&lt;/m:mo&gt; &lt;/m:mstyle&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;m:mo&gt;=&lt;/m:mo&gt; &lt;m:mn&gt;0&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:munderover&gt; &lt;m:mfenced open=\"(\" close=\")\"&gt; &lt;m:mfrac linethickness=\"0.0pt\"&gt; &lt;m:mrow&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;m","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"11 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the maximum atom-bond sum-connectivity index of graphs 论图形的最大原子键和连接指数
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-02-09 DOI: 10.1515/math-2023-0179
Tariq Alraqad, Hicham Saber, Akbar Ali, Abeer M. Albalahi
The atom-bond sum-connectivity (ABS) index of a graph <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0179_eq_001.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>G</m:mi> </m:math> <jats:tex-math>G</jats:tex-math> </jats:alternatives> </jats:inline-formula> with edges <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0179_eq_002.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>e</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mo form="prefix">,</m:mo> <m:mrow> <m:mo>…</m:mo> </m:mrow> <m:mo>,</m:mo> <m:msub> <m:mrow> <m:mi>e</m:mi> </m:mrow> <m:mrow> <m:mi>m</m:mi> </m:mrow> </m:msub> </m:math> <jats:tex-math>{e}_{1},ldots ,{e}_{m}</jats:tex-math> </jats:alternatives> </jats:inline-formula> is the sum of the numbers <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0179_eq_003.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msqrt> <m:mrow> <m:mn>1</m:mn> <m:mo>−</m:mo> <m:mn>2</m:mn> <m:msup> <m:mrow> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:msub> <m:mrow> <m:mi>d</m:mi> </m:mrow> <m:mrow> <m:msub> <m:mrow> <m:mi>e</m:mi> </m:mrow> <m:mrow> <m:mi>i</m:mi> </m:mrow> </m:msub> </m:mrow> </m:msub> <m:mo>+</m:mo> <m:mn>2</m:mn> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:mrow> <m:mrow> <m:mo>−</m:mo> <m:mn>1</m:mn> </m:mrow> </m:msup> </m:mrow> </m:msqrt> </m:math> <jats:tex-math>sqrt{1-2{left({d}_{{e}_{i}}+2)}^{-1}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> over <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0179_eq_004.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mn>1</m:mn> <m:mo>≤</m:mo> <m:mi>i</m:mi> <m:mo>≤</m:mo> <m:mi>m</m:mi> </m:math> <jats:tex-math>1le ile m</jats:tex-math> </jats:alternatives> </jats:inline-formula>, where <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0179_eq_005.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>d</m:mi> </m:mrow> <m:mrow> <m:msub> <m:mrow> <m:mi>e</m:mi> </m:mrow> <m:mrow> <m:mi>i</m:mi> </m:mrow> </m:msub> </m:mrow> </m:msub> </m:math> <jats:tex-math>{d}_{{e}_{i}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> is the number of edges adjacent to <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0179_eq_006.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>e</m:mi> </m:mrow> <m:mrow> <m:mi>i</m:mi> </m:mrow> </m:msub> </m:math> <jats:tex-math>{e}_{i}</jats:tex-math> </jats:alter
具有边 e 1 , ... , e m {e}_{1},ldots ,{e}_{m} 的图 G G 的原子-键总和-连通性(ABS)指数是 , e m {e}_{1},ldots ,{e}_{m} 是 1 - 2 ( d e i + 2 ) - 1 sqrt{1-2{left({d}_{e}_{i}+2)}^{-1}}}在 1 ≤ i ≤ m 1le ile m 上的数字之和,其中 d e i {d}_{e}_{i}} 是与 e i {e}_{i} 相邻的边的数目。在本文中,我们将研究具有给定参数的图中 ABS 指数的最大值。更具体地说,我们确定了具有固定(i)最小度、(ii)最大度、(iii)色度数、(iv)独立性数或(v)下垂顶点数的给定阶数连通图的最大 ABS 指数。我们还描述了在所有这些类别中达到最大 ABS 值的图的特征。
{"title":"On the maximum atom-bond sum-connectivity index of graphs","authors":"Tariq Alraqad, Hicham Saber, Akbar Ali, Abeer M. Albalahi","doi":"10.1515/math-2023-0179","DOIUrl":"https://doi.org/10.1515/math-2023-0179","url":null,"abstract":"The atom-bond sum-connectivity (ABS) index of a graph &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0179_eq_001.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;G&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;G&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; with edges &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0179_eq_002.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;e&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;m:mo form=\"prefix\"&gt;,&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mo&gt;…&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;e&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;m&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{e}_{1},ldots ,{e}_{m}&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; is the sum of the numbers &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0179_eq_003.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:msqrt&gt; &lt;m:mrow&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;m:msup&gt; &lt;m:mrow&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;d&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;e&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;m:mo&gt;+&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mo&gt;−&lt;/m:mo&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msup&gt; &lt;/m:mrow&gt; &lt;/m:msqrt&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;sqrt{1-2{left({d}_{{e}_{i}}+2)}^{-1}}&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; over &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0179_eq_004.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;m:mo&gt;≤&lt;/m:mo&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;m:mo&gt;≤&lt;/m:mo&gt; &lt;m:mi&gt;m&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;1le ile m&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt;, where &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0179_eq_005.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;d&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;e&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{d}_{{e}_{i}}&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; is the number of edges adjacent to &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0179_eq_006.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;e&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{e}_{i}&lt;/jats:tex-math&gt; &lt;/jats:alter","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"80 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139758563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An application of Hayashi's inequality in numerical integration 林不等式在数值积分中的应用
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-01-12 DOI: 10.1515/math-2023-0162
Ahmed Salem Heilat, Ahmad Qazza, Raed Hatamleh, Rania Saadeh, Mohammad W. Alomari
This study systematically develops error estimates tailored to a specific set of general quadrature rules that exclusively incorporate first derivatives. Moreover, it introduces refined versions of select generalized Ostrowski’s type inequalities, enhancing their applicability. Through the skillful application of Hayashi’s celebrated inequality to specific functions, the provided proofs underpin these advancements. Notably, this approach extends its utility to approximate integrals of real functions with bounded first derivatives. Remarkably, it employs Newton-Cotes and Gauss-Legendre quadrature rules, bypassing the need for stringent requirements on higher-order derivatives.
本研究系统地开发了误差估算,这些误差估算是为专门包含一阶导数的一组特定一般正交规则量身定制的。此外,它还引入了精选的广义奥斯特洛夫斯基式不等式,增强了它们的适用性。通过巧妙地将林氏著名不等式应用于特定函数,所提供的证明为这些进步奠定了基础。值得注意的是,这种方法将其实用性扩展到了具有有界一阶导数的实函数近似积分。值得注意的是,它采用了牛顿-科茨和高斯-勒根得尔正交规则,绕过了对高阶导数的严格要求。
{"title":"An application of Hayashi's inequality in numerical integration","authors":"Ahmed Salem Heilat, Ahmad Qazza, Raed Hatamleh, Rania Saadeh, Mohammad W. Alomari","doi":"10.1515/math-2023-0162","DOIUrl":"https://doi.org/10.1515/math-2023-0162","url":null,"abstract":"This study systematically develops error estimates tailored to a specific set of general quadrature rules that exclusively incorporate first derivatives. Moreover, it introduces refined versions of select generalized Ostrowski’s type inequalities, enhancing their applicability. Through the skillful application of Hayashi’s celebrated inequality to specific functions, the provided proofs underpin these advancements. Notably, this approach extends its utility to approximate integrals of real functions with bounded first derivatives. Remarkably, it employs Newton-Cotes and Gauss-Legendre quadrature rules, bypassing the need for stringent requirements on higher-order derivatives.","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"32 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139462653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Uniqueness of exponential polynomials 指数多项式的唯一性
IF 1.7 4区 数学 Q1 MATHEMATICS Pub Date : 2024-01-10 DOI: 10.1515/math-2023-0173
Ge Wang, Zhiying He, Mingliang Fang
In this article, we study the uniqueness of exponential polynomials and mainly prove: Let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0173_eq_001.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>n</m:mi> </m:math> <jats:tex-math>n</jats:tex-math> </jats:alternatives> </jats:inline-formula> be a positive integer, let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0173_eq_002.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>p</m:mi> </m:mrow> <m:mrow> <m:mi>i</m:mi> </m:mrow> </m:msub> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>z</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mspace width="0.33em" /> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>i</m:mi> <m:mo>=</m:mo> <m:mn>1</m:mn> <m:mo>,</m:mo> <m:mn>2</m:mn> <m:mo>,</m:mo> <m:mo>…</m:mo> <m:mo>,</m:mo> <m:mi>n</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{p}_{i}left(z)hspace{0.33em}left(i=1,2,ldots ,n)</jats:tex-math> </jats:alternatives> </jats:inline-formula> be nonzero polynomials, and let <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0173_eq_003.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi>c</m:mi> </m:mrow> <m:mrow> <m:mi>i</m:mi> </m:mrow> </m:msub> <m:mo>≠</m:mo> <m:mn>0</m:mn> <m:mspace width="0.33em" /> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>i</m:mi> <m:mo>=</m:mo> <m:mn>1</m:mn> <m:mo>,</m:mo> <m:mn>2</m:mn> <m:mo>,</m:mo> <m:mo>…</m:mo> <m:mo>,</m:mo> <m:mi>n</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>{c}_{i}ne 0hspace{0.33em}left(i=1,2,ldots ,n)</jats:tex-math> </jats:alternatives> </jats:inline-formula> be distinct finite complex numbers. Suppose that <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0173_eq_004.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>f</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>z</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> <jats:tex-math>fleft(z)</jats:tex-math> </jats:alternatives> </jats:inline-formula> is an entire function, <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_math-2023-0173_eq_005.png" /> <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>g</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>z</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:mo>=</m:mo> <m:msub> <m:mrow> <m:mi>p</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> </m:mrow> </m:msub> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mi>z</m:mi> </m:mrow> <m:mo>)</m:mo> </m:mrow> <m:msup> <m:mrow> <m:mi>e</m:mi> </m:mrow> <m:mrow> <m:msub> <m:mrow> <m:mi>c</m:mi> </m:mrow> <m:mrow> <m:mn>1</m:mn> </m:mrow>
本文研究指数多项式的唯一性,并主要证明:设 n n 为正整数,设 p i ( z ) ( i = 1 , 2 , ... , n ) {p}_{i}left(z)hspace{0.33em}left(i=1,2,ldots ,n) 是非零多项式,并且让 c i ≠ 0 ( i = 1 , 2 , ... , n ) {c}_{i}ne 0hspace{0.33em}left(i=1,2,ldots ,n) 是不同的有限复数。假设 f ( z ) fleft(z) 是一个全函数、 g ( z ) = p 1 ( z ) e c 1 z + p 2 ( z ) e c 2 z + ⋯ + p n ( z ) e c n z gleft(z)={p}_{1}left(z){e}^{c}_{1}z}+{p}_{2}left(z){e}^{c}_{2}z}+cdots +{p}_{n}left(z){e}^{c}_{n}z} 。如果 f ( z ) fleft(z) 和 g ( z ) gleft(z) 共享 a a 和 b b CM(计算乘数),其中 a a 和 b b 是两个不同的有限复数,那么必须出现以下情况之一: (i) n = 1 n=1 。 如果 a ≠ 0 ane 0 , b = 0 b=0 , 那么要么 f ( z ) ≡ g ( z ) fleft(z)equiv gleft(z) 或者 f ( z ) g ( z ) ≡ a 2 fleft(z)gleft(z)equiv {a}^{2} ; 如果 a = 0 a=0 , b ≠ 0 bne 0 , 那么要么 f ( z ) ≡ g ( z ) fleft(z)equiv gleft(z) 或者 f ( z ) g ( z ) ≡ b 2 fleft(z)gleft(z)equiv {b}^{2} ; 如果 a ≠ 0 ane 0 , b ≠ 0 bne 0 ,那么要么 f ( z ) ≡ g ( z ) fleft(z)equiv gleft(z) 或者 f ( z ) g ( z ) ≡ ( a + b ) g ( z ) - a b fleft(z)gleft(z)equiv left(a+b)gleft(z)-ab 。 (ii) n ≥ 2 nge 2 , f ( z ) ≡ g ( z ) fleft(z)equiv gleft(z) . 这是对 1974 年早先关于微变函数的研究中得到的结果的扩展。
{"title":"Uniqueness of exponential polynomials","authors":"Ge Wang, Zhiying He, Mingliang Fang","doi":"10.1515/math-2023-0173","DOIUrl":"https://doi.org/10.1515/math-2023-0173","url":null,"abstract":"In this article, we study the uniqueness of exponential polynomials and mainly prove: Let &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0173_eq_001.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;n&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; be a positive integer, let &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0173_eq_002.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;z&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mspace width=\"0.33em\" /&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;m:mo&gt;=&lt;/m:mo&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mo&gt;…&lt;/m:mo&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{p}_{i}left(z)hspace{0.33em}left(i=1,2,ldots ,n)&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; be nonzero polynomials, and let &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0173_eq_003.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;c&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;m:mo&gt;≠&lt;/m:mo&gt; &lt;m:mn&gt;0&lt;/m:mn&gt; &lt;m:mspace width=\"0.33em\" /&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;i&lt;/m:mi&gt; &lt;m:mo&gt;=&lt;/m:mo&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mn&gt;2&lt;/m:mn&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mo&gt;…&lt;/m:mo&gt; &lt;m:mo&gt;,&lt;/m:mo&gt; &lt;m:mi&gt;n&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;{c}_{i}ne 0hspace{0.33em}left(i=1,2,ldots ,n)&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; be distinct finite complex numbers. Suppose that &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0173_eq_004.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;f&lt;/m:mi&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;z&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;/m:math&gt; &lt;jats:tex-math&gt;fleft(z)&lt;/jats:tex-math&gt; &lt;/jats:alternatives&gt; &lt;/jats:inline-formula&gt; is an entire function, &lt;jats:inline-formula&gt; &lt;jats:alternatives&gt; &lt;jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0173_eq_005.png\" /&gt; &lt;m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"&gt; &lt;m:mi&gt;g&lt;/m:mi&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;z&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;=&lt;/m:mo&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;p&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;/m:mrow&gt; &lt;/m:msub&gt; &lt;m:mrow&gt; &lt;m:mo&gt;(&lt;/m:mo&gt; &lt;m:mrow&gt; &lt;m:mi&gt;z&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mo&gt;)&lt;/m:mo&gt; &lt;/m:mrow&gt; &lt;m:msup&gt; &lt;m:mrow&gt; &lt;m:mi&gt;e&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:msub&gt; &lt;m:mrow&gt; &lt;m:mi&gt;c&lt;/m:mi&gt; &lt;/m:mrow&gt; &lt;m:mrow&gt; &lt;m:mn&gt;1&lt;/m:mn&gt; &lt;/m:mrow&gt;","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"14 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139420926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Open Mathematics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1