Related papers: Explicit Description of Centralizers for a Matrix

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important…

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…

The representation problem of finite-dimensional Markov matrices in Markov semigroups is revisited, with emphasis on concrete criteria for matrix subclasses of theoretical or practical relevance, such as equal-input, circulant, symmetric or…

For ${n \in \mathbb{N}}$, the $n$-truncation of a matroid $M$ of rank at least $n$ is the matroid whose bases are the $n$-element independent sets of $M$. One can extend this definition to negative integers by letting the $(-n)$-truncation…

We study centralizers in certain algebras with valuation in order to generalize results by Hellstr\"{o}m and Silvestrov on centralizers in graded algebras. We prove that the centralizer of an element in the studied algebras is a free module…

We determine the centralizers of certain isomorphic copies of spin subalgebras $\mathfrak{spin}(r)$ in $\mathfrak{so}(d_rm)$, where $d_r$ is the dimension of a real irreducible representation of $Cl_r^0$, the even Clifford algebra…

We show that the objective function of conventional k-means clustering can be expressed as the Frobenius norm of the difference of a data matrix and a low rank approximation of that data matrix. In short, we show that k-means clustering is…

We study centralizers of elements in domains. We generalize a result of the author and Small, showing that if $A$ is a finitely generated noetherian domain and $a\in A$ is not algebraic over the extended centre of $A$, then the centralizer…

In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…

In the Priority $k$-Center problem, the input consists of a metric space $(X,d)$, an integer $k$, and for each point $v \in X$ a priority radius $r(v)$. The goal is to choose $k$-centers $S \subseteq X$ to minimize $\max_{v \in X}…

We consider matrix-model representations of the meander problem which describes, in particular, combinatorics for foldings of closed polymer chains. We introduce a supersymmetric matrix model for describing the principal meander numbers.…

Let $K$ be an algebraically closed field and let $M_n(K)$ denote the algebra of $n\times n$ matrices over $K$. A classical problem asks for the minimal possible dimension of a maximal commutative subalgebra $A \subseteq M_n(K)$. We…

Let F be a field. We investigate the greatest possible dimension t_n(F) for a vector space of n-by-n matrices with entries in F and in which every element is triangularizable over the ground field F. It is obvious that t_n(F) is greater…

An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We…

The main purpose of this book is to propose an introduction to the modern tools of algebraic complexity. To remain as simple as possible while providing meaningful examples, we chose to focus on effective linear algebra; this is certainly…

This paper is the first in the series of papers devoted to the explicit description of linear maps preserving the Cullis' determinant of rectangular matrices with entries belonging to an arbitrary ground field which is large enough. The…

For $n\ge 2$ and fixed $k\ge 1$, we study when a square matrix $A$ over an arbitrary field $\mathbb{F}$ can be decomposed as $T+N$ where $T$ is a torsion matrix and $N$ is a nilpotent matrix with $N^k=0$. For fields of prime characteristic,…

A classification algorithm, called the Linear Centralization Classifier (LCC), is introduced. The algorithm seeks to find a transformation that best maps instances from the feature space to a space where they concentrate towards the center…