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

3
votes
2answers
41 views

Placing a circle in a square lattice

Two part question. Consider the square lattice $\mathbb{Z}^2$: Imagine you are going to place a circle of radius $r$ somewhere in $\mathbb{R}^2$. Question 1: What is the radius of the largest ...
9
votes
2answers
454 views

Generalizing the 290 theorem.

I have only just come across the remarkable theorem of Conway about universal quadratic forms over $\mathbb{Z}$; namely that in determining whether a integer coefficient, positive definite quadratic ...
3
votes
2answers
18 views

Smallest linear combination of a set of vectors

I'm searching for an algorithm to accomplish a (hopefully) simple task. If I have a set of vetors, (e.g. $\left( ...
2
votes
2answers
56 views

$x+y\sqrt{2}$ infimum ($x,y\in \mathbb{Z}$)

I've looked for help with this question but I have not found anything, I hope this is not a duplicate. Define the set $A=\{\mid x+y\sqrt{2}\mid \ : x,y\in \mathbb{Z}\ \mbox{and} \mid ...
0
votes
2answers
378 views

Lattice Paths from $(1, 1) \to (x, y)$

Moderator Note: This is a current contest question on Brilliant.org. Let $S$ be the set of $\{(1,1), (1,−1), (−1,1), (1,0), (0,1)\}$-lattice paths which begin at $(1,1),$ do not use the same ...
5
votes
1answer
132 views

The lattice points of a f.g. rational cone form a f.g. monoid.

In their book "Polytopes, Rings, and K-Theory" Bruns and Gubeladze sketch an alternative approach to Gordan's Lemma, which is stated in the headline (f.g. = finitely generated). I don't understand the ...
1
vote
1answer
61 views

Equivalent definitions of a lattice in a real vector space of finite dimension

I'm currently trying to work my way through chapter seven of Serre's book "A Course in Arithmetic" with a view to learning about modular forms. During the course of this chapter the book begins to ...
3
votes
1answer
184 views

Algebraic proof of Ehrhart's theorem

Let $P \subset \mathbb{R}^d$ be a $d$-dimensional polytope, where all vertices lie on integral coordinates, and let $L(P,n)$ denote the number of integral lattice points contained in the scaled ...
0
votes
1answer
20 views

LLL algorithm in pari/gp

I know that in PARI/GP the function qflll performs LLL algorithm on a set of bases. However, is it possible for me to look at the code for ...
3
votes
2answers
125 views

Prove that there is a basis of a lattice $\Lambda$ s.t. a reflection is of a certain form

Consider $\Lambda$ a lattice in $\mathbb{R}^2$. Let $S \in O(\Lambda)$ be a reflection, i.e. $\det S = -1$. Set $S_{1}= \begin{pmatrix} 1 & 0 \\ 0 & -1 \\ \end{pmatrix}$ and $S_{2}= ...
2
votes
1answer
23 views

Scalar multiple of one lattice contained in another

I believe my question boils down to the following question: Given lattices $L$ and $L'$ in $k^{n}$, does there exist $\lambda \in k^{\times}$ so that $\lambda L' \subseteq L$ and $\lambda L' ...
2
votes
1answer
52 views

Lattice Path Spaces.

It is well known that the number of paths from $(0,0)$ to $(n,k)$ in $\mathbb{N^2}$ with the set of steps $\{(1,0),(0,1)\}$ is ${n+k \choose k}$. This is the minimum number of steps needed to get to ...
1
vote
1answer
31 views

“All vertices of a convex pentagon are lattice points, and its sides have integral length. Show that its perimeter is even.”

"All vertices of a convex pentagon are lattice points, and its sides have integral length. Show that its perimeter is even." - Problem Solving Strategies, Arthur Engel, pg. 27. I have proven the ...
3
votes
2answers
69 views

Are there 2D analogues for integer division and modular arithmetic?

Let's say you have a "parallelogram" of points $P = \{(0, 0), (0, 1), (1, 1), (0, 2), (1, 2)\}$. This parallelogram lies between $u = (2, 1)$ and $v = (-1, 2)$. Then for any point $n \in ...
0
votes
0answers
24 views

Finding integer vectors in the column space of a matrix

Consider a given set $S \subset Z$. $S$ is a finite set. Matrix $A \in S^{N \times M}$ is also given. Does there exist an algorithm to find all the vectors belonging to the space Col$(A)\cap S^N$ ...
0
votes
1answer
55 views

show that L^+ is non-empty

I want to show that $L^+$ is non-empty where $L$ is a full-rank integer lattice and $L^+$ denotes the set of elements of $L$ having positive coordinates I have an indication that I did not understand ...
0
votes
0answers
19 views

show that $L^+$ is non empty [duplicate]

I want to show that L+ is non-empty where L is a full-rank integer lattice and L+ denotes the set of elements of L having positive coordinates I have an indication that I did not understand L⊗Q⊆Zn⊗Q ...
0
votes
2answers
36 views

