Related papers: Superregular matrices over small finite fields
Positive definite (p.d.) matrices arise naturally in many areas within mathematics and also feature extensively in scientific applications. In modern high-dimensional applications, a common approach to finding sparse positive definite…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
We prove a new lower bound on the field size of locally repairable codes (LRCs). Additionally, we construct maximally recoverable (MR) codes which are cyclic. While a known construction for MR codes has the same parameters, it produces…
We say that an indecomposable Cartan matrix A with entries in the ground field of characteristic 0 is almost affine if the Lie sub(super)algebra determined by it is not finite dimensional or affine but the Lie (super)algebra determined by…
Pivoting methods are of vital importance for linear programming, the simplex method being the by far most well-known. In this paper, a primal-dual pair of linear programs in canonical form is considered. We show that there exists a sequence…
In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matroid theory and the relation between MDS codes and uniform…
The paper is devoted to exact and asymptotic formulas for the determinants of Toeplitz matrices with perturbations by blocks of fixed size in the four corners. If the norms of the inverses of the unperturbed matrices remain bounded as the…
Many classical constructions, such as Plotkin's and Turyn's, were generalized by matrix product (MP) codes. Quasi-twisted (QT) codes, on the other hand, form an algebraically rich structure class that contains many codes with best-known…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
In this paper we are concerned with hyponormality and subnormality of block Toeplitz operators acting on the vector-valued Hardy space $H^2_{\mathbb{C}^n}$ of the unit circle. Firstly, we establish a tractable and explicit criterion on the…
We propose a numerical method based on the master field for large-$N$ reduced matrix models. While the master field is originally an infinite-dimensional matrix, in this method it is regularized to a finite dimension, with the requirement…
The maximal commutative subalgebras containing only Toeplitz matrices have been identified as generalized circulants. A similar simple description cannot be obtained for block Toeplitz matrices. We introduce and investigate certain families…
The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits.…
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…
A recent line of work has shown that an overparametrized neural network can perfectly fit the training data, an otherwise often intractable nonconvex optimization problem. For (fully-connected) shallow networks, in the best case scenario,…
A vector-circulant matrix is a natural generalization of the classical circulant matrix and has applications in constructing additive codes. This article formulates the concept of a vector-circulant matrix over finite fields and gives an…
A super-conformal map and a minimal surface are factored into a product of two maps by modeling the Euclidean four-space and the complex Euclidean plane on the set of all quaternions. One of these two maps is a holomorphic map or a…
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $n$ and a prime power $q$. Based on Pascal's triangle we give an…
Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…