Related papers: On positional representation of integer vectors

Let $G$ be a graph each component of which has order at least 3, and let $G$ have order $n$, size $m$, total domination number $\gamma_t$ and maximum degree $\Delta(G)$. Let $\Delta = 3$ if $\Delta(G) = 2$ and $\Delta = \Delta (G)$ if…

In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…

We consider algorithms with access to an unknown matrix $M\in\mathbb{F}^{n \times d}$ via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \mathbf{v}^q$, and observes $M\mathbf{v}^1,\ldots,…

In this document we study the uniform local path connectivity of sets of $m$-tuples of pairwise commuting normal matrices with some additional constraints. More specifically, given given $\varepsilon>0$, a fixed metric $\eth$ in…

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb{N}$ is finitely colored, there must be some $\overset{\rightarrow}{x}$ with entries from $\mathbb{N}$ such that all entries of $A…

We consider one-plaquette unitary matrix model at finite $N$ using exact expression of the partition function for both SU($N$) and U($N$) groups.

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Let $A$ be a finite dimensional hereditary algebra over an algebraically closed field $k$, $T_2(A)=(\begin{array}{cc}A&0 A&A\end{array})$ be the triangular matrix algebra and $A^{(1)}=(\begin{array}{cc}A&0 DA&A\end{array})$ be the…

For partially ordered sets $X$ we consider the square matrices $M^{X}$ with rows and columns indexed by linear extensions of the partial order on $X$. Each entry $\left( M^{X}\right)_{PQ}$ is a formal variable defined by a pedestal of the…

For any $n\ge 2$ and fixed $k\ge 1$, we give necessary and sufficient conditions for an arbitrary nonzero square matrix in the matrix ring $\mathbb{M}_n(\mathbb{F})$ to be written as a sum of an invertible matrix $U$ and a nilpotent matrix…

In this series of papers, we investigate properties of a finite group which are determined by its low degree irreducible representations over a number field $F$, i.e. its representations on matrix rings $\operatorname{M}_n(D)$ with $n \leq…

We consider frames in a finite-dimensional Hilbert space where frames are exactly the spanning sets of the vector space. A factor poset of a frame is defined to be a collection of subsets of $I$, the index set of our vectors, ordered by…

We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.

In this paper we provide a finite-sample and an infinite-sample representer theorem for the concatenation of (linear combinations of) kernel functions of reproducing kernel Hilbert spaces. These results serve as mathematical foundation for…

Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…

Let $m>1$ and $\mathfrak{d} \neq 0$ be integers such that $v_{p}(\mathfrak{d}) \neq m$ for any prime $p$. We construct a matrix $A(\mathfrak{d})$ of size $(m-1) \times (m-1)$ depending on only of $\mathfrak{d}$ with the following property:…

In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the…

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…