Representation of integers by cyclotomic binary forms
DOI10.4064/AA171012-24-12zbMATH Open1417.11028arXiv1712.09019OpenAlexW2964146456MaRDI QIDQ4581952FDOQ4581952
Authors: Étienne Fouvry, Claude Levesque, Michel Waldschmidt
Publication date: 21 August 2018
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.09019
Recommendations
- On the representation of integers by cyclotomic forms with large degree
- On the representation of integers as linear combinations of consecutive values of a polynomial
- On the representation of integers by binary forms
- On the representation of integers by binary forms defined by means of the relation \((x + yi)^n= R_n(x,y) + J_n(x,y)i\)
- On totally reducible binary forms. I
cyclotomic polynomialsfamilies of Diophantine equationsEuler's totient functionrepresentation of integers by binary formscyclotomic binary formsThue Diophantine equations
Cites Work
Cited In (8)
- Representation of integers by sparse binary forms
- On the representation of integers as linear combinations of consecutive values of a polynomial
- Fast multi-precision computation of some Euler products
- Binary cyclotomic polynomials: representation via words and algorithms
- Sur la représentation des entiers par des formes cyclotomiques de grand degré
- Representing integers in the binary number system as permanents of certain matrices
- The number of rationals determined by large sets of sifted integers
- Thue Diophantine Equations
Uses Software
This page was built for publication: Representation of integers by cyclotomic binary forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581952)