相关论文: Divisibility of LCM matrices by Totally nonnegativ…

Using the relationship between totally nonnegative matrices and directed acyclic weighted planar networks, we show that $2\times 2$ minors of minor matrices of totally nonnegative matrices are also nonnegative. We give a combinatorial…

We find necessary and sufficient conditions for the finite separability of finitely generated commutative rings. Namely, we prove that every such ring is a finite extension of its torsion ideal $I_k$ where $k$ is square-free, and $I_k$ is a…

Totally equimodular matrices generalize totally unimodular matrices and arise in the context of box-total dual integral polyhedra. This work further explores the parallels between these two classes and introduces foundational building…

For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and ndecomposable group codes, we prove that every MDS non trivial code, every perfect non…

We generalize the well known characterizations of totally nonnegative and oscillatory matrices, due to F.R.Gantmacher, M.G.Krein, A.Whitney, C.Loewner, M.Gasca, and J.M.Pena to the case of an arbitrary complex semisimple Lie group.

We say that $M$ and $S$ form a \textsl{splitting} of $G$ if every nonzero element $g$ of $G$ has a unique representation of the form $g=ms$ with $m\in M$ and $s\in S$, while $0$ has no such representation. The splitting is called {\it…

Let $G$ be a finite group and denote by $o(g)$ the order of an element $g\in G$. We say that $G$ is an $LCM$-group if $o(x^ny)$ is a divisor of the least common multiple of $o(x^n)$ and $o(y)$ for all $x, y\in G$ and $n\in\mathbb{N}$. This…

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

For integers $x$ and $y$, $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of $x$ and $y$ respectively. Denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive…

We investigate the standard graded $k$-algebras over a field $k$ of characteristic zero for which general linear forms are exact zero divisors. We formulate a conjecture regarding the Hilbert function of such rings. We prove our conjecture…

The paper studies algebraic strong shift equivalence of matrices over $n$-variable polynomial rings over a principal ideal domain $D$($n\leq 2$). It is proved that in the case $n=1$, every non-zero matrix over $D[x]$ has a full rank…

A lonesum matrix is a $(0,1)$-matrix that is uniquely determined by its row and column sum vectors. In this paper, we introduce lonesum decomposable matrices and study their properties. We provide a necessary and sufficient condition for a…

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

In this paper, we study a class of generalized intersection matrix Lie algebras $\gim(M_n)$, and prove that its every finite-dimensional semi-simple quotient is of type $M(n,{\bf a}, {\bf c},{\bf d})$. Particularly, any finite dimensional…

Generalized diagonal matrices are matrices that have two ladders of entries that are zero in the upper right and bottom left corners. The minors of generic generalized diagonal matrices have square-free initial ideals. We give a description…

We introduce the concept of centrally algebraically closed division rings and show that a division ring satisfies the central Nullstellensatz if and only if it is centrally algebraically closed. We also show that every division ring can be…

In this paper, we examine the linear codes with respect to the Hamming metric from incidence matrices of the zero-divisor graphs with vertex set is the set of all non-zero zero-divisors of the ring $\mathbb{Z}_n$ and two distinct vertices…

Given a graph G with a distinguished vertex s, the critical group of (G,s) is the cokernel of their reduced Laplacian matrix L(G,s). In this article we generalize the concept of the critical group to the cokernel of any matrix with entries…

Let $S=\{x_1,x_2,\dots,x_n\}$ be a set of distinct positive integers, and let $f$ be an arithmetical function. The GCD matrix $(S)_f$ on $S$ associated with $f$ is defined as the $n\times n$ matrix having $f$ evaluated at the greatest…

Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider…