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

Applicable Algebra in Engineering Communication and Computing最新文献

筛选
英文 中文
Best Paper Award in Memory of Jacques Calmet 纪念雅克·卡尔梅特最佳论文奖
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-10-04 DOI: 10.1007/s00200-023-00624-4
{"title":"Best Paper Award in Memory of Jacques Calmet","authors":"","doi":"10.1007/s00200-023-00624-4","DOIUrl":"10.1007/s00200-023-00624-4","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49998389","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
Batch point compression in the context of advanced pairing-based protocols 基于高级配对协议的批处理点压缩
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-10-04 DOI: 10.1007/s00200-023-00625-3
Dmitrii Koshelev
{"title":"Batch point compression in the context of advanced pairing-based protocols","authors":"Dmitrii Koshelev","doi":"10.1007/s00200-023-00625-3","DOIUrl":"https://doi.org/10.1007/s00200-023-00625-3","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135547517","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}
引用次数: 3
Representing piecewise linear functions by functions with small arity 用小函数表示分段线性函数
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-09-26 DOI: 10.1007/s00200-023-00627-1
Christoph Koutschan, Bernhard Moser, Anton Ponomarchuk, Josef Schicho
{"title":"Representing piecewise linear functions by functions with small arity","authors":"Christoph Koutschan, Bernhard Moser, Anton Ponomarchuk, Josef Schicho","doi":"10.1007/s00200-023-00627-1","DOIUrl":"https://doi.org/10.1007/s00200-023-00627-1","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134886246","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
Fuchsian holonomic sequences Fuchsian完整序列
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-09-24 DOI: 10.1007/s00200-023-00616-4
Joris van der Hoeven
{"title":"Fuchsian holonomic sequences","authors":"Joris van der Hoeven","doi":"10.1007/s00200-023-00616-4","DOIUrl":"https://doi.org/10.1007/s00200-023-00616-4","url":null,"abstract":"Many sequences that arise in combinatorics and the analysis of algorithms turn out to be holonomic (note that some authors prefer the terminology D-finite). In this paper, we study various basic algorithmic problems for such sequences $$(f_n)_{n in {mathbb {N}}}$$ : how to compute their asymptotics for large n? How to evaluate $$f_n$$ efficiently for large n and/or large precisions p? How to decide whether $$f_n > 0$$ for all n? We restrict our study to the case when the generating function $$f = sum _{n in {mathbb {N}}} f_n z^n$$ satisfies a Fuchsian differential equation (often it suffices that the dominant singularities of f be Fuchsian). Even in this special case, some of the above questions are related to long-standing problems in number theory. We will present algorithms that work in many cases and we carefully analyze what kind of oracles or conjectures are needed to tackle the more difficult cases.","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135924791","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}
引用次数: 1
The 4-adic complexity of new quaternary sequences with good autocorrelation 具有良好自相关性的新四元序列的四进复杂度
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-09-21 DOI: 10.1007/s00200-023-00623-5
Yan Wang, Jiawei Li, Nian Li, Yanxi Fu
{"title":"The 4-adic complexity of new quaternary sequences with good autocorrelation","authors":"Yan Wang, Jiawei Li, Nian Li, Yanxi Fu","doi":"10.1007/s00200-023-00623-5","DOIUrl":"https://doi.org/10.1007/s00200-023-00623-5","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136236453","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
Perfect codes in proper intersection power graphs of finite groups 有限群的适当交幂图中的完备码
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-09-21 DOI: 10.1007/s00200-023-00626-2
Xuanlong Ma, Lan Li, Guo Zhong
{"title":"Perfect codes in proper intersection power graphs of finite groups","authors":"Xuanlong Ma, Lan Li, Guo Zhong","doi":"10.1007/s00200-023-00626-2","DOIUrl":"https://doi.org/10.1007/s00200-023-00626-2","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136236040","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
Array-designed reversible and complementary codes over GF(4) 阵列设计的GF(4)上可逆和互补码
4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-09-19 DOI: 10.1007/s00200-023-00622-6
Manabu Hagiwara, Whan-Hyuk Choi, Jon-Lark Kim
{"title":"Array-designed reversible and complementary codes over GF(4)","authors":"Manabu Hagiwara, Whan-Hyuk Choi, Jon-Lark Kim","doi":"10.1007/s00200-023-00622-6","DOIUrl":"https://doi.org/10.1007/s00200-023-00622-6","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135061088","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
Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics 迹（逆）公式和Artin代数在极值组合数学中的意义探讨
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-08-13 DOI: 10.1007/s00200-023-00619-1
Luis M. Pardo
{"title":"Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics","authors":"Luis M. Pardo","doi":"10.1007/s00200-023-00619-1","DOIUrl":"10.1007/s00200-023-00619-1","url":null,"abstract":"<div><p>This note is just a modest contribution to prove several classical results in Combinatorics from notions of Duality in some Artinian <i>K</i>-algebras (mainly through the Trace Formula), where <i>K</i> is a perfect field of characteristics not equal to 2. We prove how several classic combinatorial results are particular instances of a Trace (Inversion) Formula in finite <span>(mathbb {Q})</span>-algebras. This is the case with the Exclusion-Inclusion Principle (in its general form, both with direct and reverse order associated to subsets inclusion). This approach also allows us to exhibit a basis of the space of null <i>t</i>-designs, which differs from the one described in Theorem 4 of Deza and Frankl (Combinatorica 2:341–345, 1982). Provoked by the elegant proof (which uses no induction) in Frankl and Pach (Eur J Comb 4:21–23, 1983) of the Sauer–Shelah–Perles Lemma, we produce a new one based only in duality in the <span>(mathbb {Q})</span>-algebra <span>(mathbb {Q}[V_n])</span> of polynomials functions defined on the zero-dimensional algebraic variety of subsets of the set <span>([n]:={1,2,ldots , n})</span>. All results are equally true if we replace <span>(mathbb {Q}[V_n])</span> by <span>(K[V_n])</span>, where <i>K</i> is any perfect field of characteristics <span>(not =2)</span>. The article connects results from two fields of mathematical knowledge that are not usually connected, at least not in this form. Thus, we decided to write the manuscript in a self-contained survey-like style, although it is not a survey paper at all. Readers familiar with Commutative Algebra probably know most of the proofs of the statements described in section 2. We decided to include these proofs for those potential readers not so familiar with this framework.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-023-00619-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41398532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Three new classes of optimal quinary cyclic codes with minimum distance four 三类新的最小距离为4的最优五元循环码
IF 0.7 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-08-07 DOI: 10.1007/s00200-023-00621-7
Y. Liu, X. Cao
{"title":"Three new classes of optimal quinary cyclic codes with minimum distance four","authors":"Y. Liu, X. Cao","doi":"10.1007/s00200-023-00621-7","DOIUrl":"https://doi.org/10.1007/s00200-023-00621-7","url":null,"abstract":"","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47119674","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
Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system 参数理想的一般Gröbner基础及其在综合Gröbner系统中的应用
IF 0.6 4区 工程技术
Applicable Algebra in Engineering Communication and Computing Pub Date : 2023-08-03 DOI: 10.1007/s00200-023-00620-8
Katsusuke Nabeshima
{"title":"Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system","authors":"Katsusuke Nabeshima","doi":"10.1007/s00200-023-00620-8","DOIUrl":"10.1007/s00200-023-00620-8","url":null,"abstract":"<div><p>A relationship between a parametric ideal and its generic Gröbner basis is discussed, and a new stability condition of a Gröbner basis is given. It is shown that the ideal quotient of the parametric ideal by the ideal generated using the generic Gröbner basis provides the stability condition. Further, the stability condition is utilized to compute a comprehensive Gröbner system, and hence as an application, we obtain a new algorithm for computing comprehensive Gröbner systems. The proposed algorithm has been implemented in the computer algebra system Risa/Asir and experimented with a number of examples. Its performance (execution timings) has been compared with the Kapur-Sun-Wang’s algorithm for computing comprehensive Gröbner systems.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00200-023-00620-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47966809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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学术官方微信