Related papers: Fourier analytic techniques for lattice point disc…
We estimate the lattice sums arising in the context of the integer point counting in polyhedra.
Space and time discretizations of parabolic differential equations with dynamic boundary conditions are studied in a weak formulation that fits into the standard abstract formulation of parabolic problems, just that the usual L^2(\Omega)…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
In the article the Fourier series analytical solutions of uniformly loaded rectangular thin plates with symmetrical boundary conditions are considered. For all the cases the numerical values are tabulated.
In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…
We study sharp frame bounds of Gabor systems over rectangular lattices for different windows and integer oversampling rate. In some cases we obtain optimality results for the square lattice, while in other cases the lattices optimizing the…
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…
The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…
In this paper, we propose the Fourier Discrepancy Function, a new discrepancy to compare discrete probability measures. We show that this discrepancy takes into account the geometry of the underlying space. We prove that the Fourier…
Our goal is to identify the type and number of static equilibrium points of solids arising from fine, equidistant $n$-discretrizations of smooth, convex surfaces. We assume uniform gravity and a frictionless, horizontal, planar support. We…
Consider a convex body $C \subset \mathbb{R}^d$. Let $X$ be a random point with uniform distribution in $[0,1]^d$. Consider the value $X_C$ equal to the number of lattice points $\mathbb Z^d$ inside the body $C$ shifted by $X$. It is well…
Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…
We establish upper and lower bounds for the number of integral points which lie within a neighbourhood of a smooth nondegenerate curve in $\mathbb{R}^n$ for $n\geq 3$. These estimates are new for $n\geq 4$, and we recover an earlier result…
We study the error of the number of points of a unimodular lattice that fall in a strictly convex and analytic set having the origin and that is dilated by a factor $t$. The aim is to generalize the result of a previous article. We first…
We give a survey of work on the number of vertices of the convex hull of integer points defined by the system of linear inequalities. Also, we present our improvement of some of these.
The problem of imaging of a moving target is formulated as a Coefficient Inverse Problem for a hyperbolic equation with its coefficient depending on all three spatial variables and time. As the initial condition, the point source running…
For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…
Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…
Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…