Related papers: Non-Expansive Matrix Based number Systems

Suppose $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d_G( v_i,v_j ) $ be the least distance between $v_i$ and $v_j$ in $G$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} ) _{n\times…

We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every…

If a single particle obeys non-relativistic QM in R^d and has the Hamiltonian H = - Delta + f(r), where f(r)=sum_{i = 1}^{k}a_ir^{q_i}, 2\leq q_i < q_{i+1}, a_i \geq 0$, then the eigenvalues E = E_{n\ell}^{(d)}(\lambda) are given…

We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that…

Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…

We study regular non-semisimple Dubrovin-Frobenius manifolds in dimensions 2,3,4. We focus on the case where the Jordan canonical form of the operator of multiplication by the Euler vector field has a single Jordan block. Our results rely…

We use principal angles between two subspaces to define Jordan planes. Jordan planes provide an optimal way to decompose $\mathbb{C}^n$ in relation to given two subspaces. We apply Jordan planes to show that two pairs of of subspaces…

Inspired by the work of Benson, Carlson, Friedlander, Pevtsova, and Suslin on modules of constant Jordan type for finite group schemes, we introduce in this paper the class of representations of constant Jordan type for an acyclic quiver…

In this paper, we provide novel mean value estimates for exponential sums related to the extended main conjecture of Vinogradov's mean value theorem, by developing the Hardy-Littlewood circle method together with a refined shifting…

A defective eigenvalue is well documented to be hypersensitive to data perturbations and round-off? errors, making it a formidable challenge in numerical computation particularly when the matrix is known through approximate data. This paper…

The trace norm of a matrix is the sum of its singular values. This paper presents results on the minimum trace norm $\psi_{n}\left( m\right) $ of $\left( 0,1\right) $-matrices of size $n\times n$ with exactly $m$ ones. It is shown that: (1)…

McDonald and Paparella [Linear Algebra Appl. 498 (2016), 145--159] gave a necessary condition on the structure of Jordan chains of $h$-cyclic matrices. In this work, that necessary condition is shown to be sufficient. As a consequence, we…

We revisit ADE minimal string theories, focusing on the D- and E-series minimal models coupled to Liouville theory. Unlike the A-series, whose duals are solvable two-matrix models, these theories are conjectured to correspond to unsolvable…

A zero-one matrix is a matrix with entries from $\{0, 1\}$. We study monoids containing only such matrices. A finite set of zero-one matrices generating such a monoid can be seen as the matrix representation of an unambiguous finite…

Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…

Consider a $m \times n$ matrix $A$, whose elements are arbitrary integers. Consider, for each square window of size $2 \times 2$, the sum of the corresponding elements of $A$. These sums form a $(m - 1) \times (n-1)$ matrix $S$. Can we…

Diagonalizing a matrix $A$, that is finding two matrices $P$ and $D$ such that $A = PDP^{-1}$ with $D$ being a diagonal matrix needs two steps: first find the eigenvalues and then find the corresponding eigenvectors. We show that we do not…

Let $M_n$ denote the algebra of $n \times n$ complex matrices and let $\mathcal{A}\subseteq M_n$ be an arbitrary structural matrix algebra, i.e. a subalgebra of $M_n$ that contains all diagonal matrices. We consider injective maps $\phi :…

There exists a biderivation structure on the polynomial algebra $\mathscr{A}[n] = K[x_1,\dots,x_n],$ where $K$ is a field with $\operatorname{char}(K)\ne 2$, defined by $f \circ h = \sum_{i=1}^n \frac{\partial f}{\partial…

We show that lower bounds on the border rank of matrix multiplication can be used to non-trivially derandomize polynomial identity testing for small algebraic circuits. Letting $\underline{R}(n)$ denote the border rank of $n \times n \times…