Related papers: A new computational approach to ideal theory in nu…
The goal of this paper is to calculate explicitly the field index of any quintic number field $K$ generated by a complex root $\al$ of a monic irreducible trinomial $F(x) = x^5+ax+b \in \Z[x]$. In such a way we provide a complete answer to…
In this paper, for any nonic number field $K$ generated by a root $\alpha$ of a monic irreducible trinomial $F(x)=x^9+ax+b \in \mathbb{Z}[x]$ and for every rational prime $p$, we characterize when $p$ divides the index of $K$. We also…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…
In this work, we consider the problem of computing triangular bases of integral closures of one-dimensional local rings. Let $(K, v)$ be a discrete valued field with valuation ring $\mathcal{O}$ and let $\mathfrak{m}$ be the maximal ideal.…
Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…
We present an algorithm which for any given ideal $I\subseteq\mathbb{K} [x,y]$ finds all elements of $I$ that have the form $f(x) - g(y)$, i.e., all elements in which no monomial is a multiple of $xy$.
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
We introduce our package '+Ideals' for Magma, designed to perform the basic tasks related to ideals in number fields without pre-computing integral bases. It is based on Montes algorithm and a number of local techniques that we have…
In this paper, for any nonic number field $K$ defined by a monic irreducible trinomial $F(x)=x^9+ax^2+b \in \mathbb{Z}[x]$, we calculate $\nu_p(i(K))$ for every rational prime $p$. In particular, we characterize the index $i(K)$ of this…
We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term…
Rational transformations of polynomials are extensively studied in the context of finite fields, especially for the construction of irreducible polynomials. In this paper, we consider the factorization of rational transformations with…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
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…
In this paper we study the growth of ideals in $\mathbb{Z}[t]/(f)$ for a monic cubic polynomial $f$. We also compute the ideal zeta function of $\mathbb{Z}[t]/(t^n)$ for any $n \in \mathbb{N}$.