Papers
Topics
Authors
Recent
Search
2000 character limit reached

Permutation invariant lattices

Published 4 Sep 2014 in math.CO and math.NT | (1409.1491v3)

Abstract: We say that a Euclidean lattice in $\mathbb Rn$ is permutation invariant if its automorphism group has non-trivial intersection with the symmetric group $S_n$, i.e., if the lattice is closed under the action of some non-identity elements of $S_n$. Given a fixed element $\tau \in S_n$, we study properties of the set of all lattices closed under the action of $\tau$: we call such lattices $\tau$-invariant. These lattices naturally generalize cyclic lattices introduced by Micciancio, which we studied in a paper. Continuing our investigation, we discuss some basic properties of permutation invariant lattices, in particular proving that the subset of well-rounded lattices in the set of all $\tau$-invariant lattices in $\mathbb Rn$ has positive co-dimension (and hence comprises zero proportion) for all $\tau$ different from an $n$-cycle.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.