Upper bounds for the number of number fields with alternating Galois group

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

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

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

منابع مشابه

Upper Bounds for the Number of Number Fields with Alternating Galois Group

We study the number N(n,An, X) of number fields of degree n whose Galois closure has Galois group An and whose discriminant is bounded by X. By a conjecture of Malle, we expect that N(n,An, X) ∼ Cn ·X 1 2 ·(logX)bn for constants bn and Cn. For 6 ≤ n ≤ 84393, the best known upper bound is N(n,An, X) � X n+2 4 ; this bound follows from Schmidt’s Theorem, which implies there are � X n+2 4 number f...

متن کامل

Geometric Galois Theory, Nonlinear Number Fields and a Galois Group Interpretation of the Idele Class Group

This paper concerns the description of holomorphic extensions of algebraic number fields. After expanding the notion of adele class group to number fields of infinite degree over Q, a hyperbolized adele class group ŜK is assigned to every number field K/Q. The projectivization of the Hardy space PH•[K] of graded-holomorphic functions on ŜK possesses two operations ⊕ and ⊗ giving it the structur...

متن کامل

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

Upper Bounds on the Covering Number of Galois-Planes with Small Order

Our paper deals with a problem of P. Erd} os' related to the covering number of blocking sets of nite projective planes. An integer linear programming (ILP) formulation of Erd} os' problem is introduced for projective planes of given orders. The mathematical programming based approach for this problem is new in the area of nite projective planes. Since the ILP problem is NP-hard and may involve...

متن کامل

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


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

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2012

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-2012-11543-6