𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the isomorphism relation for fields of finite transcendence degree

✍ Scribed by Simon Thomas; Boban Velickovic

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
148 KB
Volume
159
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Isomorphism Problem for Finite Ca
On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency
✍ C.H. Li; C.E. Praeger πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each Οƒ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S Οƒ ). For a positive integer m, th

Symmetry and the Ramsey Degrees of Finit
Symmetry and the Ramsey Degrees of Finite Relational Structures
✍ Willem L. FouchΓ© πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 134 KB

In this paper, we introduce a measure of the extent to which a finite combinatorial structure is a Ramsey object in the class of objects with a similar structure. We show for classes of finite relational structures, including graphs, binary posets, and bipartite graphs, how this measure depends on t