Related papers: Computation of Integral Bases

In this article, we study the monoid of fractional ideals and the ideal class semigroup of an arbitrary given one dimensional normal domain O obtained by an infinite integral extension of a Dedekind domain. We introduce a notion of "upper…

The $p$-adic logarithm appears in many places in number theory. Hence having a good description of the image of the $p$-adic logarithm could be useful, and in particular, to figure out the image of $1 + \mathfrak{m}_K$, where $K$ is an…

Let $G$ be a finite $p$-group. We construct a $G$-extension $K/k$ of number fields such that the $p$-adic completion of the unit group of $K$ has a prescribed $\mathbb{Z}_p[G]$-module structure, up to free direct summands.

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

Let $\mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $\mathbb{C}$. Let $X$ be a subset of the Euclidean space $\mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in…

In this paper we present an algorithm to compute a Standard Basis for a fractional ideal $\mathcal{I}$ of the local ring $\mathcal{O}$ of an $n$-space algebroid curve with several branches. This allows us to determine the semimodule of…

We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a…

One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…

Let $f(x)=x^7+ax+b$ be an irreducible polynomial having integer coefficients and $K=\mathbb{Q}(\theta)$ be an algebraic number field generated by a root $\theta$ of $f(x)$. In the present paper, for every rational prime $p$, our objective…

Let $f(x)$ be a separable polynomial over a local field. Montes algorithm computes certain approximations to the different irreducible factors of $f(x)$, with strong arithmetic properties. In this paper we develop an algorithm to improve…

We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…

Let \( K \) be a number field. We provide quantitative estimates for the size of the Zsigmondy set of an integral ideal sequence generated by iterating a polynomial function \(\varphi(z) \in K[z]\) at a wandering point \(\alpha \in K.\)

Let $K$ be an imaginary quadratic field different from $\mathbb{Q}(\sqrt{-1})$ and $\mathbb{Q}(\sqrt{-3})$. For a positive integer $N$, let $K_\mathfrak{n}$ be the ray class field of $K$ modulo $\mathfrak{n}=N\mathcal{O}_K$. By using the…

Let $K$ be a number field, and let $G$ be a finitely generated subgroup of $K^\times$. Without relying on the Generalized Riemann Hypothesis we prove an asymptotic formula for the number of primes $\mathfrak p$ of $K$ such that the order of…

Let $k$ be a global field, let $A$ be a Dedekind domain with $\text{Quot}(A) = k$, and let $K$ be a finitely generated field. Using a unified approach for both elliptic curves and Drinfeld modules $M$ defined over $K$ and having a trivial…

In this paper we present an algorithm that computes the genus of a global function field. Let F/k be function field over a field k, and let k0 be the full constant field of F/k. By using lattices over subrings of F, we can express the genus…

Let E be a cyclic extension of degree p^n of a field F of characteristic p. Using arithmetic invariants of E/F we determine k_mE, the Milnor K-groups K_mE modulo p, as Fp[Gal(E/F)]-modules for all m in N. In particular, we show that each…

Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…