Skip to main content
Bumped by Community user
added 22 characters in body
Source Link
Federico Poloni
  • 20.2k
  • 2
  • 82
  • 120

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{i} \geq 0$ for all $i=1,\dots,j$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a “non-trivial” upper bound for $\delta_{j}$.

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{i} \geq 0$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a “non-trivial” upper bound for $\delta_{j}$.

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{i} \geq 0$ for all $i=1,\dots,j$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a “non-trivial” upper bound for $\delta_{j}$.

edited body
Source Link

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{j} \geq 0$$x_{i} \geq 0$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a “non-trivial” upper bound for $\delta_{j}$.

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{j} \geq 0$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a “non-trivial” upper bound for $\delta_{j}$.

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{i} \geq 0$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a “non-trivial” upper bound for $\delta_{j}$.

Bumped by Community user
Bumped by Community user
TeX -> Unicode quotes
Source Link
LSpice
  • 12.9k
  • 4
  • 45
  • 69

``Smallest'' “Smallest” non-zero linear combination of vectors to obtain a non-negative vector

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{j} \geq 0$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a ``non“non-trivial''trivial” upper bound for $\delta_{j}$.

``Smallest'' non-zero linear combination of vectors to obtain a non-negative vector

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{j} \geq 0$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a ``non-trivial'' upper bound for $\delta_{j}$.

“Smallest” non-zero linear combination of vectors to obtain a non-negative vector

We say that a vector $\mathbf{x}$ in $\mathbb{Z}^j$ is non-negative if it is of the form \begin{bmatrix} x_1 \\ x_2 \\ \vdots \\ x_j \\ \end{bmatrix}

where $x_{j} \geq 0$.

Suppose that $A$ is a $j \times j$ integer valued matrix with entries in the interval $[-n,n]$. What is the smallest possible value of $\delta_{j} \geq 0$ so that if $\varepsilon > 0$ then there exists an integer valued vector $\mathbf{x}_{A} \neq \mathbf{0}$ such that $A\cdot\mathbf{x}_{A}$ is non-negative, and $|\mathbf{x}_{A}| \leq C_{\epsilon}n^{\delta_{j} + \varepsilon}$ (here $C_{\epsilon}$ is a positive constant dependent only on $\varepsilon$)?

Note that we can find candidate values $\delta_{j} < \infty$, but I have not proved that here. I mainly seek a “non-trivial” upper bound for $\delta_{j}$.

Source Link
Loading