Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 69 for “"lattice points"”.

  1. Hexagonal Lattice Points on Circles

    We study the hexagonal lattice $\mathbb{Z}[\omega]$, where $\omega^6=1$. More specifically, we study the angular distribution of hexagonal lattice points on circles with a fixed radius. We prove that the angles are equidistributed on average, and suggest the possibilty of constructing a consistent …

    chalmers Repository record for Hexagonal Lattice Points on Circles (opens in a new tab)

  2. Lattice Points Problems about the Paraboloid

    … error term when approximating the number of lattice points inside a dilating circle centered at the origin by its area, is a longstanding open question in number theory. One may as well ask similar questions for regions bounded by other conics such as hyperbola and parabola, or their higher …

    unr Repository record for Lattice Points Problems about the Paraboloid (opens in a new tab)

  3. Lattice points, oriented matroids, and zonotopes

    … concerns the following problem: Given a lattice in R^d which refines the integer lattice Z^d, what can be said about the distribution of the lattice points inside of the half-open unit cube [0,1)^d? This question is of interest in discrete geometry, especially integral polytopes and …

    gatech Repository record for Lattice points, oriented matroids, and zonotopes (opens in a new tab)

  4. Lattice points in disks and strongly convex domains

    … best bound for the error between the number of lattice points inside a disk and that disks area, otherwise known as the lattice point discrepancy. First we state some of the required definitions and properties from Fourier analysis that will be used throughout. In particular, we establish …

    unm Repository record for Lattice points in disks and strongly convex domains (opens in a new tab)

  5. Asymptotically optimal shapes for counting lattice points and eigenvalues

    … we aim to maximize the number of first-quadrant lattice points under a concave (or convex) curve with respect to reciprocal stretching in the coordinate directions. The optimal domain is shown to be asymptotically balanced, meaning that the optimal stretch factor approaches 1 as the ""radius"" …

    uiuc Repository record for Asymptotically optimal shapes for counting lattice points and eigenvalues (opens in a new tab)

  6. Mean Square Estimate for Primitive Lattice Points in Convex Planar Domains

    … ZxZ : m1^2 + m2^2 <= x }, the number of integer lattice points inside a circle of radius sqrt(x). Gauss showed that P(x) = N(x)- pi * x satisfi es P(x) = O(sqrt(x)). Later Hardy and Landau independently proved that P(x) = Omega_(x1=4(log x)1=4). It is conjectured that inf{e in R : P(x) = O(x^e …

    byu Repository record for Mean Square Estimate for Primitive Lattice Points in Convex Planar Domains (opens in a new tab) Download PDF for Mean Square Estimate for Primitive Lattice Points in Convex Planar Domains (opens in a new tab)

  7. Tilings with the neighborhood property and tiling lattice points with blocks

    We examine tilings of the plane (plane tilings) and of 3-space that have the neighborhood property (NEBP). If N(T), the neighborhood of T, is the set of all tiles that have a nonempty intersection with T, then a tiling has NEBP if for every tile T$\sb1$ there is a tile T$\sb2$ such that N(T$\sb1$) …

    nebraska Repository record for Tilings with the neighborhood property and tiling lattice points with blocks (opens in a new tab)

  8. Extreme Covering Systems, Primes Plus Squarefrees, and Lattice Points Close to a Helix

    … the maximum distance between any three distinct points in an affine lattice which are close to a helix with small curvature and torsion. This is a generalization of analogous results in two dimensions. In the final part, we prove that every positive integer n which is not equal to 1, 2, 3, 6, 11, …

    south-carolina Repository record for Extreme Covering Systems, Primes Plus Squarefrees, and Lattice Points Close to a Helix (opens in a new tab)

  9. Asymptotics of the number of lattice points in the transportation polytope via optimization on Lorentzian polynomials.

    We formally extend the theory of polynomial capacity to power series and totally uni- modular matrices. Using these results, we prove the log-asymptotic correctness of bounds by Brändén, Leake, and Pak developed through the use of Lorentzian polynomials ([BLP23]) under certain conditions, and …

    waterloo Repository record for Asymptotics of the number of lattice points in the transportation polytope via optimization on Lorentzian polynomials. (opens in a new tab)

  10. Visibility of lattice points in high dimensional spaces and extreme values of combinations of Dirichlet L-functions

    … study questions concerning the distribution of lattice points in dimensions two and higher. We give asymptotic formulas for the number of integer lattice points of fixed index visible from certain admissible sets. We also study the shape of the body $PA_1, \dots, PA_k$ when the lattice points …

    uiuc Repository record for Visibility of lattice points in high dimensional spaces and extreme values of combinations of Dirichlet L-functions (opens in a new tab)

  11. On Face Vector Sets and on Alcoved Polytopes

    … we develop the concept of semi-algebraic sets of lattice points. This concept gives us a way of describing the “complexity” of the sets of f-vectors. We consider a number of different f-vector sets and find that these can for the most part be described as the set of all lattice points in a …

    fu-berlin Repository record for On Face Vector Sets and on Alcoved Polytopes (opens in a new tab)

  12. INDEX MAPPING FOR ROBUST MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZER

    … the construction of robust multiple description lattice vector quantizers (MDLVQ) by addressing the problem of designing an index mapping able to combat bit errors. We consider the scenario when the first description is received correctly at the decoder while the second one may carry bit errors. …

    mcmaster Repository record for INDEX MAPPING FOR ROBUST MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZER (opens in a new tab)

  13. Weyl formula improvement for product of Zoll manifolds

    … study of the distribution of weighted integer lattice points. In this paper, we show that we can extend this result to the case of Cartesian product of Zoll manifolds by investigating the eigenvalue clusters of Zoll manifold and reducing the problem to the study of the distribution of weighted …

    jhu Repository record for Weyl formula improvement for product of Zoll manifolds (opens in a new tab)

  14. An Extremal Property of the Square Lattice

    … \cite{extremal} on the hexagonal lattice $\Lambda$, we demonstrate that the square lattice $\Z^2$ exhibits the same local extremal property as $\Lambda$, where distances of lattice points from the barycenters of natural fundamental domains increase under perturbation. These two …

    washington Repository record for An Extremal Property of the Square Lattice (opens in a new tab)

  15. 3-simetriški daugiakampiai heksagoninės gardelės trikampiame poaibyje /

    … within a triangular subset of a hexagonal lattice. The polygons are constructed by connecting lattice points with edges while forbidding 180° angles between consecutive edges. To search for solutions, an intermediate-point (“skeleton”) method was developed and optimized. Using this method, …

    vilnius Repository record for 3-simetriški daugiakampiai heksagoninės gardelės trikampiame poaibyje / (opens in a new tab)

  16. Convex sets with lattice point constraints / by Poh Wah Awyong.

    … planar, convex set containing exactly 0, 1 or 2 lattice points in its interior.

    adelaide Repository record for Convex sets with lattice point constraints / by Poh Wah Awyong. (opens in a new tab)

  17. Quadratic Packing Polynomials on Sectors of R<sup>2</sup>

    … polynomials that bijectively map the integral lattice points of the first quadrant onto the non-negative integers are the two Cantor polynomials. We study the more general case of bijective mappings of quadratic polynomials from the lattice points of sectors defined as the convex hull of two …

    cuny-grad Repository record for Quadratic Packing Polynomials on Sectors of R<sup>2</sup> (opens in a new tab)

Page 1 of 4