arXiv 1507.040582015-07math.NT

Computation of Integral Bases

Jens-Dietrich Bauch

备注：: 22 pages, 4 figures

英文摘要：

Let $A$ be a Dedekind domain, $K$ the fraction field of $A$, and $f\in A[x]$ a monic irreducible separable polynomial. For a given non-zero prime ideal $\mathfrak{p}$ of $A$ we present in this paper a new method to compute a $\mathfrak{p}$-integral basis of the extension of $K$ determined by $f$. Our method is based on the use of simple multipliers that can be constructed with the data that occurs along the flow of the Montes Algorithm. Our construction of a $\mathfrak{p}$-integral basis is significantly faster than the similar approach from $[7]$ and provides in many cases a priori a triangular basis.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Computation of an Integral Basis of Quartic Number Fields

In this paper, based on techniques of Newton polygons, a result which allows the computation of a p integral basis of every quartic number field is given. For each prime integer p, this result allows to compute a p-integral basis of a quartic number field K defined by an irreducible polynomial $P(X) = X4 + aX + b \in\z[X]$ in methodical and complete generality.

2009-07-16math.NT

关于欧拉积分非分歧计算的金兹堡猜想

Ginzburg's conjecture on the unramified computation of Eulerian integrals

National University of Singapore（新加坡国立大学）

该研究证明了D. Ginzburg关于特定欧拉全局积分非分歧计算的猜想，还研究了含退化艾森斯坦级数的类似积分并计算其非分歧局部因子。

2026-07-31math.NT

Local-to-global computation of integral bases without a previous factorization of the discriminant

We adapt an old local-to-global technique of Ore to compute, under certain mild assumptions, an integral basis of a number field without a previous factorization of the discriminant of the defining polynomial. In a first phase, the method yields as a by-product successive splittings of the discriminant. When this phase concludes, it requires a squarefree factorization of some base factors of the discriminant to terminate.

2015-10-07math.NT

Square-free OM computation of global integral bases

For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this paper, we adapt the OM techniques to work with a positive integer $N$ instead of $p$. As an application, we obtain an algorithm to compute global integral bases in $K$, which does not require a previous factorization of the discriminant of $f$.

2022-03-03math.NT

Fast computation of half-integral weight modular forms

To study statistical properties of modular forms, including for instance Sato-Tate like problems, it is essential to have a large number of Fourier coefficients. In this article, we exhibit three bases for the space of modular forms of any half-integral weight and level 4, which have the property that many coefficients can be computed (relatively) quickly on a computer.

2022-07-13math.NT

The complete $p$-elliptic integrals and a computation formula of $π_p$ for $p=4$

The complete $p$-elliptic integrals are generalizations of the complete elliptic integrals by the generalized trigonometric function $\sin_pθ$ and its half-period $π_p$. It is shown, only for $p=4$, that the generalized $p$-elliptic integrals yield a computation formula of $π_p$ in terms of the arithmetic-geometric mean. This is a $π_p$-version of the celebrated formula of $π$, independently proved by Salamin and Brent in 1976.

2015-03-09math.APmath.CAmath.NT

更多相关论文收起更多论文

积分基的快速计算

Fast computation of integral bases

本文提出计算数域和函数域三角积分基的新复杂度界限，利用快速OM算法和MaxMin算法，实现函数域软线性成本，并推广至分式理想，助力快速计算黎曼-罗赫空间。

2024-05-22math.AGmath.NT

Extendable orthogonal sets of integral vectors

Motivated by a model in quantum computation we study orthogonal sets of integral vectors of the same norm that can be extended with new vectors keeping the norm and the orthogonality. Our approach involves some arithmetic properties of the quaternions and other hypercomplex numbers.

2022-03-20math.NT

对于SL(2)×GL(2)的无分歧计算

The unramified computation of a Shimura integral for $\mathrm{SL}(2)\times \mathrm{GL}(2)$

The University of Arizona（亚利桑那大学）

本文通过使用Casselman-Shalika公式，提供了对于SL(2)×GL(2)的Shimura型Rankin-Selberg积分的无分歧计算的新证明。

2022-10-24math.NTmath.RT

Integral $p$-adic étale cohomology of Drinfeld symmetric spaces

We compute the integral $p$-adic étale cohomology of Drinfeld symmetric spaces of any dimension. This refines the computation of the rational $p$-adic étale cohomology from Colmez-Dospinescu-Nizioł. The main tools are: the computation of the integral de Rham cohomology from CDN and the integral $p$-adic comparison theorems of Bhatt-Morrow-Scholze and Česnavičius-Koshikawa which replace the quasi-integral comparison theorem of Tsuji used in CDN.

2019-05-27math.AGmath.NT

Formalized Class Group Computations and Integral Points on Mordell Elliptic Curves

Diophantine equations are a popular and active area of research in number theory. In this paper we consider Mordell equations, which are of the form $y^2=x^3+d$, where $d$ is a (given) nonzero integer number and all solutions in integers $x$ and $y$ have to be determined. One non-elementary approach for this problem is the resolution via descent and class groups. Along these lines we formalized in Lean 3 the resolution of Mordell equations for several instances of $d<0$. In order to achieve this, we needed to formalize several other theories from number theory that are interesting on their own…

2022-12-23cs.LOmath.NT

权为2的模形式空间的积分结构比较，权为1的模2形式空间的计算，附录由Jean-Francois Mestre和Gabor Wiese编写

Comparison of integral structures on spaces of modular forms of weight two, and computation of spaces of forms mod 2 of weight one, with appendices by Jean-Francois Mestre and Gabor Wiese

比较了X_0（N）上权为2的模形式在素数p整除N时Q-向量空间上的两种积分结构。当p=2且N可被素数3 mod 4整除时，这种比较导致计算权1在X_0（N/2）上形成mod 2的空间的算法。对于任意p，N>4与p互素，利用权p的形式，以及p=2时模系数为2的抛物群上同调，给出了计算Gamma 1（N）上权为1的模p模形式的Hecke代数的一种方法.附录A是一封信从梅斯特塞尔，1987年10月，他报告的计算重量一形式模2的总理水平。附录B报告了在Magma中p=2的实现，使用Stein的模块化符号包，Mestre的计算被重做并稍微扩展。

2003-12-01math.AGmath.NT

High precision computation and a new asymptotic formula for the generalized Stieltjes constants

We provide an efficient method to evaluate the generalized Stieltjes constants $γ_n(a)$ numerically to arbitrary accuracy for large $n$ and $n \gg |a|$ values. The method uses an integral representation for the constants and evaluates the integral by applying the double exponential (DE) quadrature method near the saddle points of the integrands. Further, we provide a highly accurate asymptotic formula for the generalized Stieltjes constants.

2022-12-20cs.NAmath.NAmath.NT