Related papers: A magic rectangle set on Abelian groups
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
Magic squares are arrangements of natural numbers into square arrays, where the sum of each row, each column, and both diagonals is the same. In this paper, the concept of a magic square with 3 rows and 3 columns is generalized to define…
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…
A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…
In this article, some necessary conditions of group vertex magicness of graphs with at least one pendant, group vertex magicness of product graphs, are proved. A characterization of group vertex magicness of trees of diameter up to 5. for…
The random triangular group $\Gamma(n,p)$ is the group given by a random group presentation with $n$ generators in which every relator of length three is present independently with probability $p$. We show that in the evolution of…
Hefetz, M\"{u}tze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation. In this paper we support the analogous question for distance magic labeling. Let $\Gamma$ be an Abelian group of order $n$. A…
Let G be a simple undirected graph and let A be an additive Abelian group with identity 0. In this paper, we introduce the concept of group magic spectrum of a graph G with respect to a given Abelian group A and is defined as spec(G, A):=…
The regular graph of ideals of the commutative ring $R$, denoted by ${\Gamma_{reg}}(R)$, is a graph whose vertex set is the set of all non-trivial ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if either $I$…
For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…
Recognizing when a ring is a complete matrix ring is of significant importance in algebra. It is well-known folklore that a ring $R$ is a complete $n\times n$ matrix ring, so $R\cong M_{n}(S)$ for some ring $S$, if and only if it contains a…
We consider Majorana algebras generated by three Majorana axes $a_0$, $a_1$ and $a_2$ such that $a_0$ and $a_1$ generate a dihedral algebra of type 2A. We show that such an algebra must occur as a Majorana representation of one of 27…
A ring element $\,a\in R\,$ is said to be of {\it right stable range one\/} if, for any $\,t\in R$, $\,aR+tR=R\,$ implies that $\,a+t\,b\,$ is a unit in $\,R\,$ for some $\,b\in R$. Similarly, $\,a\in R\,$ is said to be of {\it left stable…
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…
For an arbitrary ring $A$, we study the abelianization of the elementary group $\textrm{E}_2(A)$. In particular, we show that for a commutative ring $A$ there exists an exact sequence \[ K_2(2,A)/C(2,A) \to A/M \to…
A $\Gamma$-Besicovitch set is a set which contains a rotated copy of $\Gamma$ in every direction. Our main result is the construction of a non-trivial $1$-rectifiable set $\Gamma$ in the plane, for which there exists a 1-dimensional…
In a graph $\Gamma$ with vertex set $V$, a subset $C$ of $V$ is called an $(a,b)$-perfect set if every vertex in $C$ has exactly $a$ neighbors in $C$ and every vertex in $V\setminus C$ has exactly $b$ neighbors in $C$, where $a$ and $b$ are…
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$…
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with…
In the present paper, as a generalization of the classical periodic rings, we explore those rings whose elements are additively generated by two (or more) periodic elements by calling them additively periodic. We prove that, in some major…