中文
相关论文

相关论文: Some Thoughts on the Search for $5 \times 5$ and $…

200 篇论文

A magic series is a set of natural numbers that, by virtue of its size, sum, and maximum value, could fill a row of a normal magic square. In this paper, we derive an exact two-dimensional integral representation for the number of magic…

组合数学 · 数学 2013-06-05 Michael Quist

It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…

泛函分析 · 数学 2015-09-29 Jianlian Cui , Chi-Kwong Li , Nung-Sing Sze

In this paper, constructions of multimagic squares are investigated. Diagonal Latin squares and Kronecker products are used to get some constructions of multimagic squares. Consequently, some new families of compound multimagic squares are…

组合数学 · 数学 2015-12-24 Yong Zhang , Kejun Chen , Wen Li

We review a known method of compounding two magic square matrices of order m and n with the all-ones matrix to form two magic square matrices of order mn. We show that these compounded matrices commute. Simple formulas are derived for their…

综合数学 · 数学 2020-09-09 Ronald P. Nordgren

Over the last decade, Sudoku, a combinatorial number-placement puzzle, has become a favorite pastimes of many all around the world. In this puzzle, the task is to complete a partially filled $9 \times 9$ square with numbers 1 through 9,…

组合数学 · 数学 2017-04-27 Mohammad Mahdian , Ebadollah S. Mahmoodian

The additive square problem is a relatively famous open problem in the area of combinatorics on words: Does there exist an infinite word over a finite alphabet, such that no two consecutive blocks of the same length have the same sum? In…

组合数学 · 数学 2025-06-27 Ingrid Vukusic

In this short paper we have produced different kinds of upside down magic squares based on a palindromic day 11.02.2011. In this day appear only the algorisms 0, 1 and 2. Some of the magic squares are bimagic and some are palindromic. Magic…

历史与综述 · 数学 2011-02-15 Inder Jeet Taneja

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

数论 · 数学 2025-05-06 Ajai Choudhry

We explore some of the properties of consecutive, equally-summed arithmetic progressions of odd numbers, particularly their offsets and sums, before using them to prove that no $3\times3$ magic squares of distinct square integers exist.

综合数学 · 数学 2026-04-08 Oscar Hill

A $(p,q,r)$-board that has $pq+pr+qr$ squares consists of a $(p,q)$-, a $(p,r)$-, and a $(q,r)$-rectangle. Let $S$ be the set of the squares. Consider a bijection $f : S \to [1,pq+pr+qr]$. Firstly, for $1 \le i \le p$, let $x_i$ be the sum…

组合数学 · 数学 2018-08-28 Gee-Choon Lau , Ho-Kuen Ng , Wai-Chee Shiu

We demonstrate the existence of $K$-multimagic squares of order $N$ consisting of distinct integers whenever $N>2 K(K+1)$. This improves upon our earlier result in which we only required $N+1$ distinct integers. Additionally, we present a…

数论 · 数学 2025-01-03 Daniel Flores

We consider the problem of finding 4 rational squares, such that the product of any two plus the sum of the same two always gives a square. We give some historical background and exhibit one such quadruple.

数论 · 数学 2007-05-23 Allan J. MacLeod

A construction of the magic square, and hence of exceptional Lie algebras, is carried out using trialities rather than division algebras. By way of preparation, a comprehensive discussion of trialities is given, incorporating a number of…

高能物理 - 理论 · 物理学 2009-10-12 Jonathan M. Evans

Sudoku grids can be thought of as graphs where the vertices are the squares of the grid, and edges join vertices in the same row, column, or sub-grid. A Sudoku puzzle corresponds to a partial proper coloring of the Sudoku graph. We provide…

组合数学 · 数学 2008-07-02 Fusun Akman

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…

数据结构与算法 · 计算机科学 2018-05-23 Samuele Giraudo , Stéphane Vialette

A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…

数据结构与算法 · 计算机科学 2016-03-04 Samuele Giraudo , Stéphane Vialette

We present an integrated version of the global program proving that every prescribed prime \(q_0\ge 5\) occurs in some \(3\times 3\) magic square whose nine entries are distinct positive primes. The manuscript explicitly corrects the four…

Positive definite forms $f$ which are sums of squares are constructed to have the additional property that the members of any collection of forms whose squares sum to $f$ must share a nontrivial complex root.

代数几何 · 数学 2007-12-14 Gregory C. Verchota

We show arithmetic triplets of Gaussian squares are in 3-to-1 correspondence with Pythagorean triples thereof. This correspondence would transform a solution to the Magic Square of Squares puzzle into a larger structure of perfect Gaussian…

历史与综述 · 数学 2023-10-20 Christian Wolird

In this paper, we study the concept of "binary color-coded magic squares" by assigning two distinct colors to the even and odd numbers within a magic square. We investigate the uniqueness of patterns within these squares using three…

综合数学 · 数学 2023-09-29 Peyman Fahimi