Related papers: Magic rectangles with empty cells
A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease along rows and columns when moving toward the diagonal. A…
An ordered triple $(s,p,n)$ is called admissible if there exist two different multisets $X=\{x_1,x_2,\dotsc,x_n\}$ and $Y=\{y_1,y_2,\dotsc,y_n\}$ such that $X$ and $Y$ share the same sum $s$, the same product $p$, and the same size $n$. We…
The rectangle capacity, a word statistic that was recently introduced by the author and Mansour, counts, for two fixed positive integers $r$ and $s$, the number of occurrences of a rectangle of size $r\times s$ in the bargraph…
Exact evaluation of $<{\rm Tr} S^p>$ is here performed for real symmetric matrices $S$ of arbitrary order $n$, up to some integer $p$, where the matrix entries are independent identically distributed random variables, with an arbitrary…
A special class of Jordan algebras over a field $F$ of characteristic zero is considered. Such an algebra consists of an $r$-dimensional subspace of the vector space of all square matrices of a fixed order $n$ over $F$. It contains the…
Fix an integer $r\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\{1,..., r\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the…
Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum…
A Heron triangle is one that has all integer side lengths and integer area, which takes its name from Heron of Alexandria's area formula. From a more relaxed point of view, if rescaling is allowed, then one can define a Heron triangle to be…
Merging $T$ sorted, non-redundant lists containing $M$ elements into a single sorted, non-redundant result of size $N \ge M/T$ is a classic problem typically solved practically in $O(M \log T)$ time with a priority-queue data structure the…
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,…
An $r$-matrix is a matrix with symbols in $\{0,1,\dots,r-1\}$. A matrix is simple if it has no repeated columns. Let the support of a matrix $F$, $\text{supp}(F)$ be the largest simple matrix such that every column in $\text{supp}(F)$ is in…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
For integers $n,k,s$, we give a formula for the number $T(n,k,s)$ of order $k$ subsets of the ring $\mathbb{Z}/n\mathbb{Z}$ whose sum of elements is $s$ modulo $n$. To do so, we describe explicitly a sequence of matrices $M(k)$, for…
A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…
Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…
We show the 3 by 3 magic square of squares problem equivalent to solving quartic polynomials with certain factorization constraints over an abelian extension of the rationals. We analyze a particular case in which said extension is assumed…
This is a translation of Leonhard Euler's ``De quadratis magicis'' . It is E795 in the Enestrom index. This paper studies how to construct magic squares with certain numbers of cells, in particular 9, 16, 25 and 36. It considers some…
Given an $n\times n$ matrix $c$ over a unitary ring $R$, the centralizer of $c$ in the full $n\times n$ matrix ring $M_n(R)$ is called a principal centralizer matrix ring, denoted by $S_n(c,R)$. We investigate its structure and prove: $(1)$…
Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…
In the plane, three integer points ("fleas") are given. At every tick of time, two of them (say, P,Q) instantly jump to two vacant points R,S, so that PQRS is a square with that order of vertices. Description of all integers and…