相关论文: Lattice points on circles, squares in arithmetic p…

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…

We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…

The problem of finding the number of lattice points in a triangle has a classical solution if the lattice is $\mathbf{Z}^2$ and the vertices of the triangle have integer valued coordinates. We consider what happens when we replace the…

This paper provides estimates on the difference between the number of integer lattice points an a circle centered at the origin and the area. The estimates have the form "Big O" of the product of logarithm of the radius and the radius…

In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that…

We express the number of lattice points inside certain simplices via Dedekind-Rademacher sums. As an application, we prove a conjecture of Kronheimer and Mrowka in the special case of Brieskorn spheres (with at most 4 singular fibers). This…

A symmetrized lattice of $2n$ points in terms of an irrational real number $\alpha$ is considered in the unit square, as in the theorem of Davenport. If $\alpha$ is a quadratic irrational, the square of the $L^2$ discrepancy is found to be…

We investigate the average number of solutions of certain quadratic congruences. As an application, we establish Manin's conjecture for a cubic surface whose singularity type is A_5+A_1.

Let $D$ be a square-free integer. Under certain conditions on $D$, we characterize non-constant arithmetic progressions of squares over quadratic extensions of $\mathbb{Q}(\sqrt{D})$.

We prove that the number of rational points of bounded height on certain del Pezzo surfaces of degree 1 defined over Q grows linearly, as predicted by Manin's conjecture. Along the way, we investigate the average number of integral points…

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

This is a survey article on the Hardy-Littlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…

We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else…

We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of{a_n})_{n\ge 1}$ or the form $(\root{n+1}\of{a_{n+1}}/\root n\of{a_n})_{n\ge1}$, where $(a_n)_{n\ge 1}$ is a…

We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…

We revisit the so-called "Three Squares Lemma" by Crochemore and Rytter [Algorithmica 1995] and, using arguments based on Lyndon words, derive a more general variant which considers three overlapping squares which do not necessarily share a…