Related papers: Superregular Matrices and the Construction of Conv…
It is well known that square matrices with independent and identically distributed (iid) random entries are typically well conditioned. A natural question is whether this favorable behavior persists for random matrices whose entries obey…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case of MDS codes we use our new approach to…
This paper proposes several novel optimization algorithms for minimizing a nonlinear objective function. The algorithms are enlightened by the optimal state trajectory of an optimal control problem closely related to the minimized objective…
In this paper, we establish the sharp bounds of certain Toeplitz determinants formed over the coefficients of mappings from a class defined on the unit ball of complex Banach space and on the unit polydisc in $\mathbb{C}^n$. Derived bounds…
Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…
We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $1$. Even more, we consider Toeplitz matrices of this kind. Many…
In $2014$, Gupta and Ray proved that the circulant involutory matrices over the finite field $\mathbb{F}_{2^m}$ can not be maximum distance separable (MDS). This non-existence also extends to circulant orthogonal matrices of order $2^d…
Totally positive matrices are related with the shape preserving representations of a space of functions. The normalized B-basis of the space has optimal shape preserving properties. B-splines and rational Bernstein bases are examples of…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
Isolated hypersurface singularities come equipped with distinguished bases of their Milnor lattices and with upper triangular integral matrices, which are called here distinguished matrices. These matrices form an orbit of a braid group and…
We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…
Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose…
In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is…
In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…
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…
We present a sublinear query algorithm for outputting a near-optimal low-rank approximation to any positive semidefinite Toeplitz matrix $T \in \mathbb{R}^{d \times d}$. In particular, for any integer rank $k \leq d$ and $\epsilon,\delta >…
The combined matrix is a very useful concept for many applications. Almost strictly sign regular (ASSR) matrices form an important structured class of matrices with two possible zero patterns, which are either type-I staircase or type-II…
Pseudospectral analysis is fundamental for quantifying the sensitivity and transient behavior of nonnormal matrices, yet its computational cost scales cubically with dimension, rendering it prohibitive for large-scale systems. While…
The Pl\"{u}cker coordinate description of subspaces has been recently discussed in the context of constant dimension subspace codes for random networks, as well as the Schubert cell description of certain code parameters. In this paper this…