query: If all minors are $0$, then rank is at most $n-2$
positive_passages.docid: 20922
positive_passages.text: If all minors are $0$, the rank is at most $n-2$
negative_passages.docid: 3599
negative_passages.text: show that if ${a_n} \to a$, and $a>0$, then $\exists N$ such that $a_n>0$ for $n \ge N$.
negative_passages.docid: 47290
negative_passages.text: Sum of principal minors
negative_passages.docid: 144017
negative_passages.text: How to find the smallest $n$ such that $n^a\equiv 1 \pmod p$
negative_passages.docid: 77192
negative_passages.text: How to prove $\text{Rank}(AB)\leq \min(\text{Rank}(A), \text{Rank}(B))$?
negative_passages.docid: 148376
negative_passages.text: Proving that a Binary Tree of $n$ nodes has a height of at least $\log(n)$.
negative_passages.docid: 67291
negative_passages.text: Prove that there exists $n\in\mathbb{N}$ such that $f^{(n)}$ has at least n+1 zeros on $(-1,1)$
negative_passages.docid: 94406
negative_passages.text: Degree of minimum polynomial at most $n$ without Cayley-Hamilton?
negative_passages.docid: 81884
negative_passages.text: Minimal sufficient statistic of $\operatorname{Uniform}(-\theta,\theta)$
negative_passages.docid: 50019
negative_passages.text: Prove $0$ is a partial limit of $a_n$
negative_passages.docid: 148819
negative_passages.text: every rank 2 oriented matroid is realizable
negative_passages.docid: 46572
negative_passages.text: Degree of a splitting field is no greater than $n!$
negative_passages.docid: 3327
negative_passages.text: Height and minimal number of generators of an ideal
negative_passages.docid: 120558
negative_passages.text: If $H$ has maximum vertex degree at most $3$ and is a minor of $G$, then $H$ is a topological minor of $G$.
negative_passages.docid: 96620
negative_passages.text: Condition on degrees for existence of a tree
negative_passages.docid: 10585
negative_passages.text: Does a polynomial that's bounded below have a global minimum?
negative_passages.docid: 104509
negative_passages.text: The center of $A_n$ is trivial for $n \geq 4$