scholarly journals Lattice points in rotated convex domains

2015 ◽  
Vol 31 (2) ◽  
pp. 411-438 ◽  
Author(s):  
Jingwei Guo
Keyword(s):  
Lattice Points ◽  
Convex Domains

Geometry of the gauss map and lattice points in convex domains

Mathematika ◽  
2001 ◽  
Vol 48 (1-2) ◽  
pp. 107-117 ◽  
Author(s):  
L. Brandolini ◽  
L. Colzani ◽  
A. Iosevich ◽  
A. Podkorytov ◽  
G. Travaglini
Keyword(s):  
Gauss Map ◽  
Lattice Points ◽  
Convex Domains

scholarly journals Random fluctuations of convex domains and lattice points

1999 ◽  
Vol 127 (10) ◽  
pp. 2981-2985
Author(s):  
Alex Iosevich ◽  
Kimberly K. J. Kinateder
Keyword(s):  
Lattice Points ◽  
Convex Domains ◽  
Random Fluctuations

Lattice Points in Planar Convex Domains

2004 ◽  
Vol 143 (2) ◽  
pp. 145-162 ◽  
Author(s):  
Ekkehard Kr�tzel
Keyword(s):  
Lattice Points ◽  
Convex Domains ◽  
Planar Convex

scholarly journals Stretching Convex Domains to Capture Many Lattice Points

2018 ◽  
Vol 2020 (10) ◽  
pp. 2918-2951 ◽  
Author(s):  
Nicholas F Marshall
Keyword(s):  
Fourier Analysis ◽  
Convex Domain ◽  
Large Volume ◽  
Lattice Points ◽  
Convex Domains ◽  
Coordinate Hyperplane ◽  
Analysis Techniques ◽  
Volume Limit ◽  
Gauss Circle Problem ◽  
Large Volume Limit

Abstract We consider an optimal stretching problem for strictly convex domains in $\mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant 1. Specifically, we prove that the stretched convex domain which captures the most positive lattice points in the large volume limit is balanced: the (d − 1)-dimensional measures of the intersections of the domain with each coordinate hyperplane are equal. Our results extend those of Antunes and Freitas, van den Berg, Bucur and Gittins, Ariturk and Laugesen, van den Berg and Gittins, and Gittins and Larson. The approach is motivated by the Fourier analysis techniques used to prove the classical $\#\{(i,j) \in \mathbb{Z}^2 : i^2 +j^2 \le r^2 \} =\pi r^2 + \mathcal{O}(r^{2/3})$ result for the Gauss circle problem.

scholarly journals Efficient Covering of Thin Convex Domains Using Congruent Discs

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3056
Author(s):  
Shai Gul ◽  
Reuven Cohen
Keyword(s):  
Hexagonal Lattice ◽  
Lattice Points ◽  
Thin Domains ◽  
Convex Domains ◽  
Asymptotically Optimal ◽  
Single Row

We present efficient strategies for covering classes of thin domains in the plane using unit discs. We start with efficient covering of narrow domains using a single row of covering discs. We then move to efficient covering of general rectangles by discs centered at the lattice points of an irregular hexagonal lattice. This optimization uses a lattice that leads to a covering using a small number of discs. We compare the bounds on the covering using the presented strategies to the bounds obtained from the standard honeycomb covering, which is asymptotically optimal for fat domains, and show the improvement for thin domains.

Circles on lattices and Hadamard matrices

2019 ◽  
pp. 2-9 ◽  
Author(s):  
N. A. Balonin ◽  
M. B. Sergeev ◽  
J. Seberry ◽  
O. I. Sinitsyna
Keyword(s):  
Hadamard Matrices ◽  
Lattice Points ◽  
Practical Significance ◽  
Upper And Lower Bounds ◽  
Problem Size ◽  
Orthogonal Matrices ◽  
Video Information ◽  
Scientific Schools ◽  
Gauss Theorem ◽  
Triangular Numbers

