On elementary equivalence, isomorphism and isogeny
نویسندگان
چکیده
منابع مشابه
On elementary equivalence, isomorphism and isogeny
Motivated by recent work of Florian Pop, we study the connections between three notions of equivalence of function fields: isomorphism, elementary equivalence, and the condition that each of a pair of fields can be embedded in the other, which we call isogeny. Some of our results are purely geometric: we give an isogeny classification of Severi-Brauer varieties and quadric surfaces. These resul...
متن کاملOn Elementary Equivalence, Isomorphism and Isogeny of Arithmetic Function Fields
Motivated by recent work of Florian Pop, we study the connections between three notions of equivalence of function fields: isomorphism, elementary equivalence, and the condition that each of a pair of fields can be embedded in the other, which we call isogeny. Some of our results are purely geometric: we give an isogeny classification of Severi-Brauer varieties and quadric surfaces. These resul...
متن کاملElementary equivalence versus Isomorphism
1) The isomorphy type of a finite field K is given by its cardinality |K|, i.e., if K and L are such fields, then K ∼= L iff |K| = |L|. 1) The isomorphy type of an algebraically closed field K is determined by two invariants: (i) Absolute transcendence degree td(K), (ii) The characteristic p = char(K) ≥ 0. In other words, if K and L are algebraically closed fields, then K ∼= L iff td(K) = td(L)...
متن کاملEquivalence and Isomorphism for Boolean Constraint Satisfaction
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set C of Boolean functions. We consider the problem of determining whether two given constraint satisfaction instances are equivalent and prove a Dichotomy Theorem by showing that for all sets C of allowed constraints, this problem is either polynomial-tim...
متن کاملIncremental Sequential Equivalence Checking and Subgraph Isomorphism
A method for finding large isomorphic subgraphs in two similar circuits is proposed, and its application to sequential equivalence checking (SEC) is discussed. SEC ensures correctness of two designs. Among other things, efficient SEC is important for wider adoption of innovative sequential synthesis (SS) methods, which offer substantial reductions in delay, area, power and flip-flop counts, com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2006
ISSN: 1246-7405
DOI: 10.5802/jtnb.532