2009
DOI: 10.1007/s11856-009-0064-3
|View full text |Cite
|
Sign up to set email alerts
|

Valuations and diameters of milnor K-rings

Abstract: Given a field F and a subgroup S of F × containing −1, we define a graph on F × /S associated with the relative Milnor K-ring K M * (F )/S. We prove that if the diameter of this graph is at least 4, then there exists a valuation v on F such that S is v-open. This is done by adopting to our setting a construction in a noncommutative setting due to Rapinchuk, Segev and Seitz. We study the behavior of the diameter under important K-theoretic constructions, and relate it to the elementary type conjecture. Finally,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…Now one defines the Milnor K-graph of F modulo N to be the undirected graph whose vertices are the non-identity elements of F × /N , and where vertices aN and bN are connected by an edge if and only if {a, b} N = 0 in K M 2 (F )/N . It follows from [E4,Lemma 2.1] that this is indeed a V-graph. The main result of [E4] is just Theorem A for this V-graph on D = F .…”
Section: Commuting Graphsmentioning
confidence: 95%
See 2 more Smart Citations
“…Now one defines the Milnor K-graph of F modulo N to be the undirected graph whose vertices are the non-identity elements of F × /N , and where vertices aN and bN are connected by an edge if and only if {a, b} N = 0 in K M 2 (F )/N . It follows from [E4,Lemma 2.1] that this is indeed a V-graph. The main result of [E4] is just Theorem A for this V-graph on D = F .…”
Section: Commuting Graphsmentioning
confidence: 95%
“…Namely, there are examples where the quotient D × /N supports a V-graph of diameter 3, but N is not open with respect to any non-trivial valuation (cf. [RS,Example 8.4], [E4,Example 7.2], and Examples 11.4 and 11.7).…”
Section: Valuations Via Valuation Graphsmentioning
confidence: 99%
See 1 more Smart Citation