2021
DOI: 10.48550/arxiv.2110.06496
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Two-variable polynomials with dynamical Mahler measure zero

Abstract: We discuss several aspects of the dynamical Mahler measure for multivariate polynomials. We prove a weak dynamical version of Boyd-Lawton formula and we characterize the polynomials with integer coefficients having dynamical Mahler measure zero both for the case of one variable (Kronecker's lemma) and for the case of two variables, under the assumption that the dynamical version of Lehmer's question is true.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…However, if no explicit estimates of the constants are needed, our method with Dimitrov-Habegger's bound readily gives an exponent 1 2(k−1) in Theorem 4.1, as discussed in Remark 4.15. The quality of this last exponent in the bound (14) is better than the one obtained in [20,Theorem A.1] for m = 1, noting that the authors explicitly remark that they do not strive to get optimal exponent. The crucial property of the bound provided by (27) is that the constants involved remain bounded if we replace P by P A , for any matrix A ∈ Z m×n .…”
Section: Lemma 46 (Dobrowolski) For Any Laurent Polynomial P ∈ C[z ±1mentioning
confidence: 77%
“…However, if no explicit estimates of the constants are needed, our method with Dimitrov-Habegger's bound readily gives an exponent 1 2(k−1) in Theorem 4.1, as discussed in Remark 4.15. The quality of this last exponent in the bound (14) is better than the one obtained in [20,Theorem A.1] for m = 1, noting that the authors explicitly remark that they do not strive to get optimal exponent. The crucial property of the bound provided by (27) is that the constants involved remain bounded if we replace P by P A , for any matrix A ∈ Z m×n .…”
Section: Lemma 46 (Dobrowolski) For Any Laurent Polynomial P ∈ C[z ±1mentioning
confidence: 77%