A lattice in $\mathbb R^n$ is a discrete subgroup of $\mathbb R^n$ or, equivalently, it is a subgroup of $\mathbb R^n$ generated by linearly independent vectors. Lattices have applications in geometric number theory, e.g. via Minkowski's theorem.

learn more… | top users | synonyms

10
votes
1answer
220 views

Question about Pick's Theorem

Is there a Pick's Theorem for a general lattice in $\mathbb{R}^{2}$?
0
votes
2answers
83 views

Relating lattice bases in $\mathbb R^2$

this is a homework question but I am pretty confused on it--just don't know where to start. We're given a lattice basis $(a, b)$ for a lattice $L$ in $\mathbb{R}^2$, and are supposed to show that ...
1
vote
1answer
673 views

Lattice Paths to $(2n, 2n)$ that do not go through $(n,n)$

I know that from the origin to $(x,y)$ there are $${x+y \choose x} = {x+y \choose y}$$ Lattice paths. The question is finding the number of paths from the origin to $(2n, 2n)$ not passing through ...
2
votes
1answer
170 views

What is the “$\tau$” of this elliptic curve

For any $n\geq 1$, let $E_n $ be the elliptic curve given by the equation $y^2 = x(x-1)(x-\zeta_{15^n})$. Here $\zeta_{m} = \exp(2\pi i /m)$ for any positive integer $m$. There is a unique element ...
3
votes
1answer
85 views

Nonzero element of minimal length in a lattice?

Given two linearly independent vectors $a,b\in\mathbb{R}^2$ we form the lattice $L=\{ma+nb|m,n\in\mathbb{Z}\}$. Now, a proof starts with "choose a nonzero vector in $L$ of smallest length...". Why ...
0
votes
1answer
365 views

Lattice Paths Question

You know, how we can have lattice paths, where we can move either one block north, or one block east, and we have the find all the possible ways of reaching the point (x.y) from (0,0). That is ...
2
votes
1answer
266 views

Lattices in complex vector spaces

if I have a finite dimensional complex vector space $V$ with a lattice $\Gamma$ in $V$, then I consider the complex linear span in $V\oplus \overline{V}$ of the elements $\gamma \oplus ...
4
votes
1answer
230 views

Proving this identity $\sum_k\frac{1}{k}\binom{2k-2}{k-1}\binom{2n-2k+1}{n-k}=\binom{2n}{n-1}$ using lattice paths

How can I prove the identity $\sum_k\frac{1}{k}\binom{2k-2}{k-1}\binom{2n-2k+1}{n-k}=\binom{2n}{n-1}$? I have to prove it using lattice paths, it should be related to Catalan numbers The $n$th ...
2
votes
0answers
137 views

Construction of a symplectic basis for a lattice

Let $(T,E)$ be a polarized abelian variety ($T=V/L$, $\dim_\mathbb{C} V=g$, $E:V\times V\to\mathbb{R}$ a nondegenerate real alternating bilinear form, with $E(L\times L)\subseteq\mathbb{Z}$ and ...
8
votes
1answer
330 views

“Center-of-Mass” of lattice polygons (generalization of Pick's theorem)

Call a polygon with integer coordinates (in the Euclidean plane) a 'lattice polygon'. Pick's Theorem allows you to efficiently compute the number of lattice points inside this polygon given just its ...
3
votes
1answer
316 views

Which internal angles can a lattice polygon have?

I am wondering if for a lattice polygon an internal angle can take any value? If no which ones not and why? I guess there will be some restrictions due to the discrete nature of the grid but I am ...
0
votes
1answer
105 views

Lattice Reduction of two matrix

I have two matrices A, B with same number of rows. I want lattice reduction on B. During this reduction, I change rows of A accordingly. That is if i-th row and j-th row in B interchanges, swap i-th ...
3
votes
1answer
178 views

Theta series representation of lattices (Leech lattice, especially)

I'm reading now about theta series and its significance in researching self-dual, even lattices. Now, I found the wikipedia article about the Leech lattice, but I'm having trouble understanding where ...
5
votes
1answer
264 views

Convergence of Sum over Integer Lattice

Does the sum $$\sum_{z \in \mathbb{Z}^3\setminus \{(0,0,0)\}} \left( \frac{1}{|{\bf x} - {\bf z}|^2} - \frac{1}{|{\bf z}|^2} \right)$$ converge pointwise or even uniformly for $\varepsilon < |{\bf ...
2
votes
1answer
125 views

Mathematical Results from Counting Points in Lattices

I'm preparing a talk on lattice point enumeration in polytopes (Ehrhart-Macdonald Theory), and I'd like to have an introduction with a few motivational problems/results which arise from the ...
0
votes
1answer
173 views

Lattice simplification

Update: There is an answer on same question I posted on Stack Overflow. I'm working on data structure for graph cut algorithm. Problem is to make different cuts on shortest paths. I made data ...
9
votes
1answer
425 views

Path (Feynman) Integrals over Graphs

I was thinking about Feynman integrals the other day and in particular about discretizing the paths. Does anyone know the lay of the land about what happens when you do path integrals over, say, a ...
2
votes
0answers
132 views

The $n$-shortest lattice vectors problem in $\mathcal{R}^2$

I am looking for an algorithm to compute the $n$ shortest lattice vectors in $\mathcal{R}^2$. The problem statement is as follows: Given a lattice $L: \{ m \vec{u}+n\vec{v} \} \in \mathcal{R}^2$, a ...
0
votes
1answer
204 views

Proof for Minkowski reduced basis

I've read a few articles explaining the way to use the Minkowski reduced basis in a lattice in order to measure the uniformity of the output of a random number generator. However, I can't prove a ...
16
votes
5answers
1k views

Pick's Theorem on a triangular (or hex) grid

Pick's theorem says that given a square grid (that is, all points in the plane with integer coordinates) and a polygon without holes and non selt-intersecting whose vertices are grid points, its area ...