ترغب بنشر مسار تعليمي؟ اضغط هنا

Root lattices in number fields

112   0   0.0 ( 0 )
 نشر من قبل Vladimir Popov L
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We explore whether a root lattice may be similar to the lattice $mathscr O$ of integers of a number field $K$ endowed with the inner product $(x, y):={rm Trace}_{K/mathbb Q}(xcdottheta(y))$, where $theta$ is an involution of $K$. We classify all pairs $K$, $theta$ such that $mathscr O$ is similar to either an even root lattice or the root lattice $mathbb Z^{[K:mathbb Q]}$. We also classify all pairs $K$, $theta$ such that $mathscr O$ is a root lattice. In addition to this, we show that $mathscr O$ is never similar to a positive-definite even unimodular lattice of rank $leqslant 48$, in particular, $mathscr O$ is not similar to the Leech lattice. In appendix, we give a general cyclicity criterion for the primary components of the discriminant group of $mathscr O$.



قيم البحث

اقرأ أيضاً

191 - Will Sawin 2020
This article is an overview of the vanishing cycles method in number theory over function fields. We first explain how this works in detail in a toy example, and then give three examples which are relevant to current research. The focus will be a gen eral explanation of which sorts of problems this method can be applied to.
We generalize the classical theory of periodic continued fractions (PCFs) over ${mathbf Z}$ to rings ${mathcal O}$ of $S$-integers in a number field. Let ${mathcal B}={beta, {beta^*}}$ be the multi-set of roots of a quadratic polynomial in ${mathcal O}[x]$. We show that PCFs $P=[b_1,ldots,b_N,bar{a_1ldots ,a_k}]$ of type $(N,k)$ potentially converging to a limit in ${mathcal B}$ are given by ${mathcal O}$-points on an affine variety $V:=V({mathcal B})_{N,k}$ generically of dimension $N+k-2$. We give the equations of $V$ in terms of the continuant polynomials of Wallis and Euler. The integral points $V({mathcal O})$ are related to writing matrices in $textrm{SL}_2({mathcal O})$ as products of elementary matrices. We give an algorithm to determine if a PCF converges and, if so, to compute its limit. Our standard example generalizes the PCF $sqrt{2}=[1,bar{2}]$ to the ${mathbf Z}_2$-extension of ${mathbf Q}$: $F_n={mathbf Q}(alpha_n)$, $alpha_{n}:=2cos(2pi/2^{n+2})$, with integers ${mathcal O}_n={mathbf Z}[alpha_n]$. We want to find the PCFs of $alpha_{n+1}$ over ${mathcal O}_{n}$ of type $(N,k)$ by finding the ${mathcal O}_{n}$-points on $V({mathcal B}_{n+1})_{N,k}$ for ${mathcal B}_{n+1}:={alpha_{n+1}, -alpha_{n+1}}$. There are three types $(N,k)=(0,3), (1,2), (2,1)$ such that the associated PCF variety $V({mathcal B})_{N,k}$ is a curve; we analyze these curves. For generic ${mathcal B}$, Siegels theorem implies that each of these three $V({mathcal B})_{N,k}({mathcal O})$ is finite. We find all the ${mathcal O}_n$-points on these PCF curves $V({mathcal B}_{n+1})_{N,k}$ for $n=0,1$. When $n=1$ we make extensive use of Skolems $p$-adic method for $p=2$, including its application to Ljunggrens equation $x^2 + 1 =2y^4$.
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be mo delled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties.
151 - Takehiro Hasegawa 2017
Elkies proposed a procedure for constructing explicit towers of curves, and gave two towers of Shimura curves as relevant examples. In this paper, we present a new explicit tower of Shimura curves constructed by using this procedure.
133 - Amilcar Pacheco 2003
Let $C$ be a smooth projective curve defined over a number field $k$, $X/k(C)$ a smooth projective curve of positive genus, $J_X$ the Jacobian variety of $X$ and $(tau,B)$ the $k(C)/k$-trace of $J_X$. We estimate how the rank of $J_X(k(C))/tau B(k)$ varies when we take an unramified abelian cover $pi:Cto C$ defined over $k$.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا