Related papers: The number of "magic" squares and hypercubes
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
We define a so-called square $k$-zig-zag shape as a part of the regular square grid. Considering the shape as a $k$-zig-zag digraph, we give values of its vertices according to the number of the shortest paths from a base vertex. It…
A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…
A division sudoku is a latin square whose all six conjugates are sudoku squares. We enumerate division sudokus up to a suitable equivalence, introduce powerful invariants of division sudokus, and also study latin squares that are division…
The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes…
We show that there are infinitely many square numbers , which are constrocted by putting two square numbers together , that non of them are divisible by $10$ . We also investigate the interesting properties of some square numbers.
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
We show that the vertices and edges of a $d$-dimensional grid graph $G=(V,E)$ ($d\geqslant 2$) can be labeled with the integers from $\{1,\ldots,\lvert V\rvert\}$ and $\{1,\ldots,\lvert E\rvert\}$, respectively, in such a way that for every…
A distance magic labeling of an $n$-dimensional hypercube is a labeling of its vertices by natural numbers from $\{0, \ldots, 2^n-1\}$, such that for all vertices $v$ the sum of the labels of the neighbors of $v$ is the same. Such a…
In this paper, we prove some results of restricted sums of four squares using arithmetic of quaternions in the ring of Lipschitz integers. For example, we show that every nonnegative integer $n$ can be written as $x^{2}+y^{2}+z^{2}+t^{2}$…
In an analogous construction as by Euler for 4x4 matrices, a parametrization of 8x8 magic squares of squares with orthogonal rows is shown to be obtainable by extending the quaternionic method, as shown by Hurwitz, to octonions, but not…
A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions…
We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…
Graph labeling is a well-known and intensively investigated problem in graph theory. Sparse anti-magic squares are useful in constructing vertex-magic labeling for graphs. For positive integers $n,d$ and $d<n$, an $n\times n$ array $A$…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…
It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.
This paper studies a generalization of magic squares to finite projective space $\mathbb{P}^n(q)$. We classify at all functions from $\mathbb{P}^n(q)$ into a finite field where the sum along any $r$-flat is $0$. In doing so we show…