Math-4132 · mathematics · Graph theory

Math-4132

Conjecture 4.21

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Shared notation.
$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.

Let $\Gamma\subset(\overline{\mathbb Q}\cap\mathbb R_{>0})^n$ be a finitely generated multiplicative subgroup dense in $(\mathbb R_{>0})^n$. Fix generators $\gamma_j=(\gamma_{1j},\ldots,\gamma_{nj})$, $1\le j\le m$. For $s\in\mathbb Z^m$ put $\gamma_i(s)=\prod_{j=1}^m\gamma_{ij}^{s_j}$ and $|s|_\infty=\max_j|s_j|$. Fix a compact neighborhood $\mathcal K$ of $(1,\ldots,1)$ in $(\mathbb R_{>0})^n$.

Statement recorded in the supplied source.
For every $\varepsilon>0$, does there exist $S_0>0$, depending only on $\varepsilon$, the fixed generators and $\mathcal K$, such that, for every real $S\ge S_0$ and every $\zeta=(\zeta_1,\ldots,\zeta_n)\in\mathcal K$, there is $s\in\mathbb Z^m$ with \[ |s|_\infty\le S,\qquad \max_{1\le i\le n}|\gamma_i(s)-\zeta_i|\le S^{-1-1/n+\varepsilon}? \] [S2]

Short English statement

Does the dense algebraic multiplicative subgroup approximate every target in a fixed compact neighborhood with bounded generator exponents and the stated uniform error rate?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.