加载中…
We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression’s common difference. For quadratic forms, this improves significantly upon an earlier result of Dey and Thangadurai.

生成讲解博客的中文版本

生成AI智能校验的中文版本