On the Riemann property of angular lattice sums and the one-dimensional limit of two-dimensional lattice sums

Author(s):  
Ross C McPhedran ◽  
I.J Zucker ◽  
Lindsay C Botten ◽  
Nicolae-Alexandru P Nicorovici

We consider a general class of two-dimensional lattice sums consisting of complex powers s of inverse quadratic functions. We consider two cases, one where the quadratic function is negative definite and another more restricted case where it is positive definite. In the former, we use a representation due to H. Kober, and consider the limit u →∞, where the lattice becomes ever more elongated along one period direction (the one-dimensional limit). In the latter, we use an explicit evaluation of the sum due to Zucker and Robertson. In either case, we show that the one-dimensional limit of the sum is given in terms of ζ (2 s ) if Re( s )>1/2 and either ζ (2 s −1) or ζ (2−2 s ) if Re( s )<1/2. In either case, this leads to a Riemann property of these sums in the one-dimensional limit: their zeros must lie on the critical line Re( s )=1/2. We also comment on a class of sums that involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle. We show that certain of these sums can have their zeros on the critical line but not in a neighbourhood of it; others are identically zero on it, while still others have no zeros on it.

2007 ◽  
Vol 21 (02n03) ◽  
pp. 139-154 ◽  
Author(s):  
J. H. ASAD

A first-order differential equation of Green's function, at the origin G(0), for the one-dimensional lattice is derived by simple recurrence relation. Green's function at site (m) is then calculated in terms of G(0). A simple recurrence relation connecting the lattice Green's function at the site (m, n) and the first derivative of the lattice Green's function at the site (m ± 1, n) is presented for the two-dimensional lattice, a differential equation of second order in G(0, 0) is obtained. By making use of the latter recurrence relation, lattice Green's function at an arbitrary site is obtained in closed form. Finally, the phase shift and scattering cross-section are evaluated analytically and numerically for one- and two-impurities.


Author(s):  
Ross C. McPhedran ◽  
Lindsay C. Botten ◽  
Dominic J. Williamson ◽  
Nicolae-Alexandru P. Nicorovici

We give analytical results pertaining to the distributions of zeros of a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle. Let denote the product of the Riemann zeta function and the Catalan beta function, and let denote a particular set of angular sums. We then introduce a function that is the quotient of the angular lattice sums with , and use its properties to prove that obeys the Riemann hypothesis for any m if and only if obeys the Riemann hypothesis. We furthermore prove that if the Riemann hypothesis holds, then and have the same distribution of zeros on the critical line (in a sense made precise in the proof). We also show that if obeys the Riemann hypothesis and all its zeros on the critical line have multiplicity one, then all the zeros of every have multiplicity one. We give numerical results illustrating these and other results.


2016 ◽  
Vol 27 (11) ◽  
pp. 1650127 ◽  
Author(s):  
M. Rodríguez-Achach ◽  
H. F. Coronel-Brizio ◽  
A. R. Hernández-Montoya ◽  
R. Huerta-Quintanilla ◽  
E. Canto-Lugo

Minesweeper is a famous computer game consisting usually in a two-dimensional lattice, where cells can be empty or mined and gamers are required to locate the mines without dying. Even if minesweeper seems to be a very simple system, it has some complex and interesting properties as NP-completeness. In this paper and for the one-dimensional case, given a lattice of n cells and m mines, we calculate the winning probability. By numerical simulations this probability is also estimated. We also find out by mean of these simulations that there exists a critical density of mines that minimize the probability of winning the game. Analytical results and simulations are compared showing a very good agreement.


2012 ◽  
Vol 2012 ◽  
pp. 1-10
Author(s):  
Chin-Chin Wu

We study traveling waves for a two-dimensional lattice dynamical system with bistable nonlinearity in periodic media. The existence and the monotonicity in time of traveling waves can be derived in the same way as the one-dimensional lattice case. In this paper, we derive the uniqueness of nonzero speed traveling waves by using the comparison principle and the sliding method.


2000 ◽  
Vol 15 (01) ◽  
pp. 105-131
Author(s):  
H. E. BOOS

The model which is the generalization of the one-dimensional XY-spin chain for the case of the two-dimensional square lattice is considered. The subspace of the "string" states is studied. The solution to the eigenvalue problem is obtained for the single "string" in cases of the "string" with fixed ends and "string" of types (1, 1) and (1, 2) living on the torus. The latter case has the features of a self-interacting system and does not seem to be integrable while the previous two cases are equivalent to the free-fermion model.


Author(s):  
Geoffrey Hellman ◽  
Stewart Shapiro

This chapter develops a Euclidean, two-dimensional, regions-based theory. As with the semi-Aristotelian account in Chapter 2, the goal here is to recover the now orthodox Dedekind–Cantor continuum on a point-free basis. The chapter derives the Archimedean property for a class of readily postulated orientations of certain special regions, what are called “generalized quadrilaterals” (intended as parallelograms), by which the entire space is covered. Then the chapter generalizes this to arbitrary orientations, and then establishes an isomorphism between the space and the usual point-based one. As in the one-dimensional case, this is done on the basis of axioms which contain no explicit “extremal clause”, and we have no axiom of induction other than ordinary numerical (mathematical) induction.


2002 ◽  
Vol 12 (03n04) ◽  
pp. 341-358
Author(s):  
KRISHNA M. KAVI ◽  
DINESH P. MEHTA

This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and fairness. Both algorithms exploit the predictability of propagation delays in optical buses.


Author(s):  
Bharti bharti ◽  
Debabrata Deb

We use molecular dynamics simulations to investigate the ordering phenomena in two-dimensional (2D) liquid crystals over the one-dimensional periodic substrate (1DPS). We have used Gay-Berne (GB) potential to model the...


Sign in / Sign up

Export Citation Format

Share Document