Related papers: Condition for the higher rank numerical range to b…

Let $X$ be a non-singular algebraic curve of genus $g$. We prove that the Brill-Noether locus $\bns $ is non-empty if $d= nd' +d'' $ with $0< d'' <2n$, $1\le s\le g$, $d'\geq (s-1)(s+g)/s $, $n\leq d''+(n-k)g$, $(d'',k)\ne(n,n)$. These…

A projective manifold is algebraically hyperbolic if the degree of any curve is bounded from above by its genus times a constant, which is independent from the curve. This is a property which follows from Kobayashi hyperbolicity. We prove…

Let {a_s(mod n_s)}_{s=1}^k (k>1) be a finite system of residue classes with the moduli n_1,...,n_k distinct. By means of algebraic integers we show that the range of the covering function w(x)=|{1\le s\le k: x=a_s (mod n_s)}| is not…

A randomized algorithm for computing a compressed representation of a given rank-structured matrix $A \in \mathbb{R}^{N\times N}$ is presented. The algorithm interacts with $A$ only through its action on vectors. Specifically, it draws two…

The nonnegative integer rank of a matrix is a variant of the classical nonnegative rank, introduced in the 1980s, where factorizations are required to have integer entries. While computing nonnegative integer rank is generally very hard, we…

Let $F_n$ be a free group of finite rank $n \geq 2$. We prove that if $H$ is a subgroup of $F_n$ with $\textrm{rk}(H)=2$ and $R$ is a retract of $F_n$, then $H \cap R$ is a retract of $H$. However, for every $m \geq 3$ and every $1 \leq k…

We prove that if any $\lfloor3d/2 \rfloor$ or fewer elements of a finite family of linear operators $\mathbb K^d\to \mathbb K^d$ ($\mathbb K$ is an arbitrary field) have a common eigenvector then all operators in the family have a common…

Matrix completion is about recovering a matrix from its partial revealed entries, and it can often be achieved by exploiting the inherent simplicity or low dimensional structure of the target matrix. For instance, a typical notion of matrix…

A simplicial complex K is called d-representable if it is the nerve of a collection of convex sets in R^d; K is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at most d-1 that is contained…

We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…

An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. In 1972, Erd\H{o}s conjectured that every Hamiltonian graph with…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

We address the detection of a low rank $n\times n$deterministic matrix $\mathbf{X}_{0}$ from the noisy observation ${\bf X}_{0}+{\bf Z}$ when $n\to\infty$, where ${\bf Z}$ is a complex Gaussian random matrix with independent identically…

We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…

A connected Cayley graph for an Abelian group generated by a finite symmetric subset $S$ can be represented by an integer matrix, its Heuberger matrix. We call the number of columns of that matrix its rank and the number of rows its…

It is conjectured that Hadamard matrices exist for all orders $4t$ ($t>0$). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural…

We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations. In this case the original matrix is possibly…

For $\alpha > 0$ we consider the operator $K_\alpha \colon \ell^2 \to \ell^2$ corresponding to the matrix \[\left(\frac{(nm)^{-\frac{1}{2}+\alpha}}{[\max(n,m)]^{2\alpha}}\right)_{n,m=1}^\infty.\] By interpreting $K_\alpha$ as the inverse of…

A set of vertices is $k$-sparse if it induces a graph with a maximum degree of at most $k$. In this missive, we consider the order of the largest $k$-sparse set in a triangle-free graph of fixed order. We show, for example, that every…

We study Helson matrices (also known as multiplicative Hankel matrices), i.e. infinite matrices of the form $M(\alpha) = \{\alpha(nm)\}_{n,m=1}^\infty$, where $\alpha$ is a sequence of complex numbers. Helson matrices are considered as…