Related papers: Visibility of Lattice Points across Polynomials

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…

Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…

In multiagent systems, effective coordination, coverage, and communication often rely on the concept of visibility between agents or nodes within the system. Graph-theoretically, for any subset $X$ of vertices of a graph $G$, two vertices…

The existence of a finite global attractor for polynomial curve system has been known since the work of Belk et al. [4]. However, except in the hyperbolic case, the rate at which the pullback of a curve under a polynomial converges to the…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

We define and count lattice points in the moduli space of stable genus g curves with n labeled points. This extends a construction of the second author for the uncompactified moduli space. The enumeration produces polynomials with top…

By studying the volume of a generalized difference body, this paper presents the first nontrivial lower bound for the lattice covering density by $n$-dimensional simplices.

We consider a square expanding with constant speed seen from an observer moving away with constant acceleration and study the distribution of angles between rays from the observer towards the lattice points in the square. We prove the…

Following Katz-Sarnak, Iwaniec-Luo-Sarnak, and Rubinstein, we use the 1- and 2-level densities to study the distribution of low lying zeros for one-parameter rational families of elliptic curves over Q(t). Modulo standard conjectures, for…

The direct linearization structure is presented of a "mild" but significant generalization of the lattice BSQ system. Some of the equations in this system were recently discovered in [J. Hietarinta, J. Phys {\bf A}: Math. Theor. {\bf 44}…

We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

Let $a,n \in \mathbb{Z}^+$, with $a<n$ and $\gcd(a,n)=1$. Let $P_{a,n}$ denote the lattice parallelogram spanned by $(1,0)$ and $(a,n)$, that is, $$P_{a,n} = \left\{ t_1(1,0)+ t_2(a,n) \, : \, 0\leq t_1,t_2 \leq 1 \right\}, $$ and let…

We prove some new degeneracy results for integral points and entire curves on surfaces; in particular, we provide the first example, to our knowledge, of a simply connected smooth variety whose sets of integral points are never…

We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…

We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem…

For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…