Related papers: Higher Newton polygons and integral bases

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…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…

We develop explicit formulas and algorithms for arithmetic in radical function fields K/k(x) over finite constant fields. First, we classify which places of k(x) whose local integral bases have an easy monogenic form, and give explicit…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Let $K$ be a number field defined by a monic irreducible polynomial $F(X) \in \mathbb{Z}[X]$, $p$ a fixed rational prime, and $\nu_p$ the discrete valuation associated to $p$. Assume that $\overline{F}(X)$ factors modulo $p$ into the…

We derive a straightening-free algorithm that computes the canonical bases of any higher-level q-deformed Fock space.

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

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…

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,…

Let $(K,\nu)$ be an arbitrary-rank valued field, $R_\nu$ its valuation ring, $K(\alpha)/K$ a separable finite field extension generated over $K$ by a root of a monic irreducible polynomial $f\in R_\nu[X]$. We give necessary and sufficient…

Let $K$ be a number field and $f\in K[X]$ an irreducible monic polynomial with coefficients in $O_K$, the ring of integers of $K$. We aim to enounce an effective criterion, in terms of the Galois group of $f$ over $K$ and a linear…

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

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…

The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…

Let $R$ be a Dedekind ring, $K$ its quotient field, and $L=K(\alpha)$ a finite field extension of $K$ defined by a monic irreducible polynomial $f(x)\in R[x]$. We give an easy version of Dedekind's criterion which computationally improves…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

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…