Related papers: Fourier analytic techniques for lattice point disc…
Van der Corput's provides the sharp bound vol(C) \le m 2^d on the volume of a d-dimensional origin-symmetric convex body C that has 2m-1 points of the integer lattice in its interior. For m=1, a characterization of the equality case vol(C)=…
We discuss the derivation and the solutions of integro-differential equations (variable-order time-fractional diffusion equations) following as continuous limits for lattice continuous time random walk schemes with power-law waiting-time…
We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
We study an optimal stretching problem, which is a variant lattice point problem, for convex domains in $\mathbb{R}^d$ ($d\geq 2$) with smooth boundary of finite type that are symmetric with respect to each coordinate hyperplane/axis. We…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…
Fractional-order elliptic problems are investigated in case of inhomogeneous Dirichlet boundary data. The boundary integral form is proposed as a suitable mathematical model. The corresponding theory is completed by sharpening the mapping…
We are interested in finding sharp bounds for the Cheeger constant $h$ via different geometrical quantities, namely the area $|\cdot|$, the perimeter $P$, the inradius $r$, the circumradius $R$, the minimal width $\omega$ and the diameter…
Cut and project sets are obtained by taking an irrational slice of a lattice and projecting it to a lower dimensional subspace, and are fully characterised by the shape of the slice (window) and the choice of the lattice. In this context we…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
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.
The aim of this article is to study the attenuation of transient low-frequency waves in 2D lattices in both plane and antiplane problems. The main idea of this article is that analytical solutions to problems of mechanics of discrete…
The variance of the number of lattice points inside the dilated bounded set rD with random position in R^d has asymptotics r^(d-1) if the rotational quadratic average of the modulus of the Fourier transform of the set is O(r^(-d-1)). The…
The L_2-discrepancy measures the irregularity of the distribution of a finite point set. In this note we prove lower bounds for the L_2 discrepancy of arbitrary N-point sets. Our main focus is on the two-dimensional case. Asymptotic upper…
In this paper, the high-frequency diffraction of a plane wave incident along a planar boundary turning into a smooth convex contour, so that the curvature undergoes a jump, is asymptotically analysed. An approach modifying the Fock…
We prove an asymptotic formula for the number of integer points in a family of bounded domains in the Euclidean space with smooth boundary, which remain unchanged along some linear subspace and stretch out in the directions, orthogonal to…
An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational…