2022-07-23 16:46:22 +0200 | asked a question | Fibres of a rational separable map and the separating element Fibres of a rational separable map and the separating element Let $X$ and $Y$ be two curves defined over $\mathbb{F}_q$ |

2022-07-23 16:31:08 +0200 | commented answer | Degree of a rational map and the corresponding map between function fields Thank you very much. |

2022-07-23 12:22:45 +0200 | received badge | ● Supporter (source) |

2022-07-23 12:22:42 +0200 | marked best answer | Degree of a rational map and the corresponding map between function fields Let $X$ and $Y$ be two curves defined over $\mathbb{F}_q $ and $f:X \rightarrow Y$ be a separable rational map. Then there is field embedding $$ f^\ast : \mathbb{F}_q (Y) \rightarrow \mathbb{F}_q (X) $$ defined by $f^\ast(\alpha) = \alpha \circ f$. The degree of $f$ is then defined to be $[\mathbb{F}_q (X) : f^\ast(\mathbb{F}_q (Y))]$. If I take two curves $X$ and $Y$ in sagemath over some $\mathbb{F}_q $ in sagemath, is there any way to automatically get the map $f^\ast$ and degree of $f$? |

2022-07-23 12:22:42 +0200 | received badge | ● Scholar (source) |

2022-07-13 08:56:42 +0200 | asked a question | Degree of a rational map and the corresponding map between function fields Degree of a rational map and the corresponding map between function fields Let $X$ and $Y$ be two curves defined over $\ |

2021-05-27 12:19:04 +0200 | received badge | ● Editor (source) |

2021-05-27 12:19:04 +0200 | edited question | Evaluation of Boolean function at a point. Evaluation of Boolean function at a point. Hello! I am struggling with the following code. I have a random Boolean funct |

2021-05-27 12:05:48 +0200 | received badge | ● Student (source) |

2021-05-27 02:09:21 +0200 | asked a question | Evaluation of Boolean function at a point. Evaluation of Boolean function at a point. Hello! I am struggling with the following code. I have a random Boolean funct |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.