Related papers: Non-Expansive Matrix Based number Systems
Let $k$ be an algebraically closed field, $\mathop{char}(k) = p \geq 2$ and $E_r$ be a $p$-elementary abelian group of rank $r \geq 2$. Let $(c,d) \in \mathbb{N}^2$. We show that there exists an indecomposable module of constant Jordan type…
We present a construction of a Jordan scheme from an elementary abelian $2$-group of rank $n$ and a $\{1,-1\}$-matrix of order $2^n$ that satisfies a specified condition. We then prove that the orders of matrices with the specified…
An $(n, k, d, \alpha)$-MSR (minimum storage regeneration) code is a set of $n$ nodes used to store a file. For a file of total size $k\alpha$, each node stores $\alpha$ symbols, any $k$ nodes recover the file, and any $d$ nodes can repair…
Let $k$ and $n$ be positive integers. Define $R(n,k)$ to be the minimum positive value of $$ | e_i \sqrt{s_1} + e_2 \sqrt{s_2} + ... + e_k \sqrt{s_k} -t | $$ where $ s_1, s_2, ..., s_k$ are positive integers no larger than $n$, $t$ is an…
Let $\mathbb{F}$ be an algebraically closed field of characteristic $0$. Given a square matrix $A \in \mathbb{F}^{n \times n}$ and a polynomial $f \in \mathbb{F}[w]$, we determine the Jordan canonical form of the formal Fr\'{e}chet…
The minimum message length principle is an information theoretic criterion that links data compression with statistical inference. This paper studies the strict minimum message length (SMML) estimator for $d$-dimensional exponential…
In this paper we address the problem of representing solutions of a system of scalar linear partial difference equations akin to state space equations of 1-D systems theory. We first obtain a representation formula for a special class of…
We propose a connection between the newly formulated Virasoro minimal string and the well-established $(2,2m-1)$ minimal string by deriving the string equation of the Virasoro minimal string using the expansion of its density of states in…
A square matrix is nonderogatory if its Jordan blocks have distinct eigenvalues. We give canonical forms (i) for nonderogatory complex matrices up to unitary similarity and (ii) for pairs of complex matrices up to similarity, in which one…
Let $\Mn$ be the ring of all $n \times n$ matrices over a unital ring $\mathcal{R}$, let $\mathcal{M}$ be a 2-torsion free unital $\Mn$-bimodule and let $D:\Mn\rightarrow \mathcal{M}$ be an additive map. We prove that if $D(\A)\B+ \A…
The Drazin index is a fundamental invariant in the analysis of singular matrices and their generalized inverses. While sharp results are available for block triangular matrices, the corresponding theory for anti-triangular block matrices is…
We define Jordan quadruple systems by the polynomial identities of degrees 4 and 7 satisfied by the Jordan tetrad {a,b,c,d} = abcd + dcba as a quadrilinear operation on associative algebras. We find further identities in degree 10 which are…
Discrete-time switched linear systems where switchings are governed by a digraph are considered. The minimum (or average) dwell time that guarantees the asymptotic stability can be computed by calculating the maximum cycle ratio (or maximum…
A fundamental result by L. Solomon in algebraic combinatorics and representation theory states that Mackey formulas for products of characters of a symmetric group, or equivalently the computation of tensor products of representations…
A double-base representation of an integer n is an expression n = n_1 + ... + n_r, where the n_i are (positive or negative) integers that are divisible by no primes other than 2 or 3; the length of the representation is the number r of…
We study the weights of eigenvectors of the Johnson graphs $J(n,w)$. For any $i \in \{1,\ldots,w\}$ and sufficiently large $n, n\geq n(i,w)$ we show that an eigenvector of $J(n,w)$ with the eigenvalue $\lambda_i=(n-w-i)(w-i)-i$ has at least…
Given two nonzero complex parameters $l$ and $m$, we construct by the mean of knot theory a matrix representation of size $\chl$ of the BMW algebra of type $A_{n-1}$ with parameters $l$ and $m$ over the field $\Q(l,r)$, where $m=\unsurr-r$.…
We consider nonnormal matrix-valued dynamical systems with discrete time. For an eigenvalue of matrix, the number of times it appears as a root of the characteristic polynomial is called the algebraic multiplicity. On the other hand, the…
Given an $n*n$ sparse symmetric matrix with $m$ nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values. To maintain the matrix sparse, we would like to minimize the number $k$ of these changes, hence…
This paper studies the polynomial basis that generates the smallest $n$-simplex enclosing a given $n^{\text{th}}$-degree polynomial curve in $\mathbb{R}^n$. Although the Bernstein and B-Spline polynomial bases provide feasible solutions to…