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

Discrete Mathematics and Applications最新文献

筛选
英文 中文
Some classes of easily testable circuits in the Zhegalkin basis 在Zhegalkin基中一些容易测试的电路
IF 0.5
Discrete Mathematics and Applications Pub Date : 2023-02-01 DOI: 10.1515/dma-2023-0001
Y. Borodina
{"title":"Some classes of easily testable circuits in the Zhegalkin basis","authors":"Y. Borodina","doi":"10.1515/dma-2023-0001","DOIUrl":"https://doi.org/10.1515/dma-2023-0001","url":null,"abstract":"Abstract We identify the classes of Boolean functions that may be implemented by easily testable circuits in the Zhegalkin basis for constant type-1 faults on outputs of gates. An upper estimate for the length of a complete fault detection test for three-place functions is obtained.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41420779","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
Frontmatter 头版头条
Discrete Mathematics and Applications Pub Date : 2023-02-01 DOI: 10.1515/dma-2023-frontmatter1
{"title":"Frontmatter","authors":"","doi":"10.1515/dma-2023-frontmatter1","DOIUrl":"https://doi.org/10.1515/dma-2023-frontmatter1","url":null,"abstract":"","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134941007","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 limit joint distributions of statistics of four tests of the NIST package NIST软件包四项测试统计的极限联合分布
IF 0.5
Discrete Mathematics and Applications Pub Date : 2023-02-01 DOI: 10.1515/dma-2023-0006
Maksim P. Savelov
{"title":"The limit joint distributions of statistics of four tests of the NIST package","authors":"Maksim P. Savelov","doi":"10.1515/dma-2023-0006","DOIUrl":"https://doi.org/10.1515/dma-2023-0006","url":null,"abstract":"Abstract For sequences of independent random variables having a Bernoulli distribution with parameter p the limit joint distribution of statistics of four tests of the NIST statistical package (« Monobit Test », « Frequency Test within a Block », « Runs Test » and a generalization of « Non-overlapping Template Matching Test ») is obtained. Conditions of asymptotic uncorrelatedness and/or asymptotic independence of these statistics are given.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44800901","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
Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations 随机等概率分配方案中空单元数的局部极限定理
IF 0.5
Discrete Mathematics and Applications Pub Date : 2023-02-01 DOI: 10.1515/dma-2023-0004
O. P. Orlov
{"title":"Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations","authors":"O. P. Orlov","doi":"10.1515/dma-2023-0004","DOIUrl":"https://doi.org/10.1515/dma-2023-0004","url":null,"abstract":"Abstract A classical scheme of random equiprobable allocations of n particles into N cells is considered. We find an asymptotic formula for the probability that the number of empty cells is equal to k under the condition that n, N → ∞ in such a way that n/(N − k) is bounded and separated from 1 from below.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42357219","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 concentration of the independence numbers of random hypergraphs 关于随机超图独立数的集中
IF 0.5
Discrete Mathematics and Applications Pub Date : 2023-02-01 DOI: 10.1515/dma-2023-0002
I. O. Denisov, D. A. Shabanov
{"title":"On the concentration of the independence numbers of random hypergraphs","authors":"I. O. Denisov, D. A. Shabanov","doi":"10.1515/dma-2023-0002","DOIUrl":"https://doi.org/10.1515/dma-2023-0002","url":null,"abstract":"Abstract The asymptotic behavior of general independence numbers of random hypergraphs for the binomial model is studied. We prove that for some types of parameter variations the distribution of independence numbers is concentrated on two neighboring values.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43077547","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
Maximally nonlinear functions over finite fields 有限域上的最大非线性函数
IF 0.5
Discrete Mathematics and Applications Pub Date : 2023-02-01 DOI: 10.1515/dma-2023-0005
V. G. Ryabov
{"title":"Maximally nonlinear functions over finite fields","authors":"V. G. Ryabov","doi":"10.1515/dma-2023-0005","DOIUrl":"https://doi.org/10.1515/dma-2023-0005","url":null,"abstract":"Abstract An n-place function over a field Fq $ mathbf {F}_q $ with q elements is called maximally nonlinear if it has the largest nonlinearity among all q-valued n-place functions. We show that, for even n=2, a function is maximally nonlinear if and only if its nonlinearity is qn−1(q−1)−qn2−1 $ q^{n-1}(q - 1) - q^{frac n2-1} $ ; for n=1, the corresponding criterion for maximal nonlinearity is q − 2. For q>2 $ q gt 2 $ and even n=2, we describe the set of all maximally nonlinear quadratic functions and find its cardinality. In this case, all maximally nonlinear quadratic functions are quadratic bent functions and their number is smaller than the halved number of the bent functions.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49075006","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}
引用次数: 2
On implementation of some systems of elementary conjunctions in the class of separating contact circuits 关于分离接触电路类中一些初等连接系统的实现
IF 0.5
Discrete Mathematics and Applications Pub Date : 2023-02-01 DOI: 10.1515/dma-2023-0003
Elena G. Krasulina
{"title":"On implementation of some systems of elementary conjunctions in the class of separating contact circuits","authors":"Elena G. Krasulina","doi":"10.1515/dma-2023-0003","DOIUrl":"https://doi.org/10.1515/dma-2023-0003","url":null,"abstract":"Abstract We show that the system of elementary conjunctions Ωn,2k=K0,…,K2k−1 $ Omega_{n,2^k} = {K_0,ldots,K_{2^{k} -1}} $ such that each conjunction depends essentially on n variables and corresponds to some codeword of a linear (n, k)-code can be implemented by a separating contact circuit of complexity at most 2k+1 +4k(n − k) − 2. We also show that if a contact (1, 2k)-terminal network is separating and implements the system of elementary conjunctions Ωn,2k $ Omega_{n,2^k} $ , then the number of contacts in it is at least 2k+1 − 2.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49396502","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 implementation of Boolean functions by contact circuits of minimal uniform width 用最小均匀宽度的接触电路实现布尔函数
IF 0.5
Discrete Mathematics and Applications Pub Date : 2022-12-01 DOI: 10.1515/dma-2022-0035
K. A. Popkov
{"title":"On implementation of Boolean functions by contact circuits of minimal uniform width","authors":"K. A. Popkov","doi":"10.1515/dma-2022-0035","DOIUrl":"https://doi.org/10.1515/dma-2022-0035","url":null,"abstract":"Abstract For each Boolean function, we find a minimal possible value of the uniform width of a contact circuit implementing this function. We also show that, for almost all n-place Boolean functions, this value is equal to 3.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43672303","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
Invertible matrices over some quotient rings: identification, generation, and analysis 一些商环上的可逆矩阵：识别、生成和分析
IF 0.5
Discrete Mathematics and Applications Pub Date : 2022-12-01 DOI: 10.1515/dma-2022-9999
V. Vysotskaya, L. Vysotsky
{"title":"Invertible matrices over some quotient rings: identification, generation, and analysis","authors":"V. Vysotskaya, L. Vysotsky","doi":"10.1515/dma-2022-9999","DOIUrl":"https://doi.org/10.1515/dma-2022-9999","url":null,"abstract":"","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42164389","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
Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs 具有少量附加输入的由非、CNOT和2-CNOT门组成的可逆电路的合成
IF 0.5
Discrete Mathematics and Applications Pub Date : 2022-12-01 DOI: 10.1515/dma-2022-9998
D. Zakablukov
{"title":"Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs","authors":"D. Zakablukov","doi":"10.1515/dma-2022-9998","DOIUrl":"https://doi.org/10.1515/dma-2022-9998","url":null,"abstract":"","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43255591","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学术官方微信