Polynomial values of surface point counting polynomials

2020 ◽  
pp. 1-18
Author(s):  
L. Hajdu ◽  
O. Herendi
Keyword(s):  
Lattice Point ◽  
Lattice Points ◽  
Surface Point ◽  
Point Counting ◽  
Dimensional Cube

There are many results in the literature concerning power values, equal values or more generally, polynomial values of lattice point counting polynomials. In this paper, we prove various finiteness results for polynomial values of polynomials counting the lattice points on the surface of an [Formula: see text]-dimensional cube, pyramid and simplex.

scholarly journals Uniform distribution and lattice point counting

1992 ◽  
Vol 53 (1) ◽  
pp. 39-50 ◽  
Author(s):  
G. R. Everest
Keyword(s):  
Asymptotic Formula ◽  
Uniform Distribution ◽  
Lattice Point ◽  
Lattice Points ◽  
Analytic Method ◽  
Point Counting

AbstractA well-known theorem of Hardy and Littlewood gives a three-term asymptotic formula, counting the lattice points inside an expanding, right triangle. In this paper a generalisation of their theorem is presented. Also an analytic method is developed which enables one to interpret the coefficients in the formula. These methods are combined to give a generalisation of a “heightcounting” formula of Györy and Pethö which itself was a generalisation of a theorem of Lang.

On Non-standard Hilbert Functions

2018 ◽  
Vol 25 (01) ◽  
pp. 71-80
Author(s):  
Amir Bagheri ◽  
Rahim Rahmati-Asghar
Keyword(s):  
Polynomial Ring ◽  
Lattice Point ◽  
Hilbert Function ◽  
Lattice Points ◽  
Hilbert Functions ◽  
Point Counting ◽  
Finitely Generated

Let [Formula: see text] be a non-standard polynomial ring over a field k and let M be a finitely generated graded S-module. In this paper, we investigate the behaviour of Hilbert function of M and its relations with lattice point counting. More precisely, by using combinatorial tools, we prove that there exists a polytope such that the image of Hilbert function in some degree is equal to the number of lattice points of this polytope.

scholarly journals Bounds on the Lattice Point Enumerator via Slices and Projections

2021 ◽  
Author(s):  
Ansgar Freyer ◽  
Martin Henk
Keyword(s):  
Convex Body ◽  
Lattice Point ◽  
Geometric Mean ◽  
Discrete Analogue ◽  
Lattice Points ◽  
General Context ◽  
General Bound

AbstractGardner et al. posed the problem to find a discrete analogue of Meyer’s inequality bounding from below the volume of a convex body by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated by this problem, for which we provide a first general bound, we study in a more general context the question of bounding the number of lattice points of a convex body in terms of slices, as well as projections.

On Representation of Integers from Thin Subgroups of SL(2, ℤ) with Parabolics

2018 ◽  
Vol 2020 (18) ◽  
pp. 5611-5629 ◽  
Author(s):  
Xin Zhang
Keyword(s):  
Critical Exponent ◽  
Lattice Point ◽  
Fuchsian Group ◽  
Spectral Gap ◽  
Circle Method ◽  
Inner Product ◽  
Point Counting ◽  
Finitely Generated ◽  
Exceptional Set ◽  
Representation Of Integers

Abstract Let $\Lambda <SL(2,\mathbb{Z})$ be a finitely generated, nonelementary Fuchsian group of the 2nd kind, and $\mathbf{v},\mathbf{w}$ be two primitive vectors in $\mathbb{Z}^2\!-\!\mathbf{0}$. We consider the set $\mathcal{S}\!=\!\{\left \langle \mathbf{v}\gamma ,\mathbf{w}\right \rangle _{\mathbb{R}^2}\!:\!\gamma\! \in\! \Lambda \}$, where $\left \langle \cdot ,\cdot \right \rangle _{\mathbb{R}^2}$ is the standard inner product in $\mathbb{R}^2$. Using Hardy–Littlewood circle method and some infinite co-volume lattice point counting techniques developed by Bourgain, Kontorovich, and Sarnak, together with Gamburd’s 5/6 spectral gap, we show that if $\Lambda $ has parabolic elements, and the critical exponent $\delta $ of $\Lambda $ exceeds 0.998317, then a density-one subset of all admissible integers (i.e., integers passing all local obstructions) are actually in $\mathcal{S}$, with a power savings on the size of the exceptional set (i.e., the set of admissible integers failing to appear in $\mathcal{S}$). This supplements a result of Bourgain–Kontorovich, which proves a density-one statement for the case when $\Lambda $ is free, finitely generated, has no parabolics, and has critical exponent $\delta>0.999950$.

Two classical lattice point problems

