Related papers: Gauss Sphere Problem with Polynomials
If $P$ is a lattice polytope (that is, the convex hull of a finite set of lattice points in $\mathbf{R}^n$), then every sum of $h$ lattice points in $P$ is a lattice point in the $h$-fold sumset $hP$. However, a lattice point in the…
The Gauss Circle Problem concerns finding asymptotics for the number of lattice point lying inside a circle in terms of the radius of the circle. The heuristic that the number of points is very nearly the area of the circle is surprisingly…
We study comparison of Lp norms of polynomials on the sphere with respect to doubling measures. From our description it follows an uncertainty principle for square integrable functions on the sphere. We consider also weighted uniform…
We define certain natural finite sums of $n$'th roots of unity, called $G_P(n)$, that are associated to each convex integer polytope $P$, and which generalize the classical $1$-dimensional Gauss sum $G(n)$ defined over $\mathbb Z/ {n…
The Gauss circle problem concerns with the evaluation of $\sum_{n \leq x}r(n)$, where $r(n)$ denotes the number of representations of $n$ as sums of two squares and $x \geq 2$. Let $\Psi_G(x,y)$ denote the sum of $y$-smooth numbers below…
We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…
We consider orthogonal polynomials on the unit circle with respect to a weight which is a quotient of $q$-gamma functions. We show that the Verblunsky coefficients of these polynomials satisfy discrete Painlev\'e equations, in a Lax form,…
Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n$ having no zeros in the unit disk. ~Then it is well known that for $R\geq 1,$ $\displaystyle{\max_{|z|=R}|p(z)|}\leq…
In this survey article, we review some results and conjectures related to orthogonal polynomials on Cantor sets. The main purpose of this paper is to emphasize the role of equilibrium measures in order to have a general theory of…
In this paper, we define a homogeneous polynomial for a general hypergraph, and establish a remarkable connection between clique number and the homogeneous polynomial of a general hypergraph. For a general hypergraph, we explore some…
In this work, we give a formula for coefficients of orthogonal polynomials on the unit circle. By using this formula, a new and computable approach is provided for sum rules which applying to a spectral gem problem proposed by Barry Simon…
The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…
The paper concerns the uniform polynomial approximation of a function $f$, continuous on the unit Euclidean sphere of ${\mathbb R}^3$ and known only at a finite number of points that are somehow uniformly distributed on the sphere. First we…
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…
In this paper, we will describe the space spanned by the angle-sums of polytopes, recorded in the alpha-vector. We will consider the angles sums of simplices and the angles sums and face numbers of simplicial polytopes and general…
First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…
In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…
A general method to express in terms of Gauss sums the number of rational points of subschemes of projective schemes over finite fields is applied to the image of the triple embedding $\mathbb{P}^1\hookrightarrow\mathbb{P}^3$. As a…
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
Let $M=G/H$ be a compact connected isotropy irreducible Riemannian homogeneous manifold, where $G$ is a compact Lie group (may be, disconnected) acting on $M$ by isometries. This class includes all compact irreducible Riemannian symmetric…