English
Related papers

Related papers: On indecomposable normal matrices in spaces with i…

200 papers

The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…

Algebraic Geometry · Mathematics 2026-04-27 Tamás Bencze

In this paper, we introduce restricted products for families of locally convex spaces and formulate criteria ensuring that mappings into such products are continuous or smooth. As a special case, can define restricted products of weighted…

Functional Analysis · Mathematics 2016-01-14 Boris Walter

There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a…

Number Theory · Mathematics 2019-01-07 Douglas Bowman , James Mc Laughlin

We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.

Combinatorics · Mathematics 2011-04-27 Peter J. Cameron , Christian Krattenthaler , Thomas W. Müller

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

Number Theory · Mathematics 2023-08-31 Xiao-Jie Zhu

This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…

Functional Analysis · Mathematics 2008-07-18 Anthony Weston

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

Computational Complexity · Computer Science 2017-04-24 Andrii Riazanov , Mikhail Vyalyiy

Given a linear category over a finite field such that the moduli space of its objects is a smooth Artin stack (and some additional conditions) we give formulas for an exponential sum over the set of absolutely indecomposable objects and a…

Algebraic Geometry · Mathematics 2016-12-07 Galyna Dobrovolska , Victor Ginzburg , Roman Travkin

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Representation Theory · Mathematics 2012-01-24 Yuriy A. Drozd , Eugene A. Kubichka

The product of a Hermitian matrix and a positive semidefinite matrix has only real eigenvalues. We present bounds for sums of eigenvalues of such a product.

Functional Analysis · Mathematics 2019-05-13 Bo-Yan Xi , Fuzhen Zhang

We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…

Combinatorics · Mathematics 2024-09-13 Shmuel Onn

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

We study containment and uniqueness problems concerning matrix convex sets. First, to what extent is a matrix convex set determined by its first level? Our results in this direction quantify the disparity between two product operations,…

Operator Algebras · Mathematics 2019-07-04 Benjamin Passer

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…

Combinatorics · Mathematics 2015-07-28 Lihua You , Yujie Shu , Pingzhi Yuan

We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…

Functional Analysis · Mathematics 2013-01-31 Jameson Cahill , Xuemei Chen

We give a canonical form for a complex matrix, whose square is normal, under transformations of unitary similarity as well as a canonical form for a real matrix, whose square is normal, under transformations of orthogonal similarity.

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

Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…

Functional Analysis · Mathematics 2011-02-10 Chi-Kwong Li , Nung-Sing Sze

For an (indefinite) scalar product $[x,y]_B = x^HBy$ for $B= \pm B^H \in Gl_n(\mathbb{C})$ on $\mathbb{C}^n \times \mathbb{C}^n$ we show that the set of diagonalizable matrices is dense in the set of all $B$-selfadjoint, $B$-skewadjoint,…

Rings and Algebras · Mathematics 2020-07-02 Ralph John de la Cruz , Philip Saltenberger

The set of badly approximable $m \times n $ matrices is known to have Hausdorff dimension $mn $. Each such matrix comes with its own approximation constant $c$, and one can ask for the dimension of the set of badly approximable matrices…

Number Theory · Mathematics 2015-10-12 Ryan Broderick , Dmitry Kleinbock