Uniform distribution and lattice point counting

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice point counting and harmonic analysis

We explain the application of harmonic analysis to count lattice points in large regions. We also present some of our recent results in the three-dimensional case.

متن کامل

Uniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces

We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...

متن کامل

Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences

Let d and k be integers with 1 ≤ k ≤ d − 1. Let Λ be a d-dimensional lattice and let K be a d-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of k-dimensional linear subspaces needed to cover all points in Λ ∩ K. In particular, our results imply that the minimum number of k-dimensional linear subspaces needed to cover the d-dimensional n ×...

متن کامل

The Uniform-Pareto Distribution and Eeponentiated Uniform-Pareto Distribution and Their Application in Income Data

‎In this paper‎, ‎a new distribution is introduced‎, ‎which is a generalization of a well-known distribution‎. ‎This distribution is flexible and applies to income data modeling‎. ‎We first provide some of the mathematical and distributional properties of this new model and then‎, ‎to demonstrate the flexibility the new distribution‎, ‎we will present the applications of this distribution with ...

متن کامل

The Variance of the Hyperbolic Lattice Point Counting Function

The problem of estimating the number of points of a lattice that lie in a ball, is often called the circle problem. In the case of lattices in Euclidean space, this question goes back at least as far as Gauss. If we call Nρ the number of points of Z inside the ball B(0, ρ), then one easily sees that the leading term of Nρ is the area, πρ, of B(0, ρ). It is not difficult to show that the error t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1992

ISSN: 0263-6115

DOI: 10.1017/s1446788700035370