English
Related papers

Related papers: Non-Expansive Matrix Based number Systems

200 papers

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…

Representation Theory · Mathematics 2019-03-19 Daniel Bissinger

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…

Combinatorics · Mathematics 2025-09-04 Akihide Hanaki , Masayoshi Yoshikawa

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…

Information Theory · Computer Science 2022-01-07 Iwan Duursma , Hsin-Po Wang

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…

Computational Geometry · Computer Science 2015-05-13 Qi Cheng , Xianmeng Meng , Celi Sun , Jiazhe Chen

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…

Rings and Algebras · Mathematics 2026-05-08 Vanni Noferini

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…

Information Theory · Computer Science 2014-03-24 James G. Dowty

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…

Analysis of PDEs · Mathematics 2015-05-22 Debasattam Pal , Harish K. Pillai

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…

High Energy Physics - Theory · Physics 2024-01-31 Alicia Castro

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…

Representation Theory · Mathematics 2011-12-19 Vyacheslav Futorny , Roger A. Horn , Vladimir V. Sergeichuk

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…

Rings and Algebras · Mathematics 2013-09-24 Hoger Ghahramani

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…

Combinatorics · Mathematics 2026-04-10 Faustino Maciala , Xavier Mary , C. Mendes Araújo , Pedro Patrício

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…

Rings and Algebras · Mathematics 2025-07-22 Murray Bremner , Sara Madariaga

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…

Systems and Control · Computer Science 2017-10-20 Ferruh İlhan , Özkan Karabacak

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…

Combinatorics · Mathematics 2025-03-19 Loïc Foissy , Claudia Malvenuto , Frédéric Patras

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…

Number Theory · Mathematics 2011-08-30 Vassil S. Dimitrov , Everett W. Howe

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…

Combinatorics · Mathematics 2017-06-14 Konstantin Vorob'ev , Ivan Mogilnykh , Alexandr Valyuzhenich

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$.…

Representation Theory · Mathematics 2009-01-27 Claire Levaillant

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…

Mathematical Physics · Physics 2025-11-12 Saori Morimoto , Makoto Katori , Tomoyuki Shirai

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…

Computational Complexity · Computer Science 2016-06-28 Yixin Cao , R. B. Sandeep

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…

Computational Geometry · Computer Science 2022-09-28 Jesus Tordesillas , Jonathan P. How
‹ Prev 1 4 5 6 7 8 10 Next ›