OpenLink Software

About: http://dbpedia.org/resource/Abhyankar's_lemma     Permalink

an Entity references as follows:

In mathematics, Abhyankar's lemma (named after Shreeram Shankar Abhyankar) allows one to kill tame ramification by taking an extension of a base field. More precisely, Abhyankar's lemma states that if A, B, C are local fields such that A and B are finite extensions of C, with ramification indices a and b, and B is tamely ramified over C and b divides a, then the compositumAB is an unramified extension of A.

QRcode icon
QRcode image
Graph IRICount
http://dbpedia.org45 triples
Faceted Search & Find service v1.17_git139

Alternative Linked Data Documents: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Copyright © 2009-2024 OpenLink Software