An embedding theorem for Eichler orders

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An embedding theorem for Eichler orders

Let B be a quaternion algebra over number field K : Assume that B satisfies the Eichler condition (i.e., there is at least one archimedean place which is unramified in B). Let O be an order in a quadratic extension L of K: The Eichler orders of B which admit an embedding of O are determined. This is a generalization of Chinburg and Friedman’s embedding theorem for maximal orders. r 2004 Elsevie...

متن کامل

Binary quadratic forms and Eichler orders

For any Eichler order O(D,N) of level N in an indefinite quaternion algebra of discriminant D there is a Fuchsian group Γ(D,N) ⊆ SL(2,R) and a Shimura curve X(D,N). We associate to O(D,N) a set H(O(D,N)) of binary quadratic forms which have semi-integer quadratic coefficients, and we develop a classification theory, with respect to Γ(D,N), for primitive forms contained in H(O(D,N)). In particul...

متن کامل

An embedding theorem for Hilbert categories

We axiomatically define (pre-)Hilbert categories. The axioms resemble those for monoidal Abelian categories with the addition of an involutive functor. We then prove embedding theorems: any locally small pre-Hilbert category whose monoidal unit is a simple generator embeds (weakly) monoidally into the category of pre-Hilbert spaces and adjointable maps, preserving adjoint morphisms and all fini...

متن کامل

An embedding theorem for convex fuzzy sets

In this paper we embed the space of upper semicontinuous convex fuzzy sets on a Banach space into a space of continuous functions on a compact space. The following structures are preserved by the embedding: convex cone, metric, sup-semilattice. The indicator function of the unit ball is mapped to the constant function 1. Two applications are presented: strong laws of large numbers for fuzzy ran...

متن کامل

Converse Lagrange Theorem Orders and Supersolvable Orders

For finite groups, we investigate both converse Lagrange theorem (CLT) orders and supersolvable (SS) orders, and see that the latter form a proper subset of the former. We focus on the difference between these two sets of orders, reformulate the work of earlier authors algorithmically, and construct a computer program to enumerate such NSS-CLT orders. We establish several results relating to NS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2004

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2004.04.008