Revision history [back]

Hi, new to the community!

My question: Consider a a full dimension cone and a full rank lattice in $\mathbb{R}^d$ (so the cone and lattice each have $d$ generators, with potentially non-integer coordinates). Does Sage have functions to compute their intersection?

For me, a cone $C$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} c_i v_i \text{ with } c_i \in \mathbb{R}_{>0}$.

Meanwhile, a lattice $L$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} n_i v_i \text{ with } n_i \in \mathbb{Z}$.

I am currently constructing my cones with the "convex rational polyhedral cones" module. And I couldn't find a class for a lattice with non-integer coordinates (I only found the "Integral lattices" module). When $d = 2$, I might write

cone_generators = [[1.1, 2.3], [3, 0.2]]
cone = Cone(cone_generators)
lattice_generators = [[1, 0], [0.2, 0.3]]
lattice = ??
# goal: compute intersection between cone and lattice (modulo positive translates of the cone generators)

Context of question, in case helpful: The problem arises from algebraic number theory. I am regarding (fractional) ideals in number fields as lattices via the embeddings of the number field. See Conrad's "The Different Ideal" for some pictures/examples -- pdf available online, my karma is insufficient to include a link.

I'd like to determine the intersection between those lattices and various cones.

Hi, new to the community!

My question: Consider a a full dimension cone and a full rank lattice in $\mathbb{R}^d$ (so the cone and lattice each have $d$ generators, with potentially non-integer coordinates). Does Sage have functions to compute their intersection?

For me, a cone $C$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} c_i v_i \text{ with } c_i \in \mathbb{R}_{>0}$.

Meanwhile, a lattice $L$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} n_i v_i \text{ with } n_i \in \mathbb{Z}$.

I am currently constructing my cones with the "convex rational polyhedral cones" module. And I couldn't find a class for a lattice with non-integer coordinates (I only found the "Integral lattices" module). When $d = 2$, I might write

cone_generators = [[1.1, 2.3], [3, 0.2]]
cone = Cone(cone_generators)
lattice_generators = [[1, 0], [0.2, 0.3]]
lattice = ??
# goal: compute intersection between cone and lattice = ?? (modulo positive translates of the cone generators)

Context of question, in case helpful: The problem arises from algebraic number theory. I am regarding (fractional) ideals in number fields as lattices via the embeddings of the number field. See Conrad's "The Different Ideal" for some pictures/examples -- pdf available online, my karma is insufficient to include a link.

I'd like to determine the intersection between those lattices and various cones. cones.

Hi, new to the community!

My question: Consider a a full dimension cone and a full rank lattice in $\mathbb{R}^d$ (so the cone and lattice each have $d$ generators, with potentially non-integer coordinates). Does Sage have functions to compute their intersection?

For me, a cone $C$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} c_i v_i \text{ with } c_i \in \mathbb{R}_{>0}$.

Meanwhile, a lattice $L$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} n_i v_i \text{ with } n_i \in \mathbb{Z}$.

I am currently constructing my cones with the "convex rational polyhedral cones" module. And I couldn't find a class for a lattice with non-integer coordinates (I only found the "Integral lattices" module). When $d = 2$, I might write

cone_generators = [[1.1, 2.3], [3, 0.2]]
cone = Cone(cone_generators)
Cone(cone_generators).interior()
lattice_generators = [[1, 0], [0.2, 0.3]]
lattice = ??
intersection = ?? (modulo positive translates of the cone generators)

Context of question, in case helpful: The problem arises from algebraic number theory. I am regarding (fractional) ideals in number fields as lattices via the embeddings of the number field. See Conrad's "The Different Ideal" for some pictures/examples -- pdf available online, my karma is insufficient to include a link.

I'd like to determine the intersection between those lattices and various cones.

Hi, new to the community!

My question: Consider a a full dimension cone and a full rank lattice in $\mathbb{R}^d$ (so the cone and lattice each have $d$ generators, with potentially non-integer coordinates). Does Sage have functions to compute their intersection?

For me, a cone $C$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} c_i v_i \text{ with } c_i \in \mathbb{R}_{>0}$.

