关于近似哈达玛矩阵的说明

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-06-04 DOI:10.1007/s10623-024-01430-w
Stefan Steinerberger
{"title":"关于近似哈达玛矩阵的说明","authors":"Stefan Steinerberger","doi":"10.1007/s10623-024-01430-w","DOIUrl":null,"url":null,"abstract":"<p>A Hadamard matrix is a scaled orthogonal matrix with <span>\\(\\pm 1\\)</span> entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when <i>n</i> is a multiple of 4. A conjecture attributed to Ryser is that no circulant Hadamard matrices exist when <span>\\(n &gt; 4\\)</span>. Recently, Dong and Rudelson proved the existence of <i>approximate</i> Hadamard matrices in all dimensions: there exist universal <span>\\(0&lt; c&lt; C &lt; \\infty \\)</span> so that for all <span>\\(n \\ge 1\\)</span>, there is a matrix <span>\\(A \\in \\left\\{ -1,1\\right\\} ^{n \\times n}\\)</span> satisfying, for all <span>\\(x \\in \\mathbb {R}^n\\)</span>, </p><span>$$\\begin{aligned} c \\sqrt{n} \\Vert x\\Vert _2 \\le \\Vert Ax\\Vert _2 \\le C \\sqrt{n} \\Vert x\\Vert _2. \\end{aligned}$$</span><p>We observe that, as a consequence of the existence of flat Littlewood polynomials, <i>circulant</i> approximate Hadamard matrices exist for all <span>\\(n \\ge 1\\)</span>.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A note on approximate Hadamard matrices\",\"authors\":\"Stefan Steinerberger\",\"doi\":\"10.1007/s10623-024-01430-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A Hadamard matrix is a scaled orthogonal matrix with <span>\\\\(\\\\pm 1\\\\)</span> entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when <i>n</i> is a multiple of 4. A conjecture attributed to Ryser is that no circulant Hadamard matrices exist when <span>\\\\(n &gt; 4\\\\)</span>. Recently, Dong and Rudelson proved the existence of <i>approximate</i> Hadamard matrices in all dimensions: there exist universal <span>\\\\(0&lt; c&lt; C &lt; \\\\infty \\\\)</span> so that for all <span>\\\\(n \\\\ge 1\\\\)</span>, there is a matrix <span>\\\\(A \\\\in \\\\left\\\\{ -1,1\\\\right\\\\} ^{n \\\\times n}\\\\)</span> satisfying, for all <span>\\\\(x \\\\in \\\\mathbb {R}^n\\\\)</span>, </p><span>$$\\\\begin{aligned} c \\\\sqrt{n} \\\\Vert x\\\\Vert _2 \\\\le \\\\Vert Ax\\\\Vert _2 \\\\le C \\\\sqrt{n} \\\\Vert x\\\\Vert _2. \\\\end{aligned}$$</span><p>We observe that, as a consequence of the existence of flat Littlewood polynomials, <i>circulant</i> approximate Hadamard matrices exist for all <span>\\\\(n \\\\ge 1\\\\)</span>.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01430-w\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01430-w","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

哈达玛矩阵是一个具有 \(\pm 1\) 条目的按比例正交矩阵。这样的矩阵存在于某些维度中:哈达玛猜想是,当 n 是 4 的倍数时,这样的矩阵总是存在的。雷塞尔提出的一个猜想是,当 \(n > 4\) 时,不存在环形哈达玛矩阵。最近,Dong 和 Rudelson 证明了所有维度上近似 Hadamard 矩阵的存在:存在普遍的(0< c< C<)矩阵,这样对于所有的(n),都有一个矩阵(A)满足,对于所有的(x),$$\begin{aligned} c \sqrt{n}\Vert x\Vert _2 \le \Vert Ax\Vert _2 \le C \sqrt{n}\Vert x\Vert _2.\end{aligned}$$我们注意到,由于平利特尔伍德多项式的存在,对于所有的 \(n \ge 1\) 都存在环形近似哈达玛矩阵。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A note on approximate Hadamard matrices

A Hadamard matrix is a scaled orthogonal matrix with \(\pm 1\) entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when n is a multiple of 4. A conjecture attributed to Ryser is that no circulant Hadamard matrices exist when \(n > 4\). Recently, Dong and Rudelson proved the existence of approximate Hadamard matrices in all dimensions: there exist universal \(0< c< C < \infty \) so that for all \(n \ge 1\), there is a matrix \(A \in \left\{ -1,1\right\} ^{n \times n}\) satisfying, for all \(x \in \mathbb {R}^n\),

$$\begin{aligned} c \sqrt{n} \Vert x\Vert _2 \le \Vert Ax\Vert _2 \le C \sqrt{n} \Vert x\Vert _2. \end{aligned}$$

We observe that, as a consequence of the existence of flat Littlewood polynomials, circulant approximate Hadamard matrices exist for all \(n \ge 1\).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
期刊最新文献
Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions Arithmetization-oriented APN permutations Non-linear MRD codes from cones over exterior sets Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes Designs in finite classical polar spaces
×
引用
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