Minimum difference of angles between points on square lattice

I have integer grid of size $N \times N$. If I calculate angles between all point triples - is it possible analytically find minimal non-zero difference between those angles?
1
vote
1answer
45 views

Orbits of action of $SL_2(\mathbb{Z})$ on lattice

I'm interested in the action of $SL_2(\mathbb{Z})$ on $\mathbb{Z}^2$: if $A\in SL_2(\mathbb{Z})$ and $v\in\mathbb{Z}^2$, then $Av\in\mathbb{Z}^2$. Specifically, what are the orbits of this action?
1
vote
0answers
16 views

moduli of lattices

Consider the set $M$ of all (rank $g$) lattices in $g$-dimensional complex affine space $C^g$. Does M identify in some way with Siegel upper half space $H_g$? Let's say a lattice has CM if it has ...
1
vote
2answers
167 views

A book useful to learn lattices (discrete groups)

Does anyone know a good book about lattices (as subgroups of a vector space $V$)?
1
vote
1answer
39 views

Lattices and Elliptic curves and number fields

Let $K$ be a number field with ring of integers $O_K$. If $K$ is totally real, then $O_K$ is a lattice in $\mathbb R$. If $K$ is imaginary quadratic, then $O_K$ is a lattice in $\mathbb C$. If $K$ ...
0
votes
0answers
18 views

smallest integer contained in sublattice $\Rightarrow$ $L'=[q,r\tau+s]$

Let $L'$ be a sublattice of the lattice $[1,\tau]$ in a imaginary quadratic field. Reminder: a lattice $L$ consists of the $\mathbb{Z}$-linear combinations of $1$ and $\tau$, with $\{1,\tau \}$ linear ...
0
votes
1answer
44 views

Helping solve mod problems

I am having trouble solving the below problems. My teacher taught us to write out the solutions by hand.. but I really think there is an easier way to do the higher numbers. Thanks!
1
vote
1answer
43 views

Counting sum of lattice points

Assume a set $S$ with $|S|$ entries. Indeed, $S$ is the set of lattice points inside a $k$-sphere. Assume $V=S\oplus S$ where $\oplus$ is the Minkowski sum of two sets. Do you know any lower bound on ...
2
votes
1answer
48 views

Is this the subgroup lattice for $\Bbb{Z}_4 \times \Bbb{Z}_8$?

I have been attempting to create the subgroup lattice for $\Bbb{Z}_4 \times \Bbb{Z}_8$. I have, so far, this: http://www.scribd.com/doc/223680804/Subgroup-Lattice-of-Z-4-x-Z-8 While I have calculated ...
0
votes
1answer
12 views

Correctness of the size of an planar integer lattice unknot

A planar integer lattice unknot is a polygon drawn over a two dimensional integer lattice. Here is an example: Given a number $N$, a planar unknot is not always possible. For example, a planar ...
0
votes
1answer
32 views

Integer polynomial with two aligned roots

Anyone have an example of a monic polynomial $f(x) \in \mathbb{Z}[x]$ with $f(0)=1$ such that for $\alpha \in \mathbb{C}\backslash\mathbb{R}$ and $t \in R, t>0, t\neq 1$ both $\alpha$ and $t\alpha$ ...
0
votes
0answers
22 views

Automorphism group of torus fixing origin

I've got a short question: Suppose that you have some lattice $\Lambda$, say $\Lambda=\mathbb{Z}+\mathbb{Z}i$, and let $T$ be the torus $\mathbb{C}/\Lambda$, coming with the quotient map ...
2
votes
1answer
86 views

number of lattice points in an n-ball

I have faced a problem in my work and I will appreciate any hint/reference as I am not much into the lattice problems. Assume an n-dimensional lattice $\Lambda_n$ with generator matrix $G$. Note that ...
1
vote
1answer
44 views

Lattice Definition

I see two Lattice definitions in Mathematics. Partial order set with each pair of elements have a least least upper bound and greatest lower bound. Integer linear combinations of vectors. Is ...
3
votes
1answer
83 views

Basis reduction and continued fractions

While reading several articles about lattice basis reduction I am left with a few questions. For one, I came across this piece of text Let $\alpha$ and $\beta \in \mathbb{R}$. Then there are two ...
1
vote
1answer
24 views

What is a good introduction to quantities such as the norm of a lattice and of short vectors in the context of lattice reduction?

I am trying to make sense of different notations used in measuring lattices, in particular before and after a basis reduction. In particular, I am trying to get bounds and estimates for the size of ...
0
votes
0answers
15 views

Upper bound on the product of norms of vectors in a lattice basis

The orthogonality defect of a lattice basis is the quotient of the product of the norms of the vectors in the basis and the determinant of the lattice. It is at least 1 by Hadamard's inequality. ...
3
votes
1answer
114 views

Generators of Special Linear Groups