Meanwhile, a lattice $L$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} n_i v_i \text{ with } n_i \in \mathbb{Z}$.

I want the intersection of $C$ and $L$ (modulo positive translates of the cone generators). As such, it might suffice to compute the intersection between a "fundamental parallelpiped" for $C$ and the lattice $L$... Perhaps with a condition on the relationship between the generators of $C$ and $L$?

I am currently constructing my cones with the "convex rational polyhedral cones" module. And I couldn't find a class for a lattice with non-integer coordinates (I only found the "Integral lattices" module). When $d = 2$, I might write

cone_generators = [[1.1, 2.3], [3, 0.2]]
cone = Cone(cone_generators).interior()
lattice_generators = [[1, 0], [0.2, 0.3]]
lattice = ??
intersection = ?? (modulo positive translates of the cone generators)

Context of question, in case helpful: The problem arises from algebraic number theory. I am regarding (fractional) ideals in number fields as lattices via the embeddings of the number field. See Conrad's "The Different Ideal" for some pictures/examples -- pdf available online, my karma is insufficient to include a link.

I'd like to determine the intersection between those lattices and various cones.

My question: Consider a a full dimension cone and a full rank lattice in $\mathbb{R}^d$ (so the cone and lattice each have $d$ generators, with potentially non-integer coordinates). Does Sage have functions to compute their intersection?

For me, a cone $C$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} c_i v_i \text{ with } c_i \in \mathbb{R}_{>0}$.

Meanwhile, a lattice $L$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} n_i v_i \text{ with } n_i \in \mathbb{Z}$.

I want the intersection of $C$ and $L$ (modulo positive translates of the cone generators). As such, it might suffice to compute the intersection between a "fundamental parallelpiped" for $C$ and the lattice $L$... Perhaps with a condition on the relationship between the generators of $C$ and $L$?

I am currently constructing my cones with the "convex rational polyhedral cones" module. And I couldn't find a class for a lattice with non-integer coordinates (I only found the "Integral lattices" module). When $d = 2$, I might write

cone_generators = [[1.1, 2.3], [3, 0.2]]
cone = Cone(cone_generators).interior()
lattice_generators = [[1, 0], [0.2, 0.3]]
lattice = ??
intersection = ?? (modulo positive translates of the cone generators)

Context of question, in case helpful: The problem arises from algebraic number theory. I am regarding (fractional) ideals in number fields as lattices via the embeddings of the number field. See Conrad's "The Different Ideal" for some pictures/examples -- pdf available online, my karma is insufficient to include a link.

I'd like to determine the intersection between those lattices and various cones.

My question: Consider a full dimension cone and a full rank lattice in $\mathbb{R}^d$ (so the cone and lattice each have $d$ generators, with potentially non-integer coordinates). Does Sage have functions to compute their intersection?

For me, a cone $C$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} c_i v_i \text{ with } c_i \in \mathbb{R}_{>0}$.

Meanwhile, a lattice $L$ with generators $v_1, \ldots, v_d$ is the set of all combinations $\sum_{i} n_i v_i \text{ with } n_i \in \mathbb{Z}$.

I want the intersection of $C$ and $L$ (modulo positive translates of the cone generators). As such, it might suffice to compute the intersection between a "fundamental parallelpiped" for $C$ and the lattice $L$... Perhaps with a condition on the relationship between the generators of $C$ and $L$?

I am currently constructing my cones with the "convex rational polyhedral cones" module. And I couldn't find a class for a lattice with non-integer coordinates (I only found the "Integral lattices" module). When $d = 2$, I might write

cone_generators = [[1.1, 2.3], [3, 0.2]]
cone = Cone(cone_generators).interior()
lattice_generators = [[1, 0], [0.2, 0.3]]
lattice = ??
intersection = ?? (modulo positive translates of the cone generators)

Context of question, in case helpful: The problem arises from algebraic number theory. I am regarding (fractional) ideals in number fields as lattices via the embeddings of the number field. See Conrad's "The Different Ideal" for some pictures/examples -- pdf available online, my karma is insufficient to include a link.

I'd like to determine the intersection between those lattices and various cones.