组合迭代、Cauchy、翻译和Sincov包含

Pub Date : 2020-07-01 DOI:10.2478/ausm-2020-0004
W. Fechner, Á. Száz
{"title":"组合迭代、Cauchy、翻译和Sincov包含","authors":"W. Fechner, Á. Száz","doi":"10.2478/ausm-2020-0004","DOIUrl":null,"url":null,"abstract":"Abstract Improving and extending some ideas of Gottlob Frege from 1874 (on a generalization of the notion of the composition iterates of a function), we consider the composition iterates ϕn of a relation ϕ on X, defined by ϕ0=Δx,  ϕn=ϕ∘ϕn-1 if n∈𝕅,  and   ϕ∞=∪n=0∞ϕn. {\\varphi ^0} = {\\Delta _x},\\,\\,{\\varphi ^n} = \\varphi \\circ {\\varphi ^{n - 1}}{\\rm{ if n}} \\in \\mathbb{N,}\\,\\,{\\rm{and }}\\,\\,{\\varphi ^\\infty } = \\bigcup\\limits_{n = 0}^\\infty {{\\varphi ^n}} . In particular, by using the relational inclusion ϕn◦ϕm ⊆ ϕn+m with n, m ∈ 𝕅¯0 \\mathbb{\\bar {N}_0}} , we show that the function α, defined by α(n)=ϕn   for n∈𝕅¯0, \\alpha \\left( n \\right) = {\\varphi ^{\\rm{n}}}\\,\\,\\,{\\rm{for n}} \\in {{\\rm\\mathbb{\\bar N}}_{\\rm{0}}}, satisfies the Cauchy problem α(n)∘α(m)⊆α(n+m),   α(0)=Δx. \\alpha \\left( n \\right) \\circ \\alpha \\left( {\\rm{m}} \\right) \\subseteq \\alpha \\left( {{\\rm{n}} + {\\rm{m}}} \\right),\\,\\,\\,\\alpha \\left( 0 \\right) = {\\Delta _{\\rm{x}}}. Moreover, the function f, defined by f(n,A)=α(n)[ A ]   for n∈𝕅¯0  and A⊆X, {\\rm{f}}\\left( {{\\rm{n}},{\\rm{A}}} \\right) = \\alpha \\left( {\\rm{n}} \\right)\\left[ {\\rm{A}} \\right]\\,\\,\\,{\\rm{for}}\\,{\\rm{n}} \\in {{\\rm\\mathbb{\\bar {N}}}_{\\rm{0}}}\\,\\,{\\rm{and}}\\,{\\rm{A}} \\subseteq {\\rm{X,}} satisfies the translation problem f(n,f(m,A))⊆f(n+m,A),   f(0,A)=A. {\\rm{f}}\\left( {{\\rm{n}},f(m,{\\rm{A)}}} \\right) \\subseteq {\\rm{f}}\\left( {{\\rm{n}} + {\\rm{m,A}}} \\right),\\,\\,\\,{\\rm{f}}\\left( {0,{\\rm{A}}} \\right) = {\\rm{A}}{\\rm{.}} Furthermore, the function F, defined by F(A,B)={ n∈𝕅¯0:  A⊆f(n,B) }  for  A,B⊆X, {\\rm{F}}\\left( {{\\rm{A}},{\\rm{B}}} \\right) = \\left\\{ {{\\rm{n}} \\in {{{\\rm\\mathbb{\\bar {N}}}}_{\\rm{0}}}:\\,\\,{\\rm{A}} \\subseteq {\\rm{f}}\\left( {{\\rm{n}},{\\rm{B}}} \\right)} \\right\\}\\,\\,{\\rm{for}}\\,\\,{\\rm{A,B}} \\subseteq {\\rm{X,}} satisfies the Sincov problem F(A,B)+F(B,C)⊆F(A,C),    0∈F(A,A). {\\rm{F}}\\left( {{\\rm{A}},{\\rm{B}}} \\right) + {\\rm{F}}\\left( {{\\rm{B}},{\\rm{C}}} \\right) \\subseteq {\\rm{F}}\\left( {{\\rm{A,C}}} \\right),\\,\\,\\,\\,0 \\in {\\rm{F}}\\left( {{\\rm{A}},{\\rm{A}}} \\right). Motivated by the above observations, we investigate a function F on the product set X2 to the power groupoid 𝒫(U) of an additively written groupoid U which is supertriangular in the sense that F(x,y)+F(y,z)⊆F(x,z) {\\rm{F}}\\left( {{\\rm{x}},{\\rm{y}}} \\right) + {\\rm{F}}\\left( {{\\rm{y}},{\\rm{z}}} \\right) \\subseteq {\\rm{F}}\\left( {{\\rm{x}},{\\rm{z}}} \\right) for all x, y, z ∈ X. For this, we introduce the convenient notations R(x,y)=F(y,x)   and  S(x,y)=F(x,y)+R(x,y), {\\rm{R}}\\left( {{\\rm{x}},{\\rm{y}}} \\right) = {\\rm{F}}\\left( {{\\rm{y}},{\\rm{x}}} \\right)\\,\\,\\,{\\rm{and}}\\,\\,{\\rm{S}}\\left( {{\\rm{x}},{\\rm{y}}} \\right) = {\\rm{F}}\\left( {{\\rm{x}},{\\rm{y}}} \\right) + {\\rm{R}}\\left( {{\\rm{x}},{\\rm{y}}} \\right), and Φ(x)=F(x,x)  and  Ψ(x)∪y∈XS(x,y). \\Phi \\left( {\\rm{x}} \\right) = {\\rm{F}}\\left( {{\\rm{x}},{\\rm{x}}} \\right)\\,\\,{\\rm{and}}\\,\\,\\Psi \\left( {\\rm{x}} \\right)\\bigcup\\limits_{{\\rm{y}} \\in {\\rm{X}}} {{\\rm{S}}\\left( {{\\rm{x}},{\\rm{y}}} \\right).} Moreover, we gradually assume that U and F have some useful additional properties. For instance, U has a zero, U is a group, U is commutative, U is cancellative, or U has a suitable distance function; while F is nonpartial, F is symmetric, skew symmetric, or single-valued.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Composition iterates, Cauchy, translation, and Sincov inclusions\",\"authors\":\"W. Fechner, Á. Száz\",\"doi\":\"10.2478/ausm-2020-0004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Improving and extending some ideas of Gottlob Frege from 1874 (on a generalization of the notion of the composition iterates of a function), we consider the composition iterates ϕn of a relation ϕ on X, defined by ϕ0=Δx,  ϕn=ϕ∘ϕn-1 if n∈𝕅,  and   ϕ∞=∪n=0∞ϕn. {\\\\varphi ^0} = {\\\\Delta _x},\\\\,\\\\,{\\\\varphi ^n} = \\\\varphi \\\\circ {\\\\varphi ^{n - 1}}{\\\\rm{ if n}} \\\\in \\\\mathbb{N,}\\\\,\\\\,{\\\\rm{and }}\\\\,\\\\,{\\\\varphi ^\\\\infty } = \\\\bigcup\\\\limits_{n = 0}^\\\\infty {{\\\\varphi ^n}} . In particular, by using the relational inclusion ϕn◦ϕm ⊆ ϕn+m with n, m ∈ 𝕅¯0 \\\\mathbb{\\\\bar {N}_0}} , we show that the function α, defined by α(n)=ϕn   for n∈𝕅¯0, \\\\alpha \\\\left( n \\\\right) = {\\\\varphi ^{\\\\rm{n}}}\\\\,\\\\,\\\\,{\\\\rm{for n}} \\\\in {{\\\\rm\\\\mathbb{\\\\bar N}}_{\\\\rm{0}}}, satisfies the Cauchy problem α(n)∘α(m)⊆α(n+m),   α(0)=Δx. \\\\alpha \\\\left( n \\\\right) \\\\circ \\\\alpha \\\\left( {\\\\rm{m}} \\\\right) \\\\subseteq \\\\alpha \\\\left( {{\\\\rm{n}} + {\\\\rm{m}}} \\\\right),\\\\,\\\\,\\\\,\\\\alpha \\\\left( 0 \\\\right) = {\\\\Delta _{\\\\rm{x}}}. Moreover, the function f, defined by f(n,A)=α(n)[ A ]   for n∈𝕅¯0  and A⊆X, {\\\\rm{f}}\\\\left( {{\\\\rm{n}},{\\\\rm{A}}} \\\\right) = \\\\alpha \\\\left( {\\\\rm{n}} \\\\right)\\\\left[ {\\\\rm{A}} \\\\right]\\\\,\\\\,\\\\,{\\\\rm{for}}\\\\,{\\\\rm{n}} \\\\in {{\\\\rm\\\\mathbb{\\\\bar {N}}}_{\\\\rm{0}}}\\\\,\\\\,{\\\\rm{and}}\\\\,{\\\\rm{A}} \\\\subseteq {\\\\rm{X,}} satisfies the translation problem f(n,f(m,A))⊆f(n+m,A),   f(0,A)=A. {\\\\rm{f}}\\\\left( {{\\\\rm{n}},f(m,{\\\\rm{A)}}} \\\\right) \\\\subseteq {\\\\rm{f}}\\\\left( {{\\\\rm{n}} + {\\\\rm{m,A}}} \\\\right),\\\\,\\\\,\\\\,{\\\\rm{f}}\\\\left( {0,{\\\\rm{A}}} \\\\right) = {\\\\rm{A}}{\\\\rm{.}} Furthermore, the function F, defined by F(A,B)={ n∈𝕅¯0:  A⊆f(n,B) }  for  A,B⊆X, {\\\\rm{F}}\\\\left( {{\\\\rm{A}},{\\\\rm{B}}} \\\\right) = \\\\left\\\\{ {{\\\\rm{n}} \\\\in {{{\\\\rm\\\\mathbb{\\\\bar {N}}}}_{\\\\rm{0}}}:\\\\,\\\\,{\\\\rm{A}} \\\\subseteq {\\\\rm{f}}\\\\left( {{\\\\rm{n}},{\\\\rm{B}}} \\\\right)} \\\\right\\\\}\\\\,\\\\,{\\\\rm{for}}\\\\,\\\\,{\\\\rm{A,B}} \\\\subseteq {\\\\rm{X,}} satisfies the Sincov problem F(A,B)+F(B,C)⊆F(A,C),    0∈F(A,A). {\\\\rm{F}}\\\\left( {{\\\\rm{A}},{\\\\rm{B}}} \\\\right) + {\\\\rm{F}}\\\\left( {{\\\\rm{B}},{\\\\rm{C}}} \\\\right) \\\\subseteq {\\\\rm{F}}\\\\left( {{\\\\rm{A,C}}} \\\\right),\\\\,\\\\,\\\\,\\\\,0 \\\\in {\\\\rm{F}}\\\\left( {{\\\\rm{A}},{\\\\rm{A}}} \\\\right). Motivated by the above observations, we investigate a function F on the product set X2 to the power groupoid 𝒫(U) of an additively written groupoid U which is supertriangular in the sense that F(x,y)+F(y,z)⊆F(x,z) {\\\\rm{F}}\\\\left( {{\\\\rm{x}},{\\\\rm{y}}} \\\\right) + {\\\\rm{F}}\\\\left( {{\\\\rm{y}},{\\\\rm{z}}} \\\\right) \\\\subseteq {\\\\rm{F}}\\\\left( {{\\\\rm{x}},{\\\\rm{z}}} \\\\right) for all x, y, z ∈ X. For this, we introduce the convenient notations R(x,y)=F(y,x)   and  S(x,y)=F(x,y)+R(x,y), {\\\\rm{R}}\\\\left( {{\\\\rm{x}},{\\\\rm{y}}} \\\\right) = {\\\\rm{F}}\\\\left( {{\\\\rm{y}},{\\\\rm{x}}} \\\\right)\\\\,\\\\,\\\\,{\\\\rm{and}}\\\\,\\\\,{\\\\rm{S}}\\\\left( {{\\\\rm{x}},{\\\\rm{y}}} \\\\right) = {\\\\rm{F}}\\\\left( {{\\\\rm{x}},{\\\\rm{y}}} \\\\right) + {\\\\rm{R}}\\\\left( {{\\\\rm{x}},{\\\\rm{y}}} \\\\right), and Φ(x)=F(x,x)  and  Ψ(x)∪y∈XS(x,y). \\\\Phi \\\\left( {\\\\rm{x}} \\\\right) = {\\\\rm{F}}\\\\left( {{\\\\rm{x}},{\\\\rm{x}}} \\\\right)\\\\,\\\\,{\\\\rm{and}}\\\\,\\\\,\\\\Psi \\\\left( {\\\\rm{x}} \\\\right)\\\\bigcup\\\\limits_{{\\\\rm{y}} \\\\in {\\\\rm{X}}} {{\\\\rm{S}}\\\\left( {{\\\\rm{x}},{\\\\rm{y}}} \\\\right).} Moreover, we gradually assume that U and F have some useful additional properties. For instance, U has a zero, U is a group, U is commutative, U is cancellative, or U has a suitable distance function; while F is nonpartial, F is symmetric, skew symmetric, or single-valued.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/ausm-2020-0004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausm-2020-0004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

摘要:改进和扩展了Gottlob Frege从1874年开始的一些思想(对函数的复合迭代概念的推广),我们考虑了一个关系φ在X上的复合迭代的ϕn,定义为:ϕ0=Δx,如果n∈𝕅,则ϕn= φ°ϕn-1,并且φ∞=∪n=0∞ϕn。 {\varphi ^0} = {\Delta _x},\,\,{\varphi ^n} = \varphi \circ {\varphi ^{N - 1}}{\rm{ if n}} \in \mathbb{N,}\,\,{\rm{and }}\,\,{\varphi ^\infty } = \bigcup\limits_{N = 0}^\infty {{\varphi ^n}} . 具体来说,利用关系包含式(ϕn◦ϕm)与n, m∈𝕅¯0 \mathbb{\bar {N}_0}},我们证明函数α,定义为α(n)=ϕn,对于n∈𝕅¯0, \alpha \left(n) \right) = {\varphi ^{\rm{n}}}\,\,\,{\rm{for n}} \in {{\rm\mathbb{\bar N}}_{\rm{0}}},满足柯西问题α(n)°α(m), α(0)=Δx。 \alpha \left(n) \right) \circ \alpha \left( {\rm{m}} \right) \subseteq \alpha \left( {{\rm{n}} + {\rm{m}}} \right),\,\,\,\alpha \left(0) \right) = {\Delta _{\rm{x}}}. 函数f,定义为f(n,A)=α(n)[A],对于n∈𝕅¯0,A∈X, {\rm{f}}\left( {{\rm{n}},{\rm{A}}} \right) = \alpha \left( {\rm{n}} \right)\left[ {\rm{A}} \right]\,\,\,{\rm{for}}\,{\rm{n}} \in {{\rm\mathbb{\bar {N}}}_{\rm{0}}}\,\,{\rm{and}}\,{\rm{A}} \subseteq {\rm{X,}} 满足平移问题f(n,f(m,A))≥f(n+m,A), f(0,A)=A。 {\rm{f}}\left( {{\rm{n}},f(m),{\rm{A)}}} \right) \subseteq {\rm{f}}\left( {{\rm{n}} + {\rm{m,A}}} \right),\,\,\,{\rm{f}}\left( {0,{\rm{A}}} \right) = {\rm{A}}{\rm{.}} 更进一步,函数F,定义为F(A,B)={ n∈𝕅¯0:A≤f(n,B) }为A、B、X, {\rm{F}}\left( {{\rm{A}},{\rm{B}}} \right) = \left{ {{\rm{n}} \in {{{\rm\mathbb{\bar {N}}}}_{\rm{0}}}:\,\,{\rm{A}} \subseteq {\rm{f}}\left( {{\rm{n}},{\rm{B}}} \right)} \right}\,\;{\rm{for}}\,\,{\rm{A,B}} \subseteq {\rm{X,}} 满足Sincov问题F(A,B)+F(B,C)≤F(A,C), 0∈F(A,A)。 {\rm{F}}\left( {{\rm{A}},{\rm{B}}} \right) + {\rm{F}}\left( {{\rm{B}},{\rm{C}}} \right) \subseteq {\rm{F}}\left( {{\rm{A,C}}} \right),\,\,\,\,0 \in {\rm{F}}\left( {{\rm{A}},{\rm{A}}} \right). 基于上述观察结果,我们研究了一个函数F在乘积集X2到一个可加写法群形U的幂群形∈(U)上,该群形U是一个超三角形,即F(x,y)+F(y,z)≥F(x,z) {\rm{F}}\left( {{\rm{x}},{\rm{y}}} \right) + {\rm{F}}\left( {{\rm{y}},{\rm{z}}} \right) \subseteq {\rm{F}}\left( {{\rm{x}},{\rm{z}}} \right)对于所有x,y, z∈x,我们引入方便的符号R(x,y)=F(y,x)和S(x,y)=F(x,y)+R(x,y), {\rm{R}}\left( {{\rm{x}},{\rm{y}}} \right) = {\rm{F}}\left( {{\rm{y}},{\rm{x}}} \right)\,\,\,{\rm{and}}\,\,{\rm{S}}\left( {{\rm{x}},{\rm{y}}} \right) = {\rm{F}}\left( {{\rm{x}},{\rm{y}}} \right) + {\rm{R}}\left( {{\rm{x}},{\rm{y}}} \right), Φ(x)=F(x,x)和Ψ(x)∪y∈XS(x,y)。 \Phi \left( {\rm{x}} \right) = {\rm{F}}\left( {{\rm{x}},{\rm{x}}} \right)\,\,{\rm{and}}\,\,\Psi \left( {\rm{x}} \right)\bigcup\limits_{{\rm{y}} \in {\rm{X}}} {{\rm{S}}\left( {{\rm{x}},{\rm{y}}} \right).} 此外,我们逐渐假设U和F有一些有用的附加性质。例如,U有一个零,U是一个群,U是可交换的,U是可消的,或者U有一个合适的距离函数;当F是非偏的时,F是对称的、偏对称的或单值的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
Composition iterates, Cauchy, translation, and Sincov inclusions
Abstract Improving and extending some ideas of Gottlob Frege from 1874 (on a generalization of the notion of the composition iterates of a function), we consider the composition iterates ϕn of a relation ϕ on X, defined by ϕ0=Δx,  ϕn=ϕ∘ϕn-1 if n∈𝕅,  and   ϕ∞=∪n=0∞ϕn. {\varphi ^0} = {\Delta _x},\,\,{\varphi ^n} = \varphi \circ {\varphi ^{n - 1}}{\rm{ if n}} \in \mathbb{N,}\,\,{\rm{and }}\,\,{\varphi ^\infty } = \bigcup\limits_{n = 0}^\infty {{\varphi ^n}} . In particular, by using the relational inclusion ϕn◦ϕm ⊆ ϕn+m with n, m ∈ 𝕅¯0 \mathbb{\bar {N}_0}} , we show that the function α, defined by α(n)=ϕn   for n∈𝕅¯0, \alpha \left( n \right) = {\varphi ^{\rm{n}}}\,\,\,{\rm{for n}} \in {{\rm\mathbb{\bar N}}_{\rm{0}}}, satisfies the Cauchy problem α(n)∘α(m)⊆α(n+m),   α(0)=Δx. \alpha \left( n \right) \circ \alpha \left( {\rm{m}} \right) \subseteq \alpha \left( {{\rm{n}} + {\rm{m}}} \right),\,\,\,\alpha \left( 0 \right) = {\Delta _{\rm{x}}}. Moreover, the function f, defined by f(n,A)=α(n)[ A ]   for n∈𝕅¯0  and A⊆X, {\rm{f}}\left( {{\rm{n}},{\rm{A}}} \right) = \alpha \left( {\rm{n}} \right)\left[ {\rm{A}} \right]\,\,\,{\rm{for}}\,{\rm{n}} \in {{\rm\mathbb{\bar {N}}}_{\rm{0}}}\,\,{\rm{and}}\,{\rm{A}} \subseteq {\rm{X,}} satisfies the translation problem f(n,f(m,A))⊆f(n+m,A),   f(0,A)=A. {\rm{f}}\left( {{\rm{n}},f(m,{\rm{A)}}} \right) \subseteq {\rm{f}}\left( {{\rm{n}} + {\rm{m,A}}} \right),\,\,\,{\rm{f}}\left( {0,{\rm{A}}} \right) = {\rm{A}}{\rm{.}} Furthermore, the function F, defined by F(A,B)={ n∈𝕅¯0:  A⊆f(n,B) }  for  A,B⊆X, {\rm{F}}\left( {{\rm{A}},{\rm{B}}} \right) = \left\{ {{\rm{n}} \in {{{\rm\mathbb{\bar {N}}}}_{\rm{0}}}:\,\,{\rm{A}} \subseteq {\rm{f}}\left( {{\rm{n}},{\rm{B}}} \right)} \right\}\,\,{\rm{for}}\,\,{\rm{A,B}} \subseteq {\rm{X,}} satisfies the Sincov problem F(A,B)+F(B,C)⊆F(A,C),    0∈F(A,A). {\rm{F}}\left( {{\rm{A}},{\rm{B}}} \right) + {\rm{F}}\left( {{\rm{B}},{\rm{C}}} \right) \subseteq {\rm{F}}\left( {{\rm{A,C}}} \right),\,\,\,\,0 \in {\rm{F}}\left( {{\rm{A}},{\rm{A}}} \right). Motivated by the above observations, we investigate a function F on the product set X2 to the power groupoid 𝒫(U) of an additively written groupoid U which is supertriangular in the sense that F(x,y)+F(y,z)⊆F(x,z) {\rm{F}}\left( {{\rm{x}},{\rm{y}}} \right) + {\rm{F}}\left( {{\rm{y}},{\rm{z}}} \right) \subseteq {\rm{F}}\left( {{\rm{x}},{\rm{z}}} \right) for all x, y, z ∈ X. For this, we introduce the convenient notations R(x,y)=F(y,x)   and  S(x,y)=F(x,y)+R(x,y), {\rm{R}}\left( {{\rm{x}},{\rm{y}}} \right) = {\rm{F}}\left( {{\rm{y}},{\rm{x}}} \right)\,\,\,{\rm{and}}\,\,{\rm{S}}\left( {{\rm{x}},{\rm{y}}} \right) = {\rm{F}}\left( {{\rm{x}},{\rm{y}}} \right) + {\rm{R}}\left( {{\rm{x}},{\rm{y}}} \right), and Φ(x)=F(x,x)  and  Ψ(x)∪y∈XS(x,y). \Phi \left( {\rm{x}} \right) = {\rm{F}}\left( {{\rm{x}},{\rm{x}}} \right)\,\,{\rm{and}}\,\,\Psi \left( {\rm{x}} \right)\bigcup\limits_{{\rm{y}} \in {\rm{X}}} {{\rm{S}}\left( {{\rm{x}},{\rm{y}}} \right).} Moreover, we gradually assume that U and F have some useful additional properties. For instance, U has a zero, U is a group, U is commutative, U is cancellative, or U has a suitable distance function; while F is nonpartial, F is symmetric, skew symmetric, or single-valued.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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