Related papers: On the DJL conjecture for order 6

A square matrix $A$ is completely positive if $A=BB^T$, where $B$ is a (not necessarily square) nonnegative matrix. In general, a completely positive matrix may have many, even infinitely many, such CP factorizations. But in some cases a…

A $n$-by-$n$ matrix is called totally positive ($TP$) if all its minors are positive and $TP_k$ if all of its $k$-by-$k$ submatrices are $TP$. For an arbitrary totally positive matrix or $TP_k$ matrix, we investigate if the $r$th compound…

For a positive integer $N$, we define the N-rank of a non singular integer $d\times d$ matrix $A$ to be the maximum integer $r$ such that there exists a minor of order $r$ whose determinant is not divisible by $N$. Given a positive integer…

Watkins' conjecture asserts that the rank of an elliptic curve is upper bounded by the $2$-adic valuation of its modular degree. We show that this conjecture is satisfied when $E$ is any quadratic twist of an elliptic curve with rational…

Consider a matrix $A$ of rank $n$ that approximates the $N\times N$ identity matrix with elementwise error at most $1/3$. We give a lower bound on the number of elements s.t. $|A_{i,j}|>\gamma$, for a certain threshold. Two corollaries are…

Fitting a Candecomp/Parafac (CP) decomposition (also known as Canonical Polyadic decomposition) to a multi-way array or higher-order tensor, is equivalent to finding a best low-rank approximation to the multi-way array or higher-order…

Given an elliptic curve $E/\mathbb{Q}$, it is a conjecture of Goldfeld that asymptotically half of its quadratic twists will have rank zero and half will have rank one. Nevertheless, higher rank twists do occur: subject to the parity…

Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements…

We survey the history of Shelah's conjecture on strongly dependent fields, give an equivalent formulation in terms of a classification of strongly dependent fields and prove that the conjecture implies that every strongly dependent field…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Let $C_{m} : y^{2} = x^{3} - m^{2}x +p^{2}q^{2}$ be a family of elliptic curves over $\mathbb{Q}$, where $m$ is a positive integer and $p, q$ are distinct odd primes. We study the torsion part and the rank of $C_m(\mathbb{Q})$. More…

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…

We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most $k$. We show that this problem is $\NP$-hard for any fixed…

Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…

Given an $m\times n$ binary matrix $M$ with $|M|=p\cdot mn$ (where $|M|$ denotes the number of 1 entries), define the discrepancy of $M$ as $\mbox{disc}(M)=\displaystyle\max_{X\subset [m], Y\subset [n]}\big||M[X\times Y]|-p|X|\cdot…

A matrix is called totally positive if every minor of it is positive. Such matrices are well studied and have numerous applications in Mathematics and Computer Science. We study how many times the value of a minor can repeat in a totally…

This work studies the maximum possible sign rank of $N \times N$ sign matrices with a given VC dimension $d$. For $d=1$, this maximum is {three}. For $d=2$, this maximum is $\tilde{\Theta}(N^{1/2})$. For $d >2$, similar but slightly less…

Canonical polyadic decomposition (CPD) is at the core of fast matrix multiplication, a computational problem with widespread implications across several seemingly unrelated problems in computer science. Much recent progress in this field…

We prove that the PPT$^2$ conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Many salient examples, like the Choi-type maps, depolarizing maps, dephasing maps,…

Let $M$ be the moduli space of rank $2$ stable bundles with fixed determinant of degree $1$ on a smooth projective curve $C$ of genus $g\ge 2$. When $C$ is generic, we show that any elliptic curve on $M$ has degree (respect to…