4913 search results - page 180 / 983 » Results and Perspectives of the G |
138
click to vote
JSYML
2008
15 years 6 months ago
2008
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
173
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
206
click to vote
TALG
2008
15 years 6 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
161
click to vote
JSC
2000
15 years 6 months ago
2000
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
172
click to vote
JMLR
2002
15 years 6 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...