相关论文: Non-divisibility of LCM Matrices by GCD Matrices o…

Let $S=\{x_1,\ldots, x_n\}$ be a gcd-closed set (i.e. $(x_i,x_j)\in S $ for all $1\le i,j\le n$). In 2002, Hong proposed the divisibility problem of characterizing all gcd-closed sets $S$ with $|S|\ge 4$ such that the GCD matrix $(S)$…

Let $a$ and $n$ be positive integers and let $S=\{x_1, \cdots, x_n\}$ be a set of $n$ distinct positive integers. For $x\in S$, one defines $G_{S}(x)=\{d\in S: d<x, d|x \ {\rm and} \ (d|y|x, y\in S)\Rightarrow y\in \{d,x\}\}$. We denote by…

In this paper, we show that all totally nonnegative GCD matrices are always divisors of the corresponding LCM matrices in the ring $\mathbb{M}_{n}(\mathbb{Z})$. We also introduce \lq\lq column monotone matrices" used to construct all…

In 1876 H. J. S. Smith defined an LCM matrix as follows: let S = {x_1, x_2, ..., x_n} be a set of positive integers. The LCM matrix [S] is the n $\times$ n matrix with lcm(x_i , x_j) as its ij entry. During the last 30 years singularity of…

The invertibility of LCM matrices and their Hadamard powers have been studied a lot over the years by many authors. Bourque and Ligh conjectured in 1992 that the LCM matrix $[S]=[[x_i, x_j]]$ on any GCD closed set $S=\{x_1, x_2, \ldots,…

Let $S=\{x_1,x_2,\ldots,x_n\}$ be a finite set of distinct positive integers. Throughout this article we assume that the set $S$ is GCD closed. The LCM matrix $[S]$ of the set $S$ is defined to be the $n\times n$ matrix with…

A matrix $M$ over the finite field $ \mathbb{F}_q $ is called \emph{maximum distance separable} (MDS) if all of its square submatrices are non-singular. These MDS matrices are very important in cryptography and coding theory because they…

Circulant Maximum Distance Separable (MDS) matrices have gained significant importance due to their applications in the diffusion layer of the AES block cipher. In $2013$, Gupta and Ray established that circulant involutory matrices of…

This paper considers the problem of designing maximum distance separable (MDS) codes over small fields with constraints on the support of their generator matrices. For any given $m\times n$ binary matrix $M$, the GM-MDS conjecture, due to…

In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…

P. M. Cohn showed in 1971 that given a ring $R$, to describe, up to isomorphism, a division ring $D$ generated by a homomorphic image of $R$ is equivalent to specifying the set of square matrices over $R$ which map to singular matrices over…

The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…

We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed…

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time…

We propose halfspace depth concepts for scatter, concentration and shape matrices. For scatter matrices, our concept is similar to those from Chen, Gao and Ren (2017) and Zhang (2002). Rather than focusing, as in these earlier works, on…

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…

Let $ R \subset \R $ be a GCD-domain. In this paper, Weinberg's conjecture on the $ n \times n $ matrix algebra $ M_{n}(R) \ (n \geq 2) $ is proved. Moreover, all the lattice orders (up to isomorphisms) on a full $ 2 \times 2 $ matrix…

The problem of robustly reconstructing an integer vector from its erroneous remainders appears in many applications in the field of multidimensional (MD) signal processing. To address this problem, a robust MD Chinese remainder theorem…

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…

Let $R$ be a gcd-domain (for example let $R$ be a unique factorization domain), and let $(a_n)_{n\geqslant1}$ be a sequence of nonzero elements in $R$. We prove that $\gcd(a_n,a_m)=a_{\gcd(n,m)}$ for all $n,m\geqslant1$ if and only if…