Related papers: On Minimally Non-Firm Binary Matrices

Let $M\stackrel\pi \arrow X$ be a principal elliptic fibration over a Kaehler base $X$. We assume that the Kaehler form on $X$ is lifted to an exact form on $M$ (such fibrations are called positive). Examples of these are regular Vaisman…

Let $X$ be a closed subscheme embedded in a scheme $W$ smooth over a field ${\bf k}$ of characteristic zero, and let ${\mathcal I}(X)$ be the sheaf of ideals defining $X$. Assume that the set of regular points of $X$ is dense in $X$. We…

We present algorithms for testing if a $(0,1)$-matrix $M$ has Boolean/binary rank at most $d$, or is $\epsilon$-far from Boolean/binary rank $d$ (i.e., at least an $\epsilon$-fraction of the entries in $M$ must be modified so that it has…

The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…

A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease along rows and columns when moving toward the diagonal. A…

We define marked sets and bases over a quasi-stable ideal $\mathfrak j$ in a polynomial ring on a Noetherian $K$-algebra, with $K$ a field of any characteristic. The involved polynomials may be non-homogeneous, but their degree is bounded…

The basis number of a graph $G$ is the minimum $k$ such that the cycle space of $G$ is generated by a family of cycles using each edge at most $k$ times. A classical result of Mac Lane states that planar graphs are exactly graphs with basis…

Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…

Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general…

A signed graph is a pair $(G,\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V=\{1,\ldots,n\}$ and $\Sigma\subseteq E$. The edges in $\Sigma$ are called odd and the other edges of $E$…

We show that if $M^n$ is a properly immersed, two-sided, stable minimal hypersurface in $B^{n+1}_1(0)\setminus S$, where $S$ is closed with $\mathcal{H}^{n-2}(S)=0$, then $\text{dim}_{\mathcal{H}}\text{sing}(M)\leq n-7$, namely…

For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some…

The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity / minimum rank of the family of symmetric matrices described by G. It is shown that for a…

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

We investigate structural properties of the binary rank of Kronecker powers of binary matrices, equivalently, the biclique partition numbers of the corresponding bipartite graphs. To this end, we engineer a Column Generation approach to…

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…

The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory.…

Conformal dimension of a metric space $X$, denoted by $\dim_C X$, is the infimum of the Hausdorff dimension among all its quasisymmetric images. If conformal dimension of $X$ is equal to its Hausdorff dimension, $X$ is said to be minimal…

K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive…

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…