发布求助
文献互助 智能选刊 最新文献

Moscow University Mathematics Bulletin最新文献

筛选
英文 中文
Some Criteria of Capacitive Type of a Noncompact Riemannian Manifold 非紧黎曼流形电容型的若干判据
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-07-12 DOI: 10.3103/s0027132222020036
T. R. Igonina, V. M. Keselman, O. R. Paraskevopulo
{"title":"Some Criteria of Capacitive Type of a Noncompact Riemannian Manifold","authors":"T. R. Igonina, V. M. Keselman, O. R. Paraskevopulo","doi":"10.3103/s0027132222020036","DOIUrl":"https://doi.org/10.3103/s0027132222020036","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A fairly general concept of an integral capacity on a Riemannian manifold is considered, which includes the concepts of capacity known for the geometric theory of functions such as the classical and conformal capacities. In terms of this general capacity, as in the case of the classical capacity, the concept of capacitive type of Riemannian manifold is defined. In this paper, we present some integral criteria of the capacitive type of a non-compact Riemannian manifold, which complement and, in certain cases, strengthen the known criteria of the classical capacitive type of a Riemannian manifold.</p>","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"2 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2022-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138531978","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
Unique Typed Basic Categorial Grammars 独特类型的基本范畴语法
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-07-12 DOI: 10.3103/s0027132222020097
M. E. Vishnikin
{"title":"Unique Typed Basic Categorial Grammars","authors":"M. E. Vishnikin","doi":"10.3103/s0027132222020097","DOIUrl":"https://doi.org/10.3103/s0027132222020097","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>It is proved that unique typed basic categorial grammars are not closed under any natural language operations.</p>","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"2 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2022-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138531976","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
Gradings of Quadratic Kummer Extensions 二次Kummer扩展的分级
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-07-12 DOI: 10.3103/s0027132222020024
D. A. Badulin, A. L. Kanunnikov
{"title":"Gradings of Quadratic Kummer Extensions","authors":"D. A. Badulin, A. L. Kanunnikov","doi":"10.3103/s0027132222020024","DOIUrl":"https://doi.org/10.3103/s0027132222020024","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>All gradings of quadratic Kummer extensions by a group are described. These extensions have a natural grading by Galois group and its subgroups. Sufficient and necessary conditions for such extensions to have nontrivial gradings by other groups are determined.</p>","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"54 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2022-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138531977","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 the Implementation of Monotone Boolean Functions by Memoryless Programs 用无记忆程序实现单调布尔函数
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-06-01 DOI: 10.3103/S0027132222030056
A. Chashkin
{"title":"On the Implementation of Monotone Boolean Functions by Memoryless Programs","authors":"A. Chashkin","doi":"10.3103/S0027132222030056","DOIUrl":"https://doi.org/10.3103/S0027132222030056","url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"77 1","pages":"136 - 143"},"PeriodicalIF":0.4,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49080555","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
The Bounds on the Number of Partitions of the Space $$mathbf{F}_{mathbf{2}}^{boldsymbol{m}}$$ into $$boldsymbol{k}$$-Dimensional Affine Subspaces 空间$$mathbf{F}_{mathbf{2}}^{boldsymbol{m}}$$到$$boldsymbol{k}$$维仿射子空间的分区数的界限
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-06-01 DOI: 10.3103/s0027132222030044
I. P. Baksova, Y. Tarannikov
{"title":"The Bounds on the Number of Partitions of the Space $$mathbf{F}_{mathbf{2}}^{boldsymbol{m}}$$ into $$boldsymbol{k}$$-Dimensional Affine Subspaces","authors":"I. P. Baksova, Y. Tarannikov","doi":"10.3103/s0027132222030044","DOIUrl":"https://doi.org/10.3103/s0027132222030044","url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":" ","pages":""},"PeriodicalIF":0.4,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46311689","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 the Classes of Autodual Functions Implicitly Maximal in $$boldsymbol{P}_{boldsymbol{k}}$$ 关于隐式极大的自对偶函数的类 $$boldsymbol{P}_{boldsymbol{k}}$$
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-06-01 DOI: 10.3103/S0027132222030093
M. Starostin
{"title":"On the Classes of Autodual Functions Implicitly Maximal in \u0000 \u0000 \u0000 \u0000 $$boldsymbol{P}_{boldsymbol{k}}$$\u0000 \u0000","authors":"M. Starostin","doi":"10.3103/S0027132222030093","DOIUrl":"https://doi.org/10.3103/S0027132222030093","url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"77 1","pages":"154-159"},"PeriodicalIF":0.4,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43993295","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
Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups 比较有限阿贝尔群的单项式和元的计算复杂度
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-06-01 DOI: 10.3103/S0027132222030068
V. Kochergin
{"title":"Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups","authors":"V. Kochergin","doi":"10.3103/S0027132222030068","DOIUrl":"https://doi.org/10.3103/S0027132222030068","url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"77 1","pages":"113 - 119"},"PeriodicalIF":0.4,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42649231","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}
引用次数: 1
On the Complexity of Implementation of Characteristic Functions of the Spheres by Circuits of Functional Elements 论功能元件电路实现球体特征函数的复杂性
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-06-01 DOI: 10.3103/S0027132222030081
N. P. Red’kin
{"title":"On the Complexity of Implementation of Characteristic Functions of the Spheres by Circuits of Functional Elements","authors":"N. P. Red’kin","doi":"10.3103/S0027132222030081","DOIUrl":"https://doi.org/10.3103/S0027132222030081","url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"77 1","pages":"127 - 130"},"PeriodicalIF":0.4,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48794815","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 the Cardinality of Interval Int(Pol$${}_{boldsymbol{k}}$$) in Partial $$boldsymbol{k}$$-Valued Logic 部分$$boldsymbol{k}$$值逻辑中区间Int(Pol $${}_{boldsymbol{k}}$$)的基数性
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-06-01 DOI: 10.3103/s0027132222030032
V. Alekseev
{"title":"On the Cardinality of Interval Int(Pol$${}_{boldsymbol{k}}$$) in Partial $$boldsymbol{k}$$-Valued Logic","authors":"V. Alekseev","doi":"10.3103/s0027132222030032","DOIUrl":"https://doi.org/10.3103/s0027132222030032","url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":" ","pages":""},"PeriodicalIF":0.4,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46121384","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
Refined Bounds on Shannon’s Function for Complexity of Circuits of Functional Elements 函数元电路复杂度的香农函数的改进界
IF 0.4
Moscow University Mathematics Bulletin Pub Date : 2022-06-01 DOI: 10.3103/S002713222203007X
S. A. Lozhkin
{"title":"Refined Bounds on Shannon’s Function for Complexity of Circuits of Functional Elements","authors":"S. A. Lozhkin","doi":"10.3103/S002713222203007X","DOIUrl":"https://doi.org/10.3103/S002713222203007X","url":null,"abstract":"","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":"77 1","pages":"144 - 153"},"PeriodicalIF":0.4,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69422488","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信