On the number of solutions of a Diophantine equation with symmetric entries

DOI10.1016/J.JNT.2006.09.018zbMATH Open1135.11012OpenAlexW2086551468MaRDI QIDQ884530FDOQ884530

Moubariz Z. Garaev

Publication date: 6 June 2007

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2006.09.018

Recommendations

• Combinatorial complexity of convex sequences
• Sharpening an estimate of the size of the sumset of a convex set
• Higher convexity and iterated second moment estimates
• On cardinality of sumsets
• scientific article
• Convexity and sumsets
• scientific article; zbMATH DE number 3844050
• scientific article; zbMATH DE number 3991821
• Integer sets with distinct subset sums
• scientific article; zbMATH DE number 908521

zbMATH Keywords

convex sequences related to Diophantine equations

Mathematics Subject Classification ID

Counting solutions of Diophantine equations (11D45)

Cites Work

• On lower bounds for the \(L_1\)-norm of exponential sums
• Combinatorial complexity of convex sequences
• An estimate of the \(L_1\)-norm of an exponential sum
• Upper bounds for the number of solutions of a Diophantine equation

Cited In (3)

• Combinatorial complexity of convex sequences
• On Sumsets of Convex Sets
• On some matrix counting problems

This page was built for publication: On the number of solutions of a Diophantine equation with symmetric entries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884530)