Related papers: Lattice points in rotated convex domains

We study the lattice point problem associated with a special class of high-dimensional finite type domains via estimating the Fourier transforms of corresponding indicator functions.

We consider the lattice point problem corresponding to a family of elliptic paraboloids in $\mathbb{R}^d$ with $d\ge3$ and we prove the expected to be optimal exponent, improving previous results. This is especially noticeable for $d=3$…

In a previous article it was shown that when a three-dimensional smooth convex body has rotational symmetry around a coordinate axis one can find better bounds for the lattice point discrepancy than what is known for more general convex…

We consider weighted p-Laplace type equations with homogeneous Neumann boundary conditions in convex domains, where the weight is a log-concave function which may degenerate at the boundary. In the case of bounded domains, we provide sharp…

We introduce a new integrable hierarchy of nonlinear differential-difference equations which is a subhierarchy of the 2D Toda lattice defined by imposing a constraint to the Lax operators of the latter. The 2D Toda lattice with the…

Let Q(u,v) be a positive definite binary quadratic form with arbitrary real coefficients. For large real x, one may ask for the number B(x) of primitive lattice points (integer points (m,n) with gcd(m,n) = 1) in the ellipse disc Q(u,v) < x,…

A commutative associative algebra A with an identity over the field of real numbers which has a basis, where all elements are invertible, is considered in the work. Moreover, among matrixes consisting of the structure constants of A, there…

We show how to solve computationally a combinatorial problem about the possible number of roots orthogonal to a vector of given length in $E_8$. We show that the moduli space of K3 surfaces with polarisation of degree 2d is also of general…

Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…

Given a domain $\Omega \subseteq \mathbb{R}^2$, let $\mathcal{D}(\Omega,x,R)$ be the number of lattice points from $\mathbb{Z}^2$ in $R\Omega-x$, for $R \ge 1$ and $x\in \mathbb{T}^2$, minus the area of $R\Omega$: $$\mathcal{D}(\Omega,x,R)…

Let $\delta_0(P,k)$ denote the degree $k$ dilation of a point set $P$ in the domain of plane geometric spanners. If $\Lambda$ is the infinite square lattice, it is shown that $1+\sqrt{2} \leq \delta_0(\Lambda,3) \leq (3+2\sqrt2) \, 5^{-1/2}…

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

In this manuscript we consider semilinear PDEs, with a convex nonlinearity, in a sector-like domain. Using cylindrical coordinates $(r, \theta, z)$, we investigate the shape of solutions whose derivative in $\theta$ vanishes at the…

In this paper, we prove that in bounded planar domains with $C^{2,\alpha}$ boundary, for almost every initial condition in the sense of the Lebesgue measure, the point vortex system has a global solution, meaning that there is no collision…

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 study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight t^m to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s…

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

We prove $L^p(b D)$-regularity of the Cauchy-Szeg\H o projection (also known as the Szeg\H o projection) for bounded domains $D\subset\mathbb C^n$ whose boundary satisfies the minimal regularity condition of class $C^2$, together with a…