{"title":"环$${\\mathbb{Z}}_p$$Zp上置换的最大非线性的界$","authors":"Prachi Gupta, P. R. Mishra, Atul Gaur","doi":"10.1007/s00200-022-00594-z","DOIUrl":null,"url":null,"abstract":"<div><p>In 2016, Y. Kumar et al. in the paper ‘<i>Affine equivalence and non-linearity of permutations over</i> <span>\\({\\mathbb {Z}}_n\\)</span>’ conjectured that: <i>For</i> <span>\\(n\\ge 3\\)</span>, <i>the nonlinearity of any permutation on</i> <span>\\({\\mathbb {Z}}_n\\)</span>, <i>the ring of integers modulo</i> <i>n</i>, <i>cannot exceed</i> <span>\\(n-2\\)</span>. For an odd prime <i>p</i>, we settle the above conjecture when <span>\\(n=2p\\)</span> and for <span>\\(p\\equiv 3 \\pmod {4}\\)</span> we prove the above conjecture with an improved upper bound. Further, we derive a lower bound on <span>\\(\\max {\\mathcal {N}}{\\mathcal {L}}_n\\)</span> when <i>n</i> is an odd prime or twice of an odd prime where <span>\\(\\max {\\mathcal {N}}{\\mathcal {L}}_n\\)</span> denotes the maximum possible nonlinearity of any permutation on <span>\\({\\mathbb {Z}}_n\\)</span>.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":"35 6","pages":"859 - 874"},"PeriodicalIF":0.6000,"publicationDate":"2023-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounds on the maximum nonlinearity of permutations on the rings \\\\({\\\\mathbb {Z}}_p\\\\) and \\\\({\\\\mathbb {Z}}_{2p}\\\\)\",\"authors\":\"Prachi Gupta, P. R. Mishra, Atul Gaur\",\"doi\":\"10.1007/s00200-022-00594-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In 2016, Y. Kumar et al. in the paper ‘<i>Affine equivalence and non-linearity of permutations over</i> <span>\\\\({\\\\mathbb {Z}}_n\\\\)</span>’ conjectured that: <i>For</i> <span>\\\\(n\\\\ge 3\\\\)</span>, <i>the nonlinearity of any permutation on</i> <span>\\\\({\\\\mathbb {Z}}_n\\\\)</span>, <i>the ring of integers modulo</i> <i>n</i>, <i>cannot exceed</i> <span>\\\\(n-2\\\\)</span>. For an odd prime <i>p</i>, we settle the above conjecture when <span>\\\\(n=2p\\\\)</span> and for <span>\\\\(p\\\\equiv 3 \\\\pmod {4}\\\\)</span> we prove the above conjecture with an improved upper bound. Further, we derive a lower bound on <span>\\\\(\\\\max {\\\\mathcal {N}}{\\\\mathcal {L}}_n\\\\)</span> when <i>n</i> is an odd prime or twice of an odd prime where <span>\\\\(\\\\max {\\\\mathcal {N}}{\\\\mathcal {L}}_n\\\\)</span> denotes the maximum possible nonlinearity of any permutation on <span>\\\\({\\\\mathbb {Z}}_n\\\\)</span>.</p></div>\",\"PeriodicalId\":50742,\"journal\":{\"name\":\"Applicable Algebra in Engineering Communication and Computing\",\"volume\":\"35 6\",\"pages\":\"859 - 874\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Algebra in Engineering Communication and Computing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00200-022-00594-z\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-022-00594-z","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
2016 年,Y. Kumar 等人在《Affine equivalence and non-linearity of permutations over \({\mathbb{Z}}_n\)》一文中提出了如下猜想:对于 \(n\ge 3\), 在 n 的整数环 \({\mathbb {Z}}_n\) 上的任何排列的非线性都不能超过 \(n-2\)。对于奇素数 p,当 \(n=2p\) 时,我们解决了上述猜想;对于 \(p\equiv 3 \pmod {4}\) ,我们用改进的上界证明了上述猜想。此外,当 n 是奇素数或奇素数的两倍时,我们得出了 \(\max {\mathcal {N}}{mathcal {L}}_n\) 的下界,其中 \(\max {\mathcal {N}}{mathcal {L}}_n\)表示 \({\mathbb {Z}}_n\) 上任意置换的最大可能非线性。
Bounds on the maximum nonlinearity of permutations on the rings \({\mathbb {Z}}_p\) and \({\mathbb {Z}}_{2p}\)
In 2016, Y. Kumar et al. in the paper ‘Affine equivalence and non-linearity of permutations over\({\mathbb {Z}}_n\)’ conjectured that: For\(n\ge 3\), the nonlinearity of any permutation on\({\mathbb {Z}}_n\), the ring of integers modulon, cannot exceed\(n-2\). For an odd prime p, we settle the above conjecture when \(n=2p\) and for \(p\equiv 3 \pmod {4}\) we prove the above conjecture with an improved upper bound. Further, we derive a lower bound on \(\max {\mathcal {N}}{\mathcal {L}}_n\) when n is an odd prime or twice of an odd prime where \(\max {\mathcal {N}}{\mathcal {L}}_n\) denotes the maximum possible nonlinearity of any permutation on \({\mathbb {Z}}_n\).
期刊介绍:
Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems.
Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology.
Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal.
On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.