Related papers: A circle method approach to K-multimagic squares

This article studies a generalization of magic squares to $k$-uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized…

A magic square of order $n$ with all subsquares of possible orders (ASMS$(n)$) is a magic square which contains a general magic square of each order $k\in\{3, 4, \cdots, n-2\}$. Since the conjecture on the existence of an ASMS was proposed…

We define a magic square to be a square matrix whose entries are nonnegative integers and whose rows, columns, and main diagonals sum up to the same number. We prove structural results for the number of such squares as a function of the…

In recreational mathematics, a normal magic square is an $n \times n$ square matrix whose entries are distinctly the integers $1 \ldots n^2$, such that each row, column, and major and minor traces sum to one constant $\mu$. It has been…

Let $(\Gamma,+)$ be an Abelian group of order $n^2$ and MS$_{\Gamma}(n)$ be an $n\times n$ array whose entries are all elements of $\Gamma$. Then MS$_{\Gamma}(n)$ is a $\Gamma$-magic square if all row, column, main and backward main…

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

Magic squares are a fascinating mathematical challenge that has intrigued mathematicians for centuries. Given a positive (and possibly large) integer \( n \), one of the main challenges that still remains is to find, within a computational…

This article studies the number of ways of selecting $k$ objects arranged in $p$ circles of sizes $n_1,\ldots,n_p$ such that no two selected ones have less than $s$ objects between them. If $n_i\geq sk+1$ for all $1\leq i \leq p$, this…

In this paper we construct explicit Lagrangian formulation for the massive spin-2 supermultiplets with N = k supersymmetries k = 1,2,3,4. Such multiplets contain 2k particles with spin-3/2, so there must exist N = 2k local supersymmetries…

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

This paper aims to address the relation between a magic square of odd order $n$ and a group, and their properties. By the modulo number $n$, we construct entries for each table from initial table of magic square with large number $n^2$.…

Motivated by a conjecture of Erd\H{o}s on the additive irreducibility of small perturbations of the set of squares, recently Hajdu and S\'{a}rk\"{o}zy studied a multiplicative analogue of the conjecture for shifted $k$-th powers. They…

Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…

We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…

For any real $x$ and any integer $k\ge1$, we say that a set $\mathcal{D}_{k}$ of $k$ distinct integers is a $k$-tuple jumping champion if it is the most common differences that occurs among $k+1$ consecutive primes less than or equal to…

We investigate integers whose base $g$ expansion omits a fixed digit and which can be represented as a sum of two prime squares. In the first part of the paper, we apply the Hardy--Littlewood circle method to obtain asymptotic formulas for…

Quantum permutation matrices and quantum magic squares are generalizations of permutation matrices and magic squares, where the entries are no longer numbers but elements from arbitrary (non-commutative) algebras. The famous Birkhoff--von…

We consider the minimal number of points on a regular grid on the plane that generates $n$ line segments of points of exactly length $k$. We illustrate how this is related to the $n$-queens problem on the toroidal chessboard and show that…

Knutson, Tao, and Woodward formulated a Littlewood-Richardson rule for the cohomology ring of Grassmannians in terms of puzzles. Vakil and Wheeler-Zinn-Justin have found additional triangular puzzle pieces that allow one to express…

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…