Related papers: Eigenvalue Bounds for Sum-Rank-Metric Codes

We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…

Sum-rank-metric codes have wide applications in the multishot network coding and the distributed storage. Linearized Reed-Solomon codes, sum-rank BCH codes and their Welch-Berlekamp type decoding algorithms were proposed and studied. They…

In this paper we give a randomized reduction for the Rank Syndrome Decoding problem and Rank Minimum Distance problem for rank codes. Our results are based on an embedding from linear codes equipped with Hamming distance unto linear codes…

We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of…

Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…

The study of parameter-dependent partial differential equations (parametric PDEs) with countably many parameters has been actively studied for the last few decades. In particular, it has been well known that a certain type of parametric…

Every sufficiently big matrix with small spectral norm has a nearby low-rank matrix if the distance is measured in the maximum norm (Udell & Townsend, SIAM J Math Data Sci, 2019). We use the Hanson--Wright inequality to improve the estimate…

We propose a technique for calculating and understanding the eigenvalue distribution of sums of random matrices from the known distribution of the summands. The exact problem is formidably hard. One extreme approximation to the true density…

Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…

This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…

We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios…

We study the structure of anticodes in the sum-rank metric for arbitrary fields and matrix blocks of arbitrary sizes. Our main result is a complete classification of optimal linear anticodes. We also compare the cardinality of the ball in…

We study generalized eigenvalue problems for meet and join matrices with respect to incidence functions on semilattices. We provide new bounds for generalized eigenvalues of meet matrices with respect to join matrices under very general…

We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…

We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…

We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…

We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the…

This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…

For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…