Linear algebra and special-linear group experts please help: I learn that in principle one can generate this $M$ matrix form the $B_1$ and $B_2$ matrix below. Here $$ M=\begin{pmatrix} 0& 1& ...
0
votes
0answers
56 views

Integer Points on Circles

Let $r(n)$ denote the number of integral solutions to $a^2+b^2 = n$ where $a,b,n$ are integers. Furthermore, we count the pairs with regard to order and signs. (So if $(a,b)$ is a solution, so are ...
1
vote
1answer
75 views

Obtaining a new basis for a lattice with one of the new basis vectors fixed

Suppose that a lattice $L$ in $\mathbb{R}^3$ is given with a basis $B = \mathbf{ \{ v_1, v_2, v_3 \} }$. Is there an algorithm that would help me obtain a new basis $B' = \mathbf{ \{ v_1', v_2', v_3' ...
7
votes
1answer
58 views

Orbits of action of $SL_m(\mathbb{Z})$ on $\mathbb{Z}^m$

I'm considering the action of $SL_m(\mathbb{Z})$ on $\mathbb{Z}^m$: if $A\in SL_m(\mathbb{Z})$ and $v\in\mathbb{Z}^m$, then $Av\in\mathbb{Z}^m$. My question is: what are the orbits of this action? ...
0
votes
0answers
49 views

Which of the following sets are sub lattices of $\mathbb{Z}^2$?

Here are the first three sets: $\{(x, y) \in \mathbb Z^2 : x + y = 1\}$. $\{(x, y) \in Z^2 : x + y = 0\} = S^2$. $\{(x,y) \in Z^2 :2\mid x\} = S^3$ I found that the first one is not a subgroup ...
10
votes
2answers
2k views

Integer lattice points on a sphere

Suppose we have a sphere centered at the origin of $\mathbb{R^{n}}$ with radius $r$. Are there known theorems that state the number of integer lattice points that lie on the sphere? It seems like this ...
1
vote
0answers
22 views

Which lattices are ideals of a number field?

Let $K$ be a number field, then its ring of integers $\mathcal{O}_K$ in the Minkowski space of $K$ is a lattice $\Lambda$. Is there some geometric descrpition/intuition that describes sublattices of ...
3
votes
0answers
27 views

Number of points in the diagonal of an $X \times Y$ square lattice box.

So assuming we have a $X \times Y$ lattice, Say for example a $3 \times 5$ like so * * * * * * * * * * * * * * * I need to find the number of points that each ...
1
vote
0answers
19 views

Non zero Unimodular matrices

I have a question about the lattice reduction algorithms like LLL algorithm. Lattice reduction algorithms like LLL generate a unimodular matrix which makes more orthogonal basises for a given matrix. ...
4
votes
1answer
49 views

Lattice in a vector space of dim 2 over a valuated field.

I'm reading "Arbres, amalgames et SL2" of J.P. Serre, and something is not clear to me, but is to him :) Let $k$ be a field, with a discrete valuation $v$, ie a group epimorphism $v:k^\ast \to ...
8
votes
2answers
449 views

Elementary proof that if $A$ is a matrix map from $\mathbb{Z}^m$ to $\mathbb Z^n$, then the map is surjective iff the gcd of maximal minors is $1$

I am trying to find an elementary proof that if $\phi$ is a linear map from $\mathbb{Z}^n\rightarrow \mathbb{Z}^m$ represented by an $m \times n$ matrix $A$, then the map is surjective iff the gcd ...
0
votes
0answers
28 views

Covering a Disk in a Square Lattice: How Many Squares Are Needed?

I have a square lattice (the square side is $a$, and a disk centered at $(0,0)$ with radius 1. I want to know how many lattice squares are located completely inside the disk, and how many lattice ...
1
vote
1answer
23 views

isotropic sublattice

In Scattone " Compactification of Moduli Spaces of Algebraic K3 Surfaces" the author cites a correspondance between primitive isotropic sublattices of some lattice L and the rational boundary ...
0
votes
0answers
99 views

Lattice orthogonal polyhedra face-area sequences: Golyhedra?

Let $P$ be a polyhedron, all of whose vertices are at points of $\mathbb{Z}^3$, all of whose edges are parallel to an axis, with every face simply connected, and the surface topologically a sphere. ...
1
vote
1answer
37 views

Factoring an integer matrix into unimodular and upper triangular matrices

I'm stuck at the following problem. I've read this somewhere, but the author did not provide a proof, probably assuming that this is `clear'. Let $A \in \mathbb{Z}^{n \times n}$. Then, there exist a ...
1
vote
0answers
32 views

Is the Voronoi region of a lattice symmetric around origion?

Assume an n-dimensional lattice. Is the Voronoi region of the lattice symmetric around origion? In other word, is the following statement true? "if $x\in \mathcal{V}$ then $-x\in \mathcal{V}$" where ...