Related papers: Visibility of Lattice Points across Polynomials
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…
We confirm a conjecture of Monical, Tokcan and Yong on a characterization of the lattice points in the Newton polytopes of key polynomials.
In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the…
We look at the average sum of the Euler's phi function $\phi{(n)}$ and it's relation with the visibility of a point from the origin.We show that $\forall{\hspace{0.05in}{k} \ge{1}},k\in\mathbb{N},\exists$ a $k$$\times$$k$ grid in the 2D…
Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…
We consider maps on genus-$g$ surfaces with $n$ (labeled) faces of prescribed even degrees. It is known since work of Norbury that, if one disallows vertices of degree one, the enumeration of such maps is related to the counting of lattice…
Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge…
Call a curve $C \subset \mathbb{P}^2$ defined over $\mathbb{F}_q$ transverse-free if every line over $\mathbb{F}_q$ intersects $C$ at some closed point with multiplicity at least 2. In 2004, Poonen used a notion of density to treat Bertini…
In this paper we consider the curves $C_k^{(p,a)} : y^p-y=x^{p^k+1}+ax$ defined over $\mathbb F_p$ and give a positive answer to a conjecture about a divisibility condition on $L$-polynomials of the curves $C_k^{(p,a)}$. Our proof involves…
The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…
Given a family ${\mathcal F}$ of shapes in the plane, we study what is the lowest possible density of a point set $P$ that pierces (``intersects'', ``hits'') all translates of each shape in ${\mathcal F}$. For instance, if ${\mathcal F}$…
In 2021, Hibi et. al. studied lattice points in $\mathbb{N}^2$ that appear as $(\depth R/I,\dim R/I)$ when $I$ is the edge ideal of a graph on $n$ vertices, and showed these points lie between two convex polytopes. When restricting to the…
We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…
We say a lattice point $X=(x_1,\ldots,x_m)$ is visible from the origin, if $\gcd(x_1,...,x_m)=1$. In other word, there are no other lattice point on the line segment from the origin $O$ to $X$. From J.E. Nymann's result, we know that the…
Two constructions of lattice packings of $ n $-dimensional cross-polytopes ($ \ell_1 $ balls) are described, the density of which exceeds that of any prior construction by a factor of at least $ 2^{\frac{n}{\ln n}(1 + o(1))} $ when $ n \to…
We consider the question of when the L-polynomial of one curve divides the L-polynomial of another curve. A theorem of Tate gives an answer in terms of jacobians. We consider the question in terms of the curves. The last author gave an…
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
We provide a simple proof of the Lieb-Robinson bound and use it to prove the existence of the dynamics for interactions with polynomial decay. We then use our results to demonstrate that there is an upper bound on the rate at which…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…