1961 ◽  
Vol 57 (4) ◽  
pp. 699-721 ◽  
Author(s):  
K. S. Gangadharan ◽  
A. E. Ingham
Keyword(s):  
Lattice Point ◽  
Error Term ◽  
Divisor Problem ◽  
Lattice Points ◽  
Classical Lattice ◽  
Rectangular Hyperbola ◽  
Number Of Divisors ◽  
Image Position ◽  
Euler's Constant ◽  
Lattice Point Problems

Let r(n) be the number of representations of n as a sum of two squares, d(n) the number of divisors of n, andwhere γ is Euler's constant. Then P(x) is the error term in the problem of the lattice points of the circle, and Δ(x) the error term in Dirichlet's divisor problem, or the problem of the lattice points of the rectangular hyperbola.

Theoretical Investigation of Alloy Phase Equilibria by Continuous Displacement Cluster Variation Method

2011 ◽  
Vol 172-174 ◽  
pp. 1119-1127
Author(s):  
Tetsuo Mohri
Keyword(s):  
Phase Equilibria ◽  
Lattice Point ◽  
Cluster Variation Method ◽  
Lattice Points ◽  
Variation Method ◽  
Bravais Lattice ◽  
Diffuse Intensity ◽  
Wide Range ◽  
Cluster Variation ◽  
Continuous Displacement

Continuous Displacement Cluster Variation Method is employed to study binary phase equilibria on the two dimensional square lattice with Lennard-Jones type pair potentials. It is confirmed that the transition temperature decreases significantly as compared with the one obtained by conventional Cluster Variation Method. This is ascribed to the distribution of atomic pairs in a wide range of atomic distance, which enables the system to attain the lower free energy. The spatial distribution of atomic species around a Bravais lattice point is visualized. Although the average position of an atom is centred at the Bravais lattice point, the maximum pair probability is not necessarily attained for the pairs located at the neighboring Bravais lattice points. In addition to the real space information, k-space information are calculated in the present study. Among them, the diffuse intensity spectra due to short range ordering and atomic displacement are discussed.

scholarly journals On the maximal circumradius of a planar convex set containing one lattice point

1995 ◽  
Vol 52 (1) ◽  
pp. 137-151 ◽  
Author(s):  
Poh W. Awyong ◽  
Paul R. Scott
Keyword(s):  
Lattice Point ◽  
Convex Set ◽  
Compact Convex ◽  
Lattice Points ◽  
Compact Convex Set ◽  
Planar Convex

We obtain a result about the maximal circumradius of a planar compact convex set having circumcentre O and containing no non-zero lattice points in its interior. In addition, we show that under certain conditions, the set with maximal circumradius is a triangle with an edge containing two lattice points.

scholarly journals Effective lattice point counting in rational convex polytopes

2004 ◽  
Vol 38 (4) ◽  
pp. 1273-1302 ◽  
Author(s):  
Jesús A. De Loera ◽  
Raymond Hemmecke ◽  
Jeremiah Tauzer ◽  
Ruriko Yoshida
Keyword(s):  
Lattice Point ◽  
Convex Polytopes ◽  
Point Counting

scholarly journals Partial structure factors derived from coarse-grained phase-separation dynamics on a disordered lattice with density fluctuations

2021 ◽  
Author(s):  
Puwadet Sutipanya ◽  
Takashi Arai
Keyword(s):  
Phase Separation ◽  
Structure Factor ◽  
Lattice Point ◽  
Local Density ◽  
Lattice Points ◽  
Concentration Fluctuations ◽  
Coarse Grained ◽  
Partial Structure ◽  
Disordered Lattice ◽  
Structure Factors

Abstract The simplest and most time-efficient phase-separation dynamics simulations are carried out on a disordered lattice to calculate the partial structure factors of coarse-grained A-B binary mixtures. The typical coarse-grained phase-separation models use regular lattices and can describe the local concentrations but cannot describe both local density and concentration fluctuations. To introduce fluctuation for local density in the model, the particle positions from a hard sphere fluid model are determined as disordered lattice points for the model. Then we place the local order parameter as the difference of the concentrations of A and B components on each lattice point. The concentration at each lattice point is time-evolved by discrete equations derived from the Cahn-Hilliard equation. From both fluctuations, Bhatia and Thornton’s structure factor can be accurately calculated. The structure factor for concentration fluctuations at the large wavenumber region gives us the correct mean concentrations of the components. Using the mean concentrations, partial structure factors can be converted from three of Bhatia and Thornton’s structure factors. The present model and procedures can provide a means of analysing the structural properties of many materials that exhibit complex morphological changes.

Sign in / Sign up

Export Citation Format

Share Document