首页 > 最新文献

Discrete Mathematics and Applications最新文献

英文 中文
Frontmatter Frontmatter
IF 0.5 Q4 Mathematics Pub Date : 2022-06-01 DOI: 10.1515/dma-2022-frontmatter3
{"title":"Frontmatter","authors":"","doi":"10.1515/dma-2022-frontmatter3","DOIUrl":"https://doi.org/10.1515/dma-2022-frontmatter3","url":null,"abstract":"","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46624457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
New lower bound for the minimal number of edges of simple uniform hypergraph without the property Bk 不具有Bk性质的简单一致超图最小边数的新下界
IF 0.5 Q4 Mathematics Pub Date : 2022-06-01 DOI: 10.1515/dma-2022-0015
Y. Demidovich
Abstract A hypergraph H = (V, E) has the property Bk if there exists an assignment of two colors to V such that each edge contains at least k vertices of each color. A hypergraph is called simple if every two edges of it have at most one common vertex. We obtain a new lower bound for the minimal number of edges of n-uniform simple hypergraph without the property Bk.
超图H=(V,E)具有Bk性质,如果存在两种颜色对V的赋值,使得每条边至少包含每种颜色的k个顶点。如果超图的每两条边最多有一个公共顶点,则超图称为简单超图。我们得到了不具有Bk性质的n-一致简单超图的最小边数的一个新的下界。
{"title":"New lower bound for the minimal number of edges of simple uniform hypergraph without the property Bk","authors":"Y. Demidovich","doi":"10.1515/dma-2022-0015","DOIUrl":"https://doi.org/10.1515/dma-2022-0015","url":null,"abstract":"Abstract A hypergraph H = (V, E) has the property Bk if there exists an assignment of two colors to V such that each edge contains at least k vertices of each color. A hypergraph is called simple if every two edges of it have at most one common vertex. We obtain a new lower bound for the minimal number of edges of n-uniform simple hypergraph without the property Bk.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44725509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On some limit properties for the power series distribution 幂级数分布的一些极限性质
IF 0.5 Q4 Mathematics Pub Date : 2022-06-01 DOI: 10.1515/dma-2022-0017
Yu Miao, Yanyan Tang, Xiaoming Qu, Guangyu Yang
Abstract In the present paper, we consider random variables with the power series distribution which is often used in the study of the generalized allocation scheme. We establish some asymptotic properties which include law of large numbers, moderate deviation principle, almost sure central limit theorem and the rate of convergence in the local limit theorem. These results supplements results obtained by A. V. Kolchin.
摘要本文考虑了广义分配方案研究中经常用到的幂级数分布的随机变量。我们建立了一些渐近性质,包括大数定律、中等偏差原理、几乎确定的中心极限定理和局部极限定理中的收敛速度。这些结果补充了a.v. Kolchin的结果。
{"title":"On some limit properties for the power series distribution","authors":"Yu Miao, Yanyan Tang, Xiaoming Qu, Guangyu Yang","doi":"10.1515/dma-2022-0017","DOIUrl":"https://doi.org/10.1515/dma-2022-0017","url":null,"abstract":"Abstract In the present paper, we consider random variables with the power series distribution which is often used in the study of the generalized allocation scheme. We establish some asymptotic properties which include law of large numbers, moderate deviation principle, almost sure central limit theorem and the rate of convergence in the local limit theorem. These results supplements results obtained by A. V. Kolchin.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47211210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On bases of all closed classes of Boolean vector functions 关于布尔向量函数的所有闭类的基
IF 0.5 Q4 Mathematics Pub Date : 2022-06-01 DOI: 10.1515/dma-2023-0017
V. A. Taimanov
Abstract The functional system of Boolean vector functions with the naturally defined superposition operation is considered. It is shown that every closed class of this system admits a finite basis.
摘要考虑了具有自然定义的叠加运算的布尔向量函数的函数系统。证明了该系统的每一个闭类都有一个有限基。
{"title":"On bases of all closed classes of Boolean vector functions","authors":"V. A. Taimanov","doi":"10.1515/dma-2023-0017","DOIUrl":"https://doi.org/10.1515/dma-2023-0017","url":null,"abstract":"Abstract The functional system of Boolean vector functions with the naturally defined superposition operation is considered. It is shown that every closed class of this system admits a finite basis.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44952732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On some invariants under the action of an extension of GA(n, 2) on the set of Boolean functions 关于GA(n,2)在布尔函数集上的扩展作用下的一些不变量
IF 0.5 Q4 Mathematics Pub Date : 2022-06-01 DOI: 10.1515/dma-2022-0016
O. A. Logachev, Sergey N. Fedorov, V. V. Yashchenko
Abstract Let G be the extension of a general affine group by the group of affine functions. We study the action of G on the set of Boolean functions. The action consists in nondegenerate affine transformations of variables and addition of affine Boolean functions. We introduce and examine some parameters of Boolean functions which are invariant with respect to the action of G. These are the amplitude (which is closely related to the nonlinearity), the dimension of a function, and some others. The invariants, together with some additionally proposed notions, could be used to obtain new bounds on cryptographic parameters of Boolean functions, including the maximum nonlinearity of functions in an odd number of variables.
摘要设G为一般仿射群被仿射函数群扩展。研究了G在布尔函数集上的作用。作用包括变量的非简并仿射变换和仿射布尔函数的加法。我们介绍并检验了布尔函数的一些参数,这些参数对g的作用是不变的,这些参数是振幅(与非线性密切相关),函数的维数,以及其他一些参数。利用这些不变量和一些附加的概念,可以得到布尔函数的密码参数的新界,包括函数在奇数变量下的最大非线性。
{"title":"On some invariants under the action of an extension of GA(n, 2) on the set of Boolean functions","authors":"O. A. Logachev, Sergey N. Fedorov, V. V. Yashchenko","doi":"10.1515/dma-2022-0016","DOIUrl":"https://doi.org/10.1515/dma-2022-0016","url":null,"abstract":"Abstract Let G be the extension of a general affine group by the group of affine functions. We study the action of G on the set of Boolean functions. The action consists in nondegenerate affine transformations of variables and addition of affine Boolean functions. We introduce and examine some parameters of Boolean functions which are invariant with respect to the action of G. These are the amplitude (which is closely related to the nonlinearity), the dimension of a function, and some others. The invariants, together with some additionally proposed notions, could be used to obtain new bounds on cryptographic parameters of Boolean functions, including the maximum nonlinearity of functions in an odd number of variables.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47276080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Estimates of lengths of shortest nonzero vectors in some lattices. I 一些格中最短非零向量长度的估计。我
IF 0.5 Q4 Mathematics Pub Date : 2022-06-01 DOI: 10.1515/dma-2022-0018
A. S. Rybakov
Abstract In 1988, Friese et al. put forward lower estimates for the lengths of shortest nonzero vectors for “almost all” lattices of some families in the dimension 3. In 2004, the author of the present paper obtained a similar result for the dimension 4. Here we give a better estimate for the cardinality of the set of exceptional lattices for which the above estimates are not valid. In the case of dimension 4 we improve the upper estimate for an arbitrary chosen parameter that controls the accuracy of these lower estimates and for the number of exceptions. In this (first) part of the paper, we also prove some auxiliary results, which will be used in the second (main) part of the paper, in which an analogue of A. Friese et al. result will be given for dimension 5.
摘要1988年,Friese等人对维数为3的一些族的“几乎所有”格的最短非零向量的长度提出了较低的估计。2004年,本论文的作者在维度4上获得了类似的结果。在这里,我们对上述估计无效的异常格集的基数给出了更好的估计。在维度4的情况下,我们改进了任意选择的参数的上限估计,该参数控制了这些下限估计的准确性和异常数量。在论文的这(第一)部分中,我们还证明了一些辅助结果,这些结果将在论文的第二(主要)部分中使用,其中A.Friese等人的结果将在维度5中给出。
{"title":"Estimates of lengths of shortest nonzero vectors in some lattices. I","authors":"A. S. Rybakov","doi":"10.1515/dma-2022-0018","DOIUrl":"https://doi.org/10.1515/dma-2022-0018","url":null,"abstract":"Abstract In 1988, Friese et al. put forward lower estimates for the lengths of shortest nonzero vectors for “almost all” lattices of some families in the dimension 3. In 2004, the author of the present paper obtained a similar result for the dimension 4. Here we give a better estimate for the cardinality of the set of exceptional lattices for which the above estimates are not valid. In the case of dimension 4 we improve the upper estimate for an arbitrary chosen parameter that controls the accuracy of these lower estimates and for the number of exceptions. In this (first) part of the paper, we also prove some auxiliary results, which will be used in the second (main) part of the paper, in which an analogue of A. Friese et al. result will be given for dimension 5.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44995322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Completeness criterion with respect to the enumeration closure operator in the three-valued logic 关于三值逻辑中枚举闭包运算符的完备性准则
IF 0.5 Q4 Mathematics Pub Date : 2022-04-01 DOI: 10.1515/dma-2022-0010
S. Marchenkov, V. A. Prostov
Abstract The enumeration closure operator (the Π-operator) is considered on the set Pk of functions of the k-valued logic. It is proved that, for any k ⩾ 2, any positively precomplete class in Pk is also Π-precomplete. It is also established that there are no other Π-precomplete classes in the three-valued logic.
在k值逻辑的函数集合Pk上考虑了枚举闭包算子Π-operator。证明,对于任何k小于2,Pk中的任何正预完成类也是Π-precomplete。还确定在三值逻辑中不存在其他Π-precomplete类。
{"title":"Completeness criterion with respect to the enumeration closure operator in the three-valued logic","authors":"S. Marchenkov, V. A. Prostov","doi":"10.1515/dma-2022-0010","DOIUrl":"https://doi.org/10.1515/dma-2022-0010","url":null,"abstract":"Abstract The enumeration closure operator (the Π-operator) is considered on the set Pk of functions of the k-valued logic. It is proved that, for any k ⩾ 2, any positively precomplete class in Pk is also Π-precomplete. It is also established that there are no other Π-precomplete classes in the three-valued logic.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45194701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some cardinality estimates for the set of correlation-immune Boolean functions 一组相关免疫布尔函数的基数估计
IF 0.5 Q4 Mathematics Pub Date : 2022-04-01 DOI: 10.1515/dma-2022-0008
E. Karelina
Abstract Estimates for the cardinality of the set of correlation-immune n-ary Boolean functions with fixed weight are obtained.
摘要给出了一组具有固定权值的相关免疫n元布尔函数集的基数估计。
{"title":"Some cardinality estimates for the set of correlation-immune Boolean functions","authors":"E. Karelina","doi":"10.1515/dma-2022-0008","DOIUrl":"https://doi.org/10.1515/dma-2022-0008","url":null,"abstract":"Abstract Estimates for the cardinality of the set of correlation-immune n-ary Boolean functions with fixed weight are obtained.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45534550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Admissible and Bayes decisions with fuzzy-valued losses 具有模糊值损失的容许和贝叶斯决策
IF 0.5 Q4 Mathematics Pub Date : 2022-04-01 DOI: 10.1515/dma-2022-0013
A. S. Shvedov
Abstract Some results of classical statistical decision theory are generalized by means of the theory of fuzzy sets. The concepts of an admissible decision in the restricted sense, an admissible decision in the broad sense, a Bayes decision in the restricted sense, and a Bayes decision in the broad sense are introduced. It is proved that any Bayes decision in the broad sense with positive prior discrete density is admissible in the restricted sense. The class of Bayes decisions is shown to be complete under certain conditions on the loss function. Problems with a finite set of possible states are considered.
摘要利用模糊集理论推广了经典统计决策理论的一些结果。介绍了受限制的可容许决策、广义的可容许决策、受限制的贝叶斯决策和广义的贝叶斯决策的概念。证明了广义上具有正先验离散密度的贝叶斯决策在有限意义上是可接受的。在损失函数的一定条件下,贝叶斯决策类是完备的。考虑具有有限可能状态集的问题。
{"title":"Admissible and Bayes decisions with fuzzy-valued losses","authors":"A. S. Shvedov","doi":"10.1515/dma-2022-0013","DOIUrl":"https://doi.org/10.1515/dma-2022-0013","url":null,"abstract":"Abstract Some results of classical statistical decision theory are generalized by means of the theory of fuzzy sets. The concepts of an admissible decision in the restricted sense, an admissible decision in the broad sense, a Bayes decision in the restricted sense, and a Bayes decision in the broad sense are introduced. It is proved that any Bayes decision in the broad sense with positive prior discrete density is admissible in the restricted sense. The class of Bayes decisions is shown to be complete under certain conditions on the loss function. Problems with a finite set of possible states are considered.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42891262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Finding periods of Zhegalkin polynomials Zhegalkin多项式的求周期
IF 0.5 Q4 Mathematics Pub Date : 2022-04-01 DOI: 10.1515/dma-2022-0012
S. Selezneva
Abstract A period of a Boolean function f(x1, …, xn) is a binary n-tuple a = (a1, …, an) that satisfies the identity f(x1 + a1, …, xn + an) = f(x1, …, xn). A Boolean function is periodic if it admits a nonzero period. We propose an algorithm that takes the Zhegalkin polynomial of a Boolean function f(x1, …, xn) as the input and finds a basis of the space of all periods of f(x1, …, xn). The complexity of this algorithm is nO(d), where d is the degree of the function f. As a corollary we show that a basis of the space of all periods of a Boolean function specified by the Zhegalkin polynomial of a bounded degree may be found with complexity which is polynomial in the number of variables.
摘要布尔函数f(x1,…,xn)的周期是二进制n元组A=(a1,…,an),它满足恒等式f(x1+a1,…,xn+an)=f(x1,…,xn)。如果布尔函数允许一个非零周期,那么它就是周期函数。我们提出了一种算法,该算法以布尔函数f(x1,…,xn)的Zhegalkin多项式为输入,并找到f(x1、…、xn)所有周期的空间的基。该算法的复杂度为nO(d),其中d是函数f的次数。作为推论,我们证明了由有界次数的Zhegalkin多项式指定的布尔函数的所有周期的空间的基可以被找到,其复杂度是变量数量的多项式。
{"title":"Finding periods of Zhegalkin polynomials","authors":"S. Selezneva","doi":"10.1515/dma-2022-0012","DOIUrl":"https://doi.org/10.1515/dma-2022-0012","url":null,"abstract":"Abstract A period of a Boolean function f(x1, …, xn) is a binary n-tuple a = (a1, …, an) that satisfies the identity f(x1 + a1, …, xn + an) = f(x1, …, xn). A Boolean function is periodic if it admits a nonzero period. We propose an algorithm that takes the Zhegalkin polynomial of a Boolean function f(x1, …, xn) as the input and finds a basis of the space of all periods of f(x1, …, xn). The complexity of this algorithm is nO(d), where d is the degree of the function f. As a corollary we show that a basis of the space of all periods of a Boolean function specified by the Zhegalkin polynomial of a bounded degree may be found with complexity which is polynomial in the number of variables.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44438184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Discrete Mathematics and Applications
全部 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