Introduction: The Hadamard conjecture about the existence of Hadamard matrices in all orders multiple of 4, and the Gauss problem about the number of points in a circle are among the most important turning points in the development of mathematics. They both stimulated the development of scientific schools around the world with an immense amount of works. There are substantiations that these scientific problems are deeply connected. The number of Gaussian points (Z3 lattice points) on a spheroid, cone, paraboloid or parabola, along with their location, determines the number and types of Hadamard matrices.Purpose: Specification of the upper and lower bounds for the number of Gaussian points (with odd coordinates) on a spheroid depending on the problem size, in order to specify the Gauss theorem (about the solvability of quadratic problems in triangular numbers by projections onto the Liouville plane) with estimates for the case of Hadamard matrices. Methods: The authors, in addition to their previous ideas about proving the Hadamard conjecture on the base of a one-to-one correspondence between orthogonal matrices and Gaussian points, propose one more way, using the properties of generalized circles on Z3 .Results: It is proved that for a spheroid, the lower bound of all Gaussian points with odd coordinates is equal to the equator radius R, the upper limit of the points located above the equator is equal to the length of this equator L=2πR, and the total number of points is limited to 2L. Due to the spheroid symmetry in the sector with positive coordinates (octant), this gives the values of R/8 and L/4. Thus, the number of Gaussian points with odd coordinates does not exceed the border perimeter and is no less than the relative share of the sector in the total volume of the figure.Practical significance: Hadamard matrices associated with lattice points have a direct practical significance for noise-resistant coding, compression and masking of video information.

SUMMATIONS OVER LATTICE POINTS IN K-SPACE

1948 ◽  
Vol os-19 (1) ◽  
pp. 238-248 ◽  
Author(s):  
S. BOCHNER ◽  
K. CHANDRASEKHARAN
Keyword(s):  
Lattice Points

scholarly journals Organotrialkoxysilane-Functionalized Prussian Blue Nanoparticles-Mediated Fluorescence Sensing of Arsenic(III)

Nanomaterials ◽  
2021 ◽  
Vol 11 (5) ◽  
pp. 1145
Author(s):  
Prem. C. Pandey ◽  
Shubhangi Shukla ◽  
Roger J. Narayan
Keyword(s):  
Prussian Blue ◽  
Chemical Reduction ◽  
Low Cost ◽  
Three Dimensional ◽  
Heterogeneous Systems ◽  
Lattice Points ◽  
Radiative Energy ◽  
Fluorescence Sensing ◽  
Emission Signal ◽  
Prussian Blue Nanoparticles

Prussian blue nanoparticles (PBN) exhibit selective fluorescence quenching behavior with heavy metal ions; in addition, they possess characteristic oxidant properties both for liquid–liquid and liquid–solid interface catalysis. Here, we propose to study the detection and efficient removal of toxic arsenic(III) species by materializing these dual functions of PBN. A sophisticated PBN-sensitized fluorometric switching system for dosage-dependent detection of As3+ along with PBN-integrated SiO2 platforms as a column adsorbent for biphasic oxidation and elimination of As3+ have been developed. Colloidal PBN were obtained by a facile two-step process involving chemical reduction in the presence of 2-(3,4-epoxycyclohexyl)ethyl trimethoxysilane (EETMSi) and cyclohexanone as reducing agents, while heterogeneous systems were formulated via EETMSi, which triggered in situ growth of PBN inside the three-dimensional framework of silica gel and silica nanoparticles (SiO2). PBN-induced quenching of the emission signal was recorded with an As3+ concentration (0.05–1.6 ppm)-dependent fluorometric titration system, owing to the potential excitation window of PBN (at 480–500 nm), which ultimately restricts the radiative energy transfer. The detection limit for this arrangement is estimated around 0.025 ppm. Furthermore, the mesoporous and macroporous PBN-integrated SiO2 arrangements might act as stationary phase in chromatographic studies to significantly remove As3+. Besides physisorption, significant electron exchange between Fe3+/Fe2+ lattice points and As3+ ions enable complete conversion to less toxic As5+ ions with the repeated influx of mobile phase. PBN-integrated SiO2 matrices were successfully restored after segregating the target ions. This study indicates that PBN and PBN-integrated SiO2 platforms may enable straightforward and low-cost removal of arsenic from contaminated water.

Sign in / Sign up

Export Citation Format

Share Document