Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2406.09364v1

Help | Advanced Search

Mathematics > Number Theory

arXiv:2406.09364v1 (math)
[Submitted on 13 Jun 2024 (this version) , latest version 4 Sep 2024 (v2) ]

Title: On the existence of magic squares of powers

Title: 论幂幻方的存在性

Authors:Nick Rome, Shuntaro Yamagishi (with an appendix by Diyuan Wu)
Abstract: For any $d \geq 2$, we prove that there exists an integer $n_0(d)$ such that there exists an $n \times n$ magic square of $d^\text{th}$ powers for all $n \geq n_0(d)$. In particular, we establish the existence of an $n \times n$ magic square of squares for all $n \geq 4$, which settles a conjecture of V\'{a}rilly-Alvarado. All previous approaches had been based on constructive methods and the existence of $n \times n$ magic squares of $d^\text{th}$ powers had only been known for sparse values of $n$. We prove our result by the Hardy-Littlewood circle method, which in this setting essentially reduces the problem to finding a sufficient number of disjoint linearly independent subsets of the columns of the coefficient matrix of the equations defining magic squares. We prove an optimal (up to a constant) lower bound for this quantity.
Abstract: For any $d \geq 2$, we prove that there exists an integer $n_0(d)$ such that there exists an $n \times n$ magic square of $d^\text{th}$ powers for all $n \geq n_0(d)$. In particular, we establish the existence of an $n \times n$ magic square of squares for all $n \geq 4$, which settles a conjecture of Várilly-Alvarado. 所有以前的方法都是基于构造性方法,而仅知道$n \times n$阶魔方阵的$d^\text{th}$次幂在$n$的稀疏值下存在。 我们通过 Hardy-Littlewood 圆法证明了我们的结果,在这种情况下,该方法基本上将问题简化为找到系数矩阵列的足够多的不相交的线性无关子集,这些子集定义了魔方阵的方程。 我们为此数量证明了一个最优(常数范围内)的下界。
Comments: NOTE: This upload is a draft being posted early due to the appearance of a similar result. Future versions will cite the independent results of Flores which appeared yesterday with arXiv identifier 2406.08161. His paper, contrary to the claim in this submission, is the first to apply the circle method to the problem of existence of magic squares
Subjects: Number Theory (math.NT) ; Combinatorics (math.CO)
MSC classes: 11D45, 05B15, 11D72, 11G35, 11P55
Cite as: arXiv:2406.09364 [math.NT]
  (or arXiv:2406.09364v1 [math.NT] for this version)
  https://doi.org/10.48550/arXiv.2406.09364
arXiv-issued DOI via DataCite

Submission history

From: Nick Rome [view email]
[v1] Thu, 13 Jun 2024 17:49:25 UTC (30 KB)
[v2] Wed, 4 Sep 2024 13:34:46 UTC (18 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.NT
< prev   |   next >
new | recent | 2024-06
Change to browse by:
math
math.